./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3bb1d9e312234d5c4f7ead2dcb51cc43e4ff3aebeffef1b0758f6a0d5be2ea9b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:46:27,128 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:46:27,226 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 18:46:27,233 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:46:27,234 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:46:27,291 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:46:27,293 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:46:27,293 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:46:27,294 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:46:27,295 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:46:27,295 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:46:27,296 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:46:27,296 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:46:27,297 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:46:27,297 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:46:27,298 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:46:27,298 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:46:27,299 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:46:27,299 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 18:46:27,300 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:46:27,300 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:46:27,304 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:46:27,304 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:46:27,305 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:46:27,305 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:46:27,305 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:46:27,306 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:46:27,306 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:46:27,316 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:46:27,316 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:46:27,318 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:46:27,318 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:46:27,319 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:46:27,319 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:46:27,319 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:46:27,319 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:46:27,320 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 18:46:27,320 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 18:46:27,320 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:46:27,320 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:46:27,321 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:46:27,321 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:46:27,321 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX 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 -> Automizer 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 -> 3bb1d9e312234d5c4f7ead2dcb51cc43e4ff3aebeffef1b0758f6a0d5be2ea9b [2024-11-08 18:46:27,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:46:27,675 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:46:27,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:46:27,679 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:46:27,680 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:46:27,681 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c Unable to find full path for "g++" [2024-11-08 18:46:29,669 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:46:29,869 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:46:29,869 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c [2024-11-08 18:46:29,878 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/data/f231e8ca6/66290cd6a1fd4e6bb7b7029cda4f22ae/FLAG804cf67f0 [2024-11-08 18:46:30,248 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/data/f231e8ca6/66290cd6a1fd4e6bb7b7029cda4f22ae [2024-11-08 18:46:30,251 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:46:30,253 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:46:30,255 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:46:30,255 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:46:30,261 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:46:30,262 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:46:30" (1/1) ... [2024-11-08 18:46:30,263 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70a7f93a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:46:30, skipping insertion in model container [2024-11-08 18:46:30,264 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:46:30" (1/1) ... [2024-11-08 18:46:30,289 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:46:30,506 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_53b18b60-eb0a-4f29-aa11-a4785176f1da/sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c[831,844] [2024-11-08 18:46:30,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:46:30,543 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:46:30,559 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_53b18b60-eb0a-4f29-aa11-a4785176f1da/sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c[831,844] [2024-11-08 18:46:30,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:46:30,588 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:46:30,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:46:30 WrapperNode [2024-11-08 18:46:30,589 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:46:30,590 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:46:30,590 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:46:30,590 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:46:30,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:46:30" (1/1) ... [2024-11-08 18:46:30,611 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:46:30" (1/1) ... [2024-11-08 18:46:30,634 INFO L138 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 62 [2024-11-08 18:46:30,636 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:46:30,637 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:46:30,638 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:46:30,638 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:46:30,650 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:46:30" (1/1) ... [2024-11-08 18:46:30,651 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:46:30" (1/1) ... [2024-11-08 18:46:30,652 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:46:30" (1/1) ... [2024-11-08 18:46:30,666 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 18:46:30,667 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:46:30" (1/1) ... [2024-11-08 18:46:30,667 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:46:30" (1/1) ... [2024-11-08 18:46:30,672 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:46:30" (1/1) ... [2024-11-08 18:46:30,675 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:46:30" (1/1) ... [2024-11-08 18:46:30,677 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:46:30" (1/1) ... [2024-11-08 18:46:30,678 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:46:30" (1/1) ... [2024-11-08 18:46:30,680 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:46:30,681 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:46:30,681 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:46:30,681 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:46:30,682 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:46:30" (1/1) ... [2024-11-08 18:46:30,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:46:30,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:46:30,713 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:46:30,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:46:30,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:46:30,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 18:46:30,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:46:30,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:46:30,815 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:46:30,817 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:46:31,009 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-08 18:46:31,009 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:46:31,021 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:46:31,022 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 18:46:31,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:46:31 BoogieIcfgContainer [2024-11-08 18:46:31,023 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:46:31,025 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:46:31,026 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:46:31,030 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:46:31,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:46:30" (1/3) ... [2024-11-08 18:46:31,031 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c8f6c1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:46:31, skipping insertion in model container [2024-11-08 18:46:31,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:46:30" (2/3) ... [2024-11-08 18:46:31,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c8f6c1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:46:31, skipping insertion in model container [2024-11-08 18:46:31,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:46:31" (3/3) ... [2024-11-08 18:46:31,037 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_interval.c [2024-11-08 18:46:31,062 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:46:31,062 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:46:31,122 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:46:31,129 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=PETRI_NET, 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;@60cb3c73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:46:31,130 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:46:31,134 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 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-08 18:46:31,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 18:46:31,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:46:31,141 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:46:31,142 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:46:31,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:46:31,148 INFO L85 PathProgramCache]: Analyzing trace with hash 338147700, now seen corresponding path program 1 times [2024-11-08 18:46:31,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:46:31,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712244081] [2024-11-08 18:46:31,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:46:31,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:46:31,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:46:31,310 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-08 18:46:31,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:46:31,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712244081] [2024-11-08 18:46:31,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712244081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:46:31,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:46:31,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:46:31,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255567883] [2024-11-08 18:46:31,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:46:31,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 18:46:31,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:46:31,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 18:46:31,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:46:31,360 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 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 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:46:31,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:46:31,380 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2024-11-08 18:46:31,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 18:46:31,384 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-08 18:46:31,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:46:31,395 INFO L225 Difference]: With dead ends: 31 [2024-11-08 18:46:31,395 INFO L226 Difference]: Without dead ends: 13 [2024-11-08 18:46:31,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:46:31,405 INFO L432 NwaCegarLoop]: 19 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, 19 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-08 18:46:31,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:46:31,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-08 18:46:31,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-08 18:46:31,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:46:31,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2024-11-08 18:46:31,435 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 11 [2024-11-08 18:46:31,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:46:31,436 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2024-11-08 18:46:31,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:46:31,436 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2024-11-08 18:46:31,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 18:46:31,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:46:31,437 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:46:31,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 18:46:31,438 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:46:31,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:46:31,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1018206070, now seen corresponding path program 1 times [2024-11-08 18:46:31,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:46:31,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575299443] [2024-11-08 18:46:31,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:46:31,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:46:31,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:46:31,478 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 18:46:31,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:46:31,521 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 18:46:31,521 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 18:46:31,523 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 18:46:31,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 18:46:31,529 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-08 18:46:31,552 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 18:46:31,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 06:46:31 BoogieIcfgContainer [2024-11-08 18:46:31,556 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 18:46:31,557 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 18:46:31,557 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 18:46:31,558 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 18:46:31,558 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:46:31" (3/4) ... [2024-11-08 18:46:31,561 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 18:46:31,563 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 18:46:31,564 INFO L158 Benchmark]: Toolchain (without parser) took 1310.86ms. Allocated memory was 130.0MB in the beginning and 172.0MB in the end (delta: 41.9MB). Free memory was 68.0MB in the beginning and 112.1MB in the end (delta: -44.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:46:31,564 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 130.0MB. Free memory is still 103.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:46:31,565 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.87ms. Allocated memory was 130.0MB in the beginning and 172.0MB in the end (delta: 41.9MB). Free memory was 67.7MB in the beginning and 137.3MB in the end (delta: -69.6MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2024-11-08 18:46:31,566 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.79ms. Allocated memory is still 172.0MB. Free memory was 136.5MB in the beginning and 135.7MB in the end (delta: 809.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:46:31,566 INFO L158 Benchmark]: Boogie Preprocessor took 42.60ms. Allocated memory is still 172.0MB. Free memory was 135.2MB in the beginning and 133.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 18:46:31,567 INFO L158 Benchmark]: RCFGBuilder took 341.93ms. Allocated memory is still 172.0MB. Free memory was 133.6MB in the beginning and 138.4MB in the end (delta: -4.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 18:46:31,567 INFO L158 Benchmark]: TraceAbstraction took 531.17ms. Allocated memory is still 172.0MB. Free memory was 137.3MB in the beginning and 113.3MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-08 18:46:31,568 INFO L158 Benchmark]: Witness Printer took 5.77ms. Allocated memory is still 172.0MB. Free memory was 113.3MB in the beginning and 112.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 18:46:31,571 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 130.0MB. Free memory is still 103.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 333.87ms. Allocated memory was 130.0MB in the beginning and 172.0MB in the end (delta: 41.9MB). Free memory was 67.7MB in the beginning and 137.3MB in the end (delta: -69.6MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.79ms. Allocated memory is still 172.0MB. Free memory was 136.5MB in the beginning and 135.7MB in the end (delta: 809.0kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.60ms. Allocated memory is still 172.0MB. Free memory was 135.2MB in the beginning and 133.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 341.93ms. Allocated memory is still 172.0MB. Free memory was 133.6MB in the beginning and 138.4MB in the end (delta: -4.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 531.17ms. Allocated memory is still 172.0MB. Free memory was 137.3MB in the beginning and 113.3MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Witness Printer took 5.77ms. Allocated memory is still 172.0MB. Free memory was 113.3MB in the beginning and 112.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. 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: 20]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 56, overapproximation of someUnaryDOUBLEoperation at line 32, overapproximation of someBinaryArithmeticDOUBLEoperation at line 44. Possible FailurePath: [L22] double _EPS = 1e-6; VAL [_EPS=1/1000000] [L49] double d, r; [L51] d = __VERIFIER_nondet_double() [L52] CALL assume_abort_if_not(d >= 0.1 && d <= 20.0) [L18] COND FALSE !(!cond) VAL [_EPS=1/1000000] [L52] RET assume_abort_if_not(d >= 0.1 && d <= 20.0) [L54] CALL, EXPR SqrtR(d) [L26] double xn, xnp1, residu, lsup, linf; [L27] int i, cond; VAL [_EPS=1/1000000] [L28] COND TRUE Input <= 1.0 [L28] xn = 1.0 VAL [_EPS=1/1000000, xn=1] [L29] xnp1 = xn [L30] residu = 2.0*_EPS*(xn+xnp1) [L31] lsup = _EPS * (xn+xnp1) [L32] linf = -lsup [L33] cond = ((residu > lsup) || (residu < linf)) [L34] i = 0 VAL [_EPS=1/1000000, cond=0, i=0] [L35] COND TRUE \read(cond) VAL [_EPS=1/1000000, i=0] [L44] return 1.0 / xnp1; VAL [_EPS=1/1000000, i=0] [L54] RET, EXPR SqrtR(d) [L54] r = SqrtR(d) [L56] CALL __VERIFIER_assert(r >= 0.3 && r <= 5.) [L20] COND TRUE !(cond) VAL [_EPS=1/1000000] [L20] reach_error() VAL [_EPS=1/1000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 19 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 19 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 10 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 18:46:31,609 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3bb1d9e312234d5c4f7ead2dcb51cc43e4ff3aebeffef1b0758f6a0d5be2ea9b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:46:34,264 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:46:34,368 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 18:46:34,376 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:46:34,378 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:46:34,422 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:46:34,425 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:46:34,425 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:46:34,426 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:46:34,428 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:46:34,428 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:46:34,428 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:46:34,429 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:46:34,430 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:46:34,432 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:46:34,432 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:46:34,433 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:46:34,433 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:46:34,433 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:46:34,434 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:46:34,434 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:46:34,438 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:46:34,438 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:46:34,439 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 18:46:34,439 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 18:46:34,439 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:46:34,439 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 18:46:34,440 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:46:34,440 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:46:34,440 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:46:34,441 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:46:34,443 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:46:34,443 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:46:34,444 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:46:34,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:46:34,444 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:46:34,445 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:46:34,445 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:46:34,445 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 18:46:34,446 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 18:46:34,446 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:46:34,447 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:46:34,447 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:46:34,447 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:46:34,448 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX 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 -> Automizer 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 -> 3bb1d9e312234d5c4f7ead2dcb51cc43e4ff3aebeffef1b0758f6a0d5be2ea9b [2024-11-08 18:46:34,875 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:46:34,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:46:34,912 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:46:34,913 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:46:34,914 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:46:34,915 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c Unable to find full path for "g++" [2024-11-08 18:46:37,197 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:46:37,434 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:46:37,435 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c [2024-11-08 18:46:37,443 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/data/5ee6fdfd9/f1835917579a4b10a9ca11b089ae9d28/FLAGdfa4176b6 [2024-11-08 18:46:37,786 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/data/5ee6fdfd9/f1835917579a4b10a9ca11b089ae9d28 [2024-11-08 18:46:37,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:46:37,790 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:46:37,791 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:46:37,792 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:46:37,799 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:46:37,800 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:46:37" (1/1) ... [2024-11-08 18:46:37,803 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e5dc218 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:46:37, skipping insertion in model container [2024-11-08 18:46:37,804 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:46:37" (1/1) ... [2024-11-08 18:46:37,833 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:46:38,081 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_53b18b60-eb0a-4f29-aa11-a4785176f1da/sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c[831,844] [2024-11-08 18:46:38,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:46:38,134 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:46:38,152 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_53b18b60-eb0a-4f29-aa11-a4785176f1da/sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c[831,844] [2024-11-08 18:46:38,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:46:38,195 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:46:38,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:46:38 WrapperNode [2024-11-08 18:46:38,195 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:46:38,196 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:46:38,197 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:46:38,197 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:46:38,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:46:38" (1/1) ... [2024-11-08 18:46:38,218 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:46:38" (1/1) ... [2024-11-08 18:46:38,243 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 63 [2024-11-08 18:46:38,243 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:46:38,245 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:46:38,246 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:46:38,246 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:46:38,258 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:46:38" (1/1) ... [2024-11-08 18:46:38,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:46:38" (1/1) ... [2024-11-08 18:46:38,263 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:46:38" (1/1) ... [2024-11-08 18:46:38,313 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 18:46:38,314 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:46:38" (1/1) ... [2024-11-08 18:46:38,314 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:46:38" (1/1) ... [2024-11-08 18:46:38,327 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:46:38" (1/1) ... [2024-11-08 18:46:38,338 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:46:38" (1/1) ... [2024-11-08 18:46:38,339 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:46:38" (1/1) ... [2024-11-08 18:46:38,347 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:46:38" (1/1) ... [2024-11-08 18:46:38,350 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:46:38,351 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:46:38,357 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:46:38,357 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:46:38,358 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:46:38" (1/1) ... [2024-11-08 18:46:38,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:46:38,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:46:38,436 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:46:38,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:46:38,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:46:38,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 18:46:38,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:46:38,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:46:38,564 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:46:38,567 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:46:55,257 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-08 18:46:55,258 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:46:55,276 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:46:55,277 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 18:46:55,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:46:55 BoogieIcfgContainer [2024-11-08 18:46:55,277 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:46:55,281 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:46:55,281 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:46:55,285 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:46:55,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:46:37" (1/3) ... [2024-11-08 18:46:55,286 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29d837bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:46:55, skipping insertion in model container [2024-11-08 18:46:55,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:46:38" (2/3) ... [2024-11-08 18:46:55,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29d837bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:46:55, skipping insertion in model container [2024-11-08 18:46:55,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:46:55" (3/3) ... [2024-11-08 18:46:55,290 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_interval.c [2024-11-08 18:46:55,309 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:46:55,310 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:46:55,388 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:46:55,396 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=PETRI_NET, 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;@12080db2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:46:55,397 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:46:55,401 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 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-08 18:46:55,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 18:46:55,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:46:55,409 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:46:55,410 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:46:55,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:46:55,418 INFO L85 PathProgramCache]: Analyzing trace with hash 338147700, now seen corresponding path program 1 times [2024-11-08 18:46:55,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:46:55,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1403514437] [2024-11-08 18:46:55,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:46:55,435 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-08 18:46:55,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:46:55,439 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:46:55,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:46:56,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:46:56,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 18:46:56,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:46:56,754 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-08 18:46:56,754 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:46:56,755 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:46:56,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1403514437] [2024-11-08 18:46:56,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1403514437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:46:56,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:46:56,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:46:56,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030650831] [2024-11-08 18:46:56,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:46:56,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 18:46:56,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:46:56,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 18:46:56,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:46:56,793 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 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 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:46:56,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:46:56,804 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2024-11-08 18:46:56,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 18:46:56,807 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-08 18:46:56,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:46:56,818 INFO L225 Difference]: With dead ends: 31 [2024-11-08 18:46:56,818 INFO L226 Difference]: Without dead ends: 13 [2024-11-08 18:46:56,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 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-08 18:46:56,827 INFO L432 NwaCegarLoop]: 19 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, 19 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-08 18:46:56,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:46:56,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-08 18:46:56,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-08 18:46:56,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:46:56,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2024-11-08 18:46:56,861 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 11 [2024-11-08 18:46:56,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:46:56,861 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2024-11-08 18:46:56,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:46:56,872 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2024-11-08 18:46:56,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 18:46:56,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:46:56,872 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:46:56,900 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-08 18:46:57,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:46:57,073 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:46:57,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:46:57,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1018206070, now seen corresponding path program 1 times [2024-11-08 18:46:57,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:46:57,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [549059876] [2024-11-08 18:46:57,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:46:57,076 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-08 18:46:57,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:46:57,079 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:46:57,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:46:58,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:46:58,370 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 18:46:58,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:46:59,428 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-08 18:46:59,428 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:46:59,429 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:46:59,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [549059876] [2024-11-08 18:46:59,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [549059876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:46:59,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:46:59,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:46:59,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137541919] [2024-11-08 18:46:59,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:46:59,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:46:59,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:46:59,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:46:59,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:46:59,433 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:47:01,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:47:05,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:47:10,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:47:14,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:47:18,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:47:23,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.64s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:47:27,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:47:31,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:47:36,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.58s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:47:40,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:47:44,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:47:47,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.55s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:47:47,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:47:47,911 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2024-11-08 18:47:47,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:47:47,912 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-08 18:47:47,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:47:47,913 INFO L225 Difference]: With dead ends: 21 [2024-11-08 18:47:47,913 INFO L226 Difference]: Without dead ends: 16 [2024-11-08 18:47:47,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:47:47,915 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 16 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 48.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:47:47,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 17 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 10 Unknown, 0 Unchecked, 48.2s Time] [2024-11-08 18:47:47,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-08 18:47:47,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-08 18:47:47,921 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-08 18:47:47,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2024-11-08 18:47:47,922 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 11 [2024-11-08 18:47:47,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:47:47,922 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-11-08 18:47:47,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:47:47,923 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2024-11-08 18:47:47,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 18:47:47,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:47:47,923 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:47:47,946 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:47:48,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:47:48,127 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:47:48,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:47:48,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1501753864, now seen corresponding path program 1 times [2024-11-08 18:47:48,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:47:48,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1021262983] [2024-11-08 18:47:48,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:47:48,129 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-08 18:47:48,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:47:48,131 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:47:48,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:47:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:52,158 WARN L253 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-08 18:47:52,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:48:01,118 WARN L286 SmtUtils]: Spent 5.06s 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-08 18:48:48,390 WARN L286 SmtUtils]: Spent 22.85s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 18:48:57,242 WARN L286 SmtUtils]: Spent 8.32s 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-08 18:49:05,582 WARN L286 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:49:13,891 WARN L286 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:49:22,250 WARN L286 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:49:30,761 WARN L286 SmtUtils]: Spent 8.44s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:49:39,151 WARN L286 SmtUtils]: Spent 8.39s 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-08 18:49:47,526 WARN L286 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:50:00,337 WARN L286 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:50:04,515 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (.cse2 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) .cse4)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (and (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse1 (fp.div c_currentRoundingMode .cse0 |ULTIMATE.start_SqrtR_~Input#1|))) (and (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0)) (= .cse1 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|) (let ((.cse3 (fp.add c_currentRoundingMode .cse1 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (fp.gt (fp.mul c_currentRoundingMode .cse2 .cse3) (fp.mul c_currentRoundingMode .cse4 .cse3))) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5)))) (= |c_ULTIMATE.start_SqrtR_~cond~0#1| (_ bv1 32))) (and (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse6 (fp.div c_currentRoundingMode .cse0 |ULTIMATE.start_SqrtR_~Input#1|))) (and (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0)) (= .cse6 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5) (not (let ((.cse7 (fp.add c_currentRoundingMode .cse6 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (fp.gt (fp.mul c_currentRoundingMode .cse2 .cse7) (fp.mul c_currentRoundingMode .cse4 .cse7))))))) (= |c_ULTIMATE.start_SqrtR_~cond~0#1| (_ bv0 32)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-08 18:50:12,864 WARN L286 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:50:21,175 WARN L286 SmtUtils]: Spent 8.31s 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-08 18:50:29,469 WARN L286 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:50:37,760 WARN L286 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:50:41,884 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.div c_currentRoundingMode .cse0 |ULTIMATE.start_SqrtR_~Input#1|))) (and (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0)) (= .cse1 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (not (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0))) (.cse3 (fp.add c_currentRoundingMode .cse1 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) .cse2) .cse3) (fp.mul c_currentRoundingMode .cse2 .cse3)))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-08 18:50:50,460 WARN L286 SmtUtils]: Spent 8.55s 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-08 18:50:58,901 WARN L286 SmtUtils]: Spent 8.44s 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-08 18:51:07,410 WARN L286 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:51:15,916 WARN L286 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:51:20,103 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.div c_currentRoundingMode .cse0 |ULTIMATE.start_SqrtR_~Input#1|))) (and (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0)) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= (fp.div c_currentRoundingMode .cse0 .cse1) |c_ULTIMATE.start_SqrtR_#res#1|) (not (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0))) (.cse3 (fp.add c_currentRoundingMode .cse1 .cse1))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) .cse2) .cse3) (fp.mul c_currentRoundingMode .cse2 .cse3)))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-08 18:51:37,035 WARN L286 SmtUtils]: Spent 8.53s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:51:45,674 WARN L286 SmtUtils]: Spent 8.64s 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-08 18:51:54,165 WARN L286 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:52:02,805 WARN L286 SmtUtils]: Spent 8.64s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:52:15,614 WARN L286 SmtUtils]: Spent 8.62s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:52:24,148 WARN L286 SmtUtils]: Spent 8.53s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:52:32,821 WARN L286 SmtUtils]: Spent 8.67s 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-08 18:52:41,545 WARN L286 SmtUtils]: Spent 8.72s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:52:54,306 WARN L286 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:53:03,024 WARN L286 SmtUtils]: Spent 8.72s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:53:11,650 WARN L286 SmtUtils]: Spent 8.63s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:53:20,281 WARN L286 SmtUtils]: Spent 8.63s 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-08 18:53:28,905 WARN L286 SmtUtils]: Spent 8.62s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:53:33,559 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0)))) (let ((.cse0 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse2)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0))) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse3 (fp.div roundNearestTiesToEven .cse5 |ULTIMATE.start_SqrtR_~Input#1|))) (and (not (let ((.cse1 (fp.add roundNearestTiesToEven .cse3 .cse3))) (fp.gt (fp.mul roundNearestTiesToEven .cse0 .cse1) (fp.mul roundNearestTiesToEven .cse2 .cse1)))) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse4) (not (fp.geq (fp.div roundNearestTiesToEven .cse5 .cse3) .cse6)) (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5))))) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse8 (fp.div roundNearestTiesToEven .cse5 |ULTIMATE.start_SqrtR_~Input#1|))) (and (not (let ((.cse7 (fp.add roundNearestTiesToEven .cse8 .cse8))) (fp.gt (fp.mul roundNearestTiesToEven .cse0 .cse7) (fp.mul roundNearestTiesToEven .cse2 .cse7)))) (not (fp.leq (fp.div roundNearestTiesToEven .cse5 .cse8) .cse9)) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse4) (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5))))))) (and (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse11 (fp.div roundNearestTiesToEven .cse5 |ULTIMATE.start_SqrtR_~Input#1|))) (let ((.cse12 (fp.div roundNearestTiesToEven .cse5 .cse11))) (and (not (let ((.cse10 (fp.add roundNearestTiesToEven .cse11 .cse11))) (fp.gt (fp.mul roundNearestTiesToEven .cse0 .cse10) (fp.mul roundNearestTiesToEven .cse2 .cse10)))) (fp.geq .cse12 .cse6) (fp.leq .cse12 .cse9) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse4) (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5)))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)))))) is different from false [2024-11-08 18:53:46,420 WARN L286 SmtUtils]: Spent 8.63s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:53:55,110 WARN L286 SmtUtils]: Spent 8.69s 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-08 18:54:03,591 WARN L286 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:54:12,167 WARN L286 SmtUtils]: Spent 8.58s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:54:24,889 WARN L286 SmtUtils]: Spent 8.57s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:54:33,381 WARN L286 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:54:41,938 WARN L286 SmtUtils]: Spent 8.56s 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-08 18:54:50,507 WARN L286 SmtUtils]: Spent 8.57s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:54:54,781 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0)))) (let ((.cse0 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse2)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse3 (fp.div roundNearestTiesToEven .cse5 |ULTIMATE.start_SqrtR_~Input#1|))) (and (not (let ((.cse1 (fp.add roundNearestTiesToEven .cse3 .cse3))) (fp.gt (fp.mul roundNearestTiesToEven .cse0 .cse1) (fp.mul roundNearestTiesToEven .cse2 .cse1)))) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse4) (not (fp.geq (fp.div roundNearestTiesToEven .cse5 .cse3) ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0)))) (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5))))) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse7 (fp.div roundNearestTiesToEven .cse5 |ULTIMATE.start_SqrtR_~Input#1|))) (and (not (let ((.cse6 (fp.add roundNearestTiesToEven .cse7 .cse7))) (fp.gt (fp.mul roundNearestTiesToEven .cse0 .cse6) (fp.mul roundNearestTiesToEven .cse2 .cse6)))) (not (fp.leq (fp.div roundNearestTiesToEven .cse5 .cse7) ((_ to_fp 11 53) roundNearestTiesToEven 5.0))) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse4) (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5)))))))) is different from false [2024-11-08 18:54:58,909 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0)))) (let ((.cse0 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse2)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse3 (fp.div roundNearestTiesToEven .cse5 |ULTIMATE.start_SqrtR_~Input#1|))) (and (not (let ((.cse1 (fp.add roundNearestTiesToEven .cse3 .cse3))) (fp.gt (fp.mul roundNearestTiesToEven .cse0 .cse1) (fp.mul roundNearestTiesToEven .cse2 .cse1)))) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse4) (not (fp.geq (fp.div roundNearestTiesToEven .cse5 .cse3) ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0)))) (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5))))) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse7 (fp.div roundNearestTiesToEven .cse5 |ULTIMATE.start_SqrtR_~Input#1|))) (and (not (let ((.cse6 (fp.add roundNearestTiesToEven .cse7 .cse7))) (fp.gt (fp.mul roundNearestTiesToEven .cse0 .cse6) (fp.mul roundNearestTiesToEven .cse2 .cse6)))) (not (fp.leq (fp.div roundNearestTiesToEven .cse5 .cse7) ((_ to_fp 11 53) roundNearestTiesToEven 5.0))) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse4) (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5)))))))) is different from true [2024-11-08 18:54:58,910 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-08 18:54:58,910 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:54:58,910 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:54:58,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1021262983] [2024-11-08 18:54:58,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1021262983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:54:58,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:54:58,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 18:54:58,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980707199] [2024-11-08 18:54:58,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:54:58,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 18:54:58,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:54:58,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 18:54:58,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=6, NotChecked=70, Total=132 [2024-11-08 18:54:58,913 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 12 states, 11 states have (on average 1.0) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:55:02,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:55:04,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:55:06,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:55:08,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:55:12,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:55:15,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:56:02,742 WARN L286 SmtUtils]: Spent 37.15s on a formula simplification. DAG size of input: 24 DAG size of output: 26 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 18:56:06,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:56:10,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:56:14,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:56:18,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:56:23,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:56:27,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:56:31,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:56:35,558 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq |c_ULTIMATE.start_SqrtR_~Input#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10.0))) (fp.leq |c_ULTIMATE.start_SqrtR_~Input#1| .cse0) (= .cse1 c_~_EPS~0) (let ((.cse4 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) .cse1))) (or (and (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse3 (fp.div c_currentRoundingMode .cse2 |ULTIMATE.start_SqrtR_~Input#1|))) (and (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse2)) (= .cse3 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|) (let ((.cse5 (fp.add c_currentRoundingMode .cse3 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (fp.gt (fp.mul c_currentRoundingMode .cse4 .cse5) (fp.mul c_currentRoundingMode .cse1 .cse5))) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0)))) (= |c_ULTIMATE.start_SqrtR_~cond~0#1| (_ bv1 32))) (and (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse6 (fp.div c_currentRoundingMode .cse2 |ULTIMATE.start_SqrtR_~Input#1|))) (and (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse2)) (= .cse6 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0) (not (let ((.cse7 (fp.add c_currentRoundingMode .cse6 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (fp.gt (fp.mul c_currentRoundingMode .cse4 .cse7) (fp.mul c_currentRoundingMode .cse1 .cse7))))))) (= |c_ULTIMATE.start_SqrtR_~cond~0#1| (_ bv0 32))))) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (and (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse2)) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0) (= |c_ULTIMATE.start_SqrtR_~xn~0#1| (fp.div c_currentRoundingMode .cse2 |ULTIMATE.start_SqrtR_~Input#1|)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-08 18:56:40,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.75s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:56:44,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:56:48,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:56:52,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:56:56,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:57:00,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:57:04,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:57:08,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:57:12,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:57:17,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.51s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:57:18,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:57:21,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:57:23,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:57:23,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:57:23,537 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2024-11-08 18:57:23,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 18:57:23,539 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.0) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-08 18:57:23,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:57:23,540 INFO L225 Difference]: With dead ends: 29 [2024-11-08 18:57:23,540 INFO L226 Difference]: Without dead ends: 24 [2024-11-08 18:57:23,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 119.6s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=8, NotChecked=102, Total=182 [2024-11-08 18:57:23,542 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 92.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 151 IncrementalHoareTripleChecker+Unchecked, 93.4s IncrementalHoareTripleChecker+Time [2024-11-08 18:57:23,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 59 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 18 Unknown, 151 Unchecked, 93.4s Time] [2024-11-08 18:57:23,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-08 18:57:23,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2024-11-08 18:57:23,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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-08 18:57:23,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2024-11-08 18:57:23,549 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2024-11-08 18:57:23,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:57:23,549 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-11-08 18:57:23,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.0) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:57:23,550 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2024-11-08 18:57:23,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 18:57:23,550 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:57:23,550 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:57:23,577 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/mathsat -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)] Ended with exit code 0 [2024-11-08 18:57:23,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:57:23,751 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:57:23,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:57:23,752 INFO L85 PathProgramCache]: Analyzing trace with hash 484262798, now seen corresponding path program 1 times [2024-11-08 18:57:23,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:57:23,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2105308234] [2024-11-08 18:57:23,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:57:23,752 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-08 18:57:23,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:57:23,755 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:57:23,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:57:25,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:25,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 18:57:25,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:57:25,960 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-08 18:57:25,960 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:57:25,960 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:57:25,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2105308234] [2024-11-08 18:57:25,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2105308234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:57:25,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:57:25,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:57:25,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88157972] [2024-11-08 18:57:25,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:57:25,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:57:25,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:57:25,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:57:25,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:57:25,963 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-08 18:57:30,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:57:34,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.69s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:57:38,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:57:39,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:57:39,167 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2024-11-08 18:57:39,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:57:39,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-08 18:57:39,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:57:39,169 INFO L225 Difference]: With dead ends: 22 [2024-11-08 18:57:39,169 INFO L226 Difference]: Without dead ends: 17 [2024-11-08 18:57:39,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:57:39,170 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:57:39,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 3 Unknown, 0 Unchecked, 13.2s Time] [2024-11-08 18:57:39,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-08 18:57:39,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2024-11-08 18:57:39,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:57:39,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2024-11-08 18:57:39,175 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2024-11-08 18:57:39,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:57:39,175 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2024-11-08 18:57:39,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-08 18:57:39,176 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2024-11-08 18:57:39,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 18:57:39,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:57:39,176 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:57:39,215 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-08 18:57:39,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:57:39,377 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:57:39,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:57:39,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1502535249, now seen corresponding path program 1 times [2024-11-08 18:57:39,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:57:39,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1734528934] [2024-11-08 18:57:39,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:57:39,378 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-08 18:57:39,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:57:39,379 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 18:57:39,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53b18b60-eb0a-4f29-aa11-a4785176f1da/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-08 18:57:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:46,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-08 18:57:46,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:58:00,277 WARN L286 SmtUtils]: Spent 8.57s 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-08 18:58:08,614 WARN L286 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:58:17,177 WARN L286 SmtUtils]: Spent 8.56s 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-08 18:58:23,188 WARN L286 SmtUtils]: Spent 6.01s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:58:30,609 WARN L286 SmtUtils]: Spent 7.42s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:58:38,180 WARN L286 SmtUtils]: Spent 7.57s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:58:51,109 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:58:59,253 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:59:07,410 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:59:11,539 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.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_SqrtR_~Input#1| .cse4) .cse4) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |ULTIMATE.start_SqrtR_~Input#1|) .cse4) .cse4))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)) |c_ULTIMATE.start_SqrtR_~xnp1~0#1|) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10.0))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-08 18:59:15,584 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.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_SqrtR_~Input#1| .cse4) .cse4) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |ULTIMATE.start_SqrtR_~Input#1|) .cse4) .cse4))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)) |c_ULTIMATE.start_SqrtR_~xnp1~0#1|) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10.0))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-08 18:59:23,668 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:59:31,816 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:59:40,331 WARN L286 SmtUtils]: Spent 8.51s 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-08 18:59:48,708 WARN L286 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:59:57,279 WARN L286 SmtUtils]: Spent 8.57s 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-08 19:00:05,442 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:00:09,583 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.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_SqrtR_~Input#1| .cse2) .cse2) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |ULTIMATE.start_SqrtR_~Input#1|) .cse2) .cse2))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)) |c_ULTIMATE.start_SqrtR_~xnp1~0#1|) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10.0))))) (not (fp.lt .cse0 (fp.neg .cse1))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2024-11-08 19:00:13,636 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.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_SqrtR_~Input#1| .cse2) .cse2) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |ULTIMATE.start_SqrtR_~Input#1|) .cse2) .cse2))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)) |c_ULTIMATE.start_SqrtR_~xnp1~0#1|) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10.0))))) (not (fp.lt .cse0 (fp.neg .cse1))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-08 19:00:22,427 WARN L286 SmtUtils]: Spent 8.79s 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-08 19:00:31,607 WARN L286 SmtUtils]: Spent 9.18s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:00:40,682 WARN L286 SmtUtils]: Spent 9.07s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:00:49,499 WARN L286 SmtUtils]: Spent 8.82s 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-08 19:00:58,503 WARN L286 SmtUtils]: Spent 9.00s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:01:02,830 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 ((.cse3 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_SqrtR_~Input#1| .cse0) .cse0) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |ULTIMATE.start_SqrtR_~Input#1|) .cse0) .cse0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)))) (let ((.cse1 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode .cse3 .cse0))) (.cse2 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) (fp.add c_currentRoundingMode .cse3 .cse3)))) (and (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0) (not (fp.lt .cse1 (fp.neg .cse2))) (not (fp.gt .cse1 .cse2)) (= (fp.div c_currentRoundingMode .cse0 .cse3) |c_ULTIMATE.start_SqrtR_#res#1|) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10.0)))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-08 19:01:20,326 WARN L286 SmtUtils]: Spent 8.88s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:01:29,117 WARN L286 SmtUtils]: Spent 8.79s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:01:37,833 WARN L286 SmtUtils]: Spent 8.72s 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-08 19:01:46,718 WARN L286 SmtUtils]: Spent 8.88s 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-08 19:01:55,547 WARN L286 SmtUtils]: Spent 8.83s 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)