./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1270d.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec Calling Ultimate with: /usr/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/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_1270d.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 976f334843509ce61229cfe6c2e95f4ffe1322fa ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/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/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_1270d.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 976f334843509ce61229cfe6c2e95f4ffe1322fa ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 01:54:21,329 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 01:54:21,331 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 01:54:21,365 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 01:54:21,365 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 01:54:21,368 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 01:54:21,369 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 01:54:21,373 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 01:54:21,374 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 01:54:21,378 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 01:54:21,379 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 01:54:21,380 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 01:54:21,380 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 01:54:21,382 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 01:54:21,383 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 01:54:21,388 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 01:54:21,389 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 01:54:21,389 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 01:54:21,391 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 01:54:21,395 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 01:54:21,396 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 01:54:21,397 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 01:54:21,398 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 01:54:21,399 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 01:54:21,404 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 01:54:21,404 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 01:54:21,404 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 01:54:21,405 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 01:54:21,406 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 01:54:21,406 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 01:54:21,406 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 01:54:21,407 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 01:54:21,408 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 01:54:21,409 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 01:54:21,410 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 01:54:21,410 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 01:54:21,410 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 01:54:21,410 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 01:54:21,411 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 01:54:21,412 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 01:54:21,412 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 01:54:21,416 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-26 01:54:21,443 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 01:54:21,444 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 01:54:21,445 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 01:54:21,445 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 01:54:21,446 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 01:54:21,446 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 01:54:21,447 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 01:54:21,447 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 01:54:21,447 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 01:54:21,447 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 01:54:21,448 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 01:54:21,448 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 01:54:21,448 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 01:54:21,448 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 01:54:21,448 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 01:54:21,449 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 01:54:21,449 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 01:54:21,449 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 01:54:21,449 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 01:54:21,449 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 01:54:21,449 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 01:54:21,449 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 01:54:21,450 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 01:54:21,450 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 01:54:21,450 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 01:54:21,450 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 01:54:21,450 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 01:54:21,450 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 01:54:21,450 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 01:54:21,450 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 01:54:21,451 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 976f334843509ce61229cfe6c2e95f4ffe1322fa [2021-08-26 01:54:21,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 01:54:21,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 01:54:21,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 01:54:21,706 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 01:54:21,706 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 01:54:21,707 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1270d.c [2021-08-26 01:54:21,746 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c85bf88d1/5147226d6d4544dd80adb50ed988b2f4/FLAG74d2b130a [2021-08-26 01:54:22,095 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 01:54:22,096 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1270d.c [2021-08-26 01:54:22,101 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c85bf88d1/5147226d6d4544dd80adb50ed988b2f4/FLAG74d2b130a [2021-08-26 01:54:22,506 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c85bf88d1/5147226d6d4544dd80adb50ed988b2f4 [2021-08-26 01:54:22,508 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 01:54:22,510 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 01:54:22,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 01:54:22,513 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 01:54:22,515 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 01:54:22,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 01:54:22" (1/1) ... [2021-08-26 01:54:22,517 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@153577e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:22, skipping insertion in model container [2021-08-26 01:54:22,518 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 01:54:22" (1/1) ... [2021-08-26 01:54:22,522 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 01:54:22,551 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 01:54:22,696 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1270d.c[4704,4717] [2021-08-26 01:54:22,700 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 01:54:22,711 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 01:54:22,785 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1270d.c[4704,4717] [2021-08-26 01:54:22,786 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 01:54:22,809 INFO L208 MainTranslator]: Completed translation [2021-08-26 01:54:22,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:22 WrapperNode [2021-08-26 01:54:22,809 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 01:54:22,810 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 01:54:22,810 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 01:54:22,810 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 01:54:22,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:22" (1/1) ... [2021-08-26 01:54:22,829 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:22" (1/1) ... [2021-08-26 01:54:22,865 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 01:54:22,867 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 01:54:22,867 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 01:54:22,867 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 01:54:22,873 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:22" (1/1) ... [2021-08-26 01:54:22,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:22" (1/1) ... [2021-08-26 01:54:22,888 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:22" (1/1) ... [2021-08-26 01:54:22,892 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:22" (1/1) ... [2021-08-26 01:54:22,900 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:22" (1/1) ... [2021-08-26 01:54:22,917 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:22" (1/1) ... [2021-08-26 01:54:22,919 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:22" (1/1) ... [2021-08-26 01:54:22,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 01:54:22,926 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 01:54:22,926 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 01:54:22,926 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 01:54:22,927 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:22" (1/1) ... [2021-08-26 01:54:22,932 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 01:54:22,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 01:54:22,948 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-26 01:54:22,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-26 01:54:22,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 01:54:22,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 01:54:22,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-08-26 01:54:22,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-26 01:54:22,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2021-08-26 01:54:22,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 01:54:22,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 01:54:22,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-26 01:54:22,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-26 01:54:23,521 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 01:54:23,522 INFO L299 CfgBuilder]: Removed 52 assume(true) statements. [2021-08-26 01:54:23,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:54:23 BoogieIcfgContainer [2021-08-26 01:54:23,523 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 01:54:23,524 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 01:54:23,524 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 01:54:23,526 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 01:54:23,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 01:54:22" (1/3) ... [2021-08-26 01:54:23,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@242ebdcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 01:54:23, skipping insertion in model container [2021-08-26 01:54:23,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:22" (2/3) ... [2021-08-26 01:54:23,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@242ebdcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 01:54:23, skipping insertion in model container [2021-08-26 01:54:23,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:54:23" (3/3) ... [2021-08-26 01:54:23,528 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1270d.c [2021-08-26 01:54:23,532 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 01:54:23,532 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-26 01:54:23,562 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 01:54:23,566 INFO L339 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=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2021-08-26 01:54:23,566 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-26 01:54:23,578 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 105 states have (on average 1.7142857142857142) internal successors, (180), 106 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:54:23,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-26 01:54:23,582 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:23,582 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:54:23,583 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:23,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:23,587 INFO L82 PathProgramCache]: Analyzing trace with hash 311741284, now seen corresponding path program 1 times [2021-08-26 01:54:23,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 01:54:23,593 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360952373] [2021-08-26 01:54:23,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:23,593 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 01:54:23,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:23,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:54:23,687 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 01:54:23,687 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360952373] [2021-08-26 01:54:23,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360952373] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:23,687 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:23,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-26 01:54:23,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124417376] [2021-08-26 01:54:23,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-26 01:54:23,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 01:54:23,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-26 01:54:23,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 01:54:23,703 INFO L87 Difference]: Start difference. First operand has 107 states, 105 states have (on average 1.7142857142857142) internal successors, (180), 106 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:54:23,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:23,724 INFO L93 Difference]: Finished difference Result 212 states and 358 transitions. [2021-08-26 01:54:23,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-26 01:54:23,725 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-08-26 01:54:23,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:23,731 INFO L225 Difference]: With dead ends: 212 [2021-08-26 01:54:23,732 INFO L226 Difference]: Without dead ends: 104 [2021-08-26 01:54:23,733 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 01:54:23,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-08-26 01:54:23,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-08-26 01:54:23,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.3203883495145632) internal successors, (136), 103 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:54:23,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 136 transitions. [2021-08-26 01:54:23,758 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 136 transitions. Word has length 16 [2021-08-26 01:54:23,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:23,758 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 136 transitions. [2021-08-26 01:54:23,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:54:23,758 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 136 transitions. [2021-08-26 01:54:23,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 01:54:23,759 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:23,759 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:54:23,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 01:54:23,760 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:23,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:23,760 INFO L82 PathProgramCache]: Analyzing trace with hash 2055151297, now seen corresponding path program 1 times [2021-08-26 01:54:23,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 01:54:23,761 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561118058] [2021-08-26 01:54:23,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:23,761 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 01:54:23,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 01:54:23,805 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-26 01:54:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 01:54:23,859 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-26 01:54:23,859 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-26 01:54:23,860 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 01:54:23,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-26 01:54:23,865 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 01:54:23,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 01:54:23 BoogieIcfgContainer [2021-08-26 01:54:23,884 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 01:54:23,884 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 01:54:23,885 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 01:54:23,885 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 01:54:23,885 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:54:23" (3/4) ... [2021-08-26 01:54:23,887 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-26 01:54:23,887 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 01:54:23,889 INFO L168 Benchmark]: Toolchain (without parser) took 1378.31 ms. Allocated memory was 50.3 MB in the beginning and 62.9 MB in the end (delta: 12.6 MB). Free memory was 27.7 MB in the beginning and 27.9 MB in the end (delta: -128.8 kB). Peak memory consumption was 12.5 MB. Max. memory is 16.1 GB. [2021-08-26 01:54:23,889 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 50.3 MB. Free memory was 32.5 MB in the beginning and 32.5 MB in the end (delta: 33.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 01:54:23,889 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.97 ms. Allocated memory was 50.3 MB in the beginning and 62.9 MB in the end (delta: 12.6 MB). Free memory was 27.6 MB in the beginning and 44.5 MB in the end (delta: -16.9 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. [2021-08-26 01:54:23,890 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.47 ms. Allocated memory is still 62.9 MB. Free memory was 44.3 MB in the beginning and 41.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 01:54:23,890 INFO L168 Benchmark]: Boogie Preprocessor took 57.99 ms. Allocated memory is still 62.9 MB. Free memory was 41.5 MB in the beginning and 38.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-26 01:54:23,891 INFO L168 Benchmark]: RCFGBuilder took 597.51 ms. Allocated memory is still 62.9 MB. Free memory was 38.9 MB in the beginning and 40.8 MB in the end (delta: -1.9 MB). Peak memory consumption was 16.4 MB. Max. memory is 16.1 GB. [2021-08-26 01:54:23,891 INFO L168 Benchmark]: TraceAbstraction took 359.82 ms. Allocated memory is still 62.9 MB. Free memory was 40.5 MB in the beginning and 28.2 MB in the end (delta: 12.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 16.1 GB. [2021-08-26 01:54:23,891 INFO L168 Benchmark]: Witness Printer took 2.88 ms. Allocated memory is still 62.9 MB. Free memory was 28.2 MB in the beginning and 27.9 MB in the end (delta: 340.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 01:54:23,893 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 50.3 MB. Free memory was 32.5 MB in the beginning and 32.5 MB in the end (delta: 33.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 296.97 ms. Allocated memory was 50.3 MB in the beginning and 62.9 MB in the end (delta: 12.6 MB). Free memory was 27.6 MB in the beginning and 44.5 MB in the end (delta: -16.9 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 56.47 ms. Allocated memory is still 62.9 MB. Free memory was 44.3 MB in the beginning and 41.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 57.99 ms. Allocated memory is still 62.9 MB. Free memory was 41.5 MB in the beginning and 38.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 597.51 ms. Allocated memory is still 62.9 MB. Free memory was 38.9 MB in the beginning and 40.8 MB in the end (delta: -1.9 MB). Peak memory consumption was 16.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 359.82 ms. Allocated memory is still 62.9 MB. Free memory was 40.5 MB in the beginning and 28.2 MB in the end (delta: 12.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 16.1 GB. * Witness Printer took 2.88 ms. Allocated memory is still 62.9 MB. Free memory was 28.2 MB in the beginning and 27.9 MB in the end (delta: 340.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 236]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticFLOAToperation at line 120, overapproximation of bitwiseAnd at line 220. Possible FailurePath: [L14] static const float one_sqrt = 1.0, tiny_sqrt = 1.0e-30; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L231] float x = __VERIFIER_nondet_float(); [L232] float y = -1.0f / 0.0f; [L84] float a = x, b = y, t1, t2, y1, y2, w; [L85] __int32_t j, k, ha, hb; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L88] ieee_float_shape_type gf_u; [L89] gf_u.value = (x) [L90] EXPR gf_u.word [L90] (ha) = gf_u.word [L92] ha &= 0x7fffffffL VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L94] ieee_float_shape_type gf_u; [L95] gf_u.value = (y) [L96] EXPR gf_u.word [L96] (hb) = gf_u.word [L98] hb &= 0x7fffffffL VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L99] COND FALSE !(hb > ha) [L106] a = x [L107] b = y VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L110] ieee_float_shape_type sf_u; [L111] sf_u.word = (ha) [L112] EXPR sf_u.value [L112] (a) = sf_u.value [L115] ieee_float_shape_type sf_u; [L116] sf_u.word = (hb) [L117] EXPR sf_u.value [L117] (b) = sf_u.value [L119] COND TRUE (ha - hb) > 0xf000000L [L120] return a + b; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L233] float res = __ieee754_hypotf(x, y); [L214] __int32_t ix; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L216] ieee_float_shape_type gf_u; [L217] gf_u.value = (x) [L218] EXPR gf_u.word [L218] (ix) = gf_u.word [L220] ix &= 0x7fffffff [L221] return ((ix) == 0x7f800000L); VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L235] COND TRUE !isinf_float(res) [L236] reach_error() VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 303.4ms, OverallIterations: 2, TraceHistogramMax: 1, EmptinessCheckTime: 7.7ms, AutomataDifference: 40.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 139 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 15.6ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 6.9ms SsaConstructionTime, 54.6ms SatisfiabilityAnalysisTime, 33.9ms InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 15 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-08-26 01:54:23,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 01:54:25,554 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 01:54:25,556 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 01:54:25,594 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 01:54:25,594 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 01:54:25,597 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 01:54:25,598 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 01:54:25,601 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 01:54:25,603 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 01:54:25,606 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 01:54:25,607 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 01:54:25,610 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 01:54:25,610 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 01:54:25,612 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 01:54:25,613 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 01:54:25,616 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 01:54:25,617 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 01:54:25,618 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 01:54:25,619 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 01:54:25,625 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 01:54:25,626 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 01:54:25,626 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 01:54:25,628 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 01:54:25,628 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 01:54:25,633 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 01:54:25,633 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 01:54:25,633 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 01:54:25,634 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 01:54:25,635 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 01:54:25,635 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 01:54:25,635 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 01:54:25,636 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 01:54:25,637 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 01:54:25,638 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 01:54:25,638 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 01:54:25,638 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 01:54:25,639 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 01:54:25,639 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 01:54:25,639 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 01:54:25,640 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 01:54:25,641 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 01:54:25,642 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-08-26 01:54:25,669 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 01:54:25,669 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 01:54:25,670 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 01:54:25,670 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 01:54:25,672 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 01:54:25,672 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 01:54:25,672 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 01:54:25,672 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 01:54:25,672 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 01:54:25,672 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 01:54:25,673 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 01:54:25,673 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 01:54:25,673 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 01:54:25,673 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 01:54:25,674 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-26 01:54:25,674 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-26 01:54:25,674 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 01:54:25,674 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 01:54:25,674 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 01:54:25,674 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 01:54:25,674 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 01:54:25,675 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 01:54:25,675 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 01:54:25,675 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 01:54:25,675 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 01:54:25,675 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 01:54:25,675 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 01:54:25,675 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-26 01:54:25,676 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-26 01:54:25,676 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 01:54:25,676 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 01:54:25,676 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-26 01:54:25,676 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 976f334843509ce61229cfe6c2e95f4ffe1322fa [2021-08-26 01:54:25,918 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 01:54:25,943 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 01:54:25,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 01:54:25,946 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 01:54:25,946 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 01:54:25,947 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1270d.c [2021-08-26 01:54:25,991 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e48e0144/a87a804f50b4408886e528d7d9ad7956/FLAG104f6c904 [2021-08-26 01:54:26,392 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 01:54:26,393 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1270d.c [2021-08-26 01:54:26,399 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e48e0144/a87a804f50b4408886e528d7d9ad7956/FLAG104f6c904 [2021-08-26 01:54:26,411 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e48e0144/a87a804f50b4408886e528d7d9ad7956 [2021-08-26 01:54:26,412 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 01:54:26,413 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 01:54:26,415 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 01:54:26,415 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 01:54:26,418 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 01:54:26,418 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 01:54:26" (1/1) ... [2021-08-26 01:54:26,419 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7deb933a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:26, skipping insertion in model container [2021-08-26 01:54:26,419 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 01:54:26" (1/1) ... [2021-08-26 01:54:26,423 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 01:54:26,446 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 01:54:26,610 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1270d.c[4704,4717] [2021-08-26 01:54:26,654 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 01:54:26,666 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 01:54:26,711 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1270d.c[4704,4717] [2021-08-26 01:54:26,712 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 01:54:26,725 INFO L208 MainTranslator]: Completed translation [2021-08-26 01:54:26,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:26 WrapperNode [2021-08-26 01:54:26,726 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 01:54:26,727 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 01:54:26,727 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 01:54:26,727 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 01:54:26,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:26" (1/1) ... [2021-08-26 01:54:26,754 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:26" (1/1) ... [2021-08-26 01:54:26,782 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 01:54:26,785 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 01:54:26,785 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 01:54:26,785 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 01:54:26,790 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:26" (1/1) ... [2021-08-26 01:54:26,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:26" (1/1) ... [2021-08-26 01:54:26,801 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:26" (1/1) ... [2021-08-26 01:54:26,801 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:26" (1/1) ... [2021-08-26 01:54:26,814 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:26" (1/1) ... [2021-08-26 01:54:26,829 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:26" (1/1) ... [2021-08-26 01:54:26,833 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:26" (1/1) ... [2021-08-26 01:54:26,839 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 01:54:26,842 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 01:54:26,842 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 01:54:26,842 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 01:54:26,843 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:26" (1/1) ... [2021-08-26 01:54:26,847 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 01:54:26,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 01:54:26,884 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-26 01:54:26,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-26 01:54:26,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-26 01:54:26,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 01:54:26,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2021-08-26 01:54:26,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-08-26 01:54:26,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 01:54:26,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 01:54:26,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2021-08-26 01:54:26,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-08-26 01:54:26,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-26 01:54:32,600 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 01:54:32,605 INFO L299 CfgBuilder]: Removed 52 assume(true) statements. [2021-08-26 01:54:32,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:54:32 BoogieIcfgContainer [2021-08-26 01:54:32,607 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 01:54:32,609 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 01:54:32,609 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 01:54:32,611 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 01:54:32,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 01:54:26" (1/3) ... [2021-08-26 01:54:32,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a473893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 01:54:32, skipping insertion in model container [2021-08-26 01:54:32,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:26" (2/3) ... [2021-08-26 01:54:32,612 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a473893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 01:54:32, skipping insertion in model container [2021-08-26 01:54:32,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:54:32" (3/3) ... [2021-08-26 01:54:32,613 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1270d.c [2021-08-26 01:54:32,616 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 01:54:32,617 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-26 01:54:32,657 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 01:54:32,662 INFO L339 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=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2021-08-26 01:54:32,663 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-26 01:54:32,680 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 105 states have (on average 1.7142857142857142) internal successors, (180), 106 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:54:32,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-26 01:54:32,684 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:32,685 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:54:32,686 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:32,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:32,690 INFO L82 PathProgramCache]: Analyzing trace with hash 311741284, now seen corresponding path program 1 times [2021-08-26 01:54:32,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:54:32,698 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1479490587] [2021-08-26 01:54:32,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:32,699 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:54:32,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:54:32,726 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:54:32,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-08-26 01:54:32,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:32,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 1 conjunts are in the unsatisfiable core [2021-08-26 01:54:32,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:54:33,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:54:33,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:54:33,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:54:33,198 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:54:33,198 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1479490587] [2021-08-26 01:54:33,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1479490587] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:33,199 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:33,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-26 01:54:33,200 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330165032] [2021-08-26 01:54:33,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-26 01:54:33,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:54:33,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-26 01:54:33,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 01:54:33,213 INFO L87 Difference]: Start difference. First operand has 107 states, 105 states have (on average 1.7142857142857142) internal successors, (180), 106 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:54:33,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:33,230 INFO L93 Difference]: Finished difference Result 212 states and 358 transitions. [2021-08-26 01:54:33,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-26 01:54:33,231 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-08-26 01:54:33,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:33,237 INFO L225 Difference]: With dead ends: 212 [2021-08-26 01:54:33,237 INFO L226 Difference]: Without dead ends: 104 [2021-08-26 01:54:33,239 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 01:54:33,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-08-26 01:54:33,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-08-26 01:54:33,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.3203883495145632) internal successors, (136), 103 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:54:33,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 136 transitions. [2021-08-26 01:54:33,263 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 136 transitions. Word has length 16 [2021-08-26 01:54:33,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:33,264 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 136 transitions. [2021-08-26 01:54:33,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:54:33,264 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 136 transitions. [2021-08-26 01:54:33,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 01:54:33,265 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:33,265 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:54:33,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-08-26 01:54:33,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:54:33,474 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:33,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:33,475 INFO L82 PathProgramCache]: Analyzing trace with hash 2055151297, now seen corresponding path program 1 times [2021-08-26 01:54:33,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:54:33,476 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2019077974] [2021-08-26 01:54:33,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:33,476 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:54:33,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:54:33,477 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:54:33,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-08-26 01:54:33,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:33,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-26 01:54:33,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:54:34,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:54:34,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:54:35,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:54:35,661 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:54:35,661 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2019077974] [2021-08-26 01:54:35,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2019077974] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:35,662 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:35,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2021-08-26 01:54:35,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065603260] [2021-08-26 01:54:35,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-26 01:54:35,663 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:54:35,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-26 01:54:35,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-08-26 01:54:35,664 INFO L87 Difference]: Start difference. First operand 104 states and 136 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:54:37,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:37,837 INFO L93 Difference]: Finished difference Result 444 states and 576 transitions. [2021-08-26 01:54:37,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-26 01:54:37,839 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-26 01:54:37,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:37,845 INFO L225 Difference]: With dead ends: 444 [2021-08-26 01:54:37,845 INFO L226 Difference]: Without dead ends: 358 [2021-08-26 01:54:37,847 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1645.9ms TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2021-08-26 01:54:37,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2021-08-26 01:54:37,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 113. [2021-08-26 01:54:37,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.3035714285714286) internal successors, (146), 112 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:54:37,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 146 transitions. [2021-08-26 01:54:37,889 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 146 transitions. Word has length 21 [2021-08-26 01:54:37,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:37,889 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 146 transitions. [2021-08-26 01:54:37,889 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:54:37,889 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 146 transitions. [2021-08-26 01:54:37,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 01:54:37,891 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:37,891 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:54:37,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-08-26 01:54:38,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:54:38,102 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:38,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:38,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1653009985, now seen corresponding path program 1 times [2021-08-26 01:54:38,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:54:38,103 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1282619402] [2021-08-26 01:54:38,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:38,103 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:54:38,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:54:38,105 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:54:38,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-08-26 01:54:38,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:38,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 28 conjunts are in the unsatisfiable core [2021-08-26 01:54:38,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:54:38,564 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2021-08-26 01:54:38,990 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-08-26 01:54:38,990 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 60 [2021-08-26 01:54:39,260 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-08-26 01:54:39,261 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 52 [2021-08-26 01:54:40,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 59 [2021-08-26 01:54:43,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:54:43,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:55:03,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:55:03,840 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:55:03,840 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1282619402] [2021-08-26 01:55:03,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1282619402] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:55:03,840 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:55:03,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14, 14] imperfect sequences [] total 27 [2021-08-26 01:55:03,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10773877] [2021-08-26 01:55:03,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-08-26 01:55:03,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:55:03,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-08-26 01:55:03,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2021-08-26 01:55:03,841 INFO L87 Difference]: Start difference. First operand 113 states and 146 transitions. Second operand has 27 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 27 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:55:33,264 WARN L207 SmtUtils]: Spent 22.30 s on a formula simplification that was a NOOP. DAG size: 83 [2021-08-26 01:55:55,472 WARN L207 SmtUtils]: Spent 8.37 s on a formula simplification. DAG size of input: 98 DAG size of output: 96 [2021-08-26 01:56:05,338 WARN L207 SmtUtils]: Spent 6.03 s on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2021-08-26 01:56:14,434 WARN L207 SmtUtils]: Spent 6.53 s on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2021-08-26 01:56:14,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:56:14,725 INFO L93 Difference]: Finished difference Result 135 states and 168 transitions. [2021-08-26 01:56:14,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-26 01:56:14,729 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 27 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-26 01:56:14,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:56:14,729 INFO L225 Difference]: With dead ends: 135 [2021-08-26 01:56:14,729 INFO L226 Difference]: Without dead ends: 42 [2021-08-26 01:56:14,730 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 76176.5ms TimeCoverageRelationStatistics Valid=282, Invalid=1199, Unknown=1, NotChecked=0, Total=1482 [2021-08-26 01:56:14,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-08-26 01:56:14,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2021-08-26 01:56:14,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:56:14,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2021-08-26 01:56:14,732 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 21 [2021-08-26 01:56:14,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:56:14,733 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2021-08-26 01:56:14,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 27 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:56:14,733 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2021-08-26 01:56:14,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-26 01:56:14,733 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:56:14,733 INFO L512 BasicCegarLoop]: 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] [2021-08-26 01:56:14,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-08-26 01:56:14,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:56:14,944 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:56:14,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:56:14,944 INFO L82 PathProgramCache]: Analyzing trace with hash -558668800, now seen corresponding path program 1 times [2021-08-26 01:56:14,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:56:14,944 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2140975003] [2021-08-26 01:56:14,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:56:14,945 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:56:14,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:56:14,946 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:56:14,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-08-26 01:56:15,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:56:15,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 21 conjunts are in the unsatisfiable core [2021-08-26 01:56:15,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:56:15,517 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2021-08-26 01:56:16,615 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 36 [2021-08-26 01:56:17,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:56:17,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:56:20,695 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_isinf_float_~ix~1_17 (_ BitVec 32))) (or (= (bvand (_ bv2147483647 32) v_ULTIMATE.start_isinf_float_~ix~1_17) (_ bv2139095040 32)) (not (= (fp ((_ extract 31 31) v_ULTIMATE.start_isinf_float_~ix~1_17) ((_ extract 30 23) v_ULTIMATE.start_isinf_float_~ix~1_17) ((_ extract 22 0) v_ULTIMATE.start_isinf_float_~ix~1_17)) (let ((.cse0 (bvand (_ bv2147483647 32) c_ULTIMATE.start___ieee754_hypotf_~hb~0))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))))) is different from false [2021-08-26 01:56:22,773 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_isinf_float_~ix~1_17 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_14| (_ BitVec 32))) (or (not (= (let ((.cse0 (bvand (_ bv2147483647 32) |v_skolemized_q#valueAsBitvector_14|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp ((_ extract 31 31) v_ULTIMATE.start_isinf_float_~ix~1_17) ((_ extract 30 23) v_ULTIMATE.start_isinf_float_~ix~1_17) ((_ extract 22 0) v_ULTIMATE.start_isinf_float_~ix~1_17)))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start_isinf_float_~ix~1_17) (_ bv2139095040 32)) (not (= (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_14|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_14|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_14|)) c_ULTIMATE.start___ieee754_hypotf_~y)))) is different from false [2021-08-26 01:56:22,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:56:22,943 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:56:22,943 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2140975003] [2021-08-26 01:56:22,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2140975003] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:56:22,943 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:56:22,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 22 [2021-08-26 01:56:22,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487232355] [2021-08-26 01:56:22,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-08-26 01:56:22,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:56:22,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-08-26 01:56:22,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=336, Unknown=2, NotChecked=74, Total=462 [2021-08-26 01:56:22,944 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 22 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:56:26,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:56:26,155 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2021-08-26 01:56:26,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-26 01:56:26,156 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-08-26 01:56:26,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:56:26,156 INFO L225 Difference]: With dead ends: 54 [2021-08-26 01:56:26,156 INFO L226 Difference]: Without dead ends: 36 [2021-08-26 01:56:26,157 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 8112.8ms TimeCoverageRelationStatistics Valid=207, Invalid=729, Unknown=2, NotChecked=118, Total=1056 [2021-08-26 01:56:26,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-08-26 01:56:26,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2021-08-26 01:56:26,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:56:26,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2021-08-26 01:56:26,159 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 26 [2021-08-26 01:56:26,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:56:26,159 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2021-08-26 01:56:26,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:56:26,159 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2021-08-26 01:56:26,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-26 01:56:26,159 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:56:26,159 INFO L512 BasicCegarLoop]: 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] [2021-08-26 01:56:26,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-08-26 01:56:26,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:56:26,365 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:56:26,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:56:26,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1435475906, now seen corresponding path program 1 times [2021-08-26 01:56:26,366 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:56:26,366 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [721697795] [2021-08-26 01:56:26,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:56:26,366 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:56:26,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:56:26,367 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:56:26,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-08-26 01:56:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:56:26,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-26 01:56:26,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:56:27,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:56:27,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:56:28,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:56:28,604 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:56:28,604 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [721697795] [2021-08-26 01:56:28,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [721697795] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:56:28,604 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:56:28,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2021-08-26 01:56:28,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917606461] [2021-08-26 01:56:28,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-26 01:56:28,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:56:28,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-26 01:56:28,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-08-26 01:56:28,605 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:56:29,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:56:29,173 INFO L93 Difference]: Finished difference Result 36 states and 35 transitions. [2021-08-26 01:56:29,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 01:56:29,173 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-08-26 01:56:29,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:56:29,174 INFO L225 Difference]: With dead ends: 36 [2021-08-26 01:56:29,174 INFO L226 Difference]: Without dead ends: 27 [2021-08-26 01:56:29,174 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1025.1ms TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-08-26 01:56:29,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-08-26 01:56:29,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-08-26 01:56:29,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0) internal successors, (26), 26 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:56:29,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 26 transitions. [2021-08-26 01:56:29,176 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 26 transitions. Word has length 26 [2021-08-26 01:56:29,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:56:29,176 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 26 transitions. [2021-08-26 01:56:29,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:56:29,176 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2021-08-26 01:56:29,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-26 01:56:29,177 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:56:29,177 INFO L512 BasicCegarLoop]: 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] [2021-08-26 01:56:29,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-08-26 01:56:29,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:56:29,387 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:56:29,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:56:29,387 INFO L82 PathProgramCache]: Analyzing trace with hash 2115534276, now seen corresponding path program 1 times [2021-08-26 01:56:29,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:56:29,388 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [129705373] [2021-08-26 01:56:29,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:56:29,388 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:56:29,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:56:29,389 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:56:29,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-08-26 01:56:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:56:29,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 22 conjunts are in the unsatisfiable core [2021-08-26 01:56:29,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:56:29,694 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2021-08-26 01:56:29,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 31 [2021-08-26 01:56:31,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:56:31,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:56:35,068 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_18| (_ BitVec 32))) (or (not (= (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_18|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_18|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_18|)) (let ((.cse0 (bvand (_ bv2147483647 32) c_ULTIMATE.start___ieee754_hypotf_~hb~0))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))) (= (bvand (_ bv2147483647 32) |v_skolemized_q#valueAsBitvector_18|) (_ bv2139095040 32)))) is different from false [2021-08-26 01:57:15,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:57:15,538 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:57:15,539 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [129705373] [2021-08-26 01:57:15,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [129705373] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:57:15,539 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:57:15,539 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13, 13] imperfect sequences [] total 24 [2021-08-26 01:57:15,539 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072357001] [2021-08-26 01:57:15,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-08-26 01:57:15,539 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:57:15,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-08-26 01:57:15,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=435, Unknown=19, NotChecked=42, Total=552 [2021-08-26 01:57:15,541 INFO L87 Difference]: Start difference. First operand 27 states and 26 transitions. Second operand has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:57:32,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:57:32,691 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2021-08-26 01:57:32,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-26 01:57:32,691 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-08-26 01:57:32,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:57:32,692 INFO L225 Difference]: With dead ends: 27 [2021-08-26 01:57:32,692 INFO L226 Difference]: Without dead ends: 0 [2021-08-26 01:57:32,692 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 60797.1ms TimeCoverageRelationStatistics Valid=187, Invalid=847, Unknown=26, NotChecked=62, Total=1122 [2021-08-26 01:57:32,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-26 01:57:32,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-26 01:57:32,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:57:32,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-26 01:57:32,692 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2021-08-26 01:57:32,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:57:32,693 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-26 01:57:32,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:57:32,693 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-26 01:57:32,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-26 01:57:32,695 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 01:57:32,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-08-26 01:57:32,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:57:32,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-26 01:57:32,906 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:57:33,078 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:57:33,079 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:57:33,080 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:57:33,106 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:57:33,107 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:57:33,108 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:57:33,109 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:57:33,109 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:57:33,110 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:57:33,129 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:57:33,130 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:57:33,130 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:57:33,131 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:57:33,131 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:57:33,132 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:57:33,133 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:57:33,133 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:57:33,134 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:57:33,134 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:57:33,135 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:57:33,135 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:57:33,135 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:58:07,666 WARN L207 SmtUtils]: Spent 34.53 s on a formula simplification. DAG size of input: 263 DAG size of output: 198 [2021-08-26 02:00:15,203 WARN L207 SmtUtils]: Spent 2.13 m on a formula simplification. DAG size of input: 252 DAG size of output: 213 [2021-08-26 02:02:09,834 WARN L207 SmtUtils]: Spent 1.91 m on a formula simplification. DAG size of input: 242 DAG size of output: 203 [2021-08-26 02:02:10,025 INFO L857 garLoopResultBuilder]: For program point L168(lines 168 172) no Hoare annotation was computed. [2021-08-26 02:02:10,025 INFO L857 garLoopResultBuilder]: For program point L168-1(lines 159 173) no Hoare annotation was computed. [2021-08-26 02:02:10,025 INFO L857 garLoopResultBuilder]: For program point L235(lines 235 238) no Hoare annotation was computed. [2021-08-26 02:02:10,025 INFO L857 garLoopResultBuilder]: For program point L202-1(lines 202 206) no Hoare annotation was computed. [2021-08-26 02:02:10,025 INFO L853 garLoopResultBuilder]: At program point L202-2(lines 202 206) the Hoare annotation is: false [2021-08-26 02:02:10,025 INFO L857 garLoopResultBuilder]: For program point L136-1(lines 136 140) no Hoare annotation was computed. [2021-08-26 02:02:10,026 INFO L857 garLoopResultBuilder]: For program point L202-3(lines 202 206) no Hoare annotation was computed. [2021-08-26 02:02:10,026 INFO L853 garLoopResultBuilder]: At program point L136-2(lines 136 140) the Hoare annotation is: false [2021-08-26 02:02:10,026 INFO L857 garLoopResultBuilder]: For program point L37(lines 37 41) no Hoare annotation was computed. [2021-08-26 02:02:10,026 INFO L857 garLoopResultBuilder]: For program point L37-2(lines 37 41) no Hoare annotation was computed. [2021-08-26 02:02:10,026 INFO L857 garLoopResultBuilder]: For program point L37-3(lines 37 41) no Hoare annotation was computed. [2021-08-26 02:02:10,026 INFO L857 garLoopResultBuilder]: For program point L37-5(lines 37 41) no Hoare annotation was computed. [2021-08-26 02:02:10,026 INFO L857 garLoopResultBuilder]: For program point L236(line 236) no Hoare annotation was computed. [2021-08-26 02:02:10,026 INFO L857 garLoopResultBuilder]: For program point L38-2(lines 38 39) no Hoare annotation was computed. [2021-08-26 02:02:10,026 INFO L853 garLoopResultBuilder]: At program point L38-3(lines 38 39) the Hoare annotation is: false [2021-08-26 02:02:10,026 INFO L857 garLoopResultBuilder]: For program point L38-4(lines 38 39) no Hoare annotation was computed. [2021-08-26 02:02:10,026 INFO L857 garLoopResultBuilder]: For program point L38-7(lines 38 39) no Hoare annotation was computed. [2021-08-26 02:02:10,026 INFO L853 garLoopResultBuilder]: At program point L38-8(lines 38 39) the Hoare annotation is: false [2021-08-26 02:02:10,026 INFO L857 garLoopResultBuilder]: For program point L38-9(lines 38 39) no Hoare annotation was computed. [2021-08-26 02:02:10,026 INFO L860 garLoopResultBuilder]: At program point L239(lines 224 240) the Hoare annotation is: true [2021-08-26 02:02:10,026 INFO L857 garLoopResultBuilder]: For program point L141(lines 141 145) no Hoare annotation was computed. [2021-08-26 02:02:10,026 INFO L857 garLoopResultBuilder]: For program point L141-1(lines 123 146) no Hoare annotation was computed. [2021-08-26 02:02:10,026 INFO L857 garLoopResultBuilder]: For program point L75-1(lines 75 79) no Hoare annotation was computed. [2021-08-26 02:02:10,026 INFO L853 garLoopResultBuilder]: At program point L75-2(lines 75 79) the Hoare annotation is: false [2021-08-26 02:02:10,026 INFO L857 garLoopResultBuilder]: For program point L75-3(lines 75 79) no Hoare annotation was computed. [2021-08-26 02:02:10,027 INFO L857 garLoopResultBuilder]: For program point L75-5(lines 75 79) no Hoare annotation was computed. [2021-08-26 02:02:10,027 INFO L853 garLoopResultBuilder]: At program point L75-6(lines 75 79) the Hoare annotation is: false [2021-08-26 02:02:10,027 INFO L857 garLoopResultBuilder]: For program point L75-7(lines 75 79) no Hoare annotation was computed. [2021-08-26 02:02:10,027 INFO L857 garLoopResultBuilder]: For program point L109(lines 109 113) no Hoare annotation was computed. [2021-08-26 02:02:10,027 INFO L857 garLoopResultBuilder]: For program point L109-1(lines 83 210) no Hoare annotation was computed. [2021-08-26 02:02:10,027 INFO L853 garLoopResultBuilder]: At program point L209(lines 83 210) the Hoare annotation is: (let ((.cse20 (not (bvsgt (bvadd ULTIMATE.start___ieee754_hypotf_~ha~0 (bvneg ULTIMATE.start___ieee754_hypotf_~hb~0)) (_ bv251658240 32)))) (.cse18 (bvneg ULTIMATE.start___ieee754_hypotf_~ha~0))) (let ((.cse1 (or (forall ((|v_skolemized_q#valueAsBitvector_13| (_ BitVec 32))) (or (= (bvand (_ bv2147483647 32) |v_skolemized_q#valueAsBitvector_13|) (_ bv2139095040 32)) (not (= (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_13|)) (fp.add currentRoundingMode (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0)) (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0))))))) (not (bvsgt (bvadd ULTIMATE.start___ieee754_hypotf_~hb~0 .cse18) (_ bv251658240 32))))) (.cse2 (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) ULTIMATE.start___ieee754_hypotf_~ha~0))) (.cse4 (or .cse20 (forall ((|v_skolemized_q#valueAsBitvector_13| (_ BitVec 32))) (or (= (bvand (_ bv2147483647 32) |v_skolemized_q#valueAsBitvector_13|) (_ bv2139095040 32)) (not (= (fp.add currentRoundingMode ULTIMATE.start___ieee754_hypotf_~a~0 ULTIMATE.start___ieee754_hypotf_~b~0) (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_13|)))))))) (.cse5 (or .cse20 (forall ((|v_skolemized_q#valueAsBitvector_13| (_ BitVec 32))) (or (= (bvand (_ bv2147483647 32) |v_skolemized_q#valueAsBitvector_13|) (_ bv2139095040 32)) (not (= (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_13|)) (fp.add currentRoundingMode (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)) (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0))))))))) (.cse7 (= ULTIMATE.start___ieee754_hypotf_~y (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)))) (.cse8 (or .cse20 (forall ((|v_skolemized_q#valueAsBitvector_13| (_ BitVec 32))) (or (= (bvand (_ bv2147483647 32) |v_skolemized_q#valueAsBitvector_13|) (_ bv2139095040 32)) (not (= (fp.add currentRoundingMode ULTIMATE.start___ieee754_hypotf_~a~0 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0))) (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_13|)))))))) (.cse9 (= currentRoundingMode roundNearestTiesToEven)) (.cse10 (or (not (bvsgt (bvadd (bvand (_ bv2147483647 32) ULTIMATE.start___ieee754_hypotf_~hb~0) .cse18) (_ bv251658240 32))) (forall ((|v_skolemized_q#valueAsBitvector_13| (_ BitVec 32))) (or (= (bvand (_ bv2147483647 32) |v_skolemized_q#valueAsBitvector_13|) (_ bv2139095040 32)) (not (= (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_13|)) (fp.add currentRoundingMode (let ((.cse19 (bvand (_ bv2147483647 32) ULTIMATE.start___ieee754_hypotf_~hb~0))) (fp ((_ extract 31 31) .cse19) ((_ extract 30 23) .cse19) ((_ extract 22 0) .cse19))) (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)))))))))) (or (and (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32)) (|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_10| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_10|) (_ bv0 32)))) (and (= ULTIMATE.start___ieee754_hypotf_~b~0 (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) .cse0) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37)))))) .cse1 .cse2 (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ULTIMATE.start___ieee754_hypotf_~hb~0) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37)))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32)) (|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_10| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse3 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_10|) (_ bv0 32)))) (and (= |ULTIMATE.start___ieee754_hypotf_#res| (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) .cse3) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37)))))) .cse4 .cse5 (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32)) (|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_10| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse6 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_10|) (_ bv0 32)))) (and (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) .cse6) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))) (= ULTIMATE.start___ieee754_hypotf_~w~0 (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))))) .cse7 .cse8 .cse9 .cse10) (and (exists ((v_arrayElimCell_1 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))) (= (bvand (_ bv2147483647 32) v_arrayElimCell_1) ULTIMATE.start___ieee754_hypotf_~ha~0))) (exists ((|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_7| (_ BitVec 32))) (let ((.cse11 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_7|) (_ bv0 32)))) (and (= ULTIMATE.start___ieee754_hypotf_~hb~0 .cse11) (= ULTIMATE.start___ieee754_hypotf_~b~0 (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) ULTIMATE.start___ieee754_hypotf_~hb~0)) .cse7 (= (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)) ULTIMATE.start___ieee754_hypotf_~a~0) .cse9 (exists ((v_arrayElimCell_1 (_ BitVec 32)) (v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32)) (|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_7| (_ BitVec 32))) (let ((.cse12 (bvand (_ bv2147483647 32) v_arrayElimCell_1)) (.cse13 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_7|) (_ bv0 32)))) (and (bvsgt (bvadd .cse12 (bvneg .cse13)) (_ bv251658240 32)) (= |ULTIMATE.start___ieee754_hypotf_#res| (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12)) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13)))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) .cse13) (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))))))) (and (exists ((v_arrayElimCell_5 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= |ULTIMATE.start___ieee754_hypotf_#res| (let ((.cse14 (bvand (_ bv2147483647 32) v_arrayElimCell_5))) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14)))) (= (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))) .cse1 .cse2 (forall ((|v_skolemized_q#valueAsBitvector_18| (_ BitVec 32))) (or (not (= (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)) (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_18|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_18|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_18|)))) (= (bvand (_ bv2147483647 32) |v_skolemized_q#valueAsBitvector_18|) (_ bv2139095040 32)))) .cse4 (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_39 (_ BitVec 32)) (v_ULTIMATE.start___ieee754_hypotf_~hb~0_41 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse15 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_39))) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_41) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_41) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_41))) (= .cse15 ULTIMATE.start___ieee754_hypotf_~hb~0) (bvsgt (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_41) .cse15)))) .cse5 (exists ((v_arrayElimCell_5 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))) (= ULTIMATE.start___ieee754_hypotf_~w~0 (let ((.cse16 (bvand (_ bv2147483647 32) v_arrayElimCell_5))) (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16)))))) (exists ((v_arrayElimCell_5 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))) (= ULTIMATE.start___ieee754_hypotf_~a~0 (let ((.cse17 (bvand (_ bv2147483647 32) v_arrayElimCell_5))) (fp ((_ extract 31 31) .cse17) ((_ extract 30 23) .cse17) ((_ extract 22 0) .cse17)))))) .cse7 .cse8 .cse9 .cse10)))) [2021-08-26 02:02:10,027 INFO L857 garLoopResultBuilder]: For program point L44(lines 44 45) no Hoare annotation was computed. [2021-08-26 02:02:10,027 INFO L857 garLoopResultBuilder]: For program point L44-2(lines 44 45) no Hoare annotation was computed. [2021-08-26 02:02:10,027 INFO L857 garLoopResultBuilder]: For program point L44-3(lines 44 45) no Hoare annotation was computed. [2021-08-26 02:02:10,027 INFO L857 garLoopResultBuilder]: For program point L44-5(lines 44 45) no Hoare annotation was computed. [2021-08-26 02:02:10,027 INFO L857 garLoopResultBuilder]: For program point L177(lines 177 200) no Hoare annotation was computed. [2021-08-26 02:02:10,027 INFO L857 garLoopResultBuilder]: For program point L177-2(lines 83 210) no Hoare annotation was computed. [2021-08-26 02:02:10,027 INFO L857 garLoopResultBuilder]: For program point L178-1(lines 178 182) no Hoare annotation was computed. [2021-08-26 02:02:10,028 INFO L853 garLoopResultBuilder]: At program point L178-2(lines 178 182) the Hoare annotation is: false [2021-08-26 02:02:10,028 INFO L857 garLoopResultBuilder]: For program point L178-3(lines 178 182) no Hoare annotation was computed. [2021-08-26 02:02:10,028 INFO L853 garLoopResultBuilder]: At program point L80(lines 16 81) the Hoare annotation is: false [2021-08-26 02:02:10,028 INFO L853 garLoopResultBuilder]: At program point L80-1(lines 16 81) the Hoare annotation is: false [2021-08-26 02:02:10,028 INFO L857 garLoopResultBuilder]: For program point L147(lines 147 174) no Hoare annotation was computed. [2021-08-26 02:02:10,028 INFO L857 garLoopResultBuilder]: For program point L114(lines 114 118) no Hoare annotation was computed. [2021-08-26 02:02:10,028 INFO L857 garLoopResultBuilder]: For program point L114-1(lines 83 210) no Hoare annotation was computed. [2021-08-26 02:02:10,028 INFO L857 garLoopResultBuilder]: For program point L114-2(lines 83 210) no Hoare annotation was computed. [2021-08-26 02:02:10,028 INFO L857 garLoopResultBuilder]: For program point L148(lines 148 173) no Hoare annotation was computed. [2021-08-26 02:02:10,028 INFO L857 garLoopResultBuilder]: For program point L215-1(lines 215 219) no Hoare annotation was computed. [2021-08-26 02:02:10,028 INFO L853 garLoopResultBuilder]: At program point L215-2(lines 215 219) the Hoare annotation is: (let ((.cse24 (not (bvsgt (bvadd ULTIMATE.start___ieee754_hypotf_~ha~0 (bvneg ULTIMATE.start___ieee754_hypotf_~hb~0)) (_ bv251658240 32)))) (.cse22 (bvneg ULTIMATE.start___ieee754_hypotf_~ha~0))) (let ((.cse8 (or (forall ((|v_skolemized_q#valueAsBitvector_13| (_ BitVec 32))) (or (= (bvand (_ bv2147483647 32) |v_skolemized_q#valueAsBitvector_13|) (_ bv2139095040 32)) (not (= (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_13|)) (fp.add currentRoundingMode (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0)) (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0))))))) (not (bvsgt (bvadd ULTIMATE.start___ieee754_hypotf_~hb~0 .cse22) (_ bv251658240 32))))) (.cse9 (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) ULTIMATE.start___ieee754_hypotf_~ha~0))) (.cse11 (or .cse24 (forall ((|v_skolemized_q#valueAsBitvector_13| (_ BitVec 32))) (or (= (bvand (_ bv2147483647 32) |v_skolemized_q#valueAsBitvector_13|) (_ bv2139095040 32)) (not (= (fp.add currentRoundingMode ULTIMATE.start___ieee754_hypotf_~a~0 ULTIMATE.start___ieee754_hypotf_~b~0) (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_13|)))))))) (.cse13 (or .cse24 (forall ((|v_skolemized_q#valueAsBitvector_13| (_ BitVec 32))) (or (= (bvand (_ bv2147483647 32) |v_skolemized_q#valueAsBitvector_13|) (_ bv2139095040 32)) (not (= (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_13|)) (fp.add currentRoundingMode (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)) (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0))))))))) (.cse3 (= ULTIMATE.start___ieee754_hypotf_~y (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)))) (.cse16 (or .cse24 (forall ((|v_skolemized_q#valueAsBitvector_13| (_ BitVec 32))) (or (= (bvand (_ bv2147483647 32) |v_skolemized_q#valueAsBitvector_13|) (_ bv2139095040 32)) (not (= (fp.add currentRoundingMode ULTIMATE.start___ieee754_hypotf_~a~0 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0))) (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_13|)))))))) (.cse4 (= currentRoundingMode roundNearestTiesToEven)) (.cse17 (or (not (bvsgt (bvadd (bvand (_ bv2147483647 32) ULTIMATE.start___ieee754_hypotf_~hb~0) .cse22) (_ bv251658240 32))) (forall ((|v_skolemized_q#valueAsBitvector_13| (_ BitVec 32))) (or (= (bvand (_ bv2147483647 32) |v_skolemized_q#valueAsBitvector_13|) (_ bv2139095040 32)) (not (= (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_13|)) (fp.add currentRoundingMode (let ((.cse23 (bvand (_ bv2147483647 32) ULTIMATE.start___ieee754_hypotf_~hb~0))) (fp ((_ extract 31 31) .cse23) ((_ extract 30 23) .cse23) ((_ extract 22 0) .cse23))) (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)))))))))) (or (and (exists ((v_arrayElimCell_1 (_ BitVec 32)) (v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32)) (|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_7| (_ BitVec 32))) (let ((.cse0 (bvand (_ bv2147483647 32) v_arrayElimCell_1)) (.cse1 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_7|) (_ bv0 32)))) (and (bvsgt (bvadd .cse0 (bvneg .cse1)) (_ bv251658240 32)) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) .cse1) (= ULTIMATE.start_isinf_float_~x (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))) (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)))))) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))) (= (bvand (_ bv2147483647 32) v_arrayElimCell_1) ULTIMATE.start___ieee754_hypotf_~ha~0))) (exists ((|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_7| (_ BitVec 32))) (let ((.cse2 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_7|) (_ bv0 32)))) (and (= ULTIMATE.start___ieee754_hypotf_~hb~0 .cse2) (= ULTIMATE.start___ieee754_hypotf_~b~0 (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) ULTIMATE.start___ieee754_hypotf_~hb~0)) .cse3 (= (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)) ULTIMATE.start___ieee754_hypotf_~a~0) .cse4 (exists ((v_arrayElimCell_1 (_ BitVec 32)) (v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32)) (|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_7| (_ BitVec 32))) (let ((.cse5 (bvand (_ bv2147483647 32) v_arrayElimCell_1)) (.cse6 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_7|) (_ bv0 32)))) (and (bvsgt (bvadd .cse5 (bvneg .cse6)) (_ bv251658240 32)) (= |ULTIMATE.start___ieee754_hypotf_#res| (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5)) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) .cse6) (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))))))) (and (exists ((v_arrayElimCell_5 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= |ULTIMATE.start___ieee754_hypotf_#res| (let ((.cse7 (bvand (_ bv2147483647 32) v_arrayElimCell_5))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7)))) (= (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))) .cse8 .cse9 (exists ((v_arrayElimCell_5 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))) (= (let ((.cse10 (bvand (_ bv2147483647 32) v_arrayElimCell_5))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))) ULTIMATE.start_isinf_float_~x))) (forall ((|v_skolemized_q#valueAsBitvector_18| (_ BitVec 32))) (or (not (= (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)) (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_18|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_18|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_18|)))) (= (bvand (_ bv2147483647 32) |v_skolemized_q#valueAsBitvector_18|) (_ bv2139095040 32)))) .cse11 (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_39 (_ BitVec 32)) (v_ULTIMATE.start___ieee754_hypotf_~hb~0_41 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse12 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_39))) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_41) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_41) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_41))) (= .cse12 ULTIMATE.start___ieee754_hypotf_~hb~0) (bvsgt (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_41) .cse12)))) .cse13 (exists ((v_arrayElimCell_5 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))) (= ULTIMATE.start___ieee754_hypotf_~w~0 (let ((.cse14 (bvand (_ bv2147483647 32) v_arrayElimCell_5))) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14)))))) (exists ((v_arrayElimCell_5 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))) (= ULTIMATE.start___ieee754_hypotf_~a~0 (let ((.cse15 (bvand (_ bv2147483647 32) v_arrayElimCell_5))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))))) .cse3 .cse16 .cse4 .cse17) (and (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32)) (|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_10| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse18 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_10|) (_ bv0 32)))) (and (= ULTIMATE.start___ieee754_hypotf_~b~0 (fp ((_ extract 31 31) .cse18) ((_ extract 30 23) .cse18) ((_ extract 22 0) .cse18))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) .cse18) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37)))))) .cse8 .cse9 (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ULTIMATE.start___ieee754_hypotf_~hb~0) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37)))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32)) (|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_10| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse19 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_10|) (_ bv0 32)))) (and (= |ULTIMATE.start___ieee754_hypotf_#res| (fp ((_ extract 31 31) .cse19) ((_ extract 30 23) .cse19) ((_ extract 22 0) .cse19))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) .cse19) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37)))))) .cse11 .cse13 (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32)) (|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_10| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse20 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_10|) (_ bv0 32)))) (and (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) .cse20) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))) (= ULTIMATE.start___ieee754_hypotf_~w~0 (fp ((_ extract 31 31) .cse20) ((_ extract 30 23) .cse20) ((_ extract 22 0) .cse20)))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32)) (|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_10| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse21 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_10|) (_ bv0 32)))) (and (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) .cse21) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))) (= (fp ((_ extract 31 31) .cse21) ((_ extract 30 23) .cse21) ((_ extract 22 0) .cse21)) ULTIMATE.start_isinf_float_~x)))) .cse3 .cse16 .cse4 .cse17)))) [2021-08-26 02:02:10,028 INFO L857 garLoopResultBuilder]: For program point L215-3(lines 215 219) no Hoare annotation was computed. [2021-08-26 02:02:10,029 INFO L857 garLoopResultBuilder]: For program point L150(lines 150 173) no Hoare annotation was computed. [2021-08-26 02:02:10,029 INFO L857 garLoopResultBuilder]: For program point L151-1(lines 151 155) no Hoare annotation was computed. [2021-08-26 02:02:10,029 INFO L853 garLoopResultBuilder]: At program point L151-2(lines 151 155) the Hoare annotation is: false [2021-08-26 02:02:10,029 INFO L857 garLoopResultBuilder]: For program point L151-3(lines 151 155) no Hoare annotation was computed. [2021-08-26 02:02:10,029 INFO L853 garLoopResultBuilder]: At program point L52-2(lines 52 61) the Hoare annotation is: false [2021-08-26 02:02:10,029 INFO L857 garLoopResultBuilder]: For program point L52-3(lines 16 81) no Hoare annotation was computed. [2021-08-26 02:02:10,029 INFO L853 garLoopResultBuilder]: At program point L52-6(lines 52 61) the Hoare annotation is: false [2021-08-26 02:02:10,029 INFO L857 garLoopResultBuilder]: For program point L52-7(lines 16 81) no Hoare annotation was computed. [2021-08-26 02:02:10,029 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-26 02:02:10,029 INFO L857 garLoopResultBuilder]: For program point L87-1(lines 87 91) no Hoare annotation was computed. [2021-08-26 02:02:10,029 INFO L857 garLoopResultBuilder]: For program point L54(lines 54 58) no Hoare annotation was computed. [2021-08-26 02:02:10,029 INFO L853 garLoopResultBuilder]: At program point L87-2(lines 87 91) the Hoare annotation is: (and (forall ((v_ULTIMATE.start_isinf_float_~ix~1_17 (_ BitVec 32))) (or (= (bvand (_ bv2147483647 32) v_ULTIMATE.start_isinf_float_~ix~1_17) (_ bv2139095040 32)) (not (= ULTIMATE.start___ieee754_hypotf_~b~0 (fp ((_ extract 31 31) v_ULTIMATE.start_isinf_float_~ix~1_17) ((_ extract 30 23) v_ULTIMATE.start_isinf_float_~ix~1_17) ((_ extract 22 0) v_ULTIMATE.start_isinf_float_~ix~1_17)))))) (exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start___ieee754_hypotf_~y (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)))) (= currentRoundingMode roundNearestTiesToEven)) [2021-08-26 02:02:10,029 INFO L857 garLoopResultBuilder]: For program point L87-3(lines 87 91) no Hoare annotation was computed. [2021-08-26 02:02:10,029 INFO L857 garLoopResultBuilder]: For program point L21-1(lines 21 25) no Hoare annotation was computed. [2021-08-26 02:02:10,029 INFO L857 garLoopResultBuilder]: For program point L54-2(lines 54 58) no Hoare annotation was computed. [2021-08-26 02:02:10,029 INFO L853 garLoopResultBuilder]: At program point L21-2(lines 21 25) the Hoare annotation is: false [2021-08-26 02:02:10,029 INFO L857 garLoopResultBuilder]: For program point L54-3(lines 54 58) no Hoare annotation was computed. [2021-08-26 02:02:10,029 INFO L857 garLoopResultBuilder]: For program point L21-3(lines 21 25) no Hoare annotation was computed. [2021-08-26 02:02:10,030 INFO L857 garLoopResultBuilder]: For program point L54-5(lines 54 58) no Hoare annotation was computed. [2021-08-26 02:02:10,030 INFO L857 garLoopResultBuilder]: For program point L21-5(lines 21 25) no Hoare annotation was computed. [2021-08-26 02:02:10,030 INFO L853 garLoopResultBuilder]: At program point L21-6(lines 21 25) the Hoare annotation is: false [2021-08-26 02:02:10,030 INFO L857 garLoopResultBuilder]: For program point L21-7(lines 21 25) no Hoare annotation was computed. [2021-08-26 02:02:10,030 INFO L857 garLoopResultBuilder]: For program point L187-1(lines 187 191) no Hoare annotation was computed. [2021-08-26 02:02:10,030 INFO L853 garLoopResultBuilder]: At program point L187-2(lines 187 191) the Hoare annotation is: false [2021-08-26 02:02:10,030 INFO L857 garLoopResultBuilder]: For program point L187-3(lines 187 191) no Hoare annotation was computed. [2021-08-26 02:02:10,030 INFO L853 garLoopResultBuilder]: At program point L221(lines 213 222) the Hoare annotation is: (let ((.cse2 (or (not (bvsgt (bvadd ULTIMATE.start___ieee754_hypotf_~ha~0 (bvneg ULTIMATE.start___ieee754_hypotf_~hb~0)) (_ bv251658240 32))) (forall ((|v_skolemized_q#valueAsBitvector_13| (_ BitVec 32))) (or (= (bvand (_ bv2147483647 32) |v_skolemized_q#valueAsBitvector_13|) (_ bv2139095040 32)) (not (= (fp.add currentRoundingMode ULTIMATE.start___ieee754_hypotf_~a~0 ULTIMATE.start___ieee754_hypotf_~b~0) (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_13|)))))))) (.cse8 (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) ULTIMATE.start___ieee754_hypotf_~ha~0))) (.cse3 (= ULTIMATE.start___ieee754_hypotf_~y (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)))) (.cse4 (= currentRoundingMode roundNearestTiesToEven)) (.cse5 (= |ULTIMATE.start_isinf_float_#res| (_ bv1 32)))) (or (and (exists ((v_arrayElimCell_1 (_ BitVec 32)) (v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (let ((.cse0 (bvand (_ bv2147483647 32) v_arrayElimCell_1)) (.cse1 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30))) (and (= (fp ((_ extract 31 31) ULTIMATE.start_isinf_float_~ix~1) ((_ extract 30 23) ULTIMATE.start_isinf_float_~ix~1) ((_ extract 22 0) ULTIMATE.start_isinf_float_~ix~1)) (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))) (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) (bvsgt (bvadd .cse0 (bvneg .cse1)) (_ bv251658240 32))))) (forall ((|v_skolemized_q#valueAsBitvector_13| (_ BitVec 32))) (or (= (bvand (_ bv2147483647 32) |v_skolemized_q#valueAsBitvector_13|) (_ bv2139095040 32)) (not (= (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_13|)) ULTIMATE.start_isinf_float_~x)))) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))) (= (bvand (_ bv2147483647 32) v_arrayElimCell_1) ULTIMATE.start___ieee754_hypotf_~ha~0))) (forall ((|v_skolemized_q#valueAsBitvector_13| (_ BitVec 32))) (or (= (bvand (_ bv2147483647 32) |v_skolemized_q#valueAsBitvector_13|) (_ bv2139095040 32)) (not (= (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_13|)) |ULTIMATE.start___ieee754_hypotf_#res|)))) .cse2 (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) ULTIMATE.start___ieee754_hypotf_~hb~0)) .cse3 .cse4 .cse5 (exists ((|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~1.base_7| (_ BitVec 32))) (let ((.cse6 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~1.base_7|) (_ bv0 32)))) (and (= ULTIMATE.start___ieee754_hypotf_~a~0 (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))) (= .cse6 ULTIMATE.start___ieee754_hypotf_~ha~0))))) (and (exists ((v_arrayElimCell_5 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= |ULTIMATE.start___ieee754_hypotf_#res| (let ((.cse7 (bvand (_ bv2147483647 32) v_arrayElimCell_5))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7)))) (= (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))) .cse8 (exists ((v_arrayElimCell_5 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))) (= (let ((.cse9 (bvand (_ bv2147483647 32) v_arrayElimCell_5))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))) ULTIMATE.start_isinf_float_~x))) (forall ((|v_skolemized_q#valueAsBitvector_18| (_ BitVec 32))) (or (not (= (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)) (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_18|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_18|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_18|)))) (= (bvand (_ bv2147483647 32) |v_skolemized_q#valueAsBitvector_18|) (_ bv2139095040 32)))) .cse2 (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_39 (_ BitVec 32)) (v_ULTIMATE.start___ieee754_hypotf_~hb~0_41 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse10 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_39))) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_41) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_41) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_41))) (= .cse10 ULTIMATE.start___ieee754_hypotf_~hb~0) (bvsgt (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_41) .cse10)))) (exists ((v_arrayElimCell_5 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))) (= ULTIMATE.start___ieee754_hypotf_~w~0 (let ((.cse11 (bvand (_ bv2147483647 32) v_arrayElimCell_5))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))))) (exists ((v_arrayElimCell_5 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))) (= ULTIMATE.start___ieee754_hypotf_~a~0 (let ((.cse12 (bvand (_ bv2147483647 32) v_arrayElimCell_5))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12)))))) (exists ((v_arrayElimCell_5 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))) (= (fp ((_ extract 31 31) ULTIMATE.start_isinf_float_~ix~1) ((_ extract 30 23) ULTIMATE.start_isinf_float_~ix~1) ((_ extract 22 0) ULTIMATE.start_isinf_float_~ix~1)) (let ((.cse13 (bvand (_ bv2147483647 32) v_arrayElimCell_5))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13)))))) .cse3 .cse4 .cse5) (and (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32)) (|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_10| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse14 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_10|) (_ bv0 32)))) (and (= ULTIMATE.start___ieee754_hypotf_~b~0 (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) .cse14) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37)))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (let ((.cse15 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15))) (fp ((_ extract 31 31) ULTIMATE.start_isinf_float_~ix~1) ((_ extract 30 23) ULTIMATE.start_isinf_float_~ix~1) ((_ extract 22 0) ULTIMATE.start_isinf_float_~ix~1))) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))))) .cse8 (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ULTIMATE.start___ieee754_hypotf_~hb~0) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37)))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32)) (|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_10| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse16 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_10|) (_ bv0 32)))) (and (= |ULTIMATE.start___ieee754_hypotf_#res| (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) .cse16) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37)))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32)) (|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_10| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse17 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_10|) (_ bv0 32)))) (and (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) .cse17) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))) (= ULTIMATE.start___ieee754_hypotf_~w~0 (fp ((_ extract 31 31) .cse17) ((_ extract 30 23) .cse17) ((_ extract 22 0) .cse17)))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32)) (|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_10| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse18 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_10|) (_ bv0 32)))) (and (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) .cse18) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))) (= (fp ((_ extract 31 31) .cse18) ((_ extract 30 23) .cse18) ((_ extract 22 0) .cse18)) ULTIMATE.start_isinf_float_~x)))) .cse3 .cse4 .cse5))) [2021-08-26 02:02:10,030 INFO L857 garLoopResultBuilder]: For program point L123(lines 123 146) no Hoare annotation was computed. [2021-08-26 02:02:10,030 INFO L857 garLoopResultBuilder]: For program point L123-1(lines 83 210) no Hoare annotation was computed. [2021-08-26 02:02:10,030 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-26 02:02:10,030 INFO L857 garLoopResultBuilder]: For program point L124(lines 124 131) no Hoare annotation was computed. [2021-08-26 02:02:10,030 INFO L857 garLoopResultBuilder]: For program point L126(lines 126 127) no Hoare annotation was computed. [2021-08-26 02:02:10,030 INFO L857 garLoopResultBuilder]: For program point L93-1(lines 93 97) no Hoare annotation was computed. [2021-08-26 02:02:10,030 INFO L857 garLoopResultBuilder]: For program point L126-2(lines 124 131) no Hoare annotation was computed. [2021-08-26 02:02:10,031 INFO L853 garLoopResultBuilder]: At program point L93-2(lines 93 97) the Hoare annotation is: (and (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_39 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_39) ULTIMATE.start___ieee754_hypotf_~ha~0)) (forall ((v_ULTIMATE.start_isinf_float_~ix~1_17 (_ BitVec 32))) (or (= (bvand (_ bv2147483647 32) v_ULTIMATE.start_isinf_float_~ix~1_17) (_ bv2139095040 32)) (not (= ULTIMATE.start___ieee754_hypotf_~b~0 (fp ((_ extract 31 31) v_ULTIMATE.start_isinf_float_~ix~1_17) ((_ extract 30 23) v_ULTIMATE.start_isinf_float_~ix~1_17) ((_ extract 22 0) v_ULTIMATE.start_isinf_float_~ix~1_17)))))) (exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start___ieee754_hypotf_~y (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)))) (= currentRoundingMode roundNearestTiesToEven)) [2021-08-26 02:02:10,031 INFO L857 garLoopResultBuilder]: For program point L93-3(lines 93 97) no Hoare annotation was computed. [2021-08-26 02:02:10,031 INFO L857 garLoopResultBuilder]: For program point L193-1(lines 193 197) no Hoare annotation was computed. [2021-08-26 02:02:10,031 INFO L853 garLoopResultBuilder]: At program point L193-2(lines 193 197) the Hoare annotation is: false [2021-08-26 02:02:10,031 INFO L857 garLoopResultBuilder]: For program point L193-3(lines 193 197) no Hoare annotation was computed. [2021-08-26 02:02:10,031 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-26 02:02:10,031 INFO L857 garLoopResultBuilder]: For program point L28(lines 28 29) no Hoare annotation was computed. [2021-08-26 02:02:10,031 INFO L857 garLoopResultBuilder]: For program point L28-1(lines 28 29) no Hoare annotation was computed. [2021-08-26 02:02:10,031 INFO L857 garLoopResultBuilder]: For program point L128-1(lines 128 129) no Hoare annotation was computed. [2021-08-26 02:02:10,031 INFO L857 garLoopResultBuilder]: For program point L63(lines 63 72) no Hoare annotation was computed. [2021-08-26 02:02:10,031 INFO L857 garLoopResultBuilder]: For program point L63-1(lines 63 72) no Hoare annotation was computed. [2021-08-26 02:02:10,031 INFO L857 garLoopResultBuilder]: For program point L163-1(lines 163 167) no Hoare annotation was computed. [2021-08-26 02:02:10,031 INFO L853 garLoopResultBuilder]: At program point L163-2(lines 163 167) the Hoare annotation is: false [2021-08-26 02:02:10,031 INFO L857 garLoopResultBuilder]: For program point L31(lines 31 32) no Hoare annotation was computed. [2021-08-26 02:02:10,031 INFO L857 garLoopResultBuilder]: For program point L31-1(lines 31 32) no Hoare annotation was computed. [2021-08-26 02:02:10,031 INFO L857 garLoopResultBuilder]: For program point L65(lines 65 71) no Hoare annotation was computed. [2021-08-26 02:02:10,031 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-26 02:02:10,031 INFO L857 garLoopResultBuilder]: For program point L65-2(lines 65 71) no Hoare annotation was computed. [2021-08-26 02:02:10,031 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 236) no Hoare annotation was computed. [2021-08-26 02:02:10,031 INFO L857 garLoopResultBuilder]: For program point L99(lines 99 108) no Hoare annotation was computed. [2021-08-26 02:02:10,031 INFO L857 garLoopResultBuilder]: For program point L33(lines 33 34) no Hoare annotation was computed. [2021-08-26 02:02:10,032 INFO L857 garLoopResultBuilder]: For program point L33-1(lines 33 34) no Hoare annotation was computed. [2021-08-26 02:02:10,032 INFO L857 garLoopResultBuilder]: For program point L67(lines 67 70) no Hoare annotation was computed. [2021-08-26 02:02:10,032 INFO L857 garLoopResultBuilder]: For program point L67-3(lines 67 70) no Hoare annotation was computed. [2021-08-26 02:02:10,036 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 02:02:10,039 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:211) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:456) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:452) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-08-26 02:02:10,042 INFO L168 Benchmark]: Toolchain (without parser) took 463628.19 ms. Allocated memory was 67.1 MB in the beginning and 92.3 MB in the end (delta: 25.2 MB). Free memory was 47.8 MB in the beginning and 31.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 51.0 MB. Max. memory is 16.1 GB. [2021-08-26 02:02:10,042 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 67.1 MB. Free memory is still 49.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 02:02:10,042 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.08 ms. Allocated memory is still 67.1 MB. Free memory was 47.7 MB in the beginning and 47.3 MB in the end (delta: 425.1 kB). Peak memory consumption was 13.9 MB. Max. memory is 16.1 GB. [2021-08-26 02:02:10,043 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.07 ms. Allocated memory is still 67.1 MB. Free memory was 47.1 MB in the beginning and 44.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 02:02:10,043 INFO L168 Benchmark]: Boogie Preprocessor took 56.51 ms. Allocated memory is still 67.1 MB. Free memory was 44.4 MB in the beginning and 41.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 02:02:10,043 INFO L168 Benchmark]: RCFGBuilder took 5765.92 ms. Allocated memory was 67.1 MB in the beginning and 92.3 MB in the end (delta: 25.2 MB). Free memory was 41.6 MB in the beginning and 64.9 MB in the end (delta: -23.3 MB). Peak memory consumption was 24.1 MB. Max. memory is 16.1 GB. [2021-08-26 02:02:10,043 INFO L168 Benchmark]: TraceAbstraction took 457432.59 ms. Allocated memory is still 92.3 MB. Free memory was 64.9 MB in the beginning and 31.7 MB in the end (delta: 33.2 MB). Peak memory consumption was 42.3 MB. Max. memory is 16.1 GB. [2021-08-26 02:02:10,045 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 67.1 MB. Free memory is still 49.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 311.08 ms. Allocated memory is still 67.1 MB. Free memory was 47.7 MB in the beginning and 47.3 MB in the end (delta: 425.1 kB). Peak memory consumption was 13.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 57.07 ms. Allocated memory is still 67.1 MB. Free memory was 47.1 MB in the beginning and 44.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 56.51 ms. Allocated memory is still 67.1 MB. Free memory was 44.4 MB in the beginning and 41.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 5765.92 ms. Allocated memory was 67.1 MB in the beginning and 92.3 MB in the end (delta: 25.2 MB). Free memory was 41.6 MB in the beginning and 64.9 MB in the end (delta: -23.3 MB). Peak memory consumption was 24.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 457432.59 ms. Allocated memory is still 92.3 MB. Free memory was 64.9 MB in the beginning and 31.7 MB in the end (delta: 33.2 MB). Peak memory consumption was 42.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 236]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 457379.9ms, OverallIterations: 6, TraceHistogramMax: 1, EmptinessCheckTime: 11.6ms, AutomataDifference: 94041.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 277123.3ms, InitialAbstractionConstructionTime: 12.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 318 SDtfs, 2000 SDslu, 989 SDs, 0 SdLazy, 856 SolverSat, 150 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12854.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 303 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 147757.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=2, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 63.8ms AutomataMinimizationTime, 6 MinimizatonAttempts, 260 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 23 LocationsWithAnnotation, 23 PreInvPairs, 35 NumberOfFragments, 2748 HoareAnnotationTreeSize, 23 FomulaSimplifications, 3220 FormulaSimplificationTreeSizeReduction, 231.8ms HoareSimplificationTime, 23 FomulaSimplificationsInter, 3948 FormulaSimplificationTreeSizeReductionInter, 276882.7ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 104.3ms SsaConstructionTime, 445.7ms SatisfiabilityAnalysisTime, 83650.5ms InterpolantComputationTime, 136 NumberOfCodeBlocks, 136 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 260 ConstructedInterpolants, 143 QuantifiedInterpolants, 4692 SizeOfPredicates, 67 NumberOfNonLiveVariables, 534 ConjunctsInSsa, 94 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:211) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-08-26 02:02:10,277 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-08-26 02:02:10,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...