./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/float-benchs/sqrt_poly2.c --full-output --witness-type violation_witness --validate ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/sqrt_poly2.yml/witness.yml --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0a70ae82 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/float-benchs/sqrt_poly2.c ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/sqrt_poly2.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.yaml-violation-witnesses-0a70ae8-m [2024-08-07 14:04:09,342 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-07 14:04:09,411 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-08-07 14:04:09,416 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-07 14:04:09,416 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-07 14:04:09,442 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-07 14:04:09,443 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-07 14:04:09,443 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-07 14:04:09,443 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-07 14:04:09,444 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-07 14:04:09,445 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-07 14:04:09,445 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-07 14:04:09,446 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-07 14:04:09,446 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-07 14:04:09,446 INFO L153 SettingsManager]: * Use SBE=true [2024-08-07 14:04:09,448 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-07 14:04:09,449 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-07 14:04:09,449 INFO L153 SettingsManager]: * sizeof long=4 [2024-08-07 14:04:09,449 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-07 14:04:09,449 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-08-07 14:04:09,449 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-07 14:04:09,450 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-07 14:04:09,450 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-07 14:04:09,450 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-07 14:04:09,451 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-07 14:04:09,451 INFO L153 SettingsManager]: * sizeof long double=12 [2024-08-07 14:04:09,451 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-07 14:04:09,451 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-07 14:04:09,451 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-07 14:04:09,452 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-07 14:04:09,452 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-07 14:04:09,452 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-07 14:04:09,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-07 14:04:09,453 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-07 14:04:09,453 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-07 14:04:09,454 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-07 14:04:09,454 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-07 14:04:09,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-07 14:04:09,454 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-07 14:04:09,454 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-07 14:04:09,454 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-07 14:04:09,455 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-07 14:04:09,455 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-07 14:04:09,455 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder: Size of a code block -> SequenceOfStatements [2024-08-07 14:04:09,691 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-07 14:04:09,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-07 14:04:09,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-07 14:04:09,711 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-07 14:04:09,711 INFO L274 PluginConnector]: CDTParser initialized [2024-08-07 14:04:09,712 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/sqrt_poly2.c [2024-08-07 14:04:10,933 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-07 14:04:11,084 INFO L384 CDTParser]: Found 1 translation units. [2024-08-07 14:04:11,084 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/sqrt_poly2.c [2024-08-07 14:04:11,091 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/162cb99c7/613742dbe4a947c1a0edbcf5ad2fcb74/FLAG56fb53c4e [2024-08-07 14:04:11,101 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/162cb99c7/613742dbe4a947c1a0edbcf5ad2fcb74 [2024-08-07 14:04:11,103 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-07 14:04:11,104 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-07 14:04:11,104 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/sqrt_poly2.yml/witness.yml [2024-08-07 14:04:11,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-07 14:04:11,153 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-07 14:04:11,155 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-07 14:04:11,155 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-07 14:04:11,158 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-07 14:04:11,159 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.08 02:04:11" (1/2) ... [2024-08-07 14:04:11,160 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71fee362 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:04:11, skipping insertion in model container [2024-08-07 14:04:11,160 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.08 02:04:11" (1/2) ... [2024-08-07 14:04:11,161 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5577e666 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:04:11, skipping insertion in model container [2024-08-07 14:04:11,161 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 07.08 02:04:11" (2/2) ... [2024-08-07 14:04:11,162 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71fee362 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:04:11, skipping insertion in model container [2024-08-07 14:04:11,162 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 07.08 02:04:11" (2/2) ... [2024-08-07 14:04:11,178 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-07 14:04:11,299 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/sqrt_poly2.c[587,600] [2024-08-07 14:04:11,325 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-07 14:04:11,335 INFO L200 MainTranslator]: Completed pre-run [2024-08-07 14:04:11,344 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/sqrt_poly2.c[587,600] [2024-08-07 14:04:11,356 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-07 14:04:11,373 INFO L204 MainTranslator]: Completed translation [2024-08-07 14:04:11,373 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:04:11 WrapperNode [2024-08-07 14:04:11,373 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-07 14:04:11,374 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-07 14:04:11,375 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-07 14:04:11,375 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-07 14:04:11,385 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:04:11" (1/1) ... [2024-08-07 14:04:11,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:04:11" (1/1) ... [2024-08-07 14:04:11,395 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:04:11" (1/1) ... [2024-08-07 14:04:11,410 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2024-08-07 14:04:11,411 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:04:11" (1/1) ... [2024-08-07 14:04:11,411 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:04:11" (1/1) ... [2024-08-07 14:04:11,421 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:04:11" (1/1) ... [2024-08-07 14:04:11,426 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:04:11" (1/1) ... [2024-08-07 14:04:11,426 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:04:11" (1/1) ... [2024-08-07 14:04:11,428 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-07 14:04:11,428 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-07 14:04:11,428 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-07 14:04:11,429 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-07 14:04:11,432 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:04:11" (1/1) ... [2024-08-07 14:04:11,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-07 14:04:11,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-07 14:04:11,465 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-08-07 14:04:11,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-08-07 14:04:11,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-07 14:04:11,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-07 14:04:11,508 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-07 14:04:11,508 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-07 14:04:11,508 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-08-07 14:04:11,508 INFO L138 BoogieDeclarations]: Found implementation of procedure sqrt_custom [2024-08-07 14:04:11,508 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-07 14:04:11,508 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-07 14:04:11,509 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-07 14:04:11,509 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-07 14:04:11,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-07 14:04:11,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2024-08-07 14:04:11,509 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-07 14:04:11,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-08-07 14:04:11,509 INFO L130 BoogieDeclarations]: Found specification of procedure sqrt_custom [2024-08-07 14:04:11,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-08-07 14:04:11,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-08-07 14:04:11,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-08-07 14:04:11,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-08-07 14:04:11,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-08-07 14:04:11,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-08-07 14:04:11,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-08-07 14:04:11,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-08-07 14:04:11,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-08-07 14:04:11,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-07 14:04:11,512 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-07 14:04:11,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-07 14:04:11,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-08-07 14:04:11,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-08-07 14:04:11,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-07 14:04:11,589 INFO L273 CfgBuilder]: Building ICFG [2024-08-07 14:04:11,592 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-07 14:04:11,712 INFO L1251 $ProcedureCfgBuilder]: dead code at ProgramPoint L31: call ULTIMATE.dealloc(~#x~0.base, ~#x~0.offset);havoc ~#x~0.base, ~#x~0.offset; [2024-08-07 14:04:11,739 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-08-07 14:04:11,739 INFO L327 CfgBuilder]: Performing block encoding [2024-08-07 14:04:11,748 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-07 14:04:11,748 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-07 14:04:11,749 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.08 02:04:11 BoogieIcfgContainer [2024-08-07 14:04:11,749 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-07 14:04:11,751 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-07 14:04:11,751 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-07 14:04:11,753 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-07 14:04:11,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.08 02:04:11" (1/4) ... [2024-08-07 14:04:11,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@253fcdeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.08 02:04:11, skipping insertion in model container [2024-08-07 14:04:11,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 07.08 02:04:11" (2/4) ... [2024-08-07 14:04:11,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@253fcdeb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 07.08 02:04:11, skipping insertion in model container [2024-08-07 14:04:11,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:04:11" (3/4) ... [2024-08-07 14:04:11,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@253fcdeb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 07.08 02:04:11, skipping insertion in model container [2024-08-07 14:04:11,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.08 02:04:11" (4/4) ... [2024-08-07 14:04:11,756 INFO L119 eAbstractionObserver]: Analyzing ICFG sqrt_poly2.c [2024-08-07 14:04:11,756 WARN L130 eAbstractionObserver]: Found a witness in the YAML format. I will only consider traces that are accepted by the witness [2024-08-07 14:04:11,780 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-07 14:04:11,780 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-07 14:04:11,824 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,824 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,825 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,825 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,825 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,825 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,826 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,826 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,827 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,828 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,828 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,830 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,830 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,830 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,831 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,831 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,831 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,831 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,831 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,831 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,832 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,832 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,832 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,832 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,832 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,833 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,833 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,833 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,833 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,834 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,834 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,834 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,834 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,834 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,835 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,835 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,835 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,835 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,835 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,835 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,835 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,836 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,836 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,836 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,836 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,836 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,836 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,836 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,837 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,837 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,837 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,838 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,838 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,838 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,838 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,839 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,839 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,839 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,840 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,840 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,840 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,841 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,842 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,842 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,843 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,843 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,843 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,843 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,843 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,844 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,845 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,845 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,845 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 14:04:11,845 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,845 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,845 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,846 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,846 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,847 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 14:04:11,847 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,847 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,847 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,848 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,848 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,848 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,848 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,849 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 14:04:11,849 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,849 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,849 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,850 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,850 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,850 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,850 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,850 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,851 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,851 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,851 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,852 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 14:04:11,853 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,853 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,853 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,853 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,854 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,854 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,855 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,855 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,855 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,855 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 14:04:11,856 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,856 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,856 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,856 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,857 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,857 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 14:04:11,857 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,859 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,859 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,859 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,859 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,859 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 14:04:11,859 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,860 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,860 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,860 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,862 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,863 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 14:04:11,863 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,863 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,863 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,863 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,863 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,863 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 14:04:11,863 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,864 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,864 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,874 INFO L90 WitnessUtils]: NestedWordAutomaton nwa = ( callAlphabet = {"call assume_abort_if_not((if ~someBinaryDOUBLEComparisonOperation(~x~1, 1.0) && ~someBinaryDOUBLEComparisonOperation(~x~1, 1.0E10) then 1 else 0));" "call #t~ret14 := main();" "call ULTIMATE.init();" "call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~y~0, 0.0) && ~someBinaryDOUBLEComparisonOperation(~y~0, 1000000.0) then 1 else 0));" "call #t~ret13 := sqrt_custom(~x~1);" }, internalAlphabet = {"assume 0 == ~cond;assume false;" "assume !(0 == ~cond);" "~cond := #in~cond;" "assume true;" "#res := 0;" "SUMMARY for call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~y~0, 0.0) && ~someBinaryDOUBLEComparisonOperation(~y~0, 1000000.0) then 1 else 0)); srcloc: L65-1" "~y~0 := #t~ret13;havoc #t~ret13;" "SUMMARY for call #t~ret13 := sqrt_custom(~x~1); srcloc: L63-1" "SUMMARY for call assume_abort_if_not((if ~someBinaryDOUBLEComparisonOperation(~x~1, 1.0) && ~someBinaryDOUBLEComparisonOperation(~x~1, 1.0E10) then 1 else 0)); srcloc: L61" "havoc ~x~1;havoc ~y~0;havoc #t~nondet12;~x~1 := #t~nondet12;havoc #t~nondet12;" "assume true;" "assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~C0~0 := 1.414213538;~C1~0 := 0.229761391;~C2~0 := 1.296735525;~C3~0 := ~someUnaryDOUBLEoperation(0.90109837);~C4~0 := 0.4935534;~C5~0 := ~someUnaryDOUBLEoperation(0.118958666);" "assume true;" "SUMMARY for call #t~ret14 := main(); srcloc: L-1" "SUMMARY for call ULTIMATE.init(); srcloc: ULTIMATE.startENTRY" "assume true;" "assume false;" "assume false;" "assume !false;" "assume 0 == ~cond;" "assume !(0 == ~cond);" "~cond := #in~cond;" "assume true;" "call write~int#1(1048576 * (511 + (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then 1 + ~exp~0 / 2 else ~exp~0 / 2)), ~#x~0.base, ~#x~0.offset, 4);call #t~mem11 := read~real#1(~#x~0.base, ~#x~0.offset, 8);~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, #t~mem11);havoc #t~mem11;#res := ~r~0;call ULTIMATE.dealloc(~#x~0.base, ~#x~0.offset);havoc ~#x~0.base, ~#x~0.offset;" "assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;" "assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);" "call write~int#1((if #t~bitwise8 % 4294967296 % 4294967296 <= 2147483647 then #t~bitwise8 % 4294967296 % 4294967296 else #t~bitwise8 % 4294967296 % 4294967296 - 4294967296), ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;havoc #t~bitwise7;havoc #t~bitwise8;call #t~mem9 := read~real#1(~#x~0.base, ~#x~0.offset, 8);~r~0 := ~someBinaryArithmeticDOUBLEoperation(#t~mem9, 0.5);havoc #t~mem9;~r~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~C1~0, ~C2~0), ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~C3~0, ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~C4~0, ~someBinaryArithmeticDOUBLEoperation(~C5~0, ~r~0)), ~r~0)), ~r~0));" "assume 0 == #t~bitwise7 % 4294967296 || 1072693248 == #t~bitwise7 % 4294967296;#t~bitwise8 := 1072693248;" "assume false;#t~bitwise8 := #t~bitwise7;" "assume !false;assume (#t~bitwise8 % 4294967296 >= #t~bitwise7 % 4294967296 && #t~bitwise8 % 4294967296 >= 1072693248) && #t~bitwise8 % 4294967296 <= 1072693248 + #t~bitwise7 % 4294967296;" "assume !(0 == #t~bitwise7 % 4294967296 || 1072693248 == #t~bitwise7 % 4294967296);" "assume 0 == #t~mem6 % 4294967296;#t~bitwise7 := 0;" "assume 2148532223 == #t~mem6 % 4294967296;#t~bitwise7 := #t~mem6;" "assume !(2148532223 == #t~mem6 % 4294967296);assume #t~bitwise7 % 4294967296 <= #t~mem6 % 4294967296 && #t~bitwise7 % 4294967296 <= 2148532223;" "assume !(0 == #t~mem6 % 4294967296);" "~exp~0 := #t~bitwise5 / 1048576;havoc #t~mem4;havoc #t~bitwise5;call #t~mem6 := read~int#1(~#x~0.base, ~#x~0.offset, 4);" "assume 0 == #t~mem4;#t~bitwise5 := 0;" "assume 2146435072 == #t~mem4;#t~bitwise5 := #t~mem4;" "assume !(2146435072 == #t~mem4);assume ((((#t~mem4 < 0 || #t~bitwise5 <= #t~mem4) && #t~bitwise5 <= 2146435072) && #t~bitwise5 >= 0) && (#t~mem4 >= 0 || #t~bitwise5 > 2146435072 + #t~mem4)) && #t~bitwise5 >= -2147483648;" "assume !(0 == #t~mem4);" "~a := #in~a;call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(8);havoc ~r~0;havoc ~exp~0;call write~real#1(~a, ~#x~0.base, ~#x~0.offset, 8);call #t~mem4 := read~int#1(~#x~0.base, ~#x~0.offset, 4);" "assume true;" }, returnAlphabet = {"#48#return;" "#50#return;" "#52#return;" "#54#return;" "#46#return;" }, states = {"CountingPredicate [underlying: 26#assume_abort_if_notFINALtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 14#sqrt_customFINALtrue, annotation: [5, 0]]" "CountingPredicate [underlying: 37#L14-2true, annotation: [4, 0]]" "CountingPredicate [underlying: 29#__VERIFIER_assertEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 8#L61true, annotation: [0, 0]]" "CountingPredicate [underlying: 14#sqrt_customFINALtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 10#__VERIFIER_assertENTRYtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 6#L14true, annotation: [1, 0]]" "CountingPredicate [underlying: 31#mainEXITtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 3#L65-1true, annotation: [4, 0]]" "CountingPredicate [underlying: 3#L65-1true, annotation: [6, 0]]" "CountingPredicate [underlying: 10#__VERIFIER_assertENTRYtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 27#L38-4true, annotation: [4, 0]]" "CountingPredicate [underlying: 40#ERRORtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 38#L38-1true, annotation: [1, 0]]" "CountingPredicate [underlying: 4#L63-1true, annotation: [3, 0]]" "CountingPredicate [underlying: 5#L37-2true, annotation: [4, 0]]" "CountingPredicate [underlying: 34#L50true, annotation: [4, 0]]" "CountingPredicate [underlying: 4#L63-1true, annotation: [1, 0]]" "CountingPredicate [underlying: 12#sqrt_customENTRYtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 29#__VERIFIER_assertEXITtrue, annotation: [9, 0]]" "CountingPredicate [underlying: 16#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 35#L37true, annotation: [4, 0]]" "CountingPredicate [underlying: 11#L38-3true, annotation: [1, 0]]" "CountingPredicate [underlying: 13#L38true, annotation: [4, 0]]" "CountingPredicate [underlying: 29#__VERIFIER_assertEXITtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 30#assume_abort_if_notEXITtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 20#L38-2true, annotation: [4, 0]]" "CountingPredicate [underlying: 33#mainFINALtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 33#mainFINALtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 24#__VERIFIER_assertFINALtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 15#L63true, annotation: [6, 0]]" "CountingPredicate [underlying: 32#L65true, annotation: [4, 0]]" "CountingPredicate [underlying: 15#L63true, annotation: [4, 0]]" "CountingPredicate [underlying: 6#L14true, annotation: [9, 0]]" "CountingPredicate [underlying: 23#sqrt_customEXITtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 39#ULTIMATE.startFINALtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 22#mainENTRYtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 21#L37-1true, annotation: [1, 0]]" "CountingPredicate [underlying: 26#assume_abort_if_notFINALtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 14#sqrt_customFINALtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 9#ULTIMATE.initEXITtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 37#L14-2true, annotation: [7, 0]]" "CountingPredicate [underlying: 29#__VERIFIER_assertEXITtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 37#L14-2true, annotation: [1, 0]]" "CountingPredicate [underlying: 3#L65-1true, annotation: [1, 0]]" "CountingPredicate [underlying: 40#ERRORtrue, annotation: [8, 0]]" "CountingPredicate [underlying: 36#assume_abort_if_notENTRYtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 10#__VERIFIER_assertENTRYtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 40#ERRORtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 6#L14true, annotation: [4, 0]]" "CountingPredicate [underlying: 31#mainEXITtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 31#mainEXITtrue, annotation: [9, 0]]" "CountingPredicate [underlying: 16#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [9, 0]]" "CountingPredicate [underlying: 25#ULTIMATE.initFINALtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 27#L38-4true, annotation: [1, 0]]" "CountingPredicate [underlying: 5#L37-2true, annotation: [1, 0]]" "CountingPredicate [underlying: 34#L50true, annotation: [1, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [9, 0]]" "CountingPredicate [underlying: 38#L38-1true, annotation: [4, 0]]" "CountingPredicate [underlying: 11#L38-3true, annotation: [4, 0]]" "CountingPredicate [underlying: 34#L50true, annotation: [5, 0]]" "CountingPredicate [underlying: 31#mainEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 28#L43true, annotation: [1, 0]]" "CountingPredicate [underlying: 16#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 13#L38true, annotation: [1, 0]]" "CountingPredicate [underlying: 24#__VERIFIER_assertFINALtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 12#sqrt_customENTRYtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 24#__VERIFIER_assertFINALtrue, annotation: [9, 0]]" "CountingPredicate [underlying: 33#mainFINALtrue, annotation: [9, 0]]" "CountingPredicate [underlying: 17#L12true, annotation: [1, 0]]" "CountingPredicate [underlying: 35#L37true, annotation: [1, 0]]" "CountingPredicate [underlying: 33#mainFINALtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 18#ULTIMATE.initENTRYtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 30#assume_abort_if_notEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 20#L38-2true, annotation: [1, 0]]" "CountingPredicate [underlying: 24#__VERIFIER_assertFINALtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 28#L43true, annotation: [4, 0]]" "CountingPredicate [underlying: 32#L65true, annotation: [1, 0]]" "CountingPredicate [underlying: 32#L65true, annotation: [7, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 39#ULTIMATE.startFINALtrue, annotation: [9, 0]]" "CountingPredicate [underlying: 32#L65true, annotation: [9, 0]]" "CountingPredicate [underlying: 39#ULTIMATE.startFINALtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 23#sqrt_customEXITtrue, annotation: [5, 0]]" "CountingPredicate [underlying: 15#L63true, annotation: [1, 0]]" "CountingPredicate [underlying: 39#ULTIMATE.startFINALtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 7#L-1true, annotation: [0, 0]]" "CountingPredicate [underlying: 19#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 23#sqrt_customEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 21#L37-1true, annotation: [4, 0]]" }, initialStates = {"CountingPredicate [underlying: 19#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" }, finalStates = {"CountingPredicate [underlying: 16#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [9, 0]]" }, callTransitions = { ("CountingPredicate [underlying: 8#L61true, annotation: [0, 0]]" "call assume_abort_if_not((if ~someBinaryDOUBLEComparisonOperation(~x~1, 1.0) && ~someBinaryDOUBLEComparisonOperation(~x~1, 1.0E10) then 1 else 0));" "CountingPredicate [underlying: 36#assume_abort_if_notENTRYtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 3#L65-1true, annotation: [4, 0]]" "call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~y~0, 0.0) && ~someBinaryDOUBLEComparisonOperation(~y~0, 1000000.0) then 1 else 0));" "CountingPredicate [underlying: 10#__VERIFIER_assertENTRYtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 3#L65-1true, annotation: [6, 0]]" "call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~y~0, 0.0) && ~someBinaryDOUBLEComparisonOperation(~y~0, 1000000.0) then 1 else 0));" "CountingPredicate [underlying: 10#__VERIFIER_assertENTRYtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 4#L63-1true, annotation: [3, 0]]" "call #t~ret13 := sqrt_custom(~x~1);" "CountingPredicate [underlying: 12#sqrt_customENTRYtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 4#L63-1true, annotation: [1, 0]]" "call #t~ret13 := sqrt_custom(~x~1);" "CountingPredicate [underlying: 12#sqrt_customENTRYtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 3#L65-1true, annotation: [1, 0]]" "call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~y~0, 0.0) && ~someBinaryDOUBLEComparisonOperation(~y~0, 1000000.0) then 1 else 0));" "CountingPredicate [underlying: 10#__VERIFIER_assertENTRYtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 7#L-1true, annotation: [0, 0]]" "call #t~ret14 := main();" "CountingPredicate [underlying: 22#mainENTRYtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 19#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" "call ULTIMATE.init();" "CountingPredicate [underlying: 18#ULTIMATE.initENTRYtrue, annotation: [0, 0]]") }, internalTransitions = { ("CountingPredicate [underlying: 26#assume_abort_if_notFINALtrue, annotation: [2, 0]]" "assume true;" "CountingPredicate [underlying: 30#assume_abort_if_notEXITtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 14#sqrt_customFINALtrue, annotation: [5, 0]]" "assume true;" "CountingPredicate [underlying: 23#sqrt_customEXITtrue, annotation: [5, 0]]") ("CountingPredicate [underlying: 37#L14-2true, annotation: [4, 0]]" "assume 0 == ~cond;" "CountingPredicate [underlying: 40#ERRORtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 37#L14-2true, annotation: [4, 0]]" "assume !(0 == ~cond);" "CountingPredicate [underlying: 24#__VERIFIER_assertFINALtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 14#sqrt_customFINALtrue, annotation: [1, 0]]" "assume true;" "CountingPredicate [underlying: 23#sqrt_customEXITtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 10#__VERIFIER_assertENTRYtrue, annotation: [7, 0]]" "~cond := #in~cond;" "CountingPredicate [underlying: 37#L14-2true, annotation: [7, 0]]") ("CountingPredicate [underlying: 6#L14true, annotation: [1, 0]]" "assume false;" "CountingPredicate [underlying: 24#__VERIFIER_assertFINALtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 10#__VERIFIER_assertENTRYtrue, annotation: [1, 0]]" "~cond := #in~cond;" "CountingPredicate [underlying: 37#L14-2true, annotation: [1, 0]]") ("CountingPredicate [underlying: 27#L38-4true, annotation: [4, 0]]" "assume 0 == #t~mem6 % 4294967296;#t~bitwise7 := 0;" "CountingPredicate [underlying: 20#L38-2true, annotation: [4, 0]]") ("CountingPredicate [underlying: 27#L38-4true, annotation: [4, 0]]" "assume !(0 == #t~mem6 % 4294967296);" "CountingPredicate [underlying: 11#L38-3true, annotation: [4, 0]]") ("CountingPredicate [underlying: 40#ERRORtrue, annotation: [1, 0]]" "assume false;" "CountingPredicate [underlying: 6#L14true, annotation: [1, 0]]") ("CountingPredicate [underlying: 40#ERRORtrue, annotation: [1, 0]]" "assume !false;" "CountingPredicate [underlying: 16#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 38#L38-1true, annotation: [1, 0]]" "assume false;#t~bitwise8 := #t~bitwise7;" "CountingPredicate [underlying: 13#L38true, annotation: [1, 0]]") ("CountingPredicate [underlying: 38#L38-1true, annotation: [1, 0]]" "assume !false;assume (#t~bitwise8 % 4294967296 >= #t~bitwise7 % 4294967296 && #t~bitwise8 % 4294967296 >= 1072693248) && #t~bitwise8 % 4294967296 <= 1072693248 + #t~bitwise7 % 4294967296;" "CountingPredicate [underlying: 13#L38true, annotation: [1, 0]]") ("CountingPredicate [underlying: 5#L37-2true, annotation: [4, 0]]" "assume 0 == #t~mem4;#t~bitwise5 := 0;" "CountingPredicate [underlying: 35#L37true, annotation: [4, 0]]") ("CountingPredicate [underlying: 5#L37-2true, annotation: [4, 0]]" "assume !(0 == #t~mem4);" "CountingPredicate [underlying: 21#L37-1true, annotation: [4, 0]]") ("CountingPredicate [underlying: 34#L50true, annotation: [4, 0]]" "call write~int#1(1048576 * (511 + (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then 1 + ~exp~0 / 2 else ~exp~0 / 2)), ~#x~0.base, ~#x~0.offset, 4);call #t~mem11 := read~real#1(~#x~0.base, ~#x~0.offset, 8);~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, #t~mem11);havoc #t~mem11;#res := ~r~0;call ULTIMATE.dealloc(~#x~0.base, ~#x~0.offset);havoc ~#x~0.base, ~#x~0.offset;" "CountingPredicate [underlying: 14#sqrt_customFINALtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 12#sqrt_customENTRYtrue, annotation: [1, 0]]" "~a := #in~a;call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(8);havoc ~r~0;havoc ~exp~0;call write~real#1(~a, ~#x~0.base, ~#x~0.offset, 8);call #t~mem4 := read~int#1(~#x~0.base, ~#x~0.offset, 4);" "CountingPredicate [underlying: 5#L37-2true, annotation: [1, 0]]") ("CountingPredicate [underlying: 35#L37true, annotation: [4, 0]]" "~exp~0 := #t~bitwise5 / 1048576;havoc #t~mem4;havoc #t~bitwise5;call #t~mem6 := read~int#1(~#x~0.base, ~#x~0.offset, 4);" "CountingPredicate [underlying: 27#L38-4true, annotation: [4, 0]]") ("CountingPredicate [underlying: 11#L38-3true, annotation: [1, 0]]" "assume 2148532223 == #t~mem6 % 4294967296;#t~bitwise7 := #t~mem6;" "CountingPredicate [underlying: 20#L38-2true, annotation: [1, 0]]") ("CountingPredicate [underlying: 11#L38-3true, annotation: [1, 0]]" "assume !(2148532223 == #t~mem6 % 4294967296);assume #t~bitwise7 % 4294967296 <= #t~mem6 % 4294967296 && #t~bitwise7 % 4294967296 <= 2148532223;" "CountingPredicate [underlying: 20#L38-2true, annotation: [1, 0]]") ("CountingPredicate [underlying: 13#L38true, annotation: [4, 0]]" "call write~int#1((if #t~bitwise8 % 4294967296 % 4294967296 <= 2147483647 then #t~bitwise8 % 4294967296 % 4294967296 else #t~bitwise8 % 4294967296 % 4294967296 - 4294967296), ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;havoc #t~bitwise7;havoc #t~bitwise8;call #t~mem9 := read~real#1(~#x~0.base, ~#x~0.offset, 8);~r~0 := ~someBinaryArithmeticDOUBLEoperation(#t~mem9, 0.5);havoc #t~mem9;~r~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~C1~0, ~C2~0), ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~C3~0, ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~C4~0, ~someBinaryArithmeticDOUBLEoperation(~C5~0, ~r~0)), ~r~0)), ~r~0));" "CountingPredicate [underlying: 28#L43true, annotation: [4, 0]]") ("CountingPredicate [underlying: 20#L38-2true, annotation: [4, 0]]" "assume 0 == #t~bitwise7 % 4294967296 || 1072693248 == #t~bitwise7 % 4294967296;#t~bitwise8 := 1072693248;" "CountingPredicate [underlying: 13#L38true, annotation: [4, 0]]") ("CountingPredicate [underlying: 20#L38-2true, annotation: [4, 0]]" "assume !(0 == #t~bitwise7 % 4294967296 || 1072693248 == #t~bitwise7 % 4294967296);" "CountingPredicate [underlying: 38#L38-1true, annotation: [4, 0]]") ("CountingPredicate [underlying: 33#mainFINALtrue, annotation: [7, 0]]" "assume true;" "CountingPredicate [underlying: 31#mainEXITtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 33#mainFINALtrue, annotation: [1, 0]]" "assume true;" "CountingPredicate [underlying: 31#mainEXITtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 24#__VERIFIER_assertFINALtrue, annotation: [4, 0]]" "assume true;" "CountingPredicate [underlying: 29#__VERIFIER_assertEXITtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 15#L63true, annotation: [6, 0]]" "~y~0 := #t~ret13;havoc #t~ret13;" "CountingPredicate [underlying: 3#L65-1true, annotation: [6, 0]]") ("CountingPredicate [underlying: 32#L65true, annotation: [4, 0]]" "#res := 0;" "CountingPredicate [underlying: 33#mainFINALtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 15#L63true, annotation: [4, 0]]" "~y~0 := #t~ret13;havoc #t~ret13;" "CountingPredicate [underlying: 3#L65-1true, annotation: [4, 0]]") ("CountingPredicate [underlying: 6#L14true, annotation: [9, 0]]" "assume false;" "CountingPredicate [underlying: 24#__VERIFIER_assertFINALtrue, annotation: [9, 0]]") ("CountingPredicate [underlying: 39#ULTIMATE.startFINALtrue, annotation: [4, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 22#mainENTRYtrue, annotation: [0, 0]]" "havoc ~x~1;havoc ~y~0;havoc #t~nondet12;~x~1 := #t~nondet12;havoc #t~nondet12;" "CountingPredicate [underlying: 8#L61true, annotation: [0, 0]]") ("CountingPredicate [underlying: 21#L37-1true, annotation: [1, 0]]" "assume 2146435072 == #t~mem4;#t~bitwise5 := #t~mem4;" "CountingPredicate [underlying: 35#L37true, annotation: [1, 0]]") ("CountingPredicate [underlying: 21#L37-1true, annotation: [1, 0]]" "assume !(2146435072 == #t~mem4);assume ((((#t~mem4 < 0 || #t~bitwise5 <= #t~mem4) && #t~bitwise5 <= 2146435072) && #t~bitwise5 >= 0) && (#t~mem4 >= 0 || #t~bitwise5 > 2146435072 + #t~mem4)) && #t~bitwise5 >= -2147483648;" "CountingPredicate [underlying: 35#L37true, annotation: [1, 0]]") ("CountingPredicate [underlying: 26#assume_abort_if_notFINALtrue, annotation: [1, 0]]" "assume true;" "CountingPredicate [underlying: 30#assume_abort_if_notEXITtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 14#sqrt_customFINALtrue, annotation: [4, 0]]" "assume true;" "CountingPredicate [underlying: 23#sqrt_customEXITtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 37#L14-2true, annotation: [7, 0]]" "assume 0 == ~cond;" "CountingPredicate [underlying: 40#ERRORtrue, annotation: [8, 0]]") ("CountingPredicate [underlying: 37#L14-2true, annotation: [7, 0]]" "assume !(0 == ~cond);" "CountingPredicate [underlying: 24#__VERIFIER_assertFINALtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 37#L14-2true, annotation: [1, 0]]" "assume 0 == ~cond;" "CountingPredicate [underlying: 40#ERRORtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 37#L14-2true, annotation: [1, 0]]" "assume !(0 == ~cond);" "CountingPredicate [underlying: 24#__VERIFIER_assertFINALtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 40#ERRORtrue, annotation: [8, 0]]" "assume false;" "CountingPredicate [underlying: 6#L14true, annotation: [9, 0]]") ("CountingPredicate [underlying: 40#ERRORtrue, annotation: [8, 0]]" "assume !false;" "CountingPredicate [underlying: 16#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [9, 0]]") ("CountingPredicate [underlying: 36#assume_abort_if_notENTRYtrue, annotation: [1, 0]]" "~cond := #in~cond;" "CountingPredicate [underlying: 17#L12true, annotation: [1, 0]]") ("CountingPredicate [underlying: 10#__VERIFIER_assertENTRYtrue, annotation: [4, 0]]" "~cond := #in~cond;" "CountingPredicate [underlying: 37#L14-2true, annotation: [4, 0]]") ("CountingPredicate [underlying: 40#ERRORtrue, annotation: [4, 0]]" "assume false;" "CountingPredicate [underlying: 6#L14true, annotation: [4, 0]]") ("CountingPredicate [underlying: 40#ERRORtrue, annotation: [4, 0]]" "assume !false;" "CountingPredicate [underlying: 16#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 6#L14true, annotation: [4, 0]]" "assume false;" "CountingPredicate [underlying: 24#__VERIFIER_assertFINALtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 25#ULTIMATE.initFINALtrue, annotation: [0, 0]]" "assume true;" "CountingPredicate [underlying: 9#ULTIMATE.initEXITtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 27#L38-4true, annotation: [1, 0]]" "assume 0 == #t~mem6 % 4294967296;#t~bitwise7 := 0;" "CountingPredicate [underlying: 20#L38-2true, annotation: [1, 0]]") ("CountingPredicate [underlying: 27#L38-4true, annotation: [1, 0]]" "assume !(0 == #t~mem6 % 4294967296);" "CountingPredicate [underlying: 11#L38-3true, annotation: [1, 0]]") ("CountingPredicate [underlying: 5#L37-2true, annotation: [1, 0]]" "assume 0 == #t~mem4;#t~bitwise5 := 0;" "CountingPredicate [underlying: 35#L37true, annotation: [1, 0]]") ("CountingPredicate [underlying: 5#L37-2true, annotation: [1, 0]]" "assume !(0 == #t~mem4);" "CountingPredicate [underlying: 21#L37-1true, annotation: [1, 0]]") ("CountingPredicate [underlying: 34#L50true, annotation: [1, 0]]" "call write~int#1(1048576 * (511 + (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then 1 + ~exp~0 / 2 else ~exp~0 / 2)), ~#x~0.base, ~#x~0.offset, 4);call #t~mem11 := read~real#1(~#x~0.base, ~#x~0.offset, 8);~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, #t~mem11);havoc #t~mem11;#res := ~r~0;call ULTIMATE.dealloc(~#x~0.base, ~#x~0.offset);havoc ~#x~0.base, ~#x~0.offset;" "CountingPredicate [underlying: 14#sqrt_customFINALtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 38#L38-1true, annotation: [4, 0]]" "assume false;#t~bitwise8 := #t~bitwise7;" "CountingPredicate [underlying: 13#L38true, annotation: [4, 0]]") ("CountingPredicate [underlying: 38#L38-1true, annotation: [4, 0]]" "assume !false;assume (#t~bitwise8 % 4294967296 >= #t~bitwise7 % 4294967296 && #t~bitwise8 % 4294967296 >= 1072693248) && #t~bitwise8 % 4294967296 <= 1072693248 + #t~bitwise7 % 4294967296;" "CountingPredicate [underlying: 13#L38true, annotation: [4, 0]]") ("CountingPredicate [underlying: 11#L38-3true, annotation: [4, 0]]" "assume 2148532223 == #t~mem6 % 4294967296;#t~bitwise7 := #t~mem6;" "CountingPredicate [underlying: 20#L38-2true, annotation: [4, 0]]") ("CountingPredicate [underlying: 11#L38-3true, annotation: [4, 0]]" "assume !(2148532223 == #t~mem6 % 4294967296);assume #t~bitwise7 % 4294967296 <= #t~mem6 % 4294967296 && #t~bitwise7 % 4294967296 <= 2148532223;" "CountingPredicate [underlying: 20#L38-2true, annotation: [4, 0]]") ("CountingPredicate [underlying: 34#L50true, annotation: [5, 0]]" "call write~int#1(1048576 * (511 + (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then 1 + ~exp~0 / 2 else ~exp~0 / 2)), ~#x~0.base, ~#x~0.offset, 4);call #t~mem11 := read~real#1(~#x~0.base, ~#x~0.offset, 8);~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, #t~mem11);havoc #t~mem11;#res := ~r~0;call ULTIMATE.dealloc(~#x~0.base, ~#x~0.offset);havoc ~#x~0.base, ~#x~0.offset;" "CountingPredicate [underlying: 14#sqrt_customFINALtrue, annotation: [5, 0]]") ("CountingPredicate [underlying: 28#L43true, annotation: [1, 0]]" "assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;" "CountingPredicate [underlying: 34#L50true, annotation: [1, 0]]") ("CountingPredicate [underlying: 28#L43true, annotation: [1, 0]]" "assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);" "CountingPredicate [underlying: 34#L50true, annotation: [1, 0]]") ("CountingPredicate [underlying: 13#L38true, annotation: [1, 0]]" "call write~int#1((if #t~bitwise8 % 4294967296 % 4294967296 <= 2147483647 then #t~bitwise8 % 4294967296 % 4294967296 else #t~bitwise8 % 4294967296 % 4294967296 - 4294967296), ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;havoc #t~bitwise7;havoc #t~bitwise8;call #t~mem9 := read~real#1(~#x~0.base, ~#x~0.offset, 8);~r~0 := ~someBinaryArithmeticDOUBLEoperation(#t~mem9, 0.5);havoc #t~mem9;~r~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~C1~0, ~C2~0), ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~C3~0, ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~C4~0, ~someBinaryArithmeticDOUBLEoperation(~C5~0, ~r~0)), ~r~0)), ~r~0));" "CountingPredicate [underlying: 28#L43true, annotation: [1, 0]]") ("CountingPredicate [underlying: 24#__VERIFIER_assertFINALtrue, annotation: [7, 0]]" "assume true;" "CountingPredicate [underlying: 29#__VERIFIER_assertEXITtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 12#sqrt_customENTRYtrue, annotation: [4, 0]]" "~a := #in~a;call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(8);havoc ~r~0;havoc ~exp~0;call write~real#1(~a, ~#x~0.base, ~#x~0.offset, 8);call #t~mem4 := read~int#1(~#x~0.base, ~#x~0.offset, 4);" "CountingPredicate [underlying: 5#L37-2true, annotation: [4, 0]]") ("CountingPredicate [underlying: 24#__VERIFIER_assertFINALtrue, annotation: [9, 0]]" "assume true;" "CountingPredicate [underlying: 29#__VERIFIER_assertEXITtrue, annotation: [9, 0]]") ("CountingPredicate [underlying: 33#mainFINALtrue, annotation: [9, 0]]" "assume true;" "CountingPredicate [underlying: 31#mainEXITtrue, annotation: [9, 0]]") ("CountingPredicate [underlying: 17#L12true, annotation: [1, 0]]" "assume 0 == ~cond;assume false;" "CountingPredicate [underlying: 26#assume_abort_if_notFINALtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 17#L12true, annotation: [1, 0]]" "assume !(0 == ~cond);" "CountingPredicate [underlying: 26#assume_abort_if_notFINALtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 35#L37true, annotation: [1, 0]]" "~exp~0 := #t~bitwise5 / 1048576;havoc #t~mem4;havoc #t~bitwise5;call #t~mem6 := read~int#1(~#x~0.base, ~#x~0.offset, 4);" "CountingPredicate [underlying: 27#L38-4true, annotation: [1, 0]]") ("CountingPredicate [underlying: 33#mainFINALtrue, annotation: [4, 0]]" "assume true;" "CountingPredicate [underlying: 31#mainEXITtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 18#ULTIMATE.initENTRYtrue, annotation: [0, 0]]" "assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~C0~0 := 1.414213538;~C1~0 := 0.229761391;~C2~0 := 1.296735525;~C3~0 := ~someUnaryDOUBLEoperation(0.90109837);~C4~0 := 0.4935534;~C5~0 := ~someUnaryDOUBLEoperation(0.118958666);" "CountingPredicate [underlying: 25#ULTIMATE.initFINALtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 20#L38-2true, annotation: [1, 0]]" "assume 0 == #t~bitwise7 % 4294967296 || 1072693248 == #t~bitwise7 % 4294967296;#t~bitwise8 := 1072693248;" "CountingPredicate [underlying: 13#L38true, annotation: [1, 0]]") ("CountingPredicate [underlying: 20#L38-2true, annotation: [1, 0]]" "assume !(0 == #t~bitwise7 % 4294967296 || 1072693248 == #t~bitwise7 % 4294967296);" "CountingPredicate [underlying: 38#L38-1true, annotation: [1, 0]]") ("CountingPredicate [underlying: 24#__VERIFIER_assertFINALtrue, annotation: [1, 0]]" "assume true;" "CountingPredicate [underlying: 29#__VERIFIER_assertEXITtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 28#L43true, annotation: [4, 0]]" "assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;" "CountingPredicate [underlying: 34#L50true, annotation: [5, 0]]") ("CountingPredicate [underlying: 28#L43true, annotation: [4, 0]]" "assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);" "CountingPredicate [underlying: 34#L50true, annotation: [4, 0]]") ("CountingPredicate [underlying: 32#L65true, annotation: [1, 0]]" "#res := 0;" "CountingPredicate [underlying: 33#mainFINALtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 32#L65true, annotation: [7, 0]]" "#res := 0;" "CountingPredicate [underlying: 33#mainFINALtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 39#ULTIMATE.startFINALtrue, annotation: [9, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [9, 0]]") ("CountingPredicate [underlying: 32#L65true, annotation: [9, 0]]" "#res := 0;" "CountingPredicate [underlying: 33#mainFINALtrue, annotation: [9, 0]]") ("CountingPredicate [underlying: 39#ULTIMATE.startFINALtrue, annotation: [7, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 15#L63true, annotation: [1, 0]]" "~y~0 := #t~ret13;havoc #t~ret13;" "CountingPredicate [underlying: 3#L65-1true, annotation: [1, 0]]") ("CountingPredicate [underlying: 39#ULTIMATE.startFINALtrue, annotation: [1, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 21#L37-1true, annotation: [4, 0]]" "assume 2146435072 == #t~mem4;#t~bitwise5 := #t~mem4;" "CountingPredicate [underlying: 35#L37true, annotation: [4, 0]]") ("CountingPredicate [underlying: 21#L37-1true, annotation: [4, 0]]" "assume !(2146435072 == #t~mem4);assume ((((#t~mem4 < 0 || #t~bitwise5 <= #t~mem4) && #t~bitwise5 <= 2146435072) && #t~bitwise5 >= 0) && (#t~mem4 >= 0 || #t~bitwise5 > 2146435072 + #t~mem4)) && #t~bitwise5 >= -2147483648;" "CountingPredicate [underlying: 35#L37true, annotation: [4, 0]]") }, returnTransitions = { ("CountingPredicate [underlying: 29#__VERIFIER_assertEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 3#L65-1true, annotation: [1, 0]]" "#46#return;" "CountingPredicate [underlying: 32#L65true, annotation: [1, 0]]") ("CountingPredicate [underlying: 31#mainEXITtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 7#L-1true, annotation: [0, 0]]" "#52#return;" "CountingPredicate [underlying: 39#ULTIMATE.startFINALtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 29#__VERIFIER_assertEXITtrue, annotation: [9, 0]]" "CountingPredicate [underlying: 3#L65-1true, annotation: [6, 0]]" "#46#return;" "CountingPredicate [underlying: 32#L65true, annotation: [9, 0]]") ("CountingPredicate [underlying: 29#__VERIFIER_assertEXITtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 3#L65-1true, annotation: [6, 0]]" "#46#return;" "CountingPredicate [underlying: 32#L65true, annotation: [7, 0]]") ("CountingPredicate [underlying: 30#assume_abort_if_notEXITtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 8#L61true, annotation: [0, 0]]" "#50#return;" "CountingPredicate [underlying: 4#L63-1true, annotation: [3, 0]]") ("CountingPredicate [underlying: 23#sqrt_customEXITtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 4#L63-1true, annotation: [3, 0]]" "#48#return;" "CountingPredicate [underlying: 15#L63true, annotation: [4, 0]]") ("CountingPredicate [underlying: 9#ULTIMATE.initEXITtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 19#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" "#54#return;" "CountingPredicate [underlying: 7#L-1true, annotation: [0, 0]]") ("CountingPredicate [underlying: 29#__VERIFIER_assertEXITtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 3#L65-1true, annotation: [4, 0]]" "#46#return;" "CountingPredicate [underlying: 32#L65true, annotation: [4, 0]]") ("CountingPredicate [underlying: 31#mainEXITtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 7#L-1true, annotation: [0, 0]]" "#52#return;" "CountingPredicate [underlying: 39#ULTIMATE.startFINALtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 31#mainEXITtrue, annotation: [9, 0]]" "CountingPredicate [underlying: 7#L-1true, annotation: [0, 0]]" "#52#return;" "CountingPredicate [underlying: 39#ULTIMATE.startFINALtrue, annotation: [9, 0]]") ("CountingPredicate [underlying: 31#mainEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 7#L-1true, annotation: [0, 0]]" "#52#return;" "CountingPredicate [underlying: 39#ULTIMATE.startFINALtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 30#assume_abort_if_notEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 8#L61true, annotation: [0, 0]]" "#50#return;" "CountingPredicate [underlying: 4#L63-1true, annotation: [1, 0]]") ("CountingPredicate [underlying: 23#sqrt_customEXITtrue, annotation: [5, 0]]" "CountingPredicate [underlying: 4#L63-1true, annotation: [3, 0]]" "#48#return;" "CountingPredicate [underlying: 15#L63true, annotation: [6, 0]]") ("CountingPredicate [underlying: 23#sqrt_customEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 4#L63-1true, annotation: [1, 0]]" "#48#return;" "CountingPredicate [underlying: 15#L63true, annotation: [1, 0]]") } ); [2024-08-07 14:04:11,881 INFO L82 GeneralOperation]: Start removeDeadEnds. Operand has 39 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-08-07 14:04:11,882 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,882 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,882 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,882 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,882 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,882 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,883 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,883 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,883 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,883 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,883 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,883 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,884 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,884 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,884 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,884 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,886 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,886 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,886 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,887 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,887 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,887 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,888 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,888 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,888 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,888 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,888 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,888 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,889 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,889 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,889 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,890 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,890 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,890 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,891 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,891 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,891 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,891 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,891 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,892 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,892 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,892 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,892 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,892 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,892 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,892 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,893 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,893 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,893 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,893 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,893 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,893 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,893 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,894 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,894 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,894 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,897 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,897 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,897 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,898 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,898 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,898 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,899 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,899 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,899 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,899 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,900 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,900 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,900 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,900 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,900 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,900 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,901 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 14:04:11,901 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,901 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,901 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,901 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,901 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,901 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 14:04:11,902 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,902 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,902 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,902 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,902 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,902 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,903 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,903 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 14:04:11,903 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,903 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,905 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,905 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,905 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,905 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,905 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,905 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,905 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,906 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,908 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,908 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 14:04:11,908 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,908 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,908 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,909 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,909 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,909 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,909 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,909 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,909 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,909 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 14:04:11,909 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,909 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,909 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,910 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,910 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,910 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 14:04:11,910 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,910 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,910 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,910 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,910 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,910 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 14:04:11,911 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,911 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,911 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,911 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,911 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,913 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 14:04:11,913 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,914 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,914 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,914 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:04:11,914 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,914 WARN L283 nessProductAutomaton]: assume 0 == ~cond;, isNegated false [2024-08-07 14:04:11,914 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:04:11,914 WARN L283 nessProductAutomaton]: assume 0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2);#t~post10 := ~exp~0;~exp~0 := 1 + #t~post10;havoc #t~post10;, isNegated false [2024-08-07 14:04:11,914 WARN L283 nessProductAutomaton]: assume !(0 == (if ~exp~0 < 0 && 0 != ~exp~0 % 2 then ~exp~0 % 2 - 2 else ~exp~0 % 2));~r~0 := ~someBinaryArithmeticDOUBLEoperation(~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:11,919 INFO L88 GeneralOperation]: Finished removeDeadEnds. Reduced from 93 states to 31 states. [2024-08-07 14:04:11,934 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-07 14:04:11,940 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, 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;@5a53bcb3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-07 14:04:11,940 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-07 14:04:11,942 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2024-08-07 14:04:11,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-08-07 14:04:11,944 INFO L187 NwaCegarLoop]: Found error trace [2024-08-07 14:04:11,945 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-07 14:04:11,945 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-07 14:04:11,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-07 14:04:11,949 INFO L85 PathProgramCache]: Analyzing trace with hash -222529428, now seen corresponding path program 1 times [2024-08-07 14:04:11,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-07 14:04:11,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722499256] [2024-08-07 14:04:11,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-07 14:04:11,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-07 14:04:12,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-07 14:04:12,086 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-07 14:04:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-07 14:04:12,161 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-07 14:04:12,163 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-07 14:04:12,164 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-07 14:04:12,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-07 14:04:12,170 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2024-08-07 14:04:12,172 INFO L196 ceAbstractionStarter]: Computing trace abstraction results [2024-08-07 14:04:12,195 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.08 02:04:12 BoogieIcfgContainer [2024-08-07 14:04:12,195 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-07 14:04:12,196 INFO L158 Benchmark]: Toolchain (without parser) took 1042.87ms. Allocated memory is still 92.3MB. Free memory was 70.1MB in the beginning and 65.3MB in the end (delta: 4.8MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2024-08-07 14:04:12,196 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 65.0MB. Free memory is still 36.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-07 14:04:12,196 INFO L158 Benchmark]: Witness Parser took 0.10ms. Allocated memory is still 92.3MB. Free memory is still 72.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-07 14:04:12,197 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.80ms. Allocated memory is still 92.3MB. Free memory was 70.1MB in the beginning and 58.0MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-08-07 14:04:12,197 INFO L158 Benchmark]: Boogie Preprocessor took 53.28ms. Allocated memory is still 92.3MB. Free memory was 57.7MB in the beginning and 55.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-07 14:04:12,197 INFO L158 Benchmark]: IcfgBuilder took 321.03ms. Allocated memory is still 92.3MB. Free memory was 55.4MB in the beginning and 40.3MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-08-07 14:04:12,198 INFO L158 Benchmark]: TraceAbstraction took 444.41ms. Allocated memory is still 92.3MB. Free memory was 39.7MB in the beginning and 65.3MB in the end (delta: -25.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-08-07 14:04:12,202 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.48ms. Allocated memory is still 65.0MB. Free memory is still 36.1MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.10ms. Allocated memory is still 92.3MB. Free memory is still 72.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 218.80ms. Allocated memory is still 92.3MB. Free memory was 70.1MB in the beginning and 58.0MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.28ms. Allocated memory is still 92.3MB. Free memory was 57.7MB in the beginning and 55.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 321.03ms. Allocated memory is still 92.3MB. Free memory was 55.4MB in the beginning and 40.3MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 444.41ms. Allocated memory is still 92.3MB. Free memory was 39.7MB in the beginning and 65.3MB in the end (delta: -25.7MB). 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: 14]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 65, overapproximation of someUnaryDOUBLEoperation at line 20, overapproximation of someBinaryArithmeticDOUBLEoperation at line 51. Possible FailurePath: [L17] double C0 = 1.414213538; [L18] double C1 = 0.229761391; [L19] double C2 = 1.296735525; [L20] double C3 = -0.901098370; [L21] double C4 = 0.493553400; [L22] double C5 = -0.118958666; VAL [C0=707106769/500000000, C1=229761391/1000000000, C2=51869421/40000000, C4=2467767/5000000, \old(C0)=1072693249, \old(C1)=1072693253, \old(C2)=1072693252, \old(C3)=1072693256, \old(C4)=1072693258, \old(C5)=1072693255] [L58] double x,y; [L60] x = __VERIFIER_nondet_double() [L61] CALL assume_abort_if_not(x >= 1. && x <= 1e10) VAL [C0=707106769/500000000, C1=229761391/1000000000, C2=51869421/40000000, C4=2467767/5000000, \old(cond)=1] [L12] !cond VAL [C0=707106769/500000000, C1=229761391/1000000000, C2=51869421/40000000, C4=2467767/5000000, \old(cond)=1] [L61] RET assume_abort_if_not(x >= 1. && x <= 1e10) VAL [C0=707106769/500000000, C1=229761391/1000000000, C2=51869421/40000000, C4=2467767/5000000] [L63] CALL, EXPR sqrt_custom(x) VAL [C0=707106769/500000000, C1=229761391/1000000000, C2=51869421/40000000, C4=2467767/5000000, \old(a)=1072693251] [L31] union u x; [L32] double r; [L33] int exp; [L35] x.d = a [L37] EXPR x.i[0] VAL [C0=707106769/500000000, C1=229761391/1000000000, C2=51869421/40000000, C4=2467767/5000000, \old(a)=1072693251, x={4:0}] [L37] EXPR x.i[0] & 0x7FF00000 [L37] EXPR x.i[0] & 0x7FF00000 VAL [C0=707106769/500000000, C1=229761391/1000000000, C2=51869421/40000000, C4=2467767/5000000, \old(a)=1072693251, x={4:0}] [L37] exp = (x.i[0] & 0x7FF00000) >> 20 [L38] EXPR x.i[0] VAL [C0=707106769/500000000, C1=229761391/1000000000, C2=51869421/40000000, C4=2467767/5000000, \old(a)=1072693251, exp=0, x={4:0}] [L38] EXPR x.i[0] & 0x800FFFFF [L38] EXPR x.i[0] & 0x800FFFFF VAL [C0=707106769/500000000, C1=229761391/1000000000, C2=51869421/40000000, C4=2467767/5000000, \old(a)=1072693251, exp=0, x={4:0}] [L38] EXPR (x.i[0] & 0x800FFFFF) | 0x3FF00000 [L38] EXPR (x.i[0] & 0x800FFFFF) | 0x3FF00000 VAL [C0=707106769/500000000, C1=229761391/1000000000, C2=51869421/40000000, C4=2467767/5000000, \old(a)=1072693251, exp=0, x={4:0}] [L38] x.i[0] = (x.i[0] & 0x800FFFFF) | 0x3FF00000 [L39] EXPR x.d [L39] r = x.d * 0.5 [L41] r = C1+C2+(C3+(C4+C5*r)*r)*r VAL [C0=707106769/500000000, C1=229761391/1000000000, C2=51869421/40000000, C4=2467767/5000000, \old(a)=1072693251, exp=0, x={4:0}] [L43] exp % 2 == 0 [L44] exp++ VAL [C0=707106769/500000000, C1=229761391/1000000000, C2=51869421/40000000, C4=2467767/5000000, \old(a)=1072693251, exp=1, x={4:0}] [L50] x.i[0] = (exp/2 + 511) << 20 [L51] EXPR x.d [L51] r = r * x.d [L53] return r; [L53] return r; VAL [C0=707106769/500000000, C1=229761391/1000000000, C2=51869421/40000000, C4=2467767/5000000, \old(a)=1072693251, \result=1072693250] [L63] RET, EXPR sqrt_custom(x) VAL [C0=707106769/500000000, C1=229761391/1000000000, C2=51869421/40000000, C4=2467767/5000000, x=1072693251] [L63] y = sqrt_custom(x) [L65] CALL __VERIFIER_assert(y >= 0. && y <= 1e6) VAL [C0=707106769/500000000, C1=229761391/1000000000, C2=51869421/40000000, C4=2467767/5000000, \old(cond)=0] [L14] !(cond) VAL [C0=707106769/500000000, C1=229761391/1000000000, C2=51869421/40000000, C4=2467767/5000000, \old(cond)=0] [L14] reach_error() VAL [C0=707106769/500000000, C1=229761391/1000000000, C2=51869421/40000000, C4=2467767/5000000, \old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred 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, 27 NumberOfCodeBlocks, 27 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-08-07 14:04:12,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/float-benchs/sqrt_poly2.c ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/sqrt_poly2.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.yaml-violation-witnesses-0a70ae8-m [2024-08-07 14:04:13,930 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-07 14:04:13,989 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-08-07 14:04:13,992 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-07 14:04:13,992 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-07 14:04:14,015 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-07 14:04:14,016 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-07 14:04:14,017 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-07 14:04:14,017 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-07 14:04:14,018 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-07 14:04:14,019 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-07 14:04:14,019 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-07 14:04:14,020 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-07 14:04:14,020 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-07 14:04:14,020 INFO L153 SettingsManager]: * Use SBE=true [2024-08-07 14:04:14,023 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-07 14:04:14,023 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-07 14:04:14,023 INFO L153 SettingsManager]: * sizeof long=4 [2024-08-07 14:04:14,023 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-08-07 14:04:14,023 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-07 14:04:14,023 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-07 14:04:14,024 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-07 14:04:14,024 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-07 14:04:14,024 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-08-07 14:04:14,024 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-08-07 14:04:14,024 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-07 14:04:14,024 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-08-07 14:04:14,025 INFO L153 SettingsManager]: * sizeof long double=12 [2024-08-07 14:04:14,025 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-07 14:04:14,025 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-07 14:04:14,025 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-07 14:04:14,025 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-07 14:04:14,025 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-07 14:04:14,025 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-07 14:04:14,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-07 14:04:14,026 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-07 14:04:14,026 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-07 14:04:14,026 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-07 14:04:14,026 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-08-07 14:04:14,026 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-08-07 14:04:14,026 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-07 14:04:14,027 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-07 14:04:14,027 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-07 14:04:14,027 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-07 14:04:14,027 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-07 14:04:14,027 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-08-07 14:04:14,027 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder: Size of a code block -> SequenceOfStatements [2024-08-07 14:04:14,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-07 14:04:14,280 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-07 14:04:14,282 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-07 14:04:14,283 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-07 14:04:14,283 INFO L274 PluginConnector]: CDTParser initialized [2024-08-07 14:04:14,284 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/sqrt_poly2.c [2024-08-07 14:04:15,500 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-07 14:04:15,643 INFO L384 CDTParser]: Found 1 translation units. [2024-08-07 14:04:15,644 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/sqrt_poly2.c [2024-08-07 14:04:15,652 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b62fec6c/583e471c6ae4463da178a7694133f7bc/FLAGef7d75d95 [2024-08-07 14:04:15,666 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b62fec6c/583e471c6ae4463da178a7694133f7bc [2024-08-07 14:04:15,669 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-07 14:04:15,670 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-07 14:04:15,670 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/sqrt_poly2.yml/witness.yml [2024-08-07 14:04:15,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-07 14:04:15,728 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-07 14:04:15,730 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-07 14:04:15,730 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-07 14:04:15,733 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-07 14:04:15,734 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.08 02:04:15" (1/2) ... [2024-08-07 14:04:15,734 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@340c5575 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:04:15, skipping insertion in model container [2024-08-07 14:04:15,734 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.08 02:04:15" (1/2) ... [2024-08-07 14:04:15,736 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@d195d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:04:15, skipping insertion in model container [2024-08-07 14:04:15,736 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 07.08 02:04:15" (2/2) ... [2024-08-07 14:04:15,736 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@340c5575 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:04:15, skipping insertion in model container [2024-08-07 14:04:15,736 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 07.08 02:04:15" (2/2) ... [2024-08-07 14:04:15,752 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-07 14:04:15,874 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/sqrt_poly2.c[587,600] [2024-08-07 14:04:15,896 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-07 14:04:15,908 INFO L200 MainTranslator]: Completed pre-run [2024-08-07 14:04:15,919 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/sqrt_poly2.c[587,600] [2024-08-07 14:04:15,931 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-07 14:04:15,959 INFO L204 MainTranslator]: Completed translation [2024-08-07 14:04:15,960 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:04:15 WrapperNode [2024-08-07 14:04:15,960 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-07 14:04:15,961 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-07 14:04:15,961 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-07 14:04:15,962 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-07 14:04:15,970 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:04:15" (1/1) ... [2024-08-07 14:04:15,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:04:15" (1/1) ... [2024-08-07 14:04:15,982 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:04:15" (1/1) ... [2024-08-07 14:04:16,000 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2024-08-07 14:04:16,000 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:04:15" (1/1) ... [2024-08-07 14:04:16,000 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:04:15" (1/1) ... [2024-08-07 14:04:16,017 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:04:15" (1/1) ... [2024-08-07 14:04:16,021 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:04:15" (1/1) ... [2024-08-07 14:04:16,022 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:04:15" (1/1) ... [2024-08-07 14:04:16,027 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-07 14:04:16,029 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-07 14:04:16,029 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-07 14:04:16,030 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-07 14:04:16,030 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:04:15" (1/1) ... [2024-08-07 14:04:16,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-07 14:04:16,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-07 14:04:16,056 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-08-07 14:04:16,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-08-07 14:04:16,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-07 14:04:16,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-07 14:04:16,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2024-08-07 14:04:16,096 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-07 14:04:16,097 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-07 14:04:16,097 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-08-07 14:04:16,097 INFO L138 BoogieDeclarations]: Found implementation of procedure sqrt_custom [2024-08-07 14:04:16,097 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-07 14:04:16,097 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-07 14:04:16,098 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-07 14:04:16,098 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-07 14:04:16,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-07 14:04:16,098 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2024-08-07 14:04:16,098 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-07 14:04:16,098 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-08-07 14:04:16,098 INFO L130 BoogieDeclarations]: Found specification of procedure sqrt_custom [2024-08-07 14:04:16,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-08-07 14:04:16,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-08-07 14:04:16,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-08-07 14:04:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-08-07 14:04:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-08-07 14:04:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-08-07 14:04:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-08-07 14:04:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-08-07 14:04:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-08-07 14:04:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-07 14:04:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-07 14:04:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-07 14:04:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-08-07 14:04:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-08-07 14:04:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-07 14:04:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2024-08-07 14:04:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-08-07 14:04:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-08-07 14:04:16,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-08-07 14:04:16,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-08-07 14:04:16,182 INFO L273 CfgBuilder]: Building ICFG [2024-08-07 14:04:16,183 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-07 14:04:31,124 INFO L1251 $ProcedureCfgBuilder]: dead code at ProgramPoint L31: call ULTIMATE.dealloc(~#x~0.base, ~#x~0.offset);havoc ~#x~0.base, ~#x~0.offset; [2024-08-07 14:04:31,367 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-08-07 14:04:31,367 INFO L327 CfgBuilder]: Performing block encoding [2024-08-07 14:04:31,373 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-07 14:04:31,373 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-07 14:04:31,373 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.08 02:04:31 BoogieIcfgContainer [2024-08-07 14:04:31,373 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-07 14:04:31,374 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-07 14:04:31,374 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-07 14:04:31,377 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-07 14:04:31,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.08 02:04:15" (1/4) ... [2024-08-07 14:04:31,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c29e7bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.08 02:04:31, skipping insertion in model container [2024-08-07 14:04:31,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 07.08 02:04:15" (2/4) ... [2024-08-07 14:04:31,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c29e7bd and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 07.08 02:04:31, skipping insertion in model container [2024-08-07 14:04:31,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:04:15" (3/4) ... [2024-08-07 14:04:31,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c29e7bd and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 07.08 02:04:31, skipping insertion in model container [2024-08-07 14:04:31,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.08 02:04:31" (4/4) ... [2024-08-07 14:04:31,379 INFO L119 eAbstractionObserver]: Analyzing ICFG sqrt_poly2.c [2024-08-07 14:04:31,379 WARN L130 eAbstractionObserver]: Found a witness in the YAML format. I will only consider traces that are accepted by the witness [2024-08-07 14:04:31,400 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-07 14:04:31,400 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-07 14:04:31,436 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,439 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,440 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,441 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,441 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,442 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,443 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,443 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,444 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,445 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,445 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,446 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,446 WARN L283 nessProductAutomaton]: assume 0bv32 == ~bvsrem~32(~exp~0, 2bv32);#t~post7 := ~exp~0;~exp~0 := ~bvadd~32(1bv32, #t~post7);havoc #t~post7;, isNegated false [2024-08-07 14:04:31,447 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~bvsrem~32(~exp~0, 2bv32));~r~0 := ~fp.mul~64(currentRoundingMode, ~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:31,447 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,447 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,447 WARN L283 nessProductAutomaton]: assume 0bv32 == ~bvsrem~32(~exp~0, 2bv32);#t~post7 := ~exp~0;~exp~0 := ~bvadd~32(1bv32, #t~post7);havoc #t~post7;, isNegated false [2024-08-07 14:04:31,448 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~bvsrem~32(~exp~0, 2bv32));~r~0 := ~fp.mul~64(currentRoundingMode, ~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:31,448 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,448 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,449 WARN L283 nessProductAutomaton]: assume 0bv32 == ~bvsrem~32(~exp~0, 2bv32);#t~post7 := ~exp~0;~exp~0 := ~bvadd~32(1bv32, #t~post7);havoc #t~post7;, isNegated false [2024-08-07 14:04:31,449 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~bvsrem~32(~exp~0, 2bv32));~r~0 := ~fp.mul~64(currentRoundingMode, ~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:31,449 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,449 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,450 WARN L283 nessProductAutomaton]: assume 0bv32 == ~bvsrem~32(~exp~0, 2bv32);#t~post7 := ~exp~0;~exp~0 := ~bvadd~32(1bv32, #t~post7);havoc #t~post7;, isNegated false [2024-08-07 14:04:31,450 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~bvsrem~32(~exp~0, 2bv32));~r~0 := ~fp.mul~64(currentRoundingMode, ~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:31,450 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,450 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,451 WARN L283 nessProductAutomaton]: assume 0bv32 == ~bvsrem~32(~exp~0, 2bv32);#t~post7 := ~exp~0;~exp~0 := ~bvadd~32(1bv32, #t~post7);havoc #t~post7;, isNegated false [2024-08-07 14:04:31,451 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~bvsrem~32(~exp~0, 2bv32));~r~0 := ~fp.mul~64(currentRoundingMode, ~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:31,451 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,451 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,452 WARN L283 nessProductAutomaton]: assume 0bv32 == ~bvsrem~32(~exp~0, 2bv32);#t~post7 := ~exp~0;~exp~0 := ~bvadd~32(1bv32, #t~post7);havoc #t~post7;, isNegated false [2024-08-07 14:04:31,452 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~bvsrem~32(~exp~0, 2bv32));~r~0 := ~fp.mul~64(currentRoundingMode, ~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:31,452 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,453 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,453 WARN L283 nessProductAutomaton]: assume 0bv32 == ~bvsrem~32(~exp~0, 2bv32);#t~post7 := ~exp~0;~exp~0 := ~bvadd~32(1bv32, #t~post7);havoc #t~post7;, isNegated false [2024-08-07 14:04:31,453 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~bvsrem~32(~exp~0, 2bv32));~r~0 := ~fp.mul~64(currentRoundingMode, ~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:31,454 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,454 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,454 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;, isNegated false [2024-08-07 14:04:31,454 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,454 WARN L283 nessProductAutomaton]: assume 0bv32 == ~bvsrem~32(~exp~0, 2bv32);#t~post7 := ~exp~0;~exp~0 := ~bvadd~32(1bv32, #t~post7);havoc #t~post7;, isNegated false [2024-08-07 14:04:31,454 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~bvsrem~32(~exp~0, 2bv32));~r~0 := ~fp.mul~64(currentRoundingMode, ~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:31,455 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,455 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,455 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;, isNegated false [2024-08-07 14:04:31,455 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,455 WARN L283 nessProductAutomaton]: assume 0bv32 == ~bvsrem~32(~exp~0, 2bv32);#t~post7 := ~exp~0;~exp~0 := ~bvadd~32(1bv32, #t~post7);havoc #t~post7;, isNegated false [2024-08-07 14:04:31,456 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~bvsrem~32(~exp~0, 2bv32));~r~0 := ~fp.mul~64(currentRoundingMode, ~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:31,456 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,456 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,456 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,456 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,457 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;, isNegated false [2024-08-07 14:04:31,457 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,457 WARN L283 nessProductAutomaton]: assume 0bv32 == ~bvsrem~32(~exp~0, 2bv32);#t~post7 := ~exp~0;~exp~0 := ~bvadd~32(1bv32, #t~post7);havoc #t~post7;, isNegated false [2024-08-07 14:04:31,457 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~bvsrem~32(~exp~0, 2bv32));~r~0 := ~fp.mul~64(currentRoundingMode, ~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:31,458 WARN L283 nessProductAutomaton]: assume 0bv32 == ~bvsrem~32(~exp~0, 2bv32);#t~post7 := ~exp~0;~exp~0 := ~bvadd~32(1bv32, #t~post7);havoc #t~post7;, isNegated false [2024-08-07 14:04:31,458 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~bvsrem~32(~exp~0, 2bv32));~r~0 := ~fp.mul~64(currentRoundingMode, ~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:31,458 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,458 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,458 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,459 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,459 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,459 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,460 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;, isNegated false [2024-08-07 14:04:31,460 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,460 WARN L283 nessProductAutomaton]: assume 0bv32 == ~bvsrem~32(~exp~0, 2bv32);#t~post7 := ~exp~0;~exp~0 := ~bvadd~32(1bv32, #t~post7);havoc #t~post7;, isNegated false [2024-08-07 14:04:31,460 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~bvsrem~32(~exp~0, 2bv32));~r~0 := ~fp.mul~64(currentRoundingMode, ~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:31,461 WARN L283 nessProductAutomaton]: assume 0bv32 == ~bvsrem~32(~exp~0, 2bv32);#t~post7 := ~exp~0;~exp~0 := ~bvadd~32(1bv32, #t~post7);havoc #t~post7;, isNegated false [2024-08-07 14:04:31,461 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~bvsrem~32(~exp~0, 2bv32));~r~0 := ~fp.mul~64(currentRoundingMode, ~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:31,461 WARN L283 nessProductAutomaton]: assume 0bv32 == ~bvsrem~32(~exp~0, 2bv32);#t~post7 := ~exp~0;~exp~0 := ~bvadd~32(1bv32, #t~post7);havoc #t~post7;, isNegated false [2024-08-07 14:04:31,461 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~bvsrem~32(~exp~0, 2bv32));~r~0 := ~fp.mul~64(currentRoundingMode, ~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:31,461 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,462 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,462 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;, isNegated false [2024-08-07 14:04:31,462 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,462 WARN L283 nessProductAutomaton]: assume 0bv32 == ~bvsrem~32(~exp~0, 2bv32);#t~post7 := ~exp~0;~exp~0 := ~bvadd~32(1bv32, #t~post7);havoc #t~post7;, isNegated false [2024-08-07 14:04:31,462 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~bvsrem~32(~exp~0, 2bv32));~r~0 := ~fp.mul~64(currentRoundingMode, ~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:31,463 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,463 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,463 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;, isNegated false [2024-08-07 14:04:31,464 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,464 WARN L283 nessProductAutomaton]: assume 0bv32 == ~bvsrem~32(~exp~0, 2bv32);#t~post7 := ~exp~0;~exp~0 := ~bvadd~32(1bv32, #t~post7);havoc #t~post7;, isNegated false [2024-08-07 14:04:31,464 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~bvsrem~32(~exp~0, 2bv32));~r~0 := ~fp.mul~64(currentRoundingMode, ~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:31,464 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,465 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,465 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;, isNegated false [2024-08-07 14:04:31,465 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,465 WARN L283 nessProductAutomaton]: assume 0bv32 == ~bvsrem~32(~exp~0, 2bv32);#t~post7 := ~exp~0;~exp~0 := ~bvadd~32(1bv32, #t~post7);havoc #t~post7;, isNegated false [2024-08-07 14:04:31,466 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~bvsrem~32(~exp~0, 2bv32));~r~0 := ~fp.mul~64(currentRoundingMode, ~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:31,466 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,466 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,466 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;, isNegated false [2024-08-07 14:04:31,466 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,467 WARN L283 nessProductAutomaton]: assume 0bv32 == ~bvsrem~32(~exp~0, 2bv32);#t~post7 := ~exp~0;~exp~0 := ~bvadd~32(1bv32, #t~post7);havoc #t~post7;, isNegated false [2024-08-07 14:04:31,467 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~bvsrem~32(~exp~0, 2bv32));~r~0 := ~fp.mul~64(currentRoundingMode, ~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:31,467 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,467 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,467 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;, isNegated false [2024-08-07 14:04:31,467 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,468 WARN L283 nessProductAutomaton]: assume 0bv32 == ~bvsrem~32(~exp~0, 2bv32);#t~post7 := ~exp~0;~exp~0 := ~bvadd~32(1bv32, #t~post7);havoc #t~post7;, isNegated false [2024-08-07 14:04:31,468 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~bvsrem~32(~exp~0, 2bv32));~r~0 := ~fp.mul~64(currentRoundingMode, ~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:31,477 INFO L90 WitnessUtils]: NestedWordAutomaton nwa = ( callAlphabet = {"call ULTIMATE.init();" "call __VERIFIER_assert((if ~fp.geq~64(~y~0, ~Pluszero~64()) && ~fp.leq~64(~y~0, ~to_fp~64(currentRoundingMode, 1000000.0)) then 1bv32 else 0bv32));" "call #t~ret10 := sqrt_custom(~x~1);" "call assume_abort_if_not((if ~fp.geq~64(~x~1, ~to_fp~64(currentRoundingMode, 1.0)) && ~fp.leq~64(~x~1, ~to_fp~64(currentRoundingMode, 1.0E10)) then 1bv32 else 0bv32));" "call #t~ret11 := main();" }, internalAlphabet = {"#res := 0bv32;" "SUMMARY for call __VERIFIER_assert((if ~fp.geq~64(~y~0, ~Pluszero~64()) && ~fp.leq~64(~y~0, ~to_fp~64(currentRoundingMode, 1000000.0)) then 1bv32 else 0bv32)); srcloc: L65-1" "~y~0 := #t~ret10;havoc #t~ret10;" "SUMMARY for call #t~ret10 := sqrt_custom(~x~1); srcloc: L63-1" "SUMMARY for call assume_abort_if_not((if ~fp.geq~64(~x~1, ~to_fp~64(currentRoundingMode, 1.0)) && ~fp.leq~64(~x~1, ~to_fp~64(currentRoundingMode, 1.0E10)) then 1bv32 else 0bv32)); srcloc: L61" "havoc ~x~1;havoc ~y~0;havoc #t~nondet9;~x~1 := #t~nondet9;havoc #t~nondet9;" "assume true;" "call write~intINTTYPE4#1(~bvshl~32(~bvadd~32(511bv32, ~bvsdiv~32(~exp~0, 2bv32)), 20bv32), ~#x~0.base, ~#x~0.offset, 4bv32);call #t~mem8 := read~intFLOATTYPE8#1(~#x~0.base, ~#x~0.offset, 8bv32);~r~0 := ~fp.mul~64(currentRoundingMode, ~r~0, #t~mem8);havoc #t~mem8;#res := ~r~0;call ULTIMATE.dealloc(~#x~0.base, ~#x~0.offset);havoc ~#x~0.base, ~#x~0.offset;" "assume 0bv32 == ~bvsrem~32(~exp~0, 2bv32);#t~post7 := ~exp~0;~exp~0 := ~bvadd~32(1bv32, #t~post7);havoc #t~post7;" "assume !(0bv32 == ~bvsrem~32(~exp~0, 2bv32));~r~0 := ~fp.mul~64(currentRoundingMode, ~r~0, ~C0~0);" "~a := #in~a;call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(8bv32);havoc ~r~0;havoc ~exp~0;call write~intFLOATTYPE8#1(~a, ~#x~0.base, ~#x~0.offset, 8bv32);call #t~mem4 := read~intINTTYPE4#1(~#x~0.base, ~#x~0.offset, 4bv32);~exp~0 := ~bvashr~32(~bvand~32(2146435072bv32, #t~mem4), 20bv32);havoc #t~mem4;call #t~mem5 := read~intINTTYPE4#1(~#x~0.base, ~#x~0.offset, 4bv32);call write~intINTTYPE4#1(~bvor~32(1072693248bv32, ~bvand~32(2148532223bv32, #t~mem5)), ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem5;call #t~mem6 := read~intFLOATTYPE8#1(~#x~0.base, ~#x~0.offset, 8bv32);~r~0 := ~fp.mul~64(currentRoundingMode, #t~mem6, ~to_fp~64(currentRoundingMode, 0.5));havoc #t~mem6;~r~0 := ~fp.add~64(currentRoundingMode, ~fp.add~64(currentRoundingMode, ~C1~0, ~C2~0), ~fp.mul~64(currentRoundingMode, ~fp.add~64(currentRoundingMode, ~C3~0, ~fp.mul~64(currentRoundingMode, ~fp.add~64(currentRoundingMode, ~C4~0, ~fp.mul~64(currentRoundingMode, ~C5~0, ~r~0)), ~r~0)), ~r~0));" "assume true;" "assume 0bv32 == ~cond;assume false;" "assume !(0bv32 == ~cond);" "~cond := #in~cond;" "assume true;" "assume 0bv1 == #valid[0bv32];assume ~bvult~32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1#0(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1#0(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~C0~0 := ~to_fp~64(currentRoundingMode, 1.414213538);~C1~0 := ~to_fp~64(currentRoundingMode, 0.229761391);~C2~0 := ~to_fp~64(currentRoundingMode, 1.296735525);~C3~0 := ~fp.neg~64(~to_fp~64(currentRoundingMode, 0.90109837));~C4~0 := ~to_fp~64(currentRoundingMode, 0.4935534);~C5~0 := ~fp.neg~64(~to_fp~64(currentRoundingMode, 0.118958666));" "assume true;" "SUMMARY for call #t~ret11 := main(); srcloc: L-1" "SUMMARY for call ULTIMATE.init(); srcloc: ULTIMATE.startENTRY" "assume true;" "assume false;" "assume false;" "assume !false;" "assume 0bv32 == ~cond;" "assume !(0bv32 == ~cond);" "~cond := #in~cond;" "assume true;" }, returnAlphabet = {"#49#return;" "#41#return;" "#43#return;" "#45#return;" "#47#return;" }, states = {"CountingPredicate [underlying: 29#assume_abort_if_notENTRYtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 8#ULTIMATE.initEXITtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 9#__VERIFIER_assertENTRYtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 14#L12true, annotation: [1, 0]]" "CountingPredicate [underlying: 22#L43true, annotation: [4, 0]]" "CountingPredicate [underlying: 16#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 19#__VERIFIER_assertFINALtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 26#L65true, annotation: [4, 0]]" "CountingPredicate [underlying: 31#ULTIMATE.startFINALtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 3#L65-1true, annotation: [4, 0]]" "CountingPredicate [underlying: 10#sqrt_customENTRYtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 3#L65-1true, annotation: [6, 0]]" "CountingPredicate [underlying: 27#mainFINALtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 17#mainENTRYtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 25#mainEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 4#L63-1true, annotation: [3, 0]]" "CountingPredicate [underlying: 5#L14true, annotation: [4, 0]]" "CountingPredicate [underlying: 4#L63-1true, annotation: [1, 0]]" "CountingPredicate [underlying: 11#sqrt_customFINALtrue, annotation: [5, 0]]" "CountingPredicate [underlying: 12#L63true, annotation: [1, 0]]" "CountingPredicate [underlying: 11#sqrt_customFINALtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 9#__VERIFIER_assertENTRYtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 18#sqrt_customEXITtrue, annotation: [5, 0]]" "CountingPredicate [underlying: 13#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 18#sqrt_customEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 24#assume_abort_if_notEXITtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 28#L50true, annotation: [5, 0]]" "CountingPredicate [underlying: 20#ULTIMATE.initFINALtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 32#ERRORtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 25#mainEXITtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 30#L14-2true, annotation: [4, 0]]" "CountingPredicate [underlying: 32#ERRORtrue, annotation: [8, 0]]" "CountingPredicate [underlying: 25#mainEXITtrue, annotation: [9, 0]]" "CountingPredicate [underlying: 23#__VERIFIER_assertEXITtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 15#ULTIMATE.initENTRYtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 21#assume_abort_if_notFINALtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 26#L65true, annotation: [1, 0]]" "CountingPredicate [underlying: 19#__VERIFIER_assertFINALtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 19#__VERIFIER_assertFINALtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 22#L43true, annotation: [1, 0]]" "CountingPredicate [underlying: 6#L-1true, annotation: [0, 0]]" "CountingPredicate [underlying: 3#L65-1true, annotation: [1, 0]]" "CountingPredicate [underlying: 27#mainFINALtrue, annotation: [9, 0]]" "CountingPredicate [underlying: 10#sqrt_customENTRYtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 27#mainFINALtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 19#__VERIFIER_assertFINALtrue, annotation: [9, 0]]" "CountingPredicate [underlying: 31#ULTIMATE.startFINALtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 31#ULTIMATE.startFINALtrue, annotation: [9, 0]]" "CountingPredicate [underlying: 25#mainEXITtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 12#L63true, annotation: [6, 0]]" "CountingPredicate [underlying: 27#mainFINALtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 5#L14true, annotation: [1, 0]]" "CountingPredicate [underlying: 13#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [9, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [9, 0]]" "CountingPredicate [underlying: 11#sqrt_customFINALtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 31#ULTIMATE.startFINALtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 28#L50true, annotation: [1, 0]]" "CountingPredicate [underlying: 26#L65true, annotation: [9, 0]]" "CountingPredicate [underlying: 26#L65true, annotation: [7, 0]]" "CountingPredicate [underlying: 13#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 5#L14true, annotation: [9, 0]]" "CountingPredicate [underlying: 12#L63true, annotation: [4, 0]]" "CountingPredicate [underlying: 9#__VERIFIER_assertENTRYtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 18#sqrt_customEXITtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 30#L14-2true, annotation: [1, 0]]" "CountingPredicate [underlying: 24#assume_abort_if_notEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 28#L50true, annotation: [4, 0]]" "CountingPredicate [underlying: 32#ERRORtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 30#L14-2true, annotation: [7, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 23#__VERIFIER_assertEXITtrue, annotation: [9, 0]]" "CountingPredicate [underlying: 23#__VERIFIER_assertEXITtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 7#L61true, annotation: [0, 0]]" "CountingPredicate [underlying: 21#assume_abort_if_notFINALtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 23#__VERIFIER_assertEXITtrue, annotation: [1, 0]]" }, initialStates = {"CountingPredicate [underlying: 16#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" }, finalStates = {"CountingPredicate [underlying: 13#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [9, 0]]" }, callTransitions = { ("CountingPredicate [underlying: 16#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" "call ULTIMATE.init();" "CountingPredicate [underlying: 15#ULTIMATE.initENTRYtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 3#L65-1true, annotation: [4, 0]]" "call __VERIFIER_assert((if ~fp.geq~64(~y~0, ~Pluszero~64()) && ~fp.leq~64(~y~0, ~to_fp~64(currentRoundingMode, 1000000.0)) then 1bv32 else 0bv32));" "CountingPredicate [underlying: 9#__VERIFIER_assertENTRYtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 3#L65-1true, annotation: [6, 0]]" "call __VERIFIER_assert((if ~fp.geq~64(~y~0, ~Pluszero~64()) && ~fp.leq~64(~y~0, ~to_fp~64(currentRoundingMode, 1000000.0)) then 1bv32 else 0bv32));" "CountingPredicate [underlying: 9#__VERIFIER_assertENTRYtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 4#L63-1true, annotation: [3, 0]]" "call #t~ret10 := sqrt_custom(~x~1);" "CountingPredicate [underlying: 10#sqrt_customENTRYtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 4#L63-1true, annotation: [1, 0]]" "call #t~ret10 := sqrt_custom(~x~1);" "CountingPredicate [underlying: 10#sqrt_customENTRYtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 6#L-1true, annotation: [0, 0]]" "call #t~ret11 := main();" "CountingPredicate [underlying: 17#mainENTRYtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 3#L65-1true, annotation: [1, 0]]" "call __VERIFIER_assert((if ~fp.geq~64(~y~0, ~Pluszero~64()) && ~fp.leq~64(~y~0, ~to_fp~64(currentRoundingMode, 1000000.0)) then 1bv32 else 0bv32));" "CountingPredicate [underlying: 9#__VERIFIER_assertENTRYtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 7#L61true, annotation: [0, 0]]" "call assume_abort_if_not((if ~fp.geq~64(~x~1, ~to_fp~64(currentRoundingMode, 1.0)) && ~fp.leq~64(~x~1, ~to_fp~64(currentRoundingMode, 1.0E10)) then 1bv32 else 0bv32));" "CountingPredicate [underlying: 29#assume_abort_if_notENTRYtrue, annotation: [1, 0]]") }, internalTransitions = { ("CountingPredicate [underlying: 29#assume_abort_if_notENTRYtrue, annotation: [1, 0]]" "~cond := #in~cond;" "CountingPredicate [underlying: 14#L12true, annotation: [1, 0]]") ("CountingPredicate [underlying: 9#__VERIFIER_assertENTRYtrue, annotation: [1, 0]]" "~cond := #in~cond;" "CountingPredicate [underlying: 30#L14-2true, annotation: [1, 0]]") ("CountingPredicate [underlying: 14#L12true, annotation: [1, 0]]" "assume 0bv32 == ~cond;assume false;" "CountingPredicate [underlying: 21#assume_abort_if_notFINALtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 14#L12true, annotation: [1, 0]]" "assume !(0bv32 == ~cond);" "CountingPredicate [underlying: 21#assume_abort_if_notFINALtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 22#L43true, annotation: [4, 0]]" "assume 0bv32 == ~bvsrem~32(~exp~0, 2bv32);#t~post7 := ~exp~0;~exp~0 := ~bvadd~32(1bv32, #t~post7);havoc #t~post7;" "CountingPredicate [underlying: 28#L50true, annotation: [5, 0]]") ("CountingPredicate [underlying: 22#L43true, annotation: [4, 0]]" "assume !(0bv32 == ~bvsrem~32(~exp~0, 2bv32));~r~0 := ~fp.mul~64(currentRoundingMode, ~r~0, ~C0~0);" "CountingPredicate [underlying: 28#L50true, annotation: [4, 0]]") ("CountingPredicate [underlying: 19#__VERIFIER_assertFINALtrue, annotation: [4, 0]]" "assume true;" "CountingPredicate [underlying: 23#__VERIFIER_assertEXITtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 26#L65true, annotation: [4, 0]]" "#res := 0bv32;" "CountingPredicate [underlying: 27#mainFINALtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 31#ULTIMATE.startFINALtrue, annotation: [4, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 10#sqrt_customENTRYtrue, annotation: [1, 0]]" "~a := #in~a;call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(8bv32);havoc ~r~0;havoc ~exp~0;call write~intFLOATTYPE8#1(~a, ~#x~0.base, ~#x~0.offset, 8bv32);call #t~mem4 := read~intINTTYPE4#1(~#x~0.base, ~#x~0.offset, 4bv32);~exp~0 := ~bvashr~32(~bvand~32(2146435072bv32, #t~mem4), 20bv32);havoc #t~mem4;call #t~mem5 := read~intINTTYPE4#1(~#x~0.base, ~#x~0.offset, 4bv32);call write~intINTTYPE4#1(~bvor~32(1072693248bv32, ~bvand~32(2148532223bv32, #t~mem5)), ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem5;call #t~mem6 := read~intFLOATTYPE8#1(~#x~0.base, ~#x~0.offset, 8bv32);~r~0 := ~fp.mul~64(currentRoundingMode, #t~mem6, ~to_fp~64(currentRoundingMode, 0.5));havoc #t~mem6;~r~0 := ~fp.add~64(currentRoundingMode, ~fp.add~64(currentRoundingMode, ~C1~0, ~C2~0), ~fp.mul~64(currentRoundingMode, ~fp.add~64(currentRoundingMode, ~C3~0, ~fp.mul~64(currentRoundingMode, ~fp.add~64(currentRoundingMode, ~C4~0, ~fp.mul~64(currentRoundingMode, ~C5~0, ~r~0)), ~r~0)), ~r~0));" "CountingPredicate [underlying: 22#L43true, annotation: [1, 0]]") ("CountingPredicate [underlying: 27#mainFINALtrue, annotation: [4, 0]]" "assume true;" "CountingPredicate [underlying: 25#mainEXITtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 17#mainENTRYtrue, annotation: [0, 0]]" "havoc ~x~1;havoc ~y~0;havoc #t~nondet9;~x~1 := #t~nondet9;havoc #t~nondet9;" "CountingPredicate [underlying: 7#L61true, annotation: [0, 0]]") ("CountingPredicate [underlying: 5#L14true, annotation: [4, 0]]" "assume false;" "CountingPredicate [underlying: 19#__VERIFIER_assertFINALtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 11#sqrt_customFINALtrue, annotation: [5, 0]]" "assume true;" "CountingPredicate [underlying: 18#sqrt_customEXITtrue, annotation: [5, 0]]") ("CountingPredicate [underlying: 12#L63true, annotation: [1, 0]]" "~y~0 := #t~ret10;havoc #t~ret10;" "CountingPredicate [underlying: 3#L65-1true, annotation: [1, 0]]") ("CountingPredicate [underlying: 11#sqrt_customFINALtrue, annotation: [1, 0]]" "assume true;" "CountingPredicate [underlying: 18#sqrt_customEXITtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 9#__VERIFIER_assertENTRYtrue, annotation: [7, 0]]" "~cond := #in~cond;" "CountingPredicate [underlying: 30#L14-2true, annotation: [7, 0]]") ("CountingPredicate [underlying: 28#L50true, annotation: [5, 0]]" "call write~intINTTYPE4#1(~bvshl~32(~bvadd~32(511bv32, ~bvsdiv~32(~exp~0, 2bv32)), 20bv32), ~#x~0.base, ~#x~0.offset, 4bv32);call #t~mem8 := read~intFLOATTYPE8#1(~#x~0.base, ~#x~0.offset, 8bv32);~r~0 := ~fp.mul~64(currentRoundingMode, ~r~0, #t~mem8);havoc #t~mem8;#res := ~r~0;call ULTIMATE.dealloc(~#x~0.base, ~#x~0.offset);havoc ~#x~0.base, ~#x~0.offset;" "CountingPredicate [underlying: 11#sqrt_customFINALtrue, annotation: [5, 0]]") ("CountingPredicate [underlying: 20#ULTIMATE.initFINALtrue, annotation: [0, 0]]" "assume true;" "CountingPredicate [underlying: 8#ULTIMATE.initEXITtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 32#ERRORtrue, annotation: [4, 0]]" "assume false;" "CountingPredicate [underlying: 5#L14true, annotation: [4, 0]]") ("CountingPredicate [underlying: 32#ERRORtrue, annotation: [4, 0]]" "assume !false;" "CountingPredicate [underlying: 13#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 30#L14-2true, annotation: [4, 0]]" "assume 0bv32 == ~cond;" "CountingPredicate [underlying: 32#ERRORtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 30#L14-2true, annotation: [4, 0]]" "assume !(0bv32 == ~cond);" "CountingPredicate [underlying: 19#__VERIFIER_assertFINALtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 32#ERRORtrue, annotation: [8, 0]]" "assume false;" "CountingPredicate [underlying: 5#L14true, annotation: [9, 0]]") ("CountingPredicate [underlying: 32#ERRORtrue, annotation: [8, 0]]" "assume !false;" "CountingPredicate [underlying: 13#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [9, 0]]") ("CountingPredicate [underlying: 15#ULTIMATE.initENTRYtrue, annotation: [0, 0]]" "assume 0bv1 == #valid[0bv32];assume ~bvult~32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1#0(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1#0(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~C0~0 := ~to_fp~64(currentRoundingMode, 1.414213538);~C1~0 := ~to_fp~64(currentRoundingMode, 0.229761391);~C2~0 := ~to_fp~64(currentRoundingMode, 1.296735525);~C3~0 := ~fp.neg~64(~to_fp~64(currentRoundingMode, 0.90109837));~C4~0 := ~to_fp~64(currentRoundingMode, 0.4935534);~C5~0 := ~fp.neg~64(~to_fp~64(currentRoundingMode, 0.118958666));" "CountingPredicate [underlying: 20#ULTIMATE.initFINALtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 21#assume_abort_if_notFINALtrue, annotation: [1, 0]]" "assume true;" "CountingPredicate [underlying: 24#assume_abort_if_notEXITtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 26#L65true, annotation: [1, 0]]" "#res := 0bv32;" "CountingPredicate [underlying: 27#mainFINALtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 19#__VERIFIER_assertFINALtrue, annotation: [7, 0]]" "assume true;" "CountingPredicate [underlying: 23#__VERIFIER_assertEXITtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 19#__VERIFIER_assertFINALtrue, annotation: [1, 0]]" "assume true;" "CountingPredicate [underlying: 23#__VERIFIER_assertEXITtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 22#L43true, annotation: [1, 0]]" "assume 0bv32 == ~bvsrem~32(~exp~0, 2bv32);#t~post7 := ~exp~0;~exp~0 := ~bvadd~32(1bv32, #t~post7);havoc #t~post7;" "CountingPredicate [underlying: 28#L50true, annotation: [1, 0]]") ("CountingPredicate [underlying: 22#L43true, annotation: [1, 0]]" "assume !(0bv32 == ~bvsrem~32(~exp~0, 2bv32));~r~0 := ~fp.mul~64(currentRoundingMode, ~r~0, ~C0~0);" "CountingPredicate [underlying: 28#L50true, annotation: [1, 0]]") ("CountingPredicate [underlying: 27#mainFINALtrue, annotation: [9, 0]]" "assume true;" "CountingPredicate [underlying: 25#mainEXITtrue, annotation: [9, 0]]") ("CountingPredicate [underlying: 10#sqrt_customENTRYtrue, annotation: [4, 0]]" "~a := #in~a;call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(8bv32);havoc ~r~0;havoc ~exp~0;call write~intFLOATTYPE8#1(~a, ~#x~0.base, ~#x~0.offset, 8bv32);call #t~mem4 := read~intINTTYPE4#1(~#x~0.base, ~#x~0.offset, 4bv32);~exp~0 := ~bvashr~32(~bvand~32(2146435072bv32, #t~mem4), 20bv32);havoc #t~mem4;call #t~mem5 := read~intINTTYPE4#1(~#x~0.base, ~#x~0.offset, 4bv32);call write~intINTTYPE4#1(~bvor~32(1072693248bv32, ~bvand~32(2148532223bv32, #t~mem5)), ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem5;call #t~mem6 := read~intFLOATTYPE8#1(~#x~0.base, ~#x~0.offset, 8bv32);~r~0 := ~fp.mul~64(currentRoundingMode, #t~mem6, ~to_fp~64(currentRoundingMode, 0.5));havoc #t~mem6;~r~0 := ~fp.add~64(currentRoundingMode, ~fp.add~64(currentRoundingMode, ~C1~0, ~C2~0), ~fp.mul~64(currentRoundingMode, ~fp.add~64(currentRoundingMode, ~C3~0, ~fp.mul~64(currentRoundingMode, ~fp.add~64(currentRoundingMode, ~C4~0, ~fp.mul~64(currentRoundingMode, ~C5~0, ~r~0)), ~r~0)), ~r~0));" "CountingPredicate [underlying: 22#L43true, annotation: [4, 0]]") ("CountingPredicate [underlying: 27#mainFINALtrue, annotation: [7, 0]]" "assume true;" "CountingPredicate [underlying: 25#mainEXITtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 19#__VERIFIER_assertFINALtrue, annotation: [9, 0]]" "assume true;" "CountingPredicate [underlying: 23#__VERIFIER_assertEXITtrue, annotation: [9, 0]]") ("CountingPredicate [underlying: 31#ULTIMATE.startFINALtrue, annotation: [7, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 31#ULTIMATE.startFINALtrue, annotation: [9, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [9, 0]]") ("CountingPredicate [underlying: 12#L63true, annotation: [6, 0]]" "~y~0 := #t~ret10;havoc #t~ret10;" "CountingPredicate [underlying: 3#L65-1true, annotation: [6, 0]]") ("CountingPredicate [underlying: 27#mainFINALtrue, annotation: [1, 0]]" "assume true;" "CountingPredicate [underlying: 25#mainEXITtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 5#L14true, annotation: [1, 0]]" "assume false;" "CountingPredicate [underlying: 19#__VERIFIER_assertFINALtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 11#sqrt_customFINALtrue, annotation: [4, 0]]" "assume true;" "CountingPredicate [underlying: 18#sqrt_customEXITtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 31#ULTIMATE.startFINALtrue, annotation: [1, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 28#L50true, annotation: [1, 0]]" "call write~intINTTYPE4#1(~bvshl~32(~bvadd~32(511bv32, ~bvsdiv~32(~exp~0, 2bv32)), 20bv32), ~#x~0.base, ~#x~0.offset, 4bv32);call #t~mem8 := read~intFLOATTYPE8#1(~#x~0.base, ~#x~0.offset, 8bv32);~r~0 := ~fp.mul~64(currentRoundingMode, ~r~0, #t~mem8);havoc #t~mem8;#res := ~r~0;call ULTIMATE.dealloc(~#x~0.base, ~#x~0.offset);havoc ~#x~0.base, ~#x~0.offset;" "CountingPredicate [underlying: 11#sqrt_customFINALtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 26#L65true, annotation: [9, 0]]" "#res := 0bv32;" "CountingPredicate [underlying: 27#mainFINALtrue, annotation: [9, 0]]") ("CountingPredicate [underlying: 26#L65true, annotation: [7, 0]]" "#res := 0bv32;" "CountingPredicate [underlying: 27#mainFINALtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 5#L14true, annotation: [9, 0]]" "assume false;" "CountingPredicate [underlying: 19#__VERIFIER_assertFINALtrue, annotation: [9, 0]]") ("CountingPredicate [underlying: 12#L63true, annotation: [4, 0]]" "~y~0 := #t~ret10;havoc #t~ret10;" "CountingPredicate [underlying: 3#L65-1true, annotation: [4, 0]]") ("CountingPredicate [underlying: 9#__VERIFIER_assertENTRYtrue, annotation: [4, 0]]" "~cond := #in~cond;" "CountingPredicate [underlying: 30#L14-2true, annotation: [4, 0]]") ("CountingPredicate [underlying: 30#L14-2true, annotation: [1, 0]]" "assume 0bv32 == ~cond;" "CountingPredicate [underlying: 32#ERRORtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 30#L14-2true, annotation: [1, 0]]" "assume !(0bv32 == ~cond);" "CountingPredicate [underlying: 19#__VERIFIER_assertFINALtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 28#L50true, annotation: [4, 0]]" "call write~intINTTYPE4#1(~bvshl~32(~bvadd~32(511bv32, ~bvsdiv~32(~exp~0, 2bv32)), 20bv32), ~#x~0.base, ~#x~0.offset, 4bv32);call #t~mem8 := read~intFLOATTYPE8#1(~#x~0.base, ~#x~0.offset, 8bv32);~r~0 := ~fp.mul~64(currentRoundingMode, ~r~0, #t~mem8);havoc #t~mem8;#res := ~r~0;call ULTIMATE.dealloc(~#x~0.base, ~#x~0.offset);havoc ~#x~0.base, ~#x~0.offset;" "CountingPredicate [underlying: 11#sqrt_customFINALtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 32#ERRORtrue, annotation: [1, 0]]" "assume false;" "CountingPredicate [underlying: 5#L14true, annotation: [1, 0]]") ("CountingPredicate [underlying: 32#ERRORtrue, annotation: [1, 0]]" "assume !false;" "CountingPredicate [underlying: 13#__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 30#L14-2true, annotation: [7, 0]]" "assume 0bv32 == ~cond;" "CountingPredicate [underlying: 32#ERRORtrue, annotation: [8, 0]]") ("CountingPredicate [underlying: 30#L14-2true, annotation: [7, 0]]" "assume !(0bv32 == ~cond);" "CountingPredicate [underlying: 19#__VERIFIER_assertFINALtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 21#assume_abort_if_notFINALtrue, annotation: [2, 0]]" "assume true;" "CountingPredicate [underlying: 24#assume_abort_if_notEXITtrue, annotation: [2, 0]]") }, returnTransitions = { ("CountingPredicate [underlying: 8#ULTIMATE.initEXITtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 16#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" "#49#return;" "CountingPredicate [underlying: 6#L-1true, annotation: [0, 0]]") ("CountingPredicate [underlying: 25#mainEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 6#L-1true, annotation: [0, 0]]" "#47#return;" "CountingPredicate [underlying: 31#ULTIMATE.startFINALtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 18#sqrt_customEXITtrue, annotation: [5, 0]]" "CountingPredicate [underlying: 4#L63-1true, annotation: [3, 0]]" "#43#return;" "CountingPredicate [underlying: 12#L63true, annotation: [6, 0]]") ("CountingPredicate [underlying: 18#sqrt_customEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 4#L63-1true, annotation: [1, 0]]" "#43#return;" "CountingPredicate [underlying: 12#L63true, annotation: [1, 0]]") ("CountingPredicate [underlying: 24#assume_abort_if_notEXITtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 7#L61true, annotation: [0, 0]]" "#45#return;" "CountingPredicate [underlying: 4#L63-1true, annotation: [3, 0]]") ("CountingPredicate [underlying: 25#mainEXITtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 6#L-1true, annotation: [0, 0]]" "#47#return;" "CountingPredicate [underlying: 31#ULTIMATE.startFINALtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 25#mainEXITtrue, annotation: [9, 0]]" "CountingPredicate [underlying: 6#L-1true, annotation: [0, 0]]" "#47#return;" "CountingPredicate [underlying: 31#ULTIMATE.startFINALtrue, annotation: [9, 0]]") ("CountingPredicate [underlying: 23#__VERIFIER_assertEXITtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 3#L65-1true, annotation: [4, 0]]" "#41#return;" "CountingPredicate [underlying: 26#L65true, annotation: [4, 0]]") ("CountingPredicate [underlying: 25#mainEXITtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 6#L-1true, annotation: [0, 0]]" "#47#return;" "CountingPredicate [underlying: 31#ULTIMATE.startFINALtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 18#sqrt_customEXITtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 4#L63-1true, annotation: [3, 0]]" "#43#return;" "CountingPredicate [underlying: 12#L63true, annotation: [4, 0]]") ("CountingPredicate [underlying: 24#assume_abort_if_notEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 7#L61true, annotation: [0, 0]]" "#45#return;" "CountingPredicate [underlying: 4#L63-1true, annotation: [1, 0]]") ("CountingPredicate [underlying: 23#__VERIFIER_assertEXITtrue, annotation: [9, 0]]" "CountingPredicate [underlying: 3#L65-1true, annotation: [6, 0]]" "#41#return;" "CountingPredicate [underlying: 26#L65true, annotation: [9, 0]]") ("CountingPredicate [underlying: 23#__VERIFIER_assertEXITtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 3#L65-1true, annotation: [6, 0]]" "#41#return;" "CountingPredicate [underlying: 26#L65true, annotation: [7, 0]]") ("CountingPredicate [underlying: 23#__VERIFIER_assertEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 3#L65-1true, annotation: [1, 0]]" "#41#return;" "CountingPredicate [underlying: 26#L65true, annotation: [1, 0]]") } ); [2024-08-07 14:04:31,482 INFO L82 GeneralOperation]: Start removeDeadEnds. Operand has 31 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-08-07 14:04:31,483 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,483 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,484 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,484 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,484 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,485 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,485 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,485 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,485 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,486 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,486 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,486 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,488 WARN L283 nessProductAutomaton]: assume 0bv32 == ~bvsrem~32(~exp~0, 2bv32);#t~post7 := ~exp~0;~exp~0 := ~bvadd~32(1bv32, #t~post7);havoc #t~post7;, isNegated false [2024-08-07 14:04:31,488 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~bvsrem~32(~exp~0, 2bv32));~r~0 := ~fp.mul~64(currentRoundingMode, ~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:31,488 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,488 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,489 WARN L283 nessProductAutomaton]: assume 0bv32 == ~bvsrem~32(~exp~0, 2bv32);#t~post7 := ~exp~0;~exp~0 := ~bvadd~32(1bv32, #t~post7);havoc #t~post7;, isNegated false [2024-08-07 14:04:31,489 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~bvsrem~32(~exp~0, 2bv32));~r~0 := ~fp.mul~64(currentRoundingMode, ~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:31,489 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,489 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,489 WARN L283 nessProductAutomaton]: assume 0bv32 == ~bvsrem~32(~exp~0, 2bv32);#t~post7 := ~exp~0;~exp~0 := ~bvadd~32(1bv32, #t~post7);havoc #t~post7;, isNegated false [2024-08-07 14:04:31,489 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~bvsrem~32(~exp~0, 2bv32));~r~0 := ~fp.mul~64(currentRoundingMode, ~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:31,490 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,490 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,490 WARN L283 nessProductAutomaton]: assume 0bv32 == ~bvsrem~32(~exp~0, 2bv32);#t~post7 := ~exp~0;~exp~0 := ~bvadd~32(1bv32, #t~post7);havoc #t~post7;, isNegated false [2024-08-07 14:04:31,490 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~bvsrem~32(~exp~0, 2bv32));~r~0 := ~fp.mul~64(currentRoundingMode, ~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:31,490 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,491 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,491 WARN L283 nessProductAutomaton]: assume 0bv32 == ~bvsrem~32(~exp~0, 2bv32);#t~post7 := ~exp~0;~exp~0 := ~bvadd~32(1bv32, #t~post7);havoc #t~post7;, isNegated false [2024-08-07 14:04:31,491 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~bvsrem~32(~exp~0, 2bv32));~r~0 := ~fp.mul~64(currentRoundingMode, ~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:31,491 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,491 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,492 WARN L283 nessProductAutomaton]: assume 0bv32 == ~bvsrem~32(~exp~0, 2bv32);#t~post7 := ~exp~0;~exp~0 := ~bvadd~32(1bv32, #t~post7);havoc #t~post7;, isNegated false [2024-08-07 14:04:31,492 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~bvsrem~32(~exp~0, 2bv32));~r~0 := ~fp.mul~64(currentRoundingMode, ~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:31,492 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,492 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,493 WARN L283 nessProductAutomaton]: assume 0bv32 == ~bvsrem~32(~exp~0, 2bv32);#t~post7 := ~exp~0;~exp~0 := ~bvadd~32(1bv32, #t~post7);havoc #t~post7;, isNegated false [2024-08-07 14:04:31,493 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~bvsrem~32(~exp~0, 2bv32));~r~0 := ~fp.mul~64(currentRoundingMode, ~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:31,493 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,493 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,494 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;, isNegated false [2024-08-07 14:04:31,494 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,494 WARN L283 nessProductAutomaton]: assume 0bv32 == ~bvsrem~32(~exp~0, 2bv32);#t~post7 := ~exp~0;~exp~0 := ~bvadd~32(1bv32, #t~post7);havoc #t~post7;, isNegated false [2024-08-07 14:04:31,494 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~bvsrem~32(~exp~0, 2bv32));~r~0 := ~fp.mul~64(currentRoundingMode, ~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:31,494 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,494 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,495 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;, isNegated false [2024-08-07 14:04:31,495 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,495 WARN L283 nessProductAutomaton]: assume 0bv32 == ~bvsrem~32(~exp~0, 2bv32);#t~post7 := ~exp~0;~exp~0 := ~bvadd~32(1bv32, #t~post7);havoc #t~post7;, isNegated false [2024-08-07 14:04:31,495 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~bvsrem~32(~exp~0, 2bv32));~r~0 := ~fp.mul~64(currentRoundingMode, ~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:31,495 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,495 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,496 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,496 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,497 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;, isNegated false [2024-08-07 14:04:31,497 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,497 WARN L283 nessProductAutomaton]: assume 0bv32 == ~bvsrem~32(~exp~0, 2bv32);#t~post7 := ~exp~0;~exp~0 := ~bvadd~32(1bv32, #t~post7);havoc #t~post7;, isNegated false [2024-08-07 14:04:31,497 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~bvsrem~32(~exp~0, 2bv32));~r~0 := ~fp.mul~64(currentRoundingMode, ~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:31,497 WARN L283 nessProductAutomaton]: assume 0bv32 == ~bvsrem~32(~exp~0, 2bv32);#t~post7 := ~exp~0;~exp~0 := ~bvadd~32(1bv32, #t~post7);havoc #t~post7;, isNegated false [2024-08-07 14:04:31,497 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~bvsrem~32(~exp~0, 2bv32));~r~0 := ~fp.mul~64(currentRoundingMode, ~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:31,498 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,498 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,498 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,498 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,498 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,498 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,499 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;, isNegated false [2024-08-07 14:04:31,499 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,499 WARN L283 nessProductAutomaton]: assume 0bv32 == ~bvsrem~32(~exp~0, 2bv32);#t~post7 := ~exp~0;~exp~0 := ~bvadd~32(1bv32, #t~post7);havoc #t~post7;, isNegated false [2024-08-07 14:04:31,499 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~bvsrem~32(~exp~0, 2bv32));~r~0 := ~fp.mul~64(currentRoundingMode, ~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:31,499 WARN L283 nessProductAutomaton]: assume 0bv32 == ~bvsrem~32(~exp~0, 2bv32);#t~post7 := ~exp~0;~exp~0 := ~bvadd~32(1bv32, #t~post7);havoc #t~post7;, isNegated false [2024-08-07 14:04:31,499 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~bvsrem~32(~exp~0, 2bv32));~r~0 := ~fp.mul~64(currentRoundingMode, ~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:31,499 WARN L283 nessProductAutomaton]: assume 0bv32 == ~bvsrem~32(~exp~0, 2bv32);#t~post7 := ~exp~0;~exp~0 := ~bvadd~32(1bv32, #t~post7);havoc #t~post7;, isNegated false [2024-08-07 14:04:31,500 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~bvsrem~32(~exp~0, 2bv32));~r~0 := ~fp.mul~64(currentRoundingMode, ~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:31,500 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,500 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,500 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;, isNegated false [2024-08-07 14:04:31,500 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,500 WARN L283 nessProductAutomaton]: assume 0bv32 == ~bvsrem~32(~exp~0, 2bv32);#t~post7 := ~exp~0;~exp~0 := ~bvadd~32(1bv32, #t~post7);havoc #t~post7;, isNegated false [2024-08-07 14:04:31,500 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~bvsrem~32(~exp~0, 2bv32));~r~0 := ~fp.mul~64(currentRoundingMode, ~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:31,501 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,501 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,501 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;, isNegated false [2024-08-07 14:04:31,501 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,501 WARN L283 nessProductAutomaton]: assume 0bv32 == ~bvsrem~32(~exp~0, 2bv32);#t~post7 := ~exp~0;~exp~0 := ~bvadd~32(1bv32, #t~post7);havoc #t~post7;, isNegated false [2024-08-07 14:04:31,501 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~bvsrem~32(~exp~0, 2bv32));~r~0 := ~fp.mul~64(currentRoundingMode, ~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:31,502 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,502 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,502 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;, isNegated false [2024-08-07 14:04:31,502 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,502 WARN L283 nessProductAutomaton]: assume 0bv32 == ~bvsrem~32(~exp~0, 2bv32);#t~post7 := ~exp~0;~exp~0 := ~bvadd~32(1bv32, #t~post7);havoc #t~post7;, isNegated false [2024-08-07 14:04:31,502 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~bvsrem~32(~exp~0, 2bv32));~r~0 := ~fp.mul~64(currentRoundingMode, ~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:31,502 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,503 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,503 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;, isNegated false [2024-08-07 14:04:31,503 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,503 WARN L283 nessProductAutomaton]: assume 0bv32 == ~bvsrem~32(~exp~0, 2bv32);#t~post7 := ~exp~0;~exp~0 := ~bvadd~32(1bv32, #t~post7);havoc #t~post7;, isNegated false [2024-08-07 14:04:31,503 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~bvsrem~32(~exp~0, 2bv32));~r~0 := ~fp.mul~64(currentRoundingMode, ~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:31,503 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:04:31,503 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,504 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;, isNegated false [2024-08-07 14:04:31,504 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:04:31,504 WARN L283 nessProductAutomaton]: assume 0bv32 == ~bvsrem~32(~exp~0, 2bv32);#t~post7 := ~exp~0;~exp~0 := ~bvadd~32(1bv32, #t~post7);havoc #t~post7;, isNegated false [2024-08-07 14:04:31,504 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~bvsrem~32(~exp~0, 2bv32));~r~0 := ~fp.mul~64(currentRoundingMode, ~r~0, ~C0~0);, isNegated true [2024-08-07 14:04:31,508 INFO L88 GeneralOperation]: Finished removeDeadEnds. Reduced from 77 states to 23 states. [2024-08-07 14:04:31,520 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-07 14:04:31,524 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, 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;@19355308, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-07 14:04:31,524 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-07 14:04:31,525 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2024-08-07 14:04:31,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-08-07 14:04:31,528 INFO L187 NwaCegarLoop]: Found error trace [2024-08-07 14:04:31,528 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-07 14:04:31,529 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-07 14:04:31,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-07 14:04:31,532 INFO L85 PathProgramCache]: Analyzing trace with hash 328402513, now seen corresponding path program 1 times [2024-08-07 14:04:31,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-07 14:04:31,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [890340524] [2024-08-07 14:04:31,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-07 14:04:31,541 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-08-07 14:04:31,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-08-07 14:04:31,547 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-08-07 14:04:31,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-08-07 14:04:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-07 14:04:37,154 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-07 14:04:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-07 14:04:42,899 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-08-07 14:04:42,901 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-07 14:04:42,901 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-07 14:04:42,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-08-07 14:04:43,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-08-07 14:04:43,107 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2024-08-07 14:04:43,115 INFO L196 ceAbstractionStarter]: Computing trace abstraction results [2024-08-07 14:04:43,141 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.08 02:04:43 BoogieIcfgContainer [2024-08-07 14:04:43,141 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-07 14:04:43,142 INFO L158 Benchmark]: Toolchain (without parser) took 27413.26ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 42.2MB in the beginning and 43.9MB in the end (delta: -1.7MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2024-08-07 14:04:43,142 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 46.1MB. Free memory is still 23.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-07 14:04:43,146 INFO L158 Benchmark]: Witness Parser took 1.00ms. Allocated memory is still 62.9MB. Free memory is still 28.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-07 14:04:43,146 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.73ms. Allocated memory is still 62.9MB. Free memory was 42.0MB in the beginning and 29.1MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-08-07 14:04:43,147 INFO L158 Benchmark]: Boogie Preprocessor took 67.62ms. Allocated memory is still 62.9MB. Free memory was 29.1MB in the beginning and 42.2MB in the end (delta: -13.1MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. [2024-08-07 14:04:43,147 INFO L158 Benchmark]: IcfgBuilder took 15343.84ms. Allocated memory is still 62.9MB. Free memory was 41.9MB in the beginning and 26.1MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-08-07 14:04:43,147 INFO L158 Benchmark]: TraceAbstraction took 11766.51ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 25.7MB in the beginning and 43.9MB in the end (delta: -18.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-08-07 14:04:43,149 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.11ms. Allocated memory is still 46.1MB. Free memory is still 23.9MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 1.00ms. Allocated memory is still 62.9MB. Free memory is still 28.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 230.73ms. Allocated memory is still 62.9MB. Free memory was 42.0MB in the beginning and 29.1MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.62ms. Allocated memory is still 62.9MB. Free memory was 29.1MB in the beginning and 42.2MB in the end (delta: -13.1MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. * IcfgBuilder took 15343.84ms. Allocated memory is still 62.9MB. Free memory was 41.9MB in the beginning and 26.1MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 11766.51ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 25.7MB in the beginning and 43.9MB in the end (delta: -18.2MB). 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 - CounterExampleResult [Line: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] double C0 = 1.414213538; [L18] double C1 = 0.229761391; [L19] double C2 = 1.296735525; [L20] double C3 = -0.901098370; [L21] double C4 = 0.493553400; [L22] double C5 = -0.118958666; VAL [C0=1.414213538, C1=0.229761391, C2=1.296735525, C3=-0.90109837, C4=0.4935534, C5=-0.118958666, \old(C0)=0.000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000030, \old(C1)=0.000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000010, \old(C2)=0.000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000015, \old(C3)=0.000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000020, \old(C4)=0.000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000025, \old(C5)=0.0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000049] [L58] double x,y; [L60] x = __VERIFIER_nondet_double() [L61] CALL assume_abort_if_not(x >= 1. && x <= 1e10) VAL [C0=1.414213538, C1=0.229761391, C2=1.296735525, C3=-0.90109837, C4=0.4935534, C5=-0.118958666, \old(cond)=1] [L12] !cond VAL [C0=1.414213538, C1=0.229761391, C2=1.296735525, C3=-0.90109837, C4=0.4935534, C5=-0.118958666, \old(cond)=1] [L61] RET assume_abort_if_not(x >= 1. && x <= 1e10) VAL [C0=1.414213538, C1=0.229761391, C2=1.296735525, C3=-0.90109837, C4=0.4935534, C5=-0.118958666, x=589.8072346262561] [L63] CALL, EXPR sqrt_custom(x) VAL [C0=1.414213538, C1=0.229761391, C2=1.296735525, C3=-0.90109837, C4=0.4935534, C5=-0.118958666, \old(a)=589.8072346262561] [L31] union u x; [L32] double r; [L33] int exp; [L35] x.d = a [L37] EXPR x.i[0] [L37] exp = (x.i[0] & 0x7FF00000) >> 20 [L38] EXPR x.i[0] [L38] x.i[0] = (x.i[0] & 0x800FFFFF) | 0x3FF00000 [L39] EXPR x.d [L39] r = x.d * 0.5 [L41] r = C1+C2+(C3+(C4+C5*r)*r)*r VAL [C0=1.414213538, C1=0.229761391, C2=1.296735525, C3=-0.90109837, C4=0.4935534, C5=-0.118958666, \old(a)=589.8072346262561, exp=886, r=-3008300.1297726887, x={5:0}] [L43] exp % 2 == 0 [L44] exp++ VAL [C0=1.414213538, C1=0.229761391, C2=1.296735525, C3=-0.90109837, C4=0.4935534, C5=-0.118958666, \old(a)=589.8072346262561, exp=887, r=-3008300.1297726887, x={5:0}] [L50] x.i[0] = (exp/2 + 511) << 20 [L51] EXPR x.d [L51] r = r * x.d [L53] return r; [L53] return r; VAL [C0=1.414213538, C1=0.229761391, C2=1.296735525, C3=-0.90109837, C4=0.4935534, C5=-0.118958666, \old(a)=589.8072346262561, \result=-1774317204.5504532] [L63] RET, EXPR sqrt_custom(x) VAL [C0=1.414213538, C1=0.229761391, C2=1.296735525, C3=-0.90109837, C4=0.4935534, C5=-0.118958666, x=589.8072346262561] [L63] y = sqrt_custom(x) [L65] CALL __VERIFIER_assert(y >= 0. && y <= 1e6) VAL [C0=1.414213538, C1=0.229761391, C2=1.296735525, C3=-0.90109837, C4=0.4935534, C5=-0.118958666, \old(cond)=0] [L14] !(cond) VAL [C0=1.414213538, C1=0.229761391, C2=1.296735525, C3=-0.90109837, C4=0.4935534, C5=-0.118958666, \old(cond)=0] [L14] reach_error() VAL [C0=1.414213538, C1=0.229761391, C2=1.296735525, C3=-0.90109837, C4=0.4935534, C5=-0.118958666, \old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.7s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred 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, 5.6s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-08-07 14:04:43,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE