./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.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_588a7f51-a488-47d1-9ad9-f2174f28a47d/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/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_588a7f51-a488-47d1-9ad9-f2174f28a47d/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/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_588a7f51-a488-47d1-9ad9-f2174f28a47d/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 736ab1a5e950f94d10703cde0979d12465a57eb1332dc067f0dbd06f88e9370a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-23 23:12:55,753 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 23:12:55,869 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-23 23:12:55,880 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 23:12:55,881 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 23:12:55,931 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 23:12:55,934 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 23:12:55,935 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 23:12:55,935 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 23:12:55,936 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 23:12:55,936 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-23 23:12:55,937 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-23 23:12:55,938 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 23:12:55,938 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 23:12:55,938 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 23:12:55,939 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 23:12:55,939 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-23 23:12:55,939 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-23 23:12:55,939 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 23:12:55,939 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-23 23:12:55,939 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 23:12:55,939 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-23 23:12:55,939 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-23 23:12:55,939 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-23 23:12:55,939 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-23 23:12:55,939 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 23:12:55,940 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-23 23:12:55,940 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 23:12:55,940 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-23 23:12:55,940 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 23:12:55,940 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 23:12:55,940 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 23:12:55,940 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:12:55,940 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 23:12:55,940 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 23:12:55,940 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 23:12:55,941 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 23:12:55,941 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:12:55,942 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 23:12:55,943 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-23 23:12:55,943 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-23 23:12:55,943 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-23 23:12:55,943 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-23 23:12:55,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-23 23:12:55,944 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-23 23:12:55,944 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-23 23:12:55,944 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-23 23:12:55,944 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-23 23:12:55,944 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_588a7f51-a488-47d1-9ad9-f2174f28a47d/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 -> 736ab1a5e950f94d10703cde0979d12465a57eb1332dc067f0dbd06f88e9370a [2024-11-23 23:12:56,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 23:12:56,391 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 23:12:56,394 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 23:12:56,396 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 23:12:56,397 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 23:12:56,398 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c [2024-11-23 23:13:00,068 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/bin/uautomizer-verify-LYvppIcaGC/data/bd167b19e/d65e4870032c47cfbd7928daca0a9202/FLAG9af8897f5 [2024-11-23 23:13:00,471 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 23:13:00,472 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c [2024-11-23 23:13:00,488 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/bin/uautomizer-verify-LYvppIcaGC/data/bd167b19e/d65e4870032c47cfbd7928daca0a9202/FLAG9af8897f5 [2024-11-23 23:13:00,522 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/bin/uautomizer-verify-LYvppIcaGC/data/bd167b19e/d65e4870032c47cfbd7928daca0a9202 [2024-11-23 23:13:00,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 23:13:00,528 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 23:13:00,531 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 23:13:00,531 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 23:13:00,537 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 23:13:00,538 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:13:00" (1/1) ... [2024-11-23 23:13:00,542 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43668568 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:00, skipping insertion in model container [2024-11-23 23:13:00,543 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:13:00" (1/1) ... [2024-11-23 23:13:00,566 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 23:13:00,754 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_588a7f51-a488-47d1-9ad9-f2174f28a47d/sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c[831,844] [2024-11-23 23:13:00,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:13:00,791 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 23:13:00,804 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_588a7f51-a488-47d1-9ad9-f2174f28a47d/sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c[831,844] [2024-11-23 23:13:00,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:13:00,845 INFO L204 MainTranslator]: Completed translation [2024-11-23 23:13:00,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:00 WrapperNode [2024-11-23 23:13:00,846 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 23:13:00,851 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 23:13:00,851 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 23:13:00,852 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 23:13:00,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:00" (1/1) ... [2024-11-23 23:13:00,884 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:00" (1/1) ... [2024-11-23 23:13:00,915 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2024-11-23 23:13:00,915 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 23:13:00,916 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 23:13:00,916 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 23:13:00,916 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 23:13:00,929 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:00" (1/1) ... [2024-11-23 23:13:00,929 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:00" (1/1) ... [2024-11-23 23:13:00,931 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:00" (1/1) ... [2024-11-23 23:13:00,944 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-23 23:13:00,944 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:00" (1/1) ... [2024-11-23 23:13:00,945 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:00" (1/1) ... [2024-11-23 23:13:00,948 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:00" (1/1) ... [2024-11-23 23:13:00,949 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:00" (1/1) ... [2024-11-23 23:13:00,953 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:00" (1/1) ... [2024-11-23 23:13:00,954 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:00" (1/1) ... [2024-11-23 23:13:00,955 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:00" (1/1) ... [2024-11-23 23:13:00,957 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 23:13:00,962 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 23:13:00,962 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 23:13:00,962 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 23:13:00,964 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:00" (1/1) ... [2024-11-23 23:13:00,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:13:00,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:13:01,013 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-23 23:13:01,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-23 23:13:01,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 23:13:01,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-23 23:13:01,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 23:13:01,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 23:13:01,140 INFO L234 CfgBuilder]: Building ICFG [2024-11-23 23:13:01,142 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 23:13:01,319 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-23 23:13:01,319 INFO L283 CfgBuilder]: Performing block encoding [2024-11-23 23:13:01,329 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 23:13:01,330 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-23 23:13:01,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:13:01 BoogieIcfgContainer [2024-11-23 23:13:01,331 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 23:13:01,334 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-23 23:13:01,334 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-23 23:13:01,343 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-23 23:13:01,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:13:00" (1/3) ... [2024-11-23 23:13:01,345 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68d53ca3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:13:01, skipping insertion in model container [2024-11-23 23:13:01,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:00" (2/3) ... [2024-11-23 23:13:01,345 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68d53ca3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:13:01, skipping insertion in model container [2024-11-23 23:13:01,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:13:01" (3/3) ... [2024-11-23 23:13:01,350 INFO L128 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant.c [2024-11-23 23:13:01,378 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-23 23:13:01,380 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sqrt_Householder_constant.c that has 1 procedures, 18 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2024-11-23 23:13:01,465 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-23 23:13:01,480 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;@68232ea6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 23:13:01,480 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-23 23:13:01,484 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 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-23 23:13:01,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-23 23:13:01,491 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:13:01,492 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:13:01,492 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:13:01,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:13:01,499 INFO L85 PathProgramCache]: Analyzing trace with hash 372777014, now seen corresponding path program 1 times [2024-11-23 23:13:01,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:13:01,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975107202] [2024-11-23 23:13:01,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:13:01,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:13:01,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:13:01,642 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 23:13:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:13:01,682 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 23:13:01,685 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 23:13:01,687 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-23 23:13:01,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-23 23:13:01,695 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-23 23:13:01,719 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-23 23:13:01,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:13:01 BoogieIcfgContainer [2024-11-23 23:13:01,724 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-23 23:13:01,725 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-23 23:13:01,725 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-23 23:13:01,726 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-23 23:13:01,727 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:13:01" (3/4) ... [2024-11-23 23:13:01,730 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-23 23:13:01,731 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-23 23:13:01,733 INFO L158 Benchmark]: Toolchain (without parser) took 1205.54ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 63.2MB in the end (delta: 37.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-23 23:13:01,733 INFO L158 Benchmark]: CDTParser took 0.79ms. Allocated memory is still 167.8MB. Free memory is still 104.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 23:13:01,734 INFO L158 Benchmark]: CACSL2BoogieTranslator took 315.99ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 89.9MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-23 23:13:01,735 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.80ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 88.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 23:13:01,735 INFO L158 Benchmark]: Boogie Preprocessor took 45.24ms. Allocated memory is still 142.6MB. Free memory was 88.4MB in the beginning and 87.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 23:13:01,736 INFO L158 Benchmark]: RCFGBuilder took 368.94ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 77.0MB in the end (delta: 10.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-23 23:13:01,736 INFO L158 Benchmark]: TraceAbstraction took 390.90ms. Allocated memory is still 142.6MB. Free memory was 76.3MB in the beginning and 63.6MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-23 23:13:01,737 INFO L158 Benchmark]: Witness Printer took 6.30ms. Allocated memory is still 142.6MB. Free memory was 63.6MB in the beginning and 63.2MB in the end (delta: 330.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 23:13:01,739 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.79ms. Allocated memory is still 167.8MB. Free memory is still 104.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 315.99ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 89.9MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.80ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 88.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.24ms. Allocated memory is still 142.6MB. Free memory was 88.4MB in the beginning and 87.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 368.94ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 77.0MB in the end (delta: 10.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 390.90ms. Allocated memory is still 142.6MB. Free memory was 76.3MB in the beginning and 63.6MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Witness Printer took 6.30ms. Allocated memory is still 142.6MB. Free memory was 63.6MB in the beginning and 63.2MB in the end (delta: 330.7kB). 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 28, overapproximation of someBinaryArithmeticDOUBLEoperation at line 30, overapproximation of someBinaryArithmeticDOUBLEoperation at line 44, overapproximation of someUnaryDOUBLEoperation at line 32, overapproximation of someBinaryDOUBLEComparisonOperation at line 55, overapproximation of someBinaryDOUBLEComparisonOperation at line 28, overapproximation of someBinaryDOUBLEComparisonOperation at line 51, overapproximation of someBinaryDOUBLEComparisonOperation at line 33. Possible FailurePath: [L22] double _EPS = 1e-6; VAL [_EPS=1/1000000] [L49] double d, r; [L51] d = 1. VAL [_EPS=1/1000000, d=1] [L51] COND TRUE d <= 20. VAL [_EPS=1/1000000, d=1] [L53] CALL, EXPR SqrtR(d) [L26] double xn, xnp1, residu, lsup, linf; [L27] int i, cond; VAL [_EPS=1/1000000] [L28] COND FALSE !(Input <= 1.0) [L28] xn = 1.0/Input VAL [_EPS=1/1000000] [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] [L53] RET, EXPR SqrtR(d) [L53] r = SqrtR(d) [L55] CALL __VERIFIER_assert(r >= 1.0 && r <= 5.0) [L20] COND TRUE !(cond) VAL [_EPS=1/1000000] [L20] reach_error() VAL [_EPS=1/1000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-23 23:13:01,764 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/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_588a7f51-a488-47d1-9ad9-f2174f28a47d/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/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_588a7f51-a488-47d1-9ad9-f2174f28a47d/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 736ab1a5e950f94d10703cde0979d12465a57eb1332dc067f0dbd06f88e9370a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-23 23:13:05,070 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 23:13:05,167 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-23 23:13:05,174 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 23:13:05,174 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 23:13:05,238 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 23:13:05,241 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 23:13:05,242 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 23:13:05,243 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 23:13:05,244 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 23:13:05,244 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-23 23:13:05,244 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-23 23:13:05,244 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 23:13:05,245 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 23:13:05,245 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 23:13:05,245 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 23:13:05,245 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-23 23:13:05,245 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-23 23:13:05,245 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-23 23:13:05,245 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 23:13:05,245 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-23 23:13:05,246 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-23 23:13:05,246 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-23 23:13:05,246 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-23 23:13:05,246 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-23 23:13:05,249 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-23 23:13:05,249 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-23 23:13:05,249 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 23:13:05,249 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-23 23:13:05,249 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 23:13:05,249 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-23 23:13:05,250 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 23:13:05,250 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 23:13:05,251 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 23:13:05,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:13:05,251 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 23:13:05,252 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 23:13:05,252 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 23:13:05,252 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 23:13:05,252 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:13:05,252 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 23:13:05,252 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-23 23:13:05,252 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-23 23:13:05,252 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-23 23:13:05,252 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-23 23:13:05,252 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-23 23:13:05,253 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-23 23:13:05,253 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-23 23:13:05,253 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-23 23:13:05,253 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-23 23:13:05,254 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_588a7f51-a488-47d1-9ad9-f2174f28a47d/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 -> 736ab1a5e950f94d10703cde0979d12465a57eb1332dc067f0dbd06f88e9370a [2024-11-23 23:13:05,653 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 23:13:05,665 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 23:13:05,668 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 23:13:05,669 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 23:13:05,670 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 23:13:05,672 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c [2024-11-23 23:13:09,334 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/bin/uautomizer-verify-LYvppIcaGC/data/98398a1f5/979c8c0fc1274110adf19a5baead7591/FLAG98f87312a [2024-11-23 23:13:09,695 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 23:13:09,696 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c [2024-11-23 23:13:09,709 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/bin/uautomizer-verify-LYvppIcaGC/data/98398a1f5/979c8c0fc1274110adf19a5baead7591/FLAG98f87312a [2024-11-23 23:13:09,740 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/bin/uautomizer-verify-LYvppIcaGC/data/98398a1f5/979c8c0fc1274110adf19a5baead7591 [2024-11-23 23:13:09,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 23:13:09,749 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 23:13:09,751 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 23:13:09,751 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 23:13:09,760 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 23:13:09,761 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:13:09" (1/1) ... [2024-11-23 23:13:09,762 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d6efce5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:09, skipping insertion in model container [2024-11-23 23:13:09,762 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:13:09" (1/1) ... [2024-11-23 23:13:09,786 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 23:13:09,986 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_588a7f51-a488-47d1-9ad9-f2174f28a47d/sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c[831,844] [2024-11-23 23:13:10,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:13:10,051 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 23:13:10,068 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_588a7f51-a488-47d1-9ad9-f2174f28a47d/sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c[831,844] [2024-11-23 23:13:10,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:13:10,119 INFO L204 MainTranslator]: Completed translation [2024-11-23 23:13:10,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:10 WrapperNode [2024-11-23 23:13:10,121 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 23:13:10,122 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 23:13:10,123 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 23:13:10,124 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 23:13:10,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:10" (1/1) ... [2024-11-23 23:13:10,151 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:10" (1/1) ... [2024-11-23 23:13:10,184 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2024-11-23 23:13:10,184 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 23:13:10,185 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 23:13:10,185 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 23:13:10,185 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 23:13:10,198 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:10" (1/1) ... [2024-11-23 23:13:10,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:10" (1/1) ... [2024-11-23 23:13:10,202 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:10" (1/1) ... [2024-11-23 23:13:10,223 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-23 23:13:10,223 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:10" (1/1) ... [2024-11-23 23:13:10,223 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:10" (1/1) ... [2024-11-23 23:13:10,236 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:10" (1/1) ... [2024-11-23 23:13:10,241 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:10" (1/1) ... [2024-11-23 23:13:10,248 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:10" (1/1) ... [2024-11-23 23:13:10,250 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:10" (1/1) ... [2024-11-23 23:13:10,253 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:10" (1/1) ... [2024-11-23 23:13:10,256 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 23:13:10,262 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 23:13:10,262 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 23:13:10,262 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 23:13:10,266 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:10" (1/1) ... [2024-11-23 23:13:10,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:13:10,295 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:13:10,310 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-23 23:13:10,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-23 23:13:10,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 23:13:10,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-23 23:13:10,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 23:13:10,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 23:13:10,406 INFO L234 CfgBuilder]: Building ICFG [2024-11-23 23:13:10,408 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 23:13:24,959 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-23 23:13:24,959 INFO L283 CfgBuilder]: Performing block encoding [2024-11-23 23:13:24,978 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 23:13:24,979 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-23 23:13:24,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:13:24 BoogieIcfgContainer [2024-11-23 23:13:24,980 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 23:13:24,985 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-23 23:13:24,985 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-23 23:13:24,993 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-23 23:13:24,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:13:09" (1/3) ... [2024-11-23 23:13:24,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57884149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:13:24, skipping insertion in model container [2024-11-23 23:13:24,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:10" (2/3) ... [2024-11-23 23:13:24,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57884149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:13:24, skipping insertion in model container [2024-11-23 23:13:24,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:13:24" (3/3) ... [2024-11-23 23:13:24,999 INFO L128 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant.c [2024-11-23 23:13:25,021 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-23 23:13:25,025 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sqrt_Householder_constant.c that has 1 procedures, 18 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2024-11-23 23:13:25,110 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-23 23:13:25,131 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;@60d1cea8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 23:13:25,131 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-23 23:13:25,136 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 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-23 23:13:25,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-23 23:13:25,143 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:13:25,144 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:13:25,145 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:13:25,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:13:25,154 INFO L85 PathProgramCache]: Analyzing trace with hash 372777014, now seen corresponding path program 1 times [2024-11-23 23:13:25,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 23:13:25,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1355341247] [2024-11-23 23:13:25,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:13:25,167 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-23 23:13:25,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-23 23:13:25,169 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/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-23 23:13:25,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/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-23 23:13:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:13:27,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 23:13:27,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:13:28,206 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-23 23:13:28,207 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 23:13:28,208 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 23:13:28,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1355341247] [2024-11-23 23:13:28,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1355341247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:13:28,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:13:28,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:13:28,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309693191] [2024-11-23 23:13:28,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:13:28,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:13:28,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 23:13:28,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:13:28,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:13:28,248 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 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 4 states, 4 states have (on average 2.75) 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-23 23:13:32,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:13:37,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.83s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:13:40,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.76s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:13:45,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:13:49,345 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 [] [2024-11-23 23:13:53,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:13:57,665 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-23 23:14:02,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.80s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:14:06,472 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-23 23:14:10,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.47s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:14:14,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:14:15,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:14:15,061 INFO L93 Difference]: Finished difference Result 46 states and 62 transitions. [2024-11-23 23:14:15,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 23:14:15,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) 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-23 23:14:15,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:14:15,075 INFO L225 Difference]: With dead ends: 46 [2024-11-23 23:14:15,075 INFO L226 Difference]: Without dead ends: 26 [2024-11-23 23:14:15,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:14:15,086 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 17 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 46.6s IncrementalHoareTripleChecker+Time [2024-11-23 23:14:15,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 29 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 10 Unknown, 0 Unchecked, 46.6s Time] [2024-11-23 23:14:15,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-23 23:14:15,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 17. [2024-11-23 23:14:15,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:14:15,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2024-11-23 23:14:15,130 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2024-11-23 23:14:15,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:14:15,132 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-11-23 23:14:15,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) 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-23 23:14:15,135 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2024-11-23 23:14:15,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-23 23:14:15,136 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:14:15,136 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:14:15,191 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/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)] Forceful destruction successful, exit code 0 [2024-11-23 23:14:15,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/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-23 23:14:15,337 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:14:15,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:14:15,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1402230348, now seen corresponding path program 1 times [2024-11-23 23:14:15,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 23:14:15,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1077875321] [2024-11-23 23:14:15,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:14:15,339 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-23 23:14:15,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-23 23:14:15,341 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/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-23 23:14:15,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/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-23 23:14:17,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:14:17,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-23 23:14:17,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:14:18,581 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-23 23:14:18,581 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 23:14:18,582 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 23:14:18,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1077875321] [2024-11-23 23:14:18,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1077875321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:14:18,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:14:18,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:14:18,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258592133] [2024-11-23 23:14:18,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:14:18,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 23:14:18,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 23:14:18,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 23:14:18,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:14:18,586 INFO L87 Difference]: Start difference. First operand 17 states and 19 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-23 23:14:21,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:14:26,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.75s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:14:30,224 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-23 23:14:34,234 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-23 23:14:39,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.72s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:14:43,275 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-23 23:14:47,282 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-23 23:14:49,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:14:53,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:14:57,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:15:02,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:15:06,596 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-23 23:15:06,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:15:06,597 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2024-11-23 23:15:06,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:15:06,664 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-23 23:15:06,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:15:06,665 INFO L225 Difference]: With dead ends: 32 [2024-11-23 23:15:06,665 INFO L226 Difference]: Without dead ends: 20 [2024-11-23 23:15:06,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-23 23:15:06,666 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 16 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.6s IncrementalHoareTripleChecker+Time [2024-11-23 23:15:06,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 15 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 10 Unknown, 0 Unchecked, 47.6s Time] [2024-11-23 23:15:06,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-23 23:15:06,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2024-11-23 23:15:06,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 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-23 23:15:06,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2024-11-23 23:15:06,673 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 11 [2024-11-23 23:15:06,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:15:06,673 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-11-23 23:15:06,674 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-23 23:15:06,674 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2024-11-23 23:15:06,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-23 23:15:06,674 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:15:06,675 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:15:06,701 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/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-23 23:15:06,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/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-23 23:15:06,875 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:15:06,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:15:06,876 INFO L85 PathProgramCache]: Analyzing trace with hash -820698160, now seen corresponding path program 1 times [2024-11-23 23:15:06,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 23:15:06,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1554183903] [2024-11-23 23:15:06,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:15:06,877 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-23 23:15:06,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-23 23:15:06,880 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/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-23 23:15:06,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/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-23 23:15:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:15:10,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-23 23:15:10,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:15:42,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:15:42,974 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:15:52,555 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-23 23:15:59,881 WARN L286 SmtUtils]: Spent 7.33s 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-23 23:16:06,351 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0))))) is different from true [2024-11-23 23:16:13,737 WARN L286 SmtUtils]: Spent 7.38s 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-23 23:16:22,015 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:16:31,248 WARN L286 SmtUtils]: Spent 9.23s 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-23 23:16:40,525 WARN L286 SmtUtils]: Spent 9.28s 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-23 23:16:44,856 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xn~0#1| (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) (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) |c_ULTIMATE.start_SqrtR_~Input#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0))))) is different from false [2024-11-23 23:16:49,184 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xn~0#1| (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) (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) |c_ULTIMATE.start_SqrtR_~Input#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0))))) is different from true [2024-11-23 23:16:58,369 WARN L286 SmtUtils]: Spent 9.18s 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-23 23:17:07,607 WARN L286 SmtUtils]: Spent 9.24s 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-23 23:17:16,819 WARN L286 SmtUtils]: Spent 9.21s 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-23 23:17:26,014 WARN L286 SmtUtils]: Spent 9.19s 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-23 23:17:34,903 WARN L286 SmtUtils]: Spent 8.89s 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-23 23:17:43,762 WARN L286 SmtUtils]: Spent 8.86s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:17:47,974 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| .cse1) .cse1) (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) |c_ULTIMATE.start_SqrtR_~Input#1|) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 .cse1)))) is different from false [2024-11-23 23:17:52,197 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| .cse1) .cse1) (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) |c_ULTIMATE.start_SqrtR_~Input#1|) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 .cse1)))) is different from true [2024-11-23 23:18:01,012 WARN L286 SmtUtils]: Spent 8.81s 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-23 23:18:09,957 WARN L286 SmtUtils]: Spent 8.94s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:18:14,159 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~d~0#1| .cse1) .cse1) (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) |c_ULTIMATE.start_main_~d~0#1|) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 .cse1)))) is different from false [2024-11-23 23:18:18,351 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~d~0#1| .cse1) .cse1) (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) |c_ULTIMATE.start_main_~d~0#1|) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 .cse1)))) is different from true [2024-11-23 23:18:27,032 WARN L286 SmtUtils]: Spent 8.68s 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-23 23:18:35,713 WARN L286 SmtUtils]: Spent 8.68s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:18:35,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-23 23:18:35,870 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 23:18:35,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1554183903] [2024-11-23 23:18:35,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1554183903] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:18:35,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 23:18:35,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-11-23 23:18:35,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621811679] [2024-11-23 23:18:35,870 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 23:18:35,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-23 23:18:35,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 23:18:35,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-23 23:18:35,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=78, Unknown=13, NotChecked=84, Total=210 [2024-11-23 23:18:35,872 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 15 states have internal predecessors, (25), 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-23 23:18:40,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:18:44,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:18:49,036 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~d~0#1| .cse1) .cse1) (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) |c_ULTIMATE.start_main_~d~0#1|) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 .cse1) (= .cse1 |c_ULTIMATE.start_main_~d~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-23 23:18:53,231 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| .cse1) .cse1) (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) |c_ULTIMATE.start_SqrtR_~Input#1|) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (= .cse1 |c_ULTIMATE.start_SqrtR_~Input#1|) (fp.geq .cse0 .cse1) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2024-11-23 23:18:57,449 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| .cse1) .cse1) (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) |c_ULTIMATE.start_SqrtR_~Input#1|) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (= .cse1 |c_ULTIMATE.start_SqrtR_~Input#1|) (fp.geq .cse0 .cse1) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-23 23:19:01,929 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xn~0#1| (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) (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) |c_ULTIMATE.start_SqrtR_~Input#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.geq .cse0 .cse1) (= .cse1 |c_ULTIMATE.start_SqrtR_~Input#1|) (= .cse1 |c_ULTIMATE.start_SqrtR_~xn~0#1|) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2024-11-23 23:19:06,278 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xn~0#1| (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) (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) |c_ULTIMATE.start_SqrtR_~Input#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.geq .cse0 .cse1) (= .cse1 |c_ULTIMATE.start_SqrtR_~Input#1|) (= .cse1 |c_ULTIMATE.start_SqrtR_~xn~0#1|) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-23 23:19:16,044 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (and (fp.geq .cse0 .cse1) (= (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse1) .cse1) (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) .cse1) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)) |c_ULTIMATE.start_SqrtR_~xnp1~0#1|) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-23 23:19:20,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.74s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:19:24,790 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-23 23:19:28,794 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-23 23:19:32,797 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-23 23:19:36,810 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-23 23:19:40,827 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-23 23:19:44,839 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-23 23:19:48,845 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-23 23:19:52,847 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-23 23:19:58,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.76s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:20:02,663 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-23 23:20:06,673 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-23 23:20:10,683 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-23 23:20:14,688 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-23 23:20:18,692 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-23 23:20:22,702 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-23 23:20:26,716 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-23 23:20:30,719 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-23 23:20:35,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.52s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:20:39,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:20:43,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:20:47,254 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 [] [2024-11-23 23:20:48,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:20:54,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.81s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:20:59,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:21:03,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:21:08,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:21:12,060 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-23 23:21:16,065 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-23 23:21:20,068 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-23 23:21:22,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:21:22,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:21:22,765 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2024-11-23 23:21:22,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-23 23:21:22,842 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 15 states have internal predecessors, (25), 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 13 [2024-11-23 23:21:22,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:21:22,843 INFO L225 Difference]: With dead ends: 29 [2024-11-23 23:21:22,843 INFO L226 Difference]: Without dead ends: 27 [2024-11-23 23:21:22,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 95.1s TimeCoverageRelationStatistics Valid=48, Invalid=97, Unknown=19, NotChecked=216, Total=380 [2024-11-23 23:21:22,845 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 18 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 30 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 133.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 30 IncrementalHoareTripleChecker+Unknown, 166 IncrementalHoareTripleChecker+Unchecked, 135.2s IncrementalHoareTripleChecker+Time [2024-11-23 23:21:22,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 35 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 30 Unknown, 166 Unchecked, 135.2s Time] [2024-11-23 23:21:22,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-23 23:21:22,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2024-11-23 23:21:22,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:21:22,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2024-11-23 23:21:22,852 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 13 [2024-11-23 23:21:22,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:21:22,852 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2024-11-23 23:21:22,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 15 states have internal predecessors, (25), 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-23 23:21:22,852 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2024-11-23 23:21:22,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-23 23:21:22,853 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:21:22,853 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:21:22,921 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/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)] Forceful destruction successful, exit code 0 [2024-11-23 23:21:23,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/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-23 23:21:23,054 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:21:23,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:21:23,054 INFO L85 PathProgramCache]: Analyzing trace with hash -314013972, now seen corresponding path program 2 times [2024-11-23 23:21:23,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 23:21:23,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [130128862] [2024-11-23 23:21:23,055 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 23:21:23,055 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-23 23:21:23,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-23 23:21:23,061 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/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-23 23:21:23,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/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-23 23:21:29,155 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 23:21:29,155 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 23:21:29,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-23 23:21:29,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:21:33,771 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:21:33,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:21:43,281 WARN L286 SmtUtils]: Spent 9.40s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:21:52,637 WARN L286 SmtUtils]: Spent 9.36s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:21:56,955 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xn~0#1| (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) (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) |c_ULTIMATE.start_SqrtR_~Input#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_SqrtR_~xn~0#1|))) (.cse1 (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse2 .cse2)))) (and (not (fp.lt .cse0 (fp.neg .cse1))) (not (fp.gt .cse0 .cse1))))) is different from false [2024-11-23 23:22:01,264 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xn~0#1| (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) (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) |c_ULTIMATE.start_SqrtR_~Input#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_SqrtR_~xn~0#1|))) (.cse1 (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse2 .cse2)))) (and (not (fp.lt .cse0 (fp.neg .cse1))) (not (fp.gt .cse0 .cse1))))) is different from true [2024-11-23 23:22:10,640 WARN L286 SmtUtils]: Spent 9.37s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:22:19,949 WARN L286 SmtUtils]: Spent 9.31s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:22:29,169 WARN L286 SmtUtils]: Spent 9.22s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:22:38,534 WARN L286 SmtUtils]: Spent 9.36s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:22:47,358 WARN L286 SmtUtils]: Spent 8.82s 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-23 23:22:56,127 WARN L286 SmtUtils]: Spent 8.77s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:23:00,337 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| .cse3) .cse3) (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) |c_ULTIMATE.start_SqrtR_~Input#1|) .cse3) .cse3))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode .cse2 .cse3))) (.cse1 (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse2 .cse2)))) (and (not (fp.gt .cse0 .cse1)) (not (fp.lt .cse0 (fp.neg .cse1))))))) is different from false [2024-11-23 23:23:04,545 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| .cse3) .cse3) (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) |c_ULTIMATE.start_SqrtR_~Input#1|) .cse3) .cse3))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode .cse2 .cse3))) (.cse1 (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse2 .cse2)))) (and (not (fp.gt .cse0 .cse1)) (not (fp.lt .cse0 (fp.neg .cse1))))))) is different from true [2024-11-23 23:23:13,327 WARN L286 SmtUtils]: Spent 8.78s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:23:22,225 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-23 23:23:26,462 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~d~0#1| .cse3) .cse3) (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) |c_ULTIMATE.start_main_~d~0#1|) .cse3) .cse3))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode .cse2 .cse3))) (.cse1 (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse2 .cse2)))) (and (not (fp.gt .cse0 .cse1)) (not (fp.lt .cse0 (fp.neg .cse1))))))) is different from false [2024-11-23 23:23:30,700 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~d~0#1| .cse3) .cse3) (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) |c_ULTIMATE.start_main_~d~0#1|) .cse3) .cse3))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode .cse2 .cse3))) (.cse1 (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse2 .cse2)))) (and (not (fp.gt .cse0 .cse1)) (not (fp.lt .cse0 (fp.neg .cse1))))))) is different from true [2024-11-23 23:23:39,487 WARN L286 SmtUtils]: Spent 8.79s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:23:48,285 WARN L286 SmtUtils]: Spent 8.80s 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-23 23:23:50,232 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-23 23:23:50,233 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 23:23:50,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [130128862] [2024-11-23 23:23:50,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [130128862] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:23:50,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 23:23:50,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-23 23:23:50,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879054308] [2024-11-23 23:23:50,233 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 23:23:50,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-23 23:23:50,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 23:23:50,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-23 23:23:50,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=35, Unknown=6, NotChecked=42, Total=110 [2024-11-23 23:23:50,235 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 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-23 23:23:54,554 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (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 |c_ULTIMATE.start_main_~d~0#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) |c_ULTIMATE.start_main_~d~0#1|) .cse2) .cse2))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode .cse3 .cse2))) (.cse1 (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse3 .cse3)))) (and (= ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) c_~_EPS~0) (not (fp.gt .cse0 .cse1)) (= .cse2 |c_ULTIMATE.start_main_~d~0#1|) (not (fp.lt .cse0 (fp.neg .cse1))) (= c_currentRoundingMode roundNearestTiesToEven))))) is different from false [2024-11-23 23:23:58,744 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (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 |c_ULTIMATE.start_main_~d~0#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) |c_ULTIMATE.start_main_~d~0#1|) .cse2) .cse2))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode .cse3 .cse2))) (.cse1 (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse3 .cse3)))) (and (= ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) c_~_EPS~0) (not (fp.gt .cse0 .cse1)) (= .cse2 |c_ULTIMATE.start_main_~d~0#1|) (not (fp.lt .cse0 (fp.neg .cse1))) (= c_currentRoundingMode roundNearestTiesToEven))))) is different from true [2024-11-23 23:24:02,958 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (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 |c_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) |c_ULTIMATE.start_SqrtR_~Input#1|) .cse2) .cse2))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode .cse3 .cse2))) (.cse1 (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse3 .cse3)))) (and (not (fp.gt .cse0 .cse1)) (not (fp.lt .cse0 (fp.neg .cse1))) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) c_~_EPS~0) (= .cse2 |c_ULTIMATE.start_SqrtR_~Input#1|) (= c_currentRoundingMode roundNearestTiesToEven))))) is different from true [2024-11-23 23:24:07,237 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xn~0#1| (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) (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) |c_ULTIMATE.start_SqrtR_~Input#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode .cse3 |c_ULTIMATE.start_SqrtR_~xn~0#1|))) (.cse1 (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse3 .cse3))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.lt .cse0 (fp.neg .cse1))) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) c_~_EPS~0) (= .cse2 |c_ULTIMATE.start_SqrtR_~Input#1|) (not (fp.gt .cse0 .cse1)) (= .cse2 |c_ULTIMATE.start_SqrtR_~xn~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2024-11-23 23:24:11,587 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xn~0#1| (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) (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) |c_ULTIMATE.start_SqrtR_~Input#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode .cse3 |c_ULTIMATE.start_SqrtR_~xn~0#1|))) (.cse1 (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse3 .cse3))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.lt .cse0 (fp.neg .cse1))) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) c_~_EPS~0) (= .cse2 |c_ULTIMATE.start_SqrtR_~Input#1|) (not (fp.gt .cse0 .cse1)) (= .cse2 |c_ULTIMATE.start_SqrtR_~xn~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-23 23:24:16,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:24:20,116 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 [] [2024-11-23 23:24:22,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:24:26,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:24:29,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.75s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:24:34,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.76s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:24:38,129 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 [] [2024-11-23 23:24:42,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:24:46,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.45s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:24:50,693 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-23 23:24:54,700 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-23 23:24:58,707 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-23 23:25:02,728 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-23 23:25:06,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.54s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:25:11,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.72s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:25:15,094 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-23 23:25:19,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:25:23,112 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-23 23:25:27,116 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-23 23:25:31,118 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-23 23:25:31,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:25:31,119 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2024-11-23 23:25:31,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-23 23:25:31,409 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 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 15 [2024-11-23 23:25:31,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:25:31,410 INFO L225 Difference]: With dead ends: 40 [2024-11-23 23:25:31,410 INFO L226 Difference]: Without dead ends: 26 [2024-11-23 23:25:31,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 50.2s TimeCoverageRelationStatistics Valid=33, Invalid=36, Unknown=11, NotChecked=102, Total=182 [2024-11-23 23:25:31,411 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 79.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 79.7s IncrementalHoareTripleChecker+Time [2024-11-23 23:25:31,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 16 Unknown, 99 Unchecked, 79.7s Time] [2024-11-23 23:25:31,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-23 23:25:31,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-23 23:25:31,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 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-23 23:25:31,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2024-11-23 23:25:31,419 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 15 [2024-11-23 23:25:31,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:25:31,420 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-11-23 23:25:31,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 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-23 23:25:31,420 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2024-11-23 23:25:31,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-23 23:25:31,423 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:25:31,423 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:25:31,520 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/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)] Ended with exit code 0 [2024-11-23 23:25:31,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/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-23 23:25:31,624 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:25:31,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:25:31,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1496194232, now seen corresponding path program 1 times [2024-11-23 23:25:31,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 23:25:31,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [629562523] [2024-11-23 23:25:31,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:25:31,625 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-23 23:25:31,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-23 23:25:31,629 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/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-23 23:25:31,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_588a7f51-a488-47d1-9ad9-f2174f28a47d/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 (6)] Waiting until timeout for monitored process [2024-11-23 23:25:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:25:37,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-23 23:25:37,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:25:54,240 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-23 23:25:54,240 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:26:02,865 WARN L286 SmtUtils]: Spent 8.17s 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-23 23:26:11,133 WARN L286 SmtUtils]: Spent 8.27s 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-23 23:26:15,203 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.add c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xn~0#1| |c_ULTIMATE.start_SqrtR_~xn~0#1|))) (let ((.cse0 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse1))) (or (forall ((|v_ULTIMATE.start_SqrtR_~linf~0#1_24| (_ FloatingPoint 11 53))) (fp.lt .cse0 |v_ULTIMATE.start_SqrtR_~linf~0#1_24|)) (fp.gt .cse0 (fp.mul c_currentRoundingMode c_~_EPS~0 .cse1))))) is different from false [2024-11-23 23:26:19,280 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.add c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xn~0#1| |c_ULTIMATE.start_SqrtR_~xn~0#1|))) (let ((.cse0 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse1))) (or (forall ((|v_ULTIMATE.start_SqrtR_~linf~0#1_24| (_ FloatingPoint 11 53))) (fp.lt .cse0 |v_ULTIMATE.start_SqrtR_~linf~0#1_24|)) (fp.gt .cse0 (fp.mul c_currentRoundingMode c_~_EPS~0 .cse1))))) is different from true [2024-11-23 23:26:27,767 WARN L286 SmtUtils]: Spent 8.48s 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-23 23:26:36,055 WARN L286 SmtUtils]: Spent 8.29s 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-23 23:26:40,194 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) |c_ULTIMATE.start_SqrtR_~Input#1|))) (fp.add c_currentRoundingMode .cse2 .cse2)))) (let ((.cse0 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse1))) (or (fp.gt .cse0 (fp.mul c_currentRoundingMode c_~_EPS~0 .cse1)) (forall ((|v_ULTIMATE.start_SqrtR_~linf~0#1_24| (_ FloatingPoint 11 53))) (fp.lt .cse0 |v_ULTIMATE.start_SqrtR_~linf~0#1_24|))))) is different from false [2024-11-23 23:26:44,343 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) |c_ULTIMATE.start_SqrtR_~Input#1|))) (fp.add c_currentRoundingMode .cse2 .cse2)))) (let ((.cse0 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse1))) (or (fp.gt .cse0 (fp.mul c_currentRoundingMode c_~_EPS~0 .cse1)) (forall ((|v_ULTIMATE.start_SqrtR_~linf~0#1_24| (_ FloatingPoint 11 53))) (fp.lt .cse0 |v_ULTIMATE.start_SqrtR_~linf~0#1_24|))))) is different from true [2024-11-23 23:26:52,628 WARN L286 SmtUtils]: Spent 8.28s 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-23 23:27:01,123 WARN L286 SmtUtils]: Spent 8.49s 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-23 23:27:05,270 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) |c_ULTIMATE.start_main_~d~0#1|))) (fp.add c_currentRoundingMode .cse2 .cse2)))) (let ((.cse0 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse1))) (or (forall ((|v_ULTIMATE.start_SqrtR_~linf~0#1_24| (_ FloatingPoint 11 53))) (fp.lt .cse0 |v_ULTIMATE.start_SqrtR_~linf~0#1_24|)) (fp.gt .cse0 (fp.mul c_currentRoundingMode c_~_EPS~0 .cse1))))) is different from false [2024-11-23 23:27:09,419 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) |c_ULTIMATE.start_main_~d~0#1|))) (fp.add c_currentRoundingMode .cse2 .cse2)))) (let ((.cse0 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse1))) (or (forall ((|v_ULTIMATE.start_SqrtR_~linf~0#1_24| (_ FloatingPoint 11 53))) (fp.lt .cse0 |v_ULTIMATE.start_SqrtR_~linf~0#1_24|)) (fp.gt .cse0 (fp.mul c_currentRoundingMode c_~_EPS~0 .cse1))))) is different from true [2024-11-23 23:27:17,711 WARN L286 SmtUtils]: Spent 8.29s 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-23 23:27:26,152 WARN L286 SmtUtils]: Spent 8.44s 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-23 23:27:34,738 WARN L286 SmtUtils]: Spent 8.58s 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-23 23:27:43,059 WARN L286 SmtUtils]: Spent 8.32s 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-23 23:27:47,222 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse2 (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.div c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~d~0#1| .cse3))))) (fp.add c_currentRoundingMode .cse2 .cse2)))) (let ((.cse0 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse1))) (or (fp.gt .cse0 (fp.mul c_currentRoundingMode c_~_EPS~0 .cse1)) (forall ((|v_ULTIMATE.start_SqrtR_~linf~0#1_24| (_ FloatingPoint 11 53))) (fp.lt .cse0 |v_ULTIMATE.start_SqrtR_~linf~0#1_24|))))) is different from false [2024-11-23 23:27:51,421 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse2 (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.div c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~d~0#1| .cse3))))) (fp.add c_currentRoundingMode .cse2 .cse2)))) (let ((.cse0 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse1))) (or (fp.gt .cse0 (fp.mul c_currentRoundingMode c_~_EPS~0 .cse1)) (forall ((|v_ULTIMATE.start_SqrtR_~linf~0#1_24| (_ FloatingPoint 11 53))) (fp.lt .cse0 |v_ULTIMATE.start_SqrtR_~linf~0#1_24|))))) is different from true [2024-11-23 23:28:00,040 WARN L286 SmtUtils]: Spent 8.62s 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-23 23:28:08,314 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-23 23:28:16,870 WARN L286 SmtUtils]: Spent 8.55s 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-23 23:28:25,181 WARN L286 SmtUtils]: Spent 8.31s 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)