./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 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC --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.3.0-dev-6497de0 [2024-11-24 00:10:01,343 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 00:10:01,432 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-24 00:10:01,438 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 00:10:01,438 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 00:10:01,474 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 00:10:01,475 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 00:10:01,475 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 00:10:01,476 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 00:10:01,476 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 00:10:01,477 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 00:10:01,477 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 00:10:01,478 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 00:10:01,478 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 00:10:01,478 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 00:10:01,479 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 00:10:01,479 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-24 00:10:01,479 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 00:10:01,479 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-24 00:10:01,479 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 00:10:01,479 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 00:10:01,479 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-24 00:10:01,479 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 00:10:01,480 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-24 00:10:01,480 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 00:10:01,480 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-24 00:10:01,480 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 00:10:01,480 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 00:10:01,480 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 00:10:01,480 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 00:10:01,480 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 00:10:01,480 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 00:10:01,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:10:01,480 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 00:10:01,480 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 00:10:01,480 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 00:10:01,481 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 00:10:01,481 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:10:01,481 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 00:10:01,481 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 00:10:01,481 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-24 00:10:01,481 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-24 00:10:01,481 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-24 00:10:01,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-24 00:10:01,482 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 00:10:01,482 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 00:10:01,482 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 00:10:01,483 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 00:10:01,483 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC 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-24 00:10:01,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 00:10:01,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 00:10:01,811 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 00:10:01,812 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 00:10:01,812 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 00:10:01,814 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c [2024-11-24 00:10:04,851 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC/data/ea8625c46/c475f716846346e19bd5a5991d2d1aa1/FLAGa431dcb5b [2024-11-24 00:10:05,129 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 00:10:05,130 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c [2024-11-24 00:10:05,139 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC/data/ea8625c46/c475f716846346e19bd5a5991d2d1aa1/FLAGa431dcb5b [2024-11-24 00:10:05,163 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC/data/ea8625c46/c475f716846346e19bd5a5991d2d1aa1 [2024-11-24 00:10:05,165 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 00:10:05,167 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 00:10:05,169 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 00:10:05,169 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 00:10:05,182 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 00:10:05,182 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:10:05" (1/1) ... [2024-11-24 00:10:05,185 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf8762c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:10:05, skipping insertion in model container [2024-11-24 00:10:05,185 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:10:05" (1/1) ... [2024-11-24 00:10:05,201 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 00:10:05,374 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_90feb763-67d7-44d9-9fc0-305b55a47ca0/sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c[831,844] [2024-11-24 00:10:05,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 00:10:05,420 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 00:10:05,431 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_90feb763-67d7-44d9-9fc0-305b55a47ca0/sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c[831,844] [2024-11-24 00:10:05,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 00:10:05,466 INFO L204 MainTranslator]: Completed translation [2024-11-24 00:10:05,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:10:05 WrapperNode [2024-11-24 00:10:05,467 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 00:10:05,468 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 00:10:05,469 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 00:10:05,470 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 00:10:05,479 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:10:05" (1/1) ... [2024-11-24 00:10:05,486 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:10:05" (1/1) ... [2024-11-24 00:10:05,506 INFO L138 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 62 [2024-11-24 00:10:05,507 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 00:10:05,508 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 00:10:05,508 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 00:10:05,509 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 00:10:05,519 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:10:05" (1/1) ... [2024-11-24 00:10:05,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:10:05" (1/1) ... [2024-11-24 00:10:05,521 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:10:05" (1/1) ... [2024-11-24 00:10:05,537 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-24 00:10:05,537 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:10:05" (1/1) ... [2024-11-24 00:10:05,538 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:10:05" (1/1) ... [2024-11-24 00:10:05,542 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:10:05" (1/1) ... [2024-11-24 00:10:05,542 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:10:05" (1/1) ... [2024-11-24 00:10:05,546 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:10:05" (1/1) ... [2024-11-24 00:10:05,546 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:10:05" (1/1) ... [2024-11-24 00:10:05,547 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:10:05" (1/1) ... [2024-11-24 00:10:05,549 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 00:10:05,550 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 00:10:05,550 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 00:10:05,550 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 00:10:05,551 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:10:05" (1/1) ... [2024-11-24 00:10:05,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:10:05,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:10:05,584 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 00:10:05,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 00:10:05,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 00:10:05,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-24 00:10:05,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 00:10:05,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 00:10:05,683 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 00:10:05,685 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 00:10:05,845 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-24 00:10:05,847 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 00:10:05,859 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 00:10:05,859 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-24 00:10:05,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:10:05 BoogieIcfgContainer [2024-11-24 00:10:05,860 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 00:10:05,863 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 00:10:05,863 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 00:10:05,869 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 00:10:05,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 12:10:05" (1/3) ... [2024-11-24 00:10:05,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7087df27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:10:05, skipping insertion in model container [2024-11-24 00:10:05,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:10:05" (2/3) ... [2024-11-24 00:10:05,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7087df27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:10:05, skipping insertion in model container [2024-11-24 00:10:05,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:10:05" (3/3) ... [2024-11-24 00:10:05,874 INFO L128 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_interval.c [2024-11-24 00:10:05,893 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 00:10:05,895 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sqrt_Householder_interval.c that has 1 procedures, 17 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-24 00:10:05,963 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 00:10:05,978 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;@46cc934b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 00:10:05,978 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-24 00:10:05,983 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-24 00:10:05,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-24 00:10:05,989 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:10:05,989 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:10:05,990 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:10:05,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:10:05,995 INFO L85 PathProgramCache]: Analyzing trace with hash 335407921, now seen corresponding path program 1 times [2024-11-24 00:10:06,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:10:06,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005729201] [2024-11-24 00:10:06,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:10:06,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:10:06,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:10:06,157 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-24 00:10:06,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:10:06,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005729201] [2024-11-24 00:10:06,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005729201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:10:06,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:10:06,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 00:10:06,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847784789] [2024-11-24 00:10:06,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:10:06,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-24 00:10:06,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:10:06,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-24 00:10:06,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-24 00:10:06,187 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-24 00:10:06,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:10:06,200 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2024-11-24 00:10:06,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-24 00:10:06,202 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-24 00:10:06,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:10:06,207 INFO L225 Difference]: With dead ends: 31 [2024-11-24 00:10:06,207 INFO L226 Difference]: Without dead ends: 13 [2024-11-24 00:10:06,209 INFO L434 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-24 00:10:06,212 INFO L435 NwaCegarLoop]: 18 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, 18 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-24 00:10:06,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 00:10:06,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-24 00:10:06,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-24 00:10:06,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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-24 00:10:06,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2024-11-24 00:10:06,239 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2024-11-24 00:10:06,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:10:06,241 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-11-24 00:10:06,242 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-24 00:10:06,242 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2024-11-24 00:10:06,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-24 00:10:06,243 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:10:06,243 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:10:06,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-24 00:10:06,244 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:10:06,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:10:06,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1015466291, now seen corresponding path program 1 times [2024-11-24 00:10:06,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:10:06,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851178847] [2024-11-24 00:10:06,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:10:06,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:10:06,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 00:10:06,285 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-24 00:10:06,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 00:10:06,331 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-24 00:10:06,331 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-24 00:10:06,333 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-24 00:10:06,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-24 00:10:06,339 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-24 00:10:06,357 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-24 00:10:06,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 12:10:06 BoogieIcfgContainer [2024-11-24 00:10:06,361 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-24 00:10:06,362 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-24 00:10:06,362 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-24 00:10:06,362 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-24 00:10:06,363 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:10:05" (3/4) ... [2024-11-24 00:10:06,365 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-24 00:10:06,366 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-24 00:10:06,367 INFO L158 Benchmark]: Toolchain (without parser) took 1200.03ms. Allocated memory is still 142.6MB. Free memory was 117.8MB in the beginning and 72.3MB in the end (delta: 45.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-24 00:10:06,367 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 117.4MB. Free memory is still 72.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 00:10:06,368 INFO L158 Benchmark]: CACSL2BoogieTranslator took 298.05ms. Allocated memory is still 142.6MB. Free memory was 117.5MB in the beginning and 106.2MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-24 00:10:06,368 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.95ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 105.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 00:10:06,369 INFO L158 Benchmark]: Boogie Preprocessor took 40.78ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 103.6MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-24 00:10:06,369 INFO L158 Benchmark]: RCFGBuilder took 310.31ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 93.5MB in the end (delta: 10.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 00:10:06,369 INFO L158 Benchmark]: TraceAbstraction took 498.15ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 72.6MB in the end (delta: 20.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-24 00:10:06,369 INFO L158 Benchmark]: Witness Printer took 4.60ms. Allocated memory is still 142.6MB. Free memory was 72.6MB in the beginning and 72.3MB in the end (delta: 235.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 00:10:06,371 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.43ms. Allocated memory is still 117.4MB. Free memory is still 72.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 298.05ms. Allocated memory is still 142.6MB. Free memory was 117.5MB in the beginning and 106.2MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.95ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 105.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.78ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 103.6MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 310.31ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 93.5MB in the end (delta: 10.1MB). There was no memory consumed. Max. memory is 16.1GB. * TraceAbstraction took 498.15ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 72.6MB in the end (delta: 20.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Witness Printer took 4.60ms. Allocated memory is still 142.6MB. Free memory was 72.6MB in the beginning and 72.3MB in the end (delta: 235.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 someBinaryArithmeticDOUBLEoperation at line 30, overapproximation of someBinaryArithmeticDOUBLEoperation at line 44, overapproximation of someUnaryDOUBLEoperation at line 32, overapproximation of someBinaryDOUBLEComparisonOperation at line 52, overapproximation of someBinaryDOUBLEComparisonOperation at line 28, overapproximation of someBinaryDOUBLEComparisonOperation at line 33, overapproximation of someBinaryDOUBLEComparisonOperation at line 56. 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 FALSE !(\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.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 18 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, 18 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-24 00:10:06,392 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC/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/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC --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.3.0-dev-6497de0 [2024-11-24 00:10:09,016 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 00:10:09,152 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-24 00:10:09,170 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 00:10:09,171 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 00:10:09,215 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 00:10:09,216 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 00:10:09,216 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 00:10:09,217 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 00:10:09,217 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 00:10:09,218 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 00:10:09,218 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 00:10:09,218 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 00:10:09,218 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 00:10:09,218 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 00:10:09,219 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 00:10:09,219 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-24 00:10:09,219 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 00:10:09,219 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 00:10:09,219 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 00:10:09,219 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-24 00:10:09,219 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 00:10:09,219 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-24 00:10:09,219 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-24 00:10:09,219 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-24 00:10:09,220 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-24 00:10:09,220 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 00:10:09,220 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-24 00:10:09,220 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 00:10:09,220 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 00:10:09,220 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 00:10:09,220 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 00:10:09,221 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 00:10:09,221 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 00:10:09,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:10:09,221 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 00:10:09,222 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 00:10:09,222 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 00:10:09,222 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 00:10:09,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:10:09,222 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 00:10:09,222 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 00:10:09,222 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-24 00:10:09,222 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-24 00:10:09,223 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-24 00:10:09,223 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-24 00:10:09,223 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 00:10:09,223 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 00:10:09,223 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 00:10:09,223 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 00:10:09,224 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC 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-24 00:10:09,571 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 00:10:09,581 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 00:10:09,583 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 00:10:09,585 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 00:10:09,585 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 00:10:09,586 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c [2024-11-24 00:10:12,589 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC/data/6b173c4b5/0a3481e1c9a049aebf3c6a8bc692d448/FLAGaa0c0f725 [2024-11-24 00:10:12,899 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 00:10:12,900 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c [2024-11-24 00:10:12,915 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC/data/6b173c4b5/0a3481e1c9a049aebf3c6a8bc692d448/FLAGaa0c0f725 [2024-11-24 00:10:12,939 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC/data/6b173c4b5/0a3481e1c9a049aebf3c6a8bc692d448 [2024-11-24 00:10:12,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 00:10:12,943 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 00:10:12,944 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 00:10:12,944 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 00:10:12,949 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 00:10:12,950 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:10:12" (1/1) ... [2024-11-24 00:10:12,951 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@447232d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:10:12, skipping insertion in model container [2024-11-24 00:10:12,951 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:10:12" (1/1) ... [2024-11-24 00:10:12,970 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 00:10:13,147 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_90feb763-67d7-44d9-9fc0-305b55a47ca0/sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c[831,844] [2024-11-24 00:10:13,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 00:10:13,204 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 00:10:13,216 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_90feb763-67d7-44d9-9fc0-305b55a47ca0/sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c[831,844] [2024-11-24 00:10:13,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 00:10:13,250 INFO L204 MainTranslator]: Completed translation [2024-11-24 00:10:13,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:10:13 WrapperNode [2024-11-24 00:10:13,252 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 00:10:13,253 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 00:10:13,253 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 00:10:13,253 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 00:10:13,264 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:10:13" (1/1) ... [2024-11-24 00:10:13,274 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:10:13" (1/1) ... [2024-11-24 00:10:13,296 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 63 [2024-11-24 00:10:13,297 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 00:10:13,299 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 00:10:13,299 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 00:10:13,299 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 00:10:13,307 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:10:13" (1/1) ... [2024-11-24 00:10:13,308 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:10:13" (1/1) ... [2024-11-24 00:10:13,311 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:10:13" (1/1) ... [2024-11-24 00:10:13,329 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-24 00:10:13,329 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:10:13" (1/1) ... [2024-11-24 00:10:13,336 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:10:13" (1/1) ... [2024-11-24 00:10:13,347 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:10:13" (1/1) ... [2024-11-24 00:10:13,348 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:10:13" (1/1) ... [2024-11-24 00:10:13,352 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:10:13" (1/1) ... [2024-11-24 00:10:13,353 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:10:13" (1/1) ... [2024-11-24 00:10:13,355 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:10:13" (1/1) ... [2024-11-24 00:10:13,358 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 00:10:13,358 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 00:10:13,359 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 00:10:13,359 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 00:10:13,363 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:10:13" (1/1) ... [2024-11-24 00:10:13,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:10:13,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:10:13,394 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 00:10:13,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 00:10:13,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 00:10:13,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-24 00:10:13,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 00:10:13,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 00:10:13,503 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 00:10:13,505 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 00:10:25,376 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-24 00:10:25,379 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 00:10:25,393 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 00:10:25,394 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-24 00:10:25,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:10:25 BoogieIcfgContainer [2024-11-24 00:10:25,394 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 00:10:25,397 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 00:10:25,397 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 00:10:25,402 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 00:10:25,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 12:10:12" (1/3) ... [2024-11-24 00:10:25,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2917e4dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:10:25, skipping insertion in model container [2024-11-24 00:10:25,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:10:13" (2/3) ... [2024-11-24 00:10:25,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2917e4dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:10:25, skipping insertion in model container [2024-11-24 00:10:25,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:10:25" (3/3) ... [2024-11-24 00:10:25,405 INFO L128 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_interval.c [2024-11-24 00:10:25,421 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 00:10:25,422 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sqrt_Householder_interval.c that has 1 procedures, 17 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-24 00:10:25,474 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 00:10:25,487 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;@69ce1d6c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 00:10:25,487 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-24 00:10:25,491 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-24 00:10:25,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-24 00:10:25,496 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:10:25,497 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:10:25,497 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:10:25,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:10:25,503 INFO L85 PathProgramCache]: Analyzing trace with hash 335407921, now seen corresponding path program 1 times [2024-11-24 00:10:25,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:10:25,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1825352369] [2024-11-24 00:10:25,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:10:25,513 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-24 00:10:25,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 00:10:25,518 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC/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-24 00:10:25,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC/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-24 00:10:26,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:10:26,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-24 00:10:26,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:10:26,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-24 00:10:26,960 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:10:26,961 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:10:26,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1825352369] [2024-11-24 00:10:26,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1825352369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:10:26,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:10:26,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 00:10:26,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567997098] [2024-11-24 00:10:26,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:10:26,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-24 00:10:26,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:10:26,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-24 00:10:26,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-24 00:10:26,987 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-24 00:10:26,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:10:26,996 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2024-11-24 00:10:26,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-24 00:10:26,998 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-24 00:10:26,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:10:27,003 INFO L225 Difference]: With dead ends: 31 [2024-11-24 00:10:27,003 INFO L226 Difference]: Without dead ends: 13 [2024-11-24 00:10:27,006 INFO L434 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-24 00:10:27,009 INFO L435 NwaCegarLoop]: 18 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, 18 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-24 00:10:27,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 00:10:27,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-24 00:10:27,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-24 00:10:27,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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-24 00:10:27,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2024-11-24 00:10:27,036 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2024-11-24 00:10:27,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:10:27,037 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-11-24 00:10:27,037 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-24 00:10:27,037 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2024-11-24 00:10:27,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-24 00:10:27,038 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:10:27,038 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:10:27,058 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-24 00:10:27,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC/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-24 00:10:27,239 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:10:27,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:10:27,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1015466291, now seen corresponding path program 1 times [2024-11-24 00:10:27,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:10:27,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2144689321] [2024-11-24 00:10:27,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:10:27,240 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-24 00:10:27,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 00:10:27,244 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC/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-24 00:10:27,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC/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-24 00:10:28,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:10:28,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-24 00:10:28,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:10:29,530 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-24 00:10:29,530 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:10:29,530 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:10:29,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2144689321] [2024-11-24 00:10:29,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2144689321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:10:29,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:10:29,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 00:10:29,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600485101] [2024-11-24 00:10:29,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:10:29,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 00:10:29,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:10:29,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 00:10:29,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-24 00:10:29,533 INFO L87 Difference]: Start difference. First operand 13 states and 14 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-24 00:10:34,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 00:10:35,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 00:10:40,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 00:10:44,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 00:10:48,586 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-24 00:10:52,592 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-24 00:10:57,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.62s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 00:11:01,354 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-24 00:11:05,374 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-24 00:11:09,388 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-24 00:11:13,438 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-24 00:11:17,446 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-24 00:11:21,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 00:11:23,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 00:11:24,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 00:11:25,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:11:25,064 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2024-11-24 00:11:25,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 00:11:25,066 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-24 00:11:25,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:11:25,066 INFO L225 Difference]: With dead ends: 21 [2024-11-24 00:11:25,067 INFO L226 Difference]: Without dead ends: 16 [2024-11-24 00:11:25,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-24 00:11:25,068 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 14 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 54.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 55.3s IncrementalHoareTripleChecker+Time [2024-11-24 00:11:25,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 15 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 12 Unknown, 0 Unchecked, 55.3s Time] [2024-11-24 00:11:25,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-24 00:11:25,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2024-11-24 00:11:25,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:11:25,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-11-24 00:11:25,073 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2024-11-24 00:11:25,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:11:25,073 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-11-24 00:11:25,074 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-24 00:11:25,074 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2024-11-24 00:11:25,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-24 00:11:25,074 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:11:25,074 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:11:25,095 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC/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-24 00:11:25,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC/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-24 00:11:25,275 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:11:25,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:11:25,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1504493643, now seen corresponding path program 1 times [2024-11-24 00:11:25,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:11:25,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1730325207] [2024-11-24 00:11:25,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:11:25,278 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-24 00:11:25,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 00:11:25,280 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC/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-24 00:11:25,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC/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-24 00:11:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:11:32,145 WARN L254 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-24 00:11:32,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:11:46,104 WARN L286 SmtUtils]: Spent 6.48s 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-24 00:12:32,235 WARN L286 SmtUtils]: Spent 22.77s 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-24 00:12:41,056 WARN L286 SmtUtils]: Spent 8.29s 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-24 00:12:49,346 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-24 00:12:57,600 WARN L286 SmtUtils]: Spent 8.25s 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-24 00:13:05,884 WARN L286 SmtUtils]: Spent 8.28s 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-24 00:13:14,222 WARN L286 SmtUtils]: Spent 8.29s 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-24 00:13:22,539 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-24 00:13:30,901 WARN L286 SmtUtils]: Spent 8.36s 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-24 00:13:43,892 WARN L286 SmtUtils]: Spent 8.33s 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-24 00:13:48,060 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-24 00:13:56,451 WARN L286 SmtUtils]: Spent 8.35s 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-24 00:14:04,816 WARN L286 SmtUtils]: Spent 8.36s 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-24 00:14:13,109 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-24 00:14:21,436 WARN L286 SmtUtils]: Spent 8.33s 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-24 00:14:25,584 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-24 00:14:34,177 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-24 00:14:42,611 WARN L286 SmtUtils]: Spent 8.43s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 00:14:51,132 WARN L286 SmtUtils]: Spent 8.52s 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-24 00:14:59,710 WARN L286 SmtUtils]: Spent 8.58s 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-24 00:15:03,906 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-24 00:15:20,782 WARN L286 SmtUtils]: Spent 8.48s 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-24 00:15:29,293 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-24 00:15:37,721 WARN L286 SmtUtils]: Spent 8.43s 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-24 00:15:46,253 WARN L286 SmtUtils]: Spent 8.53s 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-24 00:15:58,889 WARN L286 SmtUtils]: Spent 8.49s 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-24 00:16:07,323 WARN L286 SmtUtils]: Spent 8.43s 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-24 00:16:15,876 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-24 00:16:24,381 WARN L286 SmtUtils]: Spent 8.50s 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-24 00:16:37,003 WARN L286 SmtUtils]: Spent 8.48s 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-24 00:16:45,677 WARN L286 SmtUtils]: Spent 8.67s 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-24 00:16:54,203 WARN L286 SmtUtils]: Spent 8.53s 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-24 00:17:02,736 WARN L286 SmtUtils]: Spent 8.53s 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-24 00:17:11,296 WARN L286 SmtUtils]: Spent 8.56s 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-24 00:17:15,876 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-24 00:17:28,547 WARN L286 SmtUtils]: Spent 8.47s 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-24 00:17:37,189 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-24 00:17:45,698 WARN L286 SmtUtils]: Spent 8.51s 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-24 00:17:54,234 WARN L286 SmtUtils]: Spent 8.54s 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-24 00:18:06,853 WARN L286 SmtUtils]: Spent 8.48s 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-24 00:18:15,285 WARN L286 SmtUtils]: Spent 8.43s 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-24 00:18:23,803 WARN L286 SmtUtils]: Spent 8.52s 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-24 00:18:32,309 WARN L286 SmtUtils]: Spent 8.50s 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-24 00:18:36,605 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-24 00:18:40,711 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-24 00:18:40,711 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-24 00:18:40,711 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:18:40,712 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:18:40,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1730325207] [2024-11-24 00:18:40,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1730325207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:18:40,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:18:40,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-24 00:18:40,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040590312] [2024-11-24 00:18:40,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:18:40,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-24 00:18:40,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:18:40,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-24 00:18:40,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=30, Unknown=7, NotChecked=70, Total=132 [2024-11-24 00:18:40,713 INFO L87 Difference]: Start difference. First operand 15 states and 16 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-24 00:18:42,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 00:18:44,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-24 00:18:46,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-24 00:18:49,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.52s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-24 00:18:53,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.87s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-24 00:18:57,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 00:19:35,206 WARN L286 SmtUtils]: Spent 30.23s 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-24 00:19:39,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 00:19:43,354 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-24 00:19:47,361 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-24 00:19:51,365 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-24 00:19:55,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-24 00:19:59,610 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-24 00:20:03,628 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 [0] [2024-11-24 00:20:08,094 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-24 00:20:12,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.62s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 00:20:16,767 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-24 00:20:20,772 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-24 00:20:24,784 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-24 00:20:28,796 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-24 00:20:32,802 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-24 00:20:36,816 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-24 00:20:40,819 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-24 00:20:44,826 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-24 00:20:49,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.41s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 00:20:53,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-24 00:20:56,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.85s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 00:20:57,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-24 00:20:57,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:20:57,853 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2024-11-24 00:20:57,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-24 00:20:57,854 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-24 00:20:57,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:20:57,855 INFO L225 Difference]: With dead ends: 28 [2024-11-24 00:20:57,855 INFO L226 Difference]: Without dead ends: 23 [2024-11-24 00:20:57,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 112.4s TimeCoverageRelationStatistics Valid=32, Invalid=39, Unknown=9, NotChecked=102, Total=182 [2024-11-24 00:20:57,856 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 17 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 94.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 144 IncrementalHoareTripleChecker+Unchecked, 95.1s IncrementalHoareTripleChecker+Time [2024-11-24 00:20:57,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 40 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 18 Unknown, 144 Unchecked, 95.1s Time] [2024-11-24 00:20:57,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-24 00:20:57,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 14. [2024-11-24 00:20:57,861 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-24 00:20:57,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2024-11-24 00:20:57,861 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2024-11-24 00:20:57,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:20:57,862 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2024-11-24 00:20:57,862 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-24 00:20:57,862 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2024-11-24 00:20:57,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-24 00:20:57,862 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:20:57,863 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:20:57,905 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC/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-24 00:20:58,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC/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-24 00:20:58,063 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:20:58,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:20:58,064 INFO L85 PathProgramCache]: Analyzing trace with hash -991535313, now seen corresponding path program 1 times [2024-11-24 00:20:58,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:20:58,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [378830952] [2024-11-24 00:20:58,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:20:58,065 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-24 00:20:58,065 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 00:20:58,067 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC/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-24 00:20:58,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90feb763-67d7-44d9-9fc0-305b55a47ca0/bin/uautomizer-verify-LYvppIcaGC/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-24 00:21:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:21:08,199 WARN L254 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-24 00:21:08,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:21:22,813 WARN L286 SmtUtils]: Spent 8.60s 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-24 00:21:31,276 WARN L286 SmtUtils]: Spent 8.46s 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-24 00:21:39,923 WARN L286 SmtUtils]: Spent 8.65s 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-24 00:21:48,088 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-24 00:21:56,259 WARN L286 SmtUtils]: Spent 8.17s 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-24 00:22:04,434 WARN L286 SmtUtils]: Spent 8.17s 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-24 00:22:12,604 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 00:22:20,875 WARN L286 SmtUtils]: Spent 8.27s 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-24 00:22:29,054 WARN L286 SmtUtils]: Spent 8.18s 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-24 00:22:37,217 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-24 00:22:41,725 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-24 00:22:45,797 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-24 00:22:53,978 WARN L286 SmtUtils]: Spent 8.18s 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-24 00:23:02,135 WARN L286 SmtUtils]: Spent 8.16s 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-24 00:23:10,679 WARN L286 SmtUtils]: Spent 8.54s 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-24 00:23:19,040 WARN L286 SmtUtils]: Spent 8.36s 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-24 00:23:27,640 WARN L286 SmtUtils]: Spent 8.60s 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-24 00:23:35,818 WARN L286 SmtUtils]: Spent 8.18s 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-24 00:23:39,993 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-24 00:23:44,056 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-24 00:23:52,936 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-24 00:24:02,151 WARN L286 SmtUtils]: Spent 9.21s 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-24 00:24:11,331 WARN L286 SmtUtils]: Spent 9.18s 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-24 00:24:20,331 WARN L286 SmtUtils]: Spent 9.00s 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-24 00:24:29,416 WARN L286 SmtUtils]: Spent 9.08s 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-24 00:24:33,774 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-24 00:24:51,323 WARN L286 SmtUtils]: Spent 8.90s 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-24 00:25:00,347 WARN L286 SmtUtils]: Spent 9.02s 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-24 00:25:09,143 WARN L286 SmtUtils]: Spent 8.80s 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-24 00:25:17,989 WARN L286 SmtUtils]: Spent 8.85s 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-24 00:25:26,851 WARN L286 SmtUtils]: Spent 8.86s 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)