./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1211b.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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_1211b.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 60a85fa0dc6e4e6b4078469f7e24e1dca9372a9f2a0f0b1c4c333cd6d766b7f3 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:46:32,383 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:46:32,385 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:46:32,406 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:46:32,406 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:46:32,407 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:46:32,408 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:46:32,409 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:46:32,410 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:46:32,411 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:46:32,412 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:46:32,412 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:46:32,413 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:46:32,413 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:46:32,414 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:46:32,415 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:46:32,415 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:46:32,416 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:46:32,417 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:46:32,418 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:46:32,419 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:46:32,420 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:46:32,421 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:46:32,421 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:46:32,423 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:46:32,423 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:46:32,424 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:46:32,424 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:46:32,425 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:46:32,425 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:46:32,426 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:46:32,426 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:46:32,427 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:46:32,427 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:46:32,428 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:46:32,428 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:46:32,429 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:46:32,429 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:46:32,429 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:46:32,430 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:46:32,430 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:46:32,442 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:46:32,473 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:46:32,473 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:46:32,474 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:46:32,474 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:46:32,474 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:46:32,475 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:46:32,475 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:46:32,475 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:46:32,475 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:46:32,475 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:46:32,476 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:46:32,476 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:46:32,476 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:46:32,477 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:46:32,477 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:46:32,477 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:46:32,477 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:46:32,477 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:46:32,477 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:46:32,477 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:46:32,478 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:46:32,478 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:46:32,478 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:46:32,478 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:46:32,478 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:32,478 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:46:32,478 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:46:32,479 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:46:32,479 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:46:32,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:46:32,479 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:46:32,479 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:46:32,480 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:46:32,480 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 -> 60a85fa0dc6e4e6b4078469f7e24e1dca9372a9f2a0f0b1c4c333cd6d766b7f3 [2022-02-20 16:46:32,650 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:46:32,667 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:46:32,668 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:46:32,669 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:46:32,671 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:46:32,672 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1211b.c [2022-02-20 16:46:32,717 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8a2c17d6/61e438fc27e5497c8cd34d63bcde49ba/FLAGd6a4fe4d9 [2022-02-20 16:46:33,077 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:46:33,077 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1211b.c [2022-02-20 16:46:33,086 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8a2c17d6/61e438fc27e5497c8cd34d63bcde49ba/FLAGd6a4fe4d9 [2022-02-20 16:46:33,501 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8a2c17d6/61e438fc27e5497c8cd34d63bcde49ba [2022-02-20 16:46:33,503 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:46:33,505 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:46:33,508 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:33,508 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:46:33,510 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:46:33,511 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:33" (1/1) ... [2022-02-20 16:46:33,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34af8313 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:33, skipping insertion in model container [2022-02-20 16:46:33,512 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:33" (1/1) ... [2022-02-20 16:46:33,517 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:46:33,532 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:46:33,667 WARN L230 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_1211b.c[2579,2592] [2022-02-20 16:46:33,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:33,682 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:46:33,719 WARN L230 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_1211b.c[2579,2592] [2022-02-20 16:46:33,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:33,734 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:46:33,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:33 WrapperNode [2022-02-20 16:46:33,735 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:33,736 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:33,736 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:46:33,736 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:46:33,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:33" (1/1) ... [2022-02-20 16:46:33,752 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:33" (1/1) ... [2022-02-20 16:46:33,785 INFO L137 Inliner]: procedures = 19, calls = 57, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 183 [2022-02-20 16:46:33,787 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:33,787 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:46:33,788 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:46:33,788 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:46:33,793 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:33" (1/1) ... [2022-02-20 16:46:33,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:33" (1/1) ... [2022-02-20 16:46:33,803 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:33" (1/1) ... [2022-02-20 16:46:33,807 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:33" (1/1) ... [2022-02-20 16:46:33,813 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:33" (1/1) ... [2022-02-20 16:46:33,819 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:33" (1/1) ... [2022-02-20 16:46:33,826 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:33" (1/1) ... [2022-02-20 16:46:33,827 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:46:33,828 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:46:33,828 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:46:33,828 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:46:33,832 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:33" (1/1) ... [2022-02-20 16:46:33,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:33,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:46:33,852 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) [2022-02-20 16:46:33,853 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 [2022-02-20 16:46:33,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:46:33,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:46:33,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:46:33,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:46:33,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:46:33,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:46:33,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:46:33,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:46:33,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-02-20 16:46:33,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:46:33,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:46:33,933 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:46:33,934 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:46:34,239 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:46:34,243 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:46:34,244 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2022-02-20 16:46:34,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:34 BoogieIcfgContainer [2022-02-20 16:46:34,245 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:46:34,246 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:46:34,246 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:46:34,249 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:46:34,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:46:33" (1/3) ... [2022-02-20 16:46:34,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@288540f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:34, skipping insertion in model container [2022-02-20 16:46:34,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:33" (2/3) ... [2022-02-20 16:46:34,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@288540f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:34, skipping insertion in model container [2022-02-20 16:46:34,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:34" (3/3) ... [2022-02-20 16:46:34,251 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1211b.c [2022-02-20 16:46:34,254 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:46:34,254 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:46:34,282 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:46:34,286 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, mAutomataTypeConcurrency=PETRI_NET, 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 [2022-02-20 16:46:34,287 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:46:34,296 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 40 states have (on average 1.625) internal successors, (65), 41 states have internal predecessors, (65), 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) [2022-02-20 16:46:34,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:46:34,299 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:34,300 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:34,300 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:34,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:34,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1888439402, now seen corresponding path program 1 times [2022-02-20 16:46:34,317 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:34,318 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897903248] [2022-02-20 16:46:34,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:34,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:34,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:34,409 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~one_modf~0 := 1.0; {45#true} is VALID [2022-02-20 16:46:34,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~ret15#1, main_#t~mem16#1, main_#t~ret17#1, main_#t~ret18#1, main_#t~short19#1, main_#t~short20#1, main_~x~0#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0);call main_~#iptr~0#1.base, main_~#iptr~0#1.offset := #Ultimate.allocOnStack(4);call write~init~real(main_#t~nondet14#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset, 4);havoc main_#t~nondet14#1;assume { :begin_inline_modf_float } true;modf_float_#in~x#1, modf_float_#in~iptr#1.base, modf_float_#in~iptr#1.offset := main_~x~0#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset;havoc modf_float_#res#1;havoc modf_float_#t~mem4#1, modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset, modf_float_#t~mem5#1, modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset, modf_float_#t~mem6#1, modf_float_~#gf_u~1#1.base, modf_float_~#gf_u~1#1.offset, modf_float_#t~mem7#1, modf_float_~#sf_u~1#1.base, modf_float_~#sf_u~1#1.offset, modf_float_~ix~0#1, modf_float_#t~mem8#1, modf_float_~#sf_u~2#1.base, modf_float_~#sf_u~2#1.offset, modf_float_#t~mem9#1, modf_float_#t~mem10#1, modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset, modf_float_#t~mem11#1, modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset, modf_float_~ix~1#1, modf_float_~x#1, modf_float_~iptr#1.base, modf_float_~iptr#1.offset, modf_float_~i0~0#1, modf_float_~j0~0#1, modf_float_~i~0#1;modf_float_~x#1 := modf_float_#in~x#1;modf_float_~iptr#1.base, modf_float_~iptr#1.offset := modf_float_#in~iptr#1.base, modf_float_#in~iptr#1.offset;havoc modf_float_~i0~0#1;havoc modf_float_~j0~0#1;havoc modf_float_~i~0#1; {45#true} is VALID [2022-02-20 16:46:34,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {45#true} assume !true; {46#false} is VALID [2022-02-20 16:46:34,411 INFO L290 TraceCheckUtils]: 3: Hoare triple {46#false} modf_float_~j0~0#1 := (if 0 == modf_float_~i0~0#1 / 8388608 then 0 else (if 1 == modf_float_~i0~0#1 / 8388608 then 1 else ~bitwiseAnd(modf_float_~i0~0#1 / 8388608, 255))) - 127; {46#false} is VALID [2022-02-20 16:46:34,411 INFO L290 TraceCheckUtils]: 4: Hoare triple {46#false} assume !(modf_float_~j0~0#1 < 23);havoc modf_float_~ix~1#1;call write~real(~someBinaryArithmeticFLOAToperation(modf_float_~x#1, ~one_modf~0), modf_float_~iptr#1.base, modf_float_~iptr#1.offset, 4); {46#false} is VALID [2022-02-20 16:46:34,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {46#false} assume !true; {46#false} is VALID [2022-02-20 16:46:34,411 INFO L290 TraceCheckUtils]: 6: Hoare triple {46#false} assume !true; {46#false} is VALID [2022-02-20 16:46:34,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {46#false} modf_float_#res#1 := modf_float_~x#1; {46#false} is VALID [2022-02-20 16:46:34,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {46#false} main_#t~ret15#1 := modf_float_#res#1;assume { :end_inline_modf_float } true;main_~res~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1;call main_#t~mem16#1 := read~real(main_~#iptr~0#1.base, main_~#iptr~0#1.offset, 4);assume { :begin_inline_isinf_float } true;isinf_float_#in~x#1 := main_#t~mem16#1;havoc isinf_float_#res#1;havoc isinf_float_#t~mem13#1, isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset, isinf_float_~x#1, isinf_float_~ix~2#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~2#1; {46#false} is VALID [2022-02-20 16:46:34,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {46#false} assume !true; {46#false} is VALID [2022-02-20 16:46:34,412 INFO L290 TraceCheckUtils]: 10: Hoare triple {46#false} isinf_float_~ix~2#1 := (if 0 == isinf_float_~ix~2#1 then 0 else (if 1 == isinf_float_~ix~2#1 then 1 else ~bitwiseAnd(isinf_float_~ix~2#1, 2147483647)));isinf_float_#res#1 := (if 2139095040 == isinf_float_~ix~2#1 then 1 else 0); {46#false} is VALID [2022-02-20 16:46:34,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {46#false} main_#t~ret17#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647;main_#t~short20#1 := 0 != main_#t~ret17#1; {46#false} is VALID [2022-02-20 16:46:34,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {46#false} assume !main_#t~short20#1; {46#false} is VALID [2022-02-20 16:46:34,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {46#false} assume main_#t~short20#1;havoc main_#t~mem16#1;havoc main_#t~ret17#1;havoc main_#t~ret18#1;havoc main_#t~short19#1;havoc main_#t~short20#1; {46#false} is VALID [2022-02-20 16:46:34,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {46#false} assume !false; {46#false} is VALID [2022-02-20 16:46:34,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:46:34,414 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:46:34,414 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897903248] [2022-02-20 16:46:34,415 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897903248] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:34,415 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:34,415 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:46:34,416 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178287532] [2022-02-20 16:46:34,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:34,420 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 16:46:34,420 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:34,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:34,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:34,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:46:34,435 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:46:34,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:46:34,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:34,449 INFO L87 Difference]: Start difference. First operand has 42 states, 40 states have (on average 1.625) internal successors, (65), 41 states have internal predecessors, (65), 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 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:34,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:34,489 INFO L93 Difference]: Finished difference Result 82 states and 128 transitions. [2022-02-20 16:46:34,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:46:34,490 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 16:46:34,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:34,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:34,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 128 transitions. [2022-02-20 16:46:34,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:34,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 128 transitions. [2022-02-20 16:46:34,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 128 transitions. [2022-02-20 16:46:34,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:34,587 INFO L225 Difference]: With dead ends: 82 [2022-02-20 16:46:34,587 INFO L226 Difference]: Without dead ends: 39 [2022-02-20 16:46:34,589 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:34,591 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:34,592 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:46:34,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-20 16:46:34,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-02-20 16:46:34,609 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:34,609 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 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) [2022-02-20 16:46:34,610 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 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) [2022-02-20 16:46:34,610 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 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) [2022-02-20 16:46:34,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:34,612 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-02-20 16:46:34,613 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-02-20 16:46:34,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:34,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:34,613 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 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) Second operand 39 states. [2022-02-20 16:46:34,614 INFO L87 Difference]: Start difference. First operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 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) Second operand 39 states. [2022-02-20 16:46:34,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:34,615 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-02-20 16:46:34,615 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-02-20 16:46:34,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:34,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:34,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:34,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:34,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 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) [2022-02-20 16:46:34,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-02-20 16:46:34,618 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 15 [2022-02-20 16:46:34,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:34,619 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-02-20 16:46:34,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:34,619 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-02-20 16:46:34,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 16:46:34,620 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:34,620 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:34,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:46:34,620 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:34,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:34,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1291452088, now seen corresponding path program 1 times [2022-02-20 16:46:34,621 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:34,621 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259870144] [2022-02-20 16:46:34,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:34,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:34,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:34,702 INFO L290 TraceCheckUtils]: 0: Hoare triple {280#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~one_modf~0 := 1.0; {280#true} is VALID [2022-02-20 16:46:34,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {280#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~ret15#1, main_#t~mem16#1, main_#t~ret17#1, main_#t~ret18#1, main_#t~short19#1, main_#t~short20#1, main_~x~0#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0);call main_~#iptr~0#1.base, main_~#iptr~0#1.offset := #Ultimate.allocOnStack(4);call write~init~real(main_#t~nondet14#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset, 4);havoc main_#t~nondet14#1;assume { :begin_inline_modf_float } true;modf_float_#in~x#1, modf_float_#in~iptr#1.base, modf_float_#in~iptr#1.offset := main_~x~0#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset;havoc modf_float_#res#1;havoc modf_float_#t~mem4#1, modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset, modf_float_#t~mem5#1, modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset, modf_float_#t~mem6#1, modf_float_~#gf_u~1#1.base, modf_float_~#gf_u~1#1.offset, modf_float_#t~mem7#1, modf_float_~#sf_u~1#1.base, modf_float_~#sf_u~1#1.offset, modf_float_~ix~0#1, modf_float_#t~mem8#1, modf_float_~#sf_u~2#1.base, modf_float_~#sf_u~2#1.offset, modf_float_#t~mem9#1, modf_float_#t~mem10#1, modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset, modf_float_#t~mem11#1, modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset, modf_float_~ix~1#1, modf_float_~x#1, modf_float_~iptr#1.base, modf_float_~iptr#1.offset, modf_float_~i0~0#1, modf_float_~j0~0#1, modf_float_~i~0#1;modf_float_~x#1 := modf_float_#in~x#1;modf_float_~iptr#1.base, modf_float_~iptr#1.offset := modf_float_#in~iptr#1.base, modf_float_#in~iptr#1.offset;havoc modf_float_~i0~0#1;havoc modf_float_~j0~0#1;havoc modf_float_~i~0#1; {280#true} is VALID [2022-02-20 16:46:34,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {280#true} call modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4);call write~real(modf_float_~x#1, modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset, 4);call modf_float_#t~mem4#1 := read~int(modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset, 4);modf_float_~i0~0#1 := (if modf_float_#t~mem4#1 % 4294967296 % 4294967296 <= 2147483647 then modf_float_#t~mem4#1 % 4294967296 % 4294967296 else modf_float_#t~mem4#1 % 4294967296 % 4294967296 - 4294967296);havoc modf_float_#t~mem4#1;call ULTIMATE.dealloc(modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset);havoc modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset; {280#true} is VALID [2022-02-20 16:46:34,703 INFO L290 TraceCheckUtils]: 3: Hoare triple {280#true} goto; {280#true} is VALID [2022-02-20 16:46:34,703 INFO L290 TraceCheckUtils]: 4: Hoare triple {280#true} modf_float_~j0~0#1 := (if 0 == modf_float_~i0~0#1 / 8388608 then 0 else (if 1 == modf_float_~i0~0#1 / 8388608 then 1 else ~bitwiseAnd(modf_float_~i0~0#1 / 8388608, 255))) - 127; {280#true} is VALID [2022-02-20 16:46:34,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {280#true} assume modf_float_~j0~0#1 < 23; {280#true} is VALID [2022-02-20 16:46:34,703 INFO L290 TraceCheckUtils]: 6: Hoare triple {280#true} assume modf_float_~j0~0#1 < 0; {280#true} is VALID [2022-02-20 16:46:34,703 INFO L290 TraceCheckUtils]: 7: Hoare triple {280#true} call modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset := #Ultimate.allocOnStack(4);call write~int((if 0 == modf_float_~i0~0#1 then 0 else (if 1 == modf_float_~i0~0#1 then 0 else ~bitwiseAnd(modf_float_~i0~0#1, 2147483648))), modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset, 4);call modf_float_#t~mem5#1 := read~real(modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset, 4);call write~real(modf_float_#t~mem5#1, modf_float_~iptr#1.base, modf_float_~iptr#1.offset, 4);havoc modf_float_#t~mem5#1;call ULTIMATE.dealloc(modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset);havoc modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset; {280#true} is VALID [2022-02-20 16:46:34,704 INFO L290 TraceCheckUtils]: 8: Hoare triple {280#true} goto; {280#true} is VALID [2022-02-20 16:46:34,705 INFO L290 TraceCheckUtils]: 9: Hoare triple {280#true} modf_float_#res#1 := modf_float_~x#1; {280#true} is VALID [2022-02-20 16:46:34,705 INFO L290 TraceCheckUtils]: 10: Hoare triple {280#true} main_#t~ret15#1 := modf_float_#res#1;assume { :end_inline_modf_float } true;main_~res~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1;call main_#t~mem16#1 := read~real(main_~#iptr~0#1.base, main_~#iptr~0#1.offset, 4);assume { :begin_inline_isinf_float } true;isinf_float_#in~x#1 := main_#t~mem16#1;havoc isinf_float_#res#1;havoc isinf_float_#t~mem13#1, isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset, isinf_float_~x#1, isinf_float_~ix~2#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~2#1; {280#true} is VALID [2022-02-20 16:46:34,705 INFO L290 TraceCheckUtils]: 11: Hoare triple {280#true} call isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset := #Ultimate.allocOnStack(4);call write~real(isinf_float_~x#1, isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset, 4);call isinf_float_#t~mem13#1 := read~int(isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset, 4);isinf_float_~ix~2#1 := (if isinf_float_#t~mem13#1 % 4294967296 % 4294967296 <= 2147483647 then isinf_float_#t~mem13#1 % 4294967296 % 4294967296 else isinf_float_#t~mem13#1 % 4294967296 % 4294967296 - 4294967296);havoc isinf_float_#t~mem13#1;call ULTIMATE.dealloc(isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset);havoc isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset; {280#true} is VALID [2022-02-20 16:46:34,705 INFO L290 TraceCheckUtils]: 12: Hoare triple {280#true} goto; {280#true} is VALID [2022-02-20 16:46:34,705 INFO L290 TraceCheckUtils]: 13: Hoare triple {280#true} isinf_float_~ix~2#1 := (if 0 == isinf_float_~ix~2#1 then 0 else (if 1 == isinf_float_~ix~2#1 then 1 else ~bitwiseAnd(isinf_float_~ix~2#1, 2147483647)));isinf_float_#res#1 := (if 2139095040 == isinf_float_~ix~2#1 then 1 else 0); {280#true} is VALID [2022-02-20 16:46:34,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {280#true} main_#t~ret17#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647;main_#t~short20#1 := 0 != main_#t~ret17#1; {280#true} is VALID [2022-02-20 16:46:34,706 INFO L290 TraceCheckUtils]: 15: Hoare triple {280#true} assume !main_#t~short20#1; {282#(not |ULTIMATE.start_main_#t~short20#1|)} is VALID [2022-02-20 16:46:34,706 INFO L290 TraceCheckUtils]: 16: Hoare triple {282#(not |ULTIMATE.start_main_#t~short20#1|)} assume main_#t~short20#1;havoc main_#t~mem16#1;havoc main_#t~ret17#1;havoc main_#t~ret18#1;havoc main_#t~short19#1;havoc main_#t~short20#1; {281#false} is VALID [2022-02-20 16:46:34,707 INFO L290 TraceCheckUtils]: 17: Hoare triple {281#false} assume !false; {281#false} is VALID [2022-02-20 16:46:34,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:46:34,707 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:46:34,707 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259870144] [2022-02-20 16:46:34,708 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259870144] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:34,708 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:34,708 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:46:34,708 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862080179] [2022-02-20 16:46:34,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:34,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 16:46:34,711 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:34,711 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:34,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:34,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:46:34,724 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:46:34,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:46:34,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:46:34,725 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:34,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:34,775 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2022-02-20 16:46:34,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:46:34,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 16:46:34,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:34,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:34,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-02-20 16:46:34,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:34,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-02-20 16:46:34,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 45 transitions. [2022-02-20 16:46:34,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:34,817 INFO L225 Difference]: With dead ends: 42 [2022-02-20 16:46:34,818 INFO L226 Difference]: Without dead ends: 39 [2022-02-20 16:46:34,820 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:46:34,822 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:34,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:46:34,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-20 16:46:34,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-02-20 16:46:34,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:34,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 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) [2022-02-20 16:46:34,830 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 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) [2022-02-20 16:46:34,830 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 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) [2022-02-20 16:46:34,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:34,834 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-02-20 16:46:34,835 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-02-20 16:46:34,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:34,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:34,836 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 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 39 states. [2022-02-20 16:46:34,837 INFO L87 Difference]: Start difference. First operand has 39 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 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 39 states. [2022-02-20 16:46:34,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:34,842 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-02-20 16:46:34,842 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-02-20 16:46:34,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:34,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:34,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:34,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:34,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 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) [2022-02-20 16:46:34,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2022-02-20 16:46:34,846 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 18 [2022-02-20 16:46:34,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:34,847 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2022-02-20 16:46:34,847 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:34,847 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-02-20 16:46:34,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 16:46:34,850 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:34,851 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:34,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:46:34,851 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:34,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:34,851 INFO L85 PathProgramCache]: Analyzing trace with hash -182496670, now seen corresponding path program 1 times [2022-02-20 16:46:34,851 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:34,852 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262759804] [2022-02-20 16:46:34,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:34,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:34,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:46:34,929 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:46:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:46:34,973 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:46:34,973 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:46:34,974 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:46:34,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:46:34,977 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 16:46:34,979 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:46:35,011 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:46:35,011 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:46:35,011 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2022-02-20 16:46:35,012 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2022-02-20 16:46:35,012 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2022-02-20 16:46:35,012 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2022-02-20 16:46:35,012 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2022-02-20 16:46:35,012 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-02-20 16:46:35,012 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-02-20 16:46:35,012 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 16:46:35,012 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 16:46:35,013 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2022-02-20 16:46:35,013 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2022-02-20 16:46:35,013 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2022-02-20 16:46:35,013 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2022-02-20 16:46:35,013 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-02-20 16:46:35,014 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-02-20 16:46:35,015 WARN L170 areAnnotationChecker]: L61-1 has no Hoare annotation [2022-02-20 16:46:35,015 WARN L170 areAnnotationChecker]: L61-1 has no Hoare annotation [2022-02-20 16:46:35,015 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2022-02-20 16:46:35,015 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2022-02-20 16:46:35,015 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:46:35,015 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:46:35,015 WARN L170 areAnnotationChecker]: L27-3 has no Hoare annotation [2022-02-20 16:46:35,016 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2022-02-20 16:46:35,019 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2022-02-20 16:46:35,019 WARN L170 areAnnotationChecker]: L50-2 has no Hoare annotation [2022-02-20 16:46:35,019 WARN L170 areAnnotationChecker]: L50-2 has no Hoare annotation [2022-02-20 16:46:35,019 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-20 16:46:35,019 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-20 16:46:35,019 WARN L170 areAnnotationChecker]: L66-2 has no Hoare annotation [2022-02-20 16:46:35,019 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-02-20 16:46:35,019 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2022-02-20 16:46:35,019 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2022-02-20 16:46:35,019 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2022-02-20 16:46:35,020 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2022-02-20 16:46:35,020 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2022-02-20 16:46:35,020 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2022-02-20 16:46:35,020 WARN L170 areAnnotationChecker]: L50-3 has no Hoare annotation [2022-02-20 16:46:35,020 WARN L170 areAnnotationChecker]: L90-2 has no Hoare annotation [2022-02-20 16:46:35,020 WARN L170 areAnnotationChecker]: L90-2 has no Hoare annotation [2022-02-20 16:46:35,020 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 16:46:35,020 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 16:46:35,020 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:46:35,020 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:46:35,021 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:46:35,021 WARN L170 areAnnotationChecker]: L90-3 has no Hoare annotation [2022-02-20 16:46:35,021 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2022-02-20 16:46:35,021 WARN L170 areAnnotationChecker]: L111 has no Hoare annotation [2022-02-20 16:46:35,021 WARN L170 areAnnotationChecker]: L111 has no Hoare annotation [2022-02-20 16:46:35,021 WARN L170 areAnnotationChecker]: L111-1 has no Hoare annotation [2022-02-20 16:46:35,022 WARN L170 areAnnotationChecker]: L111-1 has no Hoare annotation [2022-02-20 16:46:35,022 WARN L170 areAnnotationChecker]: L111-5 has no Hoare annotation [2022-02-20 16:46:35,022 WARN L170 areAnnotationChecker]: L111-5 has no Hoare annotation [2022-02-20 16:46:35,022 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:46:35,022 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:46:35,022 WARN L170 areAnnotationChecker]: L111-3 has no Hoare annotation [2022-02-20 16:46:35,022 WARN L170 areAnnotationChecker]: L112 has no Hoare annotation [2022-02-20 16:46:35,022 WARN L170 areAnnotationChecker]: L112 has no Hoare annotation [2022-02-20 16:46:35,022 WARN L170 areAnnotationChecker]: L116 has no Hoare annotation [2022-02-20 16:46:35,022 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-02-20 16:46:35,023 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-02-20 16:46:35,023 WARN L170 areAnnotationChecker]: L78-3 has no Hoare annotation [2022-02-20 16:46:35,023 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:35,023 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2022-02-20 16:46:35,023 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:46:35,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:46:35 BoogieIcfgContainer [2022-02-20 16:46:35,024 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:46:35,027 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:46:35,030 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:46:35,030 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:46:35,030 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:34" (3/4) ... [2022-02-20 16:46:35,032 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:46:35,033 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:46:35,034 INFO L158 Benchmark]: Toolchain (without parser) took 1528.42ms. Allocated memory is still 132.1MB. Free memory was 100.0MB in the beginning and 85.6MB in the end (delta: 14.3MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2022-02-20 16:46:35,034 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 83.9MB. Free memory was 39.3MB in the beginning and 39.2MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:35,034 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.22ms. Allocated memory is still 132.1MB. Free memory was 99.7MB in the beginning and 106.3MB in the end (delta: -6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:46:35,036 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.36ms. Allocated memory is still 132.1MB. Free memory was 106.3MB in the beginning and 103.8MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:46:35,036 INFO L158 Benchmark]: Boogie Preprocessor took 39.98ms. Allocated memory is still 132.1MB. Free memory was 103.8MB in the beginning and 101.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:35,037 INFO L158 Benchmark]: RCFGBuilder took 417.22ms. Allocated memory is still 132.1MB. Free memory was 101.3MB in the beginning and 81.2MB in the end (delta: 20.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-02-20 16:46:35,037 INFO L158 Benchmark]: TraceAbstraction took 777.82ms. Allocated memory is still 132.1MB. Free memory was 80.4MB in the beginning and 85.8MB in the end (delta: -5.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:35,037 INFO L158 Benchmark]: Witness Printer took 5.88ms. Allocated memory is still 132.1MB. Free memory was 85.8MB in the beginning and 85.6MB in the end (delta: 181.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:35,039 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 83.9MB. Free memory was 39.3MB in the beginning and 39.2MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 227.22ms. Allocated memory is still 132.1MB. Free memory was 99.7MB in the beginning and 106.3MB in the end (delta: -6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.36ms. Allocated memory is still 132.1MB. Free memory was 106.3MB in the beginning and 103.8MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.98ms. Allocated memory is still 132.1MB. Free memory was 103.8MB in the beginning and 101.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 417.22ms. Allocated memory is still 132.1MB. Free memory was 101.3MB in the beginning and 81.2MB in the end (delta: 20.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 777.82ms. Allocated memory is still 132.1MB. Free memory was 80.4MB in the beginning and 85.8MB in the end (delta: -5.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.88ms. Allocated memory is still 132.1MB. Free memory was 85.8MB in the beginning and 85.6MB in the end (delta: 181.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 112]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 111, overapproximation of someBinaryArithmeticFLOAToperation at line 106, overapproximation of bitwiseAnd at line 95. Possible FailurePath: [L14] static const float one_modf = 1.0; VAL [one_modf=1] [L106] float x = -1.0f / 0.0f; [L107] float iptr = __VERIFIER_nondet_float(); [L108] CALL, EXPR modf_float(x, &iptr) [L17] __int32_t i0, j0; [L18] __uint32_t i; VAL [\old(x)=4370464771, iptr={6:0}, iptr={6:0}, one_modf=1, x=4370464771] [L20] ieee_float_shape_type gf_u; [L21] gf_u.value = (x) [L22] EXPR gf_u.word [L22] (i0) = gf_u.word [L24] j0 = ((i0 >> 23) & 0xff) - 0x7f VAL [\old(x)=4370464771, i0=75497472, iptr={6:0}, iptr={6:0}, j0=-127, one_modf=1, x=4370464771] [L25] COND TRUE j0 < 23 VAL [\old(x)=4370464771, i0=75497472, iptr={6:0}, iptr={6:0}, j0=-127, one_modf=1, x=4370464771] [L26] COND TRUE j0 < 0 VAL [\old(x)=4370464771, i0=75497472, iptr={6:0}, iptr={6:0}, j0=-127, one_modf=1, x=4370464771] [L28] ieee_float_shape_type sf_u; [L29] sf_u.word = (i0 & 0x80000000) [L30] EXPR sf_u.value [L30] (*iptr) = sf_u.value [L32] return x; VAL [\old(x)=4370464771, \result=4370464771, i0=75497472, iptr={6:0}, iptr={6:0}, j0=-127, one_modf=1, x=4370464771] [L108] RET, EXPR modf_float(x, &iptr) [L108] float res = modf_float(x, &iptr); [L111] EXPR \read(iptr) [L111] CALL, EXPR isinf_float(iptr) [L89] __int32_t ix; VAL [\old(x)=4370464769, one_modf=1, x=4370464769] [L91] ieee_float_shape_type gf_u; [L92] gf_u.value = (x) [L93] EXPR gf_u.word [L93] (ix) = gf_u.word [L95] ix &= 0x7fffffff [L96] return ((ix) == 0x7f800000L); VAL [\old(x)=4370464769, \result=1, ix=2139095040, one_modf=1, x=4370464769] [L111] RET, EXPR isinf_float(iptr) [L111] isinf_float(iptr) && !(res == -0.0f && __signbit_float(res) == 1) [L111] EXPR res == -0.0f && __signbit_float(res) == 1 VAL [\read(iptr)=4370464769, iptr={6:0}, isinf_float(iptr)=1, isinf_float(iptr) && !(res == -0.0f && __signbit_float(res) == 1)=1, one_modf=1, res=4370464771, res == -0.0f && __signbit_float(res) == 1=0, x=4370464771] [L111] isinf_float(iptr) && !(res == -0.0f && __signbit_float(res) == 1) VAL [\read(iptr)=4370464769, iptr={6:0}, isinf_float(iptr)=1, isinf_float(iptr) && !(res == -0.0f && __signbit_float(res) == 1)=1, one_modf=1, res=4370464771, res == -0.0f && __signbit_float(res) == 1=0, x=4370464771] [L111] COND TRUE isinf_float(iptr) && !(res == -0.0f && __signbit_float(res) == 1) [L112] reach_error() VAL [iptr={6:0}, one_modf=1, res=4370464771, x=4370464771] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 126 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 89 mSDtfsCounter, 5 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 31 ConstructedInterpolants, 0 QuantifiedInterpolants, 32 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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 [2022-02-20 16:46:35,071 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... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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_1211b.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 60a85fa0dc6e4e6b4078469f7e24e1dca9372a9f2a0f0b1c4c333cd6d766b7f3 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:46:36,704 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:46:36,707 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:46:36,734 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:46:36,734 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:46:36,735 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:46:36,738 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:46:36,752 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:46:36,754 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:46:36,757 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:46:36,758 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:46:36,765 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:46:36,767 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:46:36,769 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:46:36,770 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:46:36,771 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:46:36,771 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:46:36,772 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:46:36,776 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:46:36,781 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:46:36,783 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:46:36,786 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:46:36,787 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:46:36,787 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:46:36,789 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:46:36,791 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:46:36,791 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:46:36,792 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:46:36,793 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:46:36,794 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:46:36,794 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:46:36,794 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:46:36,795 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:46:36,796 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:46:36,797 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:46:36,797 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:46:36,797 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:46:36,797 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:46:36,798 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:46:36,799 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:46:36,799 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:46:36,800 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 16:46:36,821 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:46:36,821 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:46:36,821 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:46:36,821 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:46:36,822 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:46:36,822 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:46:36,822 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:46:36,823 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:46:36,823 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:46:36,823 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:46:36,823 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:46:36,823 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:46:36,823 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:46:36,824 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:46:36,824 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:46:36,824 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:46:36,824 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:46:36,824 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:46:36,824 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:46:36,824 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:46:36,824 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:46:36,825 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:46:36,825 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:46:36,825 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:46:36,825 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:46:36,825 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:46:36,825 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:36,826 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:46:36,826 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:46:36,826 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:46:36,826 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:46:36,826 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:46:36,826 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:46:36,826 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:46:36,826 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:46:36,827 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:46:36,827 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 -> 60a85fa0dc6e4e6b4078469f7e24e1dca9372a9f2a0f0b1c4c333cd6d766b7f3 [2022-02-20 16:46:37,082 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:46:37,102 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:46:37,104 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:46:37,105 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:46:37,105 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:46:37,107 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1211b.c [2022-02-20 16:46:37,152 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ad91c4b2/e0e2288a3aaa40a6a2c26ca8b15e39b1/FLAG903ede59f [2022-02-20 16:46:37,534 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:46:37,535 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1211b.c [2022-02-20 16:46:37,541 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ad91c4b2/e0e2288a3aaa40a6a2c26ca8b15e39b1/FLAG903ede59f [2022-02-20 16:46:37,554 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ad91c4b2/e0e2288a3aaa40a6a2c26ca8b15e39b1 [2022-02-20 16:46:37,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:46:37,557 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:46:37,559 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:37,559 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:46:37,561 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:46:37,562 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:37" (1/1) ... [2022-02-20 16:46:37,563 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a2b9e8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:37, skipping insertion in model container [2022-02-20 16:46:37,563 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:37" (1/1) ... [2022-02-20 16:46:37,567 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:46:37,583 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:46:37,695 WARN L230 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_1211b.c[2579,2592] [2022-02-20 16:46:37,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:37,711 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:46:37,767 WARN L230 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_1211b.c[2579,2592] [2022-02-20 16:46:37,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:37,778 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:46:37,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:37 WrapperNode [2022-02-20 16:46:37,779 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:37,779 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:37,780 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:46:37,780 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:46:37,784 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:37" (1/1) ... [2022-02-20 16:46:37,791 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:37" (1/1) ... [2022-02-20 16:46:37,814 INFO L137 Inliner]: procedures = 22, calls = 57, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 182 [2022-02-20 16:46:37,818 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:37,819 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:46:37,819 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:46:37,819 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:46:37,825 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:37" (1/1) ... [2022-02-20 16:46:37,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:37" (1/1) ... [2022-02-20 16:46:37,842 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:37" (1/1) ... [2022-02-20 16:46:37,843 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:37" (1/1) ... [2022-02-20 16:46:37,853 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:37" (1/1) ... [2022-02-20 16:46:37,868 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:37" (1/1) ... [2022-02-20 16:46:37,873 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:37" (1/1) ... [2022-02-20 16:46:37,882 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:46:37,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:46:37,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:46:37,884 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:46:37,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:37" (1/1) ... [2022-02-20 16:46:37,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:37,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:46:37,911 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) [2022-02-20 16:46:37,912 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 [2022-02-20 16:46:37,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:46:37,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2022-02-20 16:46:37,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:46:37,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:46:37,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:46:37,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:46:37,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:46:37,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:46:37,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:46:37,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:46:37,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:46:38,054 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:46:38,056 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:46:38,457 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:46:38,463 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:46:38,465 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2022-02-20 16:46:38,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:38 BoogieIcfgContainer [2022-02-20 16:46:38,468 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:46:38,469 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:46:38,470 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:46:38,472 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:46:38,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:46:37" (1/3) ... [2022-02-20 16:46:38,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4962120a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:38, skipping insertion in model container [2022-02-20 16:46:38,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:37" (2/3) ... [2022-02-20 16:46:38,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4962120a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:38, skipping insertion in model container [2022-02-20 16:46:38,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:38" (3/3) ... [2022-02-20 16:46:38,476 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1211b.c [2022-02-20 16:46:38,481 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:46:38,481 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:46:38,529 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:46:38,534 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, mAutomataTypeConcurrency=PETRI_NET, 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 [2022-02-20 16:46:38,535 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:46:38,549 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 40 states have (on average 1.625) internal successors, (65), 41 states have internal predecessors, (65), 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) [2022-02-20 16:46:38,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:46:38,554 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:38,554 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:38,555 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:38,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:38,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1888439402, now seen corresponding path program 1 times [2022-02-20 16:46:38,573 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:38,573 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1987080393] [2022-02-20 16:46:38,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:38,574 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:38,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:38,577 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) [2022-02-20 16:46:38,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 16:46:38,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:38,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:46:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:38,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:38,784 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_modf~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {45#true} is VALID [2022-02-20 16:46:38,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~ret15#1, main_#t~mem16#1, main_#t~ret17#1, main_#t~ret18#1, main_#t~short19#1, main_#t~short20#1, main_~x~0#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 1.0)), ~Pluszero~FLOAT());call main_~#iptr~0#1.base, main_~#iptr~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~intFLOATTYPE4(main_#t~nondet14#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset, 4bv32);havoc main_#t~nondet14#1;assume { :begin_inline_modf_float } true;modf_float_#in~x#1, modf_float_#in~iptr#1.base, modf_float_#in~iptr#1.offset := main_~x~0#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset;havoc modf_float_#res#1;havoc modf_float_#t~mem4#1, modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset, modf_float_#t~mem5#1, modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset, modf_float_#t~mem6#1, modf_float_~#gf_u~1#1.base, modf_float_~#gf_u~1#1.offset, modf_float_#t~mem7#1, modf_float_~#sf_u~1#1.base, modf_float_~#sf_u~1#1.offset, modf_float_~ix~0#1, modf_float_#t~mem8#1, modf_float_~#sf_u~2#1.base, modf_float_~#sf_u~2#1.offset, modf_float_#t~mem9#1, modf_float_#t~mem10#1, modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset, modf_float_#t~mem11#1, modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset, modf_float_~ix~1#1, modf_float_~x#1, modf_float_~iptr#1.base, modf_float_~iptr#1.offset, modf_float_~i0~0#1, modf_float_~j0~0#1, modf_float_~i~0#1;modf_float_~x#1 := modf_float_#in~x#1;modf_float_~iptr#1.base, modf_float_~iptr#1.offset := modf_float_#in~iptr#1.base, modf_float_#in~iptr#1.offset;havoc modf_float_~i0~0#1;havoc modf_float_~j0~0#1;havoc modf_float_~i~0#1; {45#true} is VALID [2022-02-20 16:46:38,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {45#true} assume !true; {46#false} is VALID [2022-02-20 16:46:38,786 INFO L290 TraceCheckUtils]: 3: Hoare triple {46#false} modf_float_~j0~0#1 := ~bvsub32(~bvand32(255bv32, ~bvashr32(modf_float_~i0~0#1, 23bv32)), 127bv32); {46#false} is VALID [2022-02-20 16:46:38,786 INFO L290 TraceCheckUtils]: 4: Hoare triple {46#false} assume !~bvslt32(modf_float_~j0~0#1, 23bv32);havoc modf_float_~ix~1#1;call write~intFLOATTYPE4(~fp.mul~FLOAT(currentRoundingMode, modf_float_~x#1, ~one_modf~0), modf_float_~iptr#1.base, modf_float_~iptr#1.offset, 4bv32); {46#false} is VALID [2022-02-20 16:46:38,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {46#false} assume !true; {46#false} is VALID [2022-02-20 16:46:38,787 INFO L290 TraceCheckUtils]: 6: Hoare triple {46#false} assume !true; {46#false} is VALID [2022-02-20 16:46:38,787 INFO L290 TraceCheckUtils]: 7: Hoare triple {46#false} modf_float_#res#1 := modf_float_~x#1; {46#false} is VALID [2022-02-20 16:46:38,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {46#false} main_#t~ret15#1 := modf_float_#res#1;assume { :end_inline_modf_float } true;main_~res~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1;call main_#t~mem16#1 := read~intFLOATTYPE4(main_~#iptr~0#1.base, main_~#iptr~0#1.offset, 4bv32);assume { :begin_inline_isinf_float } true;isinf_float_#in~x#1 := main_#t~mem16#1;havoc isinf_float_#res#1;havoc isinf_float_#t~mem13#1, isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset, isinf_float_~x#1, isinf_float_~ix~2#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~2#1; {46#false} is VALID [2022-02-20 16:46:38,789 INFO L290 TraceCheckUtils]: 9: Hoare triple {46#false} assume !true; {46#false} is VALID [2022-02-20 16:46:38,789 INFO L290 TraceCheckUtils]: 10: Hoare triple {46#false} isinf_float_~ix~2#1 := ~bvand32(2147483647bv32, isinf_float_~ix~2#1);isinf_float_#res#1 := (if 2139095040bv32 == isinf_float_~ix~2#1 then 1bv32 else 0bv32); {46#false} is VALID [2022-02-20 16:46:38,789 INFO L290 TraceCheckUtils]: 11: Hoare triple {46#false} main_#t~ret17#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true;main_#t~short20#1 := 0bv32 != main_#t~ret17#1; {46#false} is VALID [2022-02-20 16:46:38,789 INFO L290 TraceCheckUtils]: 12: Hoare triple {46#false} assume !main_#t~short20#1; {46#false} is VALID [2022-02-20 16:46:38,790 INFO L290 TraceCheckUtils]: 13: Hoare triple {46#false} assume main_#t~short20#1;havoc main_#t~mem16#1;havoc main_#t~ret17#1;havoc main_#t~ret18#1;havoc main_#t~short19#1;havoc main_#t~short20#1; {46#false} is VALID [2022-02-20 16:46:38,790 INFO L290 TraceCheckUtils]: 14: Hoare triple {46#false} assume !false; {46#false} is VALID [2022-02-20 16:46:38,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:46:38,793 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:38,793 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:38,794 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1987080393] [2022-02-20 16:46:38,794 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1987080393] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:38,794 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:38,794 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:46:38,797 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857859644] [2022-02-20 16:46:38,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:38,801 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 16:46:38,802 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:38,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:38,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:38,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:46:38,848 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:38,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:46:38,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:38,874 INFO L87 Difference]: Start difference. First operand has 42 states, 40 states have (on average 1.625) internal successors, (65), 41 states have internal predecessors, (65), 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 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:38,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:38,979 INFO L93 Difference]: Finished difference Result 82 states and 128 transitions. [2022-02-20 16:46:38,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:46:38,980 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 16:46:38,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:38,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:38,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 128 transitions. [2022-02-20 16:46:38,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:38,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 128 transitions. [2022-02-20 16:46:38,996 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 128 transitions. [2022-02-20 16:46:39,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:39,151 INFO L225 Difference]: With dead ends: 82 [2022-02-20 16:46:39,151 INFO L226 Difference]: Without dead ends: 39 [2022-02-20 16:46:39,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:39,156 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:39,158 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:46:39,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-20 16:46:39,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-02-20 16:46:39,179 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:39,180 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 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) [2022-02-20 16:46:39,180 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 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) [2022-02-20 16:46:39,181 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 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) [2022-02-20 16:46:39,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:39,184 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-02-20 16:46:39,184 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-02-20 16:46:39,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:39,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:39,186 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 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) Second operand 39 states. [2022-02-20 16:46:39,188 INFO L87 Difference]: Start difference. First operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 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) Second operand 39 states. [2022-02-20 16:46:39,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:39,195 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-02-20 16:46:39,195 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-02-20 16:46:39,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:39,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:39,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:39,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:39,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 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) [2022-02-20 16:46:39,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-02-20 16:46:39,198 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 15 [2022-02-20 16:46:39,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:39,199 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-02-20 16:46:39,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:39,199 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-02-20 16:46:39,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 16:46:39,199 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:39,199 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:39,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:39,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:46:39,401 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:39,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:39,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1291452088, now seen corresponding path program 1 times [2022-02-20 16:46:39,402 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:39,402 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1214723020] [2022-02-20 16:46:39,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:39,402 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:39,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:39,406 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) [2022-02-20 16:46:39,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 16:46:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:39,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:46:39,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:39,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:39,701 INFO L290 TraceCheckUtils]: 0: Hoare triple {322#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_modf~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {322#true} is VALID [2022-02-20 16:46:39,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {322#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~ret15#1, main_#t~mem16#1, main_#t~ret17#1, main_#t~ret18#1, main_#t~short19#1, main_#t~short20#1, main_~x~0#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 1.0)), ~Pluszero~FLOAT());call main_~#iptr~0#1.base, main_~#iptr~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~intFLOATTYPE4(main_#t~nondet14#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset, 4bv32);havoc main_#t~nondet14#1;assume { :begin_inline_modf_float } true;modf_float_#in~x#1, modf_float_#in~iptr#1.base, modf_float_#in~iptr#1.offset := main_~x~0#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset;havoc modf_float_#res#1;havoc modf_float_#t~mem4#1, modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset, modf_float_#t~mem5#1, modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset, modf_float_#t~mem6#1, modf_float_~#gf_u~1#1.base, modf_float_~#gf_u~1#1.offset, modf_float_#t~mem7#1, modf_float_~#sf_u~1#1.base, modf_float_~#sf_u~1#1.offset, modf_float_~ix~0#1, modf_float_#t~mem8#1, modf_float_~#sf_u~2#1.base, modf_float_~#sf_u~2#1.offset, modf_float_#t~mem9#1, modf_float_#t~mem10#1, modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset, modf_float_#t~mem11#1, modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset, modf_float_~ix~1#1, modf_float_~x#1, modf_float_~iptr#1.base, modf_float_~iptr#1.offset, modf_float_~i0~0#1, modf_float_~j0~0#1, modf_float_~i~0#1;modf_float_~x#1 := modf_float_#in~x#1;modf_float_~iptr#1.base, modf_float_~iptr#1.offset := modf_float_#in~iptr#1.base, modf_float_#in~iptr#1.offset;havoc modf_float_~i0~0#1;havoc modf_float_~j0~0#1;havoc modf_float_~i~0#1; {330#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_modf_float_~x#1|))} is VALID [2022-02-20 16:46:39,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {330#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_modf_float_~x#1|))} call modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(modf_float_~x#1, modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset, 4bv32);call modf_float_#t~mem4#1 := read~intINTTYPE4(modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset, 4bv32);modf_float_~i0~0#1 := modf_float_#t~mem4#1;havoc modf_float_#t~mem4#1;call ULTIMATE.dealloc(modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset);havoc modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset; {334#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_modf_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_modf_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_modf_float_~i0~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:39,708 INFO L290 TraceCheckUtils]: 3: Hoare triple {334#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_modf_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_modf_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_modf_float_~i0~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))} goto; {334#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_modf_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_modf_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_modf_float_~i0~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:39,710 INFO L290 TraceCheckUtils]: 4: Hoare triple {334#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_modf_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_modf_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_modf_float_~i0~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))} modf_float_~j0~0#1 := ~bvsub32(~bvand32(255bv32, ~bvashr32(modf_float_~i0~0#1, 23bv32)), 127bv32); {341#(exists ((|ULTIMATE.start_modf_float_~i0~0#1| (_ BitVec 32))) (and (= (bvadd (bvand (bvashr |ULTIMATE.start_modf_float_~i0~0#1| (_ bv23 32)) (_ bv255 32)) (_ bv4294967169 32)) |ULTIMATE.start_modf_float_~j0~0#1|) (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_modf_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_modf_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_modf_float_~i0~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))))} is VALID [2022-02-20 16:46:39,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {341#(exists ((|ULTIMATE.start_modf_float_~i0~0#1| (_ BitVec 32))) (and (= (bvadd (bvand (bvashr |ULTIMATE.start_modf_float_~i0~0#1| (_ bv23 32)) (_ bv255 32)) (_ bv4294967169 32)) |ULTIMATE.start_modf_float_~j0~0#1|) (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_modf_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_modf_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_modf_float_~i0~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))))} assume ~bvslt32(modf_float_~j0~0#1, 23bv32); {323#false} is VALID [2022-02-20 16:46:39,711 INFO L290 TraceCheckUtils]: 6: Hoare triple {323#false} assume ~bvslt32(modf_float_~j0~0#1, 0bv32); {323#false} is VALID [2022-02-20 16:46:39,711 INFO L290 TraceCheckUtils]: 7: Hoare triple {323#false} call modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(~bvand32(2147483648bv32, modf_float_~i0~0#1), modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset, 4bv32);call modf_float_#t~mem5#1 := read~intFLOATTYPE4(modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset, 4bv32);call write~intFLOATTYPE4(modf_float_#t~mem5#1, modf_float_~iptr#1.base, modf_float_~iptr#1.offset, 4bv32);havoc modf_float_#t~mem5#1;call ULTIMATE.dealloc(modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset);havoc modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset; {323#false} is VALID [2022-02-20 16:46:39,712 INFO L290 TraceCheckUtils]: 8: Hoare triple {323#false} goto; {323#false} is VALID [2022-02-20 16:46:39,712 INFO L290 TraceCheckUtils]: 9: Hoare triple {323#false} modf_float_#res#1 := modf_float_~x#1; {323#false} is VALID [2022-02-20 16:46:39,712 INFO L290 TraceCheckUtils]: 10: Hoare triple {323#false} main_#t~ret15#1 := modf_float_#res#1;assume { :end_inline_modf_float } true;main_~res~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1;call main_#t~mem16#1 := read~intFLOATTYPE4(main_~#iptr~0#1.base, main_~#iptr~0#1.offset, 4bv32);assume { :begin_inline_isinf_float } true;isinf_float_#in~x#1 := main_#t~mem16#1;havoc isinf_float_#res#1;havoc isinf_float_#t~mem13#1, isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset, isinf_float_~x#1, isinf_float_~ix~2#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~2#1; {323#false} is VALID [2022-02-20 16:46:39,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {323#false} call isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(isinf_float_~x#1, isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset, 4bv32);call isinf_float_#t~mem13#1 := read~intINTTYPE4(isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset, 4bv32);isinf_float_~ix~2#1 := isinf_float_#t~mem13#1;havoc isinf_float_#t~mem13#1;call ULTIMATE.dealloc(isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset);havoc isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset; {323#false} is VALID [2022-02-20 16:46:39,712 INFO L290 TraceCheckUtils]: 12: Hoare triple {323#false} goto; {323#false} is VALID [2022-02-20 16:46:39,712 INFO L290 TraceCheckUtils]: 13: Hoare triple {323#false} isinf_float_~ix~2#1 := ~bvand32(2147483647bv32, isinf_float_~ix~2#1);isinf_float_#res#1 := (if 2139095040bv32 == isinf_float_~ix~2#1 then 1bv32 else 0bv32); {323#false} is VALID [2022-02-20 16:46:39,712 INFO L290 TraceCheckUtils]: 14: Hoare triple {323#false} main_#t~ret17#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true;main_#t~short20#1 := 0bv32 != main_#t~ret17#1; {323#false} is VALID [2022-02-20 16:46:39,712 INFO L290 TraceCheckUtils]: 15: Hoare triple {323#false} assume !main_#t~short20#1; {323#false} is VALID [2022-02-20 16:46:39,712 INFO L290 TraceCheckUtils]: 16: Hoare triple {323#false} assume main_#t~short20#1;havoc main_#t~mem16#1;havoc main_#t~ret17#1;havoc main_#t~ret18#1;havoc main_#t~short19#1;havoc main_#t~short20#1; {323#false} is VALID [2022-02-20 16:46:39,713 INFO L290 TraceCheckUtils]: 17: Hoare triple {323#false} assume !false; {323#false} is VALID [2022-02-20 16:46:39,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:46:39,713 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:39,713 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:39,713 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1214723020] [2022-02-20 16:46:39,713 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1214723020] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:39,719 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:39,719 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:46:39,719 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56853333] [2022-02-20 16:46:39,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:39,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 16:46:39,720 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:39,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:39,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:39,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:46:39,744 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:39,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:46:39,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:39,745 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:39,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:39,901 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2022-02-20 16:46:39,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:46:39,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 16:46:39,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:39,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:39,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-02-20 16:46:39,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:39,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-02-20 16:46:39,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2022-02-20 16:46:39,992 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:39,992 INFO L225 Difference]: With dead ends: 54 [2022-02-20 16:46:39,993 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 16:46:39,993 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:39,994 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:39,994 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 8 Unchecked, 0.0s Time] [2022-02-20 16:46:39,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 16:46:39,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-02-20 16:46:39,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:39,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.08) internal successors, (27), 25 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) [2022-02-20 16:46:39,996 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.08) internal successors, (27), 25 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) [2022-02-20 16:46:39,996 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.08) internal successors, (27), 25 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) [2022-02-20 16:46:39,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:39,997 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-02-20 16:46:39,997 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-02-20 16:46:39,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:39,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:39,998 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 25 states have (on average 1.08) internal successors, (27), 25 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) Second operand 26 states. [2022-02-20 16:46:39,998 INFO L87 Difference]: Start difference. First operand has 26 states, 25 states have (on average 1.08) internal successors, (27), 25 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) Second operand 26 states. [2022-02-20 16:46:39,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:39,999 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-02-20 16:46:39,999 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-02-20 16:46:39,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:40,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:40,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:40,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:40,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.08) internal successors, (27), 25 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) [2022-02-20 16:46:40,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-02-20 16:46:40,001 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 18 [2022-02-20 16:46:40,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:40,001 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-02-20 16:46:40,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:40,001 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-02-20 16:46:40,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 16:46:40,002 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:40,002 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:40,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:40,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:46:40,214 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:40,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:40,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1647807069, now seen corresponding path program 1 times [2022-02-20 16:46:40,215 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:40,215 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1215535071] [2022-02-20 16:46:40,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:40,215 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:40,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:40,216 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) [2022-02-20 16:46:40,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 16:46:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:40,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 16:46:40,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:40,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:40,386 INFO L290 TraceCheckUtils]: 0: Hoare triple {534#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_modf~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {534#true} is VALID [2022-02-20 16:46:40,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {534#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~ret15#1, main_#t~mem16#1, main_#t~ret17#1, main_#t~ret18#1, main_#t~short19#1, main_#t~short20#1, main_~x~0#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 1.0)), ~Pluszero~FLOAT());call main_~#iptr~0#1.base, main_~#iptr~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~intFLOATTYPE4(main_#t~nondet14#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset, 4bv32);havoc main_#t~nondet14#1;assume { :begin_inline_modf_float } true;modf_float_#in~x#1, modf_float_#in~iptr#1.base, modf_float_#in~iptr#1.offset := main_~x~0#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset;havoc modf_float_#res#1;havoc modf_float_#t~mem4#1, modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset, modf_float_#t~mem5#1, modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset, modf_float_#t~mem6#1, modf_float_~#gf_u~1#1.base, modf_float_~#gf_u~1#1.offset, modf_float_#t~mem7#1, modf_float_~#sf_u~1#1.base, modf_float_~#sf_u~1#1.offset, modf_float_~ix~0#1, modf_float_#t~mem8#1, modf_float_~#sf_u~2#1.base, modf_float_~#sf_u~2#1.offset, modf_float_#t~mem9#1, modf_float_#t~mem10#1, modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset, modf_float_#t~mem11#1, modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset, modf_float_~ix~1#1, modf_float_~x#1, modf_float_~iptr#1.base, modf_float_~iptr#1.offset, modf_float_~i0~0#1, modf_float_~j0~0#1, modf_float_~i~0#1;modf_float_~x#1 := modf_float_#in~x#1;modf_float_~iptr#1.base, modf_float_~iptr#1.offset := modf_float_#in~iptr#1.base, modf_float_#in~iptr#1.offset;havoc modf_float_~i0~0#1;havoc modf_float_~j0~0#1;havoc modf_float_~i~0#1; {534#true} is VALID [2022-02-20 16:46:40,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {534#true} call modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(modf_float_~x#1, modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset, 4bv32);call modf_float_#t~mem4#1 := read~intINTTYPE4(modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset, 4bv32);modf_float_~i0~0#1 := modf_float_#t~mem4#1;havoc modf_float_#t~mem4#1;call ULTIMATE.dealloc(modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset);havoc modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset; {534#true} is VALID [2022-02-20 16:46:40,387 INFO L290 TraceCheckUtils]: 3: Hoare triple {534#true} goto; {534#true} is VALID [2022-02-20 16:46:40,387 INFO L290 TraceCheckUtils]: 4: Hoare triple {534#true} modf_float_~j0~0#1 := ~bvsub32(~bvand32(255bv32, ~bvashr32(modf_float_~i0~0#1, 23bv32)), 127bv32); {534#true} is VALID [2022-02-20 16:46:40,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {534#true} assume !~bvslt32(modf_float_~j0~0#1, 23bv32);havoc modf_float_~ix~1#1;call write~intFLOATTYPE4(~fp.mul~FLOAT(currentRoundingMode, modf_float_~x#1, ~one_modf~0), modf_float_~iptr#1.base, modf_float_~iptr#1.offset, 4bv32); {534#true} is VALID [2022-02-20 16:46:40,387 INFO L290 TraceCheckUtils]: 6: Hoare triple {534#true} call modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(modf_float_~x#1, modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset, 4bv32);call modf_float_#t~mem10#1 := read~intINTTYPE4(modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset, 4bv32);modf_float_~ix~1#1 := modf_float_#t~mem10#1;havoc modf_float_#t~mem10#1;call ULTIMATE.dealloc(modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset);havoc modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset; {534#true} is VALID [2022-02-20 16:46:40,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {534#true} goto; {534#true} is VALID [2022-02-20 16:46:40,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {534#true} call modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(~bvand32(2147483648bv32, modf_float_~ix~1#1), modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset, 4bv32);call modf_float_#t~mem11#1 := read~intFLOATTYPE4(modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset, 4bv32);modf_float_~x#1 := modf_float_#t~mem11#1;havoc modf_float_#t~mem11#1;call ULTIMATE.dealloc(modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset);havoc modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset; {534#true} is VALID [2022-02-20 16:46:40,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {534#true} goto; {534#true} is VALID [2022-02-20 16:46:40,388 INFO L290 TraceCheckUtils]: 10: Hoare triple {534#true} modf_float_#res#1 := modf_float_~x#1; {534#true} is VALID [2022-02-20 16:46:40,388 INFO L290 TraceCheckUtils]: 11: Hoare triple {534#true} main_#t~ret15#1 := modf_float_#res#1;assume { :end_inline_modf_float } true;main_~res~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1;call main_#t~mem16#1 := read~intFLOATTYPE4(main_~#iptr~0#1.base, main_~#iptr~0#1.offset, 4bv32);assume { :begin_inline_isinf_float } true;isinf_float_#in~x#1 := main_#t~mem16#1;havoc isinf_float_#res#1;havoc isinf_float_#t~mem13#1, isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset, isinf_float_~x#1, isinf_float_~ix~2#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~2#1; {534#true} is VALID [2022-02-20 16:46:40,388 INFO L290 TraceCheckUtils]: 12: Hoare triple {534#true} call isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(isinf_float_~x#1, isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset, 4bv32);call isinf_float_#t~mem13#1 := read~intINTTYPE4(isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset, 4bv32);isinf_float_~ix~2#1 := isinf_float_#t~mem13#1;havoc isinf_float_#t~mem13#1;call ULTIMATE.dealloc(isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset);havoc isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset; {534#true} is VALID [2022-02-20 16:46:40,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {534#true} goto; {534#true} is VALID [2022-02-20 16:46:40,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {534#true} isinf_float_~ix~2#1 := ~bvand32(2147483647bv32, isinf_float_~ix~2#1);isinf_float_#res#1 := (if 2139095040bv32 == isinf_float_~ix~2#1 then 1bv32 else 0bv32); {534#true} is VALID [2022-02-20 16:46:40,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {534#true} main_#t~ret17#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true;main_#t~short20#1 := 0bv32 != main_#t~ret17#1; {534#true} is VALID [2022-02-20 16:46:40,391 INFO L290 TraceCheckUtils]: 16: Hoare triple {534#true} assume !main_#t~short20#1; {587#(not |ULTIMATE.start_main_#t~short20#1|)} is VALID [2022-02-20 16:46:40,391 INFO L290 TraceCheckUtils]: 17: Hoare triple {587#(not |ULTIMATE.start_main_#t~short20#1|)} assume main_#t~short20#1;havoc main_#t~mem16#1;havoc main_#t~ret17#1;havoc main_#t~ret18#1;havoc main_#t~short19#1;havoc main_#t~short20#1; {535#false} is VALID [2022-02-20 16:46:40,391 INFO L290 TraceCheckUtils]: 18: Hoare triple {535#false} assume !false; {535#false} is VALID [2022-02-20 16:46:40,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:46:40,392 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:40,392 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:40,392 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1215535071] [2022-02-20 16:46:40,392 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1215535071] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:40,392 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:40,392 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:46:40,393 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382999699] [2022-02-20 16:46:40,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:40,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 16:46:40,393 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:40,394 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:40,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:40,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:46:40,430 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:40,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:46:40,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:46:40,431 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:40,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:40,558 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-02-20 16:46:40,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:46:40,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 16:46:40,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:40,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:40,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-02-20 16:46:40,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:40,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-02-20 16:46:40,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 29 transitions. [2022-02-20 16:46:40,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:40,612 INFO L225 Difference]: With dead ends: 29 [2022-02-20 16:46:40,612 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 16:46:40,613 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:46:40,613 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:40,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:46:40,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 16:46:40,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-02-20 16:46:40,615 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:40,615 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.04) internal successors, (26), 25 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) [2022-02-20 16:46:40,616 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.04) internal successors, (26), 25 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) [2022-02-20 16:46:40,616 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.04) internal successors, (26), 25 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) [2022-02-20 16:46:40,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:40,616 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-02-20 16:46:40,616 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-02-20 16:46:40,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:40,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:40,617 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 25 states have (on average 1.04) internal successors, (26), 25 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) Second operand 26 states. [2022-02-20 16:46:40,618 INFO L87 Difference]: Start difference. First operand has 26 states, 25 states have (on average 1.04) internal successors, (26), 25 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) Second operand 26 states. [2022-02-20 16:46:40,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:40,619 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-02-20 16:46:40,619 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-02-20 16:46:40,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:40,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:40,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:40,621 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:40,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.04) internal successors, (26), 25 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) [2022-02-20 16:46:40,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2022-02-20 16:46:40,622 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 19 [2022-02-20 16:46:40,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:40,622 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2022-02-20 16:46:40,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:40,623 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-02-20 16:46:40,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 16:46:40,623 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:40,623 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:40,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:40,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:46:40,835 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:40,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:40,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1322743609, now seen corresponding path program 1 times [2022-02-20 16:46:40,836 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:40,836 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [301954962] [2022-02-20 16:46:40,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:40,836 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:40,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:40,837 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) [2022-02-20 16:46:40,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 16:46:40,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:40,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 16:46:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:40,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:41,078 INFO L290 TraceCheckUtils]: 0: Hoare triple {714#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_modf~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {714#true} is VALID [2022-02-20 16:46:41,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {714#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~ret15#1, main_#t~mem16#1, main_#t~ret17#1, main_#t~ret18#1, main_#t~short19#1, main_#t~short20#1, main_~x~0#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 1.0)), ~Pluszero~FLOAT());call main_~#iptr~0#1.base, main_~#iptr~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~intFLOATTYPE4(main_#t~nondet14#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset, 4bv32);havoc main_#t~nondet14#1;assume { :begin_inline_modf_float } true;modf_float_#in~x#1, modf_float_#in~iptr#1.base, modf_float_#in~iptr#1.offset := main_~x~0#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset;havoc modf_float_#res#1;havoc modf_float_#t~mem4#1, modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset, modf_float_#t~mem5#1, modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset, modf_float_#t~mem6#1, modf_float_~#gf_u~1#1.base, modf_float_~#gf_u~1#1.offset, modf_float_#t~mem7#1, modf_float_~#sf_u~1#1.base, modf_float_~#sf_u~1#1.offset, modf_float_~ix~0#1, modf_float_#t~mem8#1, modf_float_~#sf_u~2#1.base, modf_float_~#sf_u~2#1.offset, modf_float_#t~mem9#1, modf_float_#t~mem10#1, modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset, modf_float_#t~mem11#1, modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset, modf_float_~ix~1#1, modf_float_~x#1, modf_float_~iptr#1.base, modf_float_~iptr#1.offset, modf_float_~i0~0#1, modf_float_~j0~0#1, modf_float_~i~0#1;modf_float_~x#1 := modf_float_#in~x#1;modf_float_~iptr#1.base, modf_float_~iptr#1.offset := modf_float_#in~iptr#1.base, modf_float_#in~iptr#1.offset;havoc modf_float_~i0~0#1;havoc modf_float_~j0~0#1;havoc modf_float_~i~0#1; {714#true} is VALID [2022-02-20 16:46:41,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {714#true} call modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(modf_float_~x#1, modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset, 4bv32);call modf_float_#t~mem4#1 := read~intINTTYPE4(modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset, 4bv32);modf_float_~i0~0#1 := modf_float_#t~mem4#1;havoc modf_float_#t~mem4#1;call ULTIMATE.dealloc(modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset);havoc modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset; {714#true} is VALID [2022-02-20 16:46:41,079 INFO L290 TraceCheckUtils]: 3: Hoare triple {714#true} goto; {714#true} is VALID [2022-02-20 16:46:41,079 INFO L290 TraceCheckUtils]: 4: Hoare triple {714#true} modf_float_~j0~0#1 := ~bvsub32(~bvand32(255bv32, ~bvashr32(modf_float_~i0~0#1, 23bv32)), 127bv32); {714#true} is VALID [2022-02-20 16:46:41,079 INFO L290 TraceCheckUtils]: 5: Hoare triple {714#true} assume !~bvslt32(modf_float_~j0~0#1, 23bv32);havoc modf_float_~ix~1#1;call write~intFLOATTYPE4(~fp.mul~FLOAT(currentRoundingMode, modf_float_~x#1, ~one_modf~0), modf_float_~iptr#1.base, modf_float_~iptr#1.offset, 4bv32); {714#true} is VALID [2022-02-20 16:46:41,079 INFO L290 TraceCheckUtils]: 6: Hoare triple {714#true} call modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(modf_float_~x#1, modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset, 4bv32);call modf_float_#t~mem10#1 := read~intINTTYPE4(modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset, 4bv32);modf_float_~ix~1#1 := modf_float_#t~mem10#1;havoc modf_float_#t~mem10#1;call ULTIMATE.dealloc(modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset);havoc modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset; {714#true} is VALID [2022-02-20 16:46:41,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {714#true} goto; {714#true} is VALID [2022-02-20 16:46:41,081 INFO L290 TraceCheckUtils]: 8: Hoare triple {714#true} call modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(~bvand32(2147483648bv32, modf_float_~ix~1#1), modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset, 4bv32);call modf_float_#t~mem11#1 := read~intFLOATTYPE4(modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset, 4bv32);modf_float_~x#1 := modf_float_#t~mem11#1;havoc modf_float_#t~mem11#1;call ULTIMATE.dealloc(modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset);havoc modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset; {743#(exists ((|ULTIMATE.start_modf_float_~ix~1#1| (_ BitVec 32))) (= |ULTIMATE.start_modf_float_~x#1| (fp ((_ extract 31 31) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))) ((_ extract 30 23) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))) ((_ extract 22 0) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))))))} is VALID [2022-02-20 16:46:41,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {743#(exists ((|ULTIMATE.start_modf_float_~ix~1#1| (_ BitVec 32))) (= |ULTIMATE.start_modf_float_~x#1| (fp ((_ extract 31 31) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))) ((_ extract 30 23) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))) ((_ extract 22 0) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))))))} goto; {743#(exists ((|ULTIMATE.start_modf_float_~ix~1#1| (_ BitVec 32))) (= |ULTIMATE.start_modf_float_~x#1| (fp ((_ extract 31 31) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))) ((_ extract 30 23) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))) ((_ extract 22 0) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))))))} is VALID [2022-02-20 16:46:41,085 INFO L290 TraceCheckUtils]: 10: Hoare triple {743#(exists ((|ULTIMATE.start_modf_float_~ix~1#1| (_ BitVec 32))) (= |ULTIMATE.start_modf_float_~x#1| (fp ((_ extract 31 31) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))) ((_ extract 30 23) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))) ((_ extract 22 0) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))))))} modf_float_#res#1 := modf_float_~x#1; {750#(exists ((|ULTIMATE.start_modf_float_~ix~1#1| (_ BitVec 32))) (= |ULTIMATE.start_modf_float_#res#1| (fp ((_ extract 31 31) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))) ((_ extract 30 23) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))) ((_ extract 22 0) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))))))} is VALID [2022-02-20 16:46:41,086 INFO L290 TraceCheckUtils]: 11: Hoare triple {750#(exists ((|ULTIMATE.start_modf_float_~ix~1#1| (_ BitVec 32))) (= |ULTIMATE.start_modf_float_#res#1| (fp ((_ extract 31 31) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))) ((_ extract 30 23) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))) ((_ extract 22 0) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))))))} main_#t~ret15#1 := modf_float_#res#1;assume { :end_inline_modf_float } true;main_~res~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1;call main_#t~mem16#1 := read~intFLOATTYPE4(main_~#iptr~0#1.base, main_~#iptr~0#1.offset, 4bv32);assume { :begin_inline_isinf_float } true;isinf_float_#in~x#1 := main_#t~mem16#1;havoc isinf_float_#res#1;havoc isinf_float_#t~mem13#1, isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset, isinf_float_~x#1, isinf_float_~ix~2#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~2#1; {754#(exists ((|ULTIMATE.start_modf_float_~ix~1#1| (_ BitVec 32))) (= |ULTIMATE.start_main_~res~0#1| (fp ((_ extract 31 31) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))) ((_ extract 30 23) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))) ((_ extract 22 0) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))))))} is VALID [2022-02-20 16:46:41,086 INFO L290 TraceCheckUtils]: 12: Hoare triple {754#(exists ((|ULTIMATE.start_modf_float_~ix~1#1| (_ BitVec 32))) (= |ULTIMATE.start_main_~res~0#1| (fp ((_ extract 31 31) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))) ((_ extract 30 23) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))) ((_ extract 22 0) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))))))} call isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(isinf_float_~x#1, isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset, 4bv32);call isinf_float_#t~mem13#1 := read~intINTTYPE4(isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset, 4bv32);isinf_float_~ix~2#1 := isinf_float_#t~mem13#1;havoc isinf_float_#t~mem13#1;call ULTIMATE.dealloc(isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset);havoc isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset; {754#(exists ((|ULTIMATE.start_modf_float_~ix~1#1| (_ BitVec 32))) (= |ULTIMATE.start_main_~res~0#1| (fp ((_ extract 31 31) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))) ((_ extract 30 23) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))) ((_ extract 22 0) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))))))} is VALID [2022-02-20 16:46:41,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {754#(exists ((|ULTIMATE.start_modf_float_~ix~1#1| (_ BitVec 32))) (= |ULTIMATE.start_main_~res~0#1| (fp ((_ extract 31 31) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))) ((_ extract 30 23) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))) ((_ extract 22 0) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))))))} goto; {754#(exists ((|ULTIMATE.start_modf_float_~ix~1#1| (_ BitVec 32))) (= |ULTIMATE.start_main_~res~0#1| (fp ((_ extract 31 31) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))) ((_ extract 30 23) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))) ((_ extract 22 0) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))))))} is VALID [2022-02-20 16:46:41,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {754#(exists ((|ULTIMATE.start_modf_float_~ix~1#1| (_ BitVec 32))) (= |ULTIMATE.start_main_~res~0#1| (fp ((_ extract 31 31) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))) ((_ extract 30 23) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))) ((_ extract 22 0) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))))))} isinf_float_~ix~2#1 := ~bvand32(2147483647bv32, isinf_float_~ix~2#1);isinf_float_#res#1 := (if 2139095040bv32 == isinf_float_~ix~2#1 then 1bv32 else 0bv32); {754#(exists ((|ULTIMATE.start_modf_float_~ix~1#1| (_ BitVec 32))) (= |ULTIMATE.start_main_~res~0#1| (fp ((_ extract 31 31) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))) ((_ extract 30 23) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))) ((_ extract 22 0) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))))))} is VALID [2022-02-20 16:46:41,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {754#(exists ((|ULTIMATE.start_modf_float_~ix~1#1| (_ BitVec 32))) (= |ULTIMATE.start_main_~res~0#1| (fp ((_ extract 31 31) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))) ((_ extract 30 23) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))) ((_ extract 22 0) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))))))} main_#t~ret17#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true;main_#t~short20#1 := 0bv32 != main_#t~ret17#1; {754#(exists ((|ULTIMATE.start_modf_float_~ix~1#1| (_ BitVec 32))) (= |ULTIMATE.start_main_~res~0#1| (fp ((_ extract 31 31) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))) ((_ extract 30 23) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))) ((_ extract 22 0) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))))))} is VALID [2022-02-20 16:46:41,089 INFO L290 TraceCheckUtils]: 16: Hoare triple {754#(exists ((|ULTIMATE.start_modf_float_~ix~1#1| (_ BitVec 32))) (= |ULTIMATE.start_main_~res~0#1| (fp ((_ extract 31 31) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))) ((_ extract 30 23) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))) ((_ extract 22 0) (bvand |ULTIMATE.start_modf_float_~ix~1#1| (_ bv2147483648 32))))))} assume main_#t~short20#1;main_#t~short19#1 := ~fp.eq~FLOAT(main_~res~0#1, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {770#|ULTIMATE.start_main_#t~short19#1|} is VALID [2022-02-20 16:46:41,089 INFO L290 TraceCheckUtils]: 17: Hoare triple {770#|ULTIMATE.start_main_#t~short19#1|} assume !main_#t~short19#1; {715#false} is VALID [2022-02-20 16:46:41,089 INFO L290 TraceCheckUtils]: 18: Hoare triple {715#false} main_#t~short20#1 := !main_#t~short19#1; {715#false} is VALID [2022-02-20 16:46:41,089 INFO L290 TraceCheckUtils]: 19: Hoare triple {715#false} assume main_#t~short20#1;havoc main_#t~mem16#1;havoc main_#t~ret17#1;havoc main_#t~ret18#1;havoc main_#t~short19#1;havoc main_#t~short20#1; {715#false} is VALID [2022-02-20 16:46:41,089 INFO L290 TraceCheckUtils]: 20: Hoare triple {715#false} assume !false; {715#false} is VALID [2022-02-20 16:46:41,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:46:41,090 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:41,090 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:41,090 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [301954962] [2022-02-20 16:46:41,090 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [301954962] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:41,090 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:41,090 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:46:41,090 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941983198] [2022-02-20 16:46:41,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:41,091 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 16:46:41,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:41,091 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:41,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:41,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 16:46:41,136 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:41,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 16:46:41,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:46:41,137 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:41,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:41,448 INFO L93 Difference]: Finished difference Result 30 states and 29 transitions. [2022-02-20 16:46:41,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:46:41,448 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 16:46:41,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:41,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:41,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2022-02-20 16:46:41,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:41,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2022-02-20 16:46:41,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 29 transitions. [2022-02-20 16:46:41,496 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:41,497 INFO L225 Difference]: With dead ends: 30 [2022-02-20 16:46:41,497 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 16:46:41,497 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:46:41,497 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:41,498 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 86 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 12 Unchecked, 0.0s Time] [2022-02-20 16:46:41,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 16:46:41,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-02-20 16:46:41,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:41,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.0) internal successors, (25), 25 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:41,500 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.0) internal successors, (25), 25 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:41,500 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.0) internal successors, (25), 25 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:41,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:41,500 INFO L93 Difference]: Finished difference Result 26 states and 25 transitions. [2022-02-20 16:46:41,501 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 25 transitions. [2022-02-20 16:46:41,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:41,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:41,501 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 25 states have (on average 1.0) internal successors, (25), 25 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 26 states. [2022-02-20 16:46:41,501 INFO L87 Difference]: Start difference. First operand has 26 states, 25 states have (on average 1.0) internal successors, (25), 25 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 26 states. [2022-02-20 16:46:41,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:41,502 INFO L93 Difference]: Finished difference Result 26 states and 25 transitions. [2022-02-20 16:46:41,502 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 25 transitions. [2022-02-20 16:46:41,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:41,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:41,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:41,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:41,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.0) internal successors, (25), 25 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:41,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 25 transitions. [2022-02-20 16:46:41,503 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 25 transitions. Word has length 21 [2022-02-20 16:46:41,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:41,503 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 25 transitions. [2022-02-20 16:46:41,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:41,503 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 25 transitions. [2022-02-20 16:46:41,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 16:46:41,504 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:41,504 INFO L514 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] [2022-02-20 16:46:41,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:41,713 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:46:41,713 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:41,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:41,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1202751826, now seen corresponding path program 1 times [2022-02-20 16:46:41,714 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:41,714 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [680753858] [2022-02-20 16:46:41,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:41,714 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:41,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:41,715 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) [2022-02-20 16:46:41,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 16:46:41,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:41,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-20 16:46:41,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:41,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:41,930 INFO L390 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 11 treesize of output 7 [2022-02-20 16:46:41,989 INFO L390 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 [2022-02-20 16:46:48,661 INFO L290 TraceCheckUtils]: 0: Hoare triple {904#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_modf~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {904#true} is VALID [2022-02-20 16:46:48,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {904#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~ret15#1, main_#t~mem16#1, main_#t~ret17#1, main_#t~ret18#1, main_#t~short19#1, main_#t~short20#1, main_~x~0#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 1.0)), ~Pluszero~FLOAT());call main_~#iptr~0#1.base, main_~#iptr~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~intFLOATTYPE4(main_#t~nondet14#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset, 4bv32);havoc main_#t~nondet14#1;assume { :begin_inline_modf_float } true;modf_float_#in~x#1, modf_float_#in~iptr#1.base, modf_float_#in~iptr#1.offset := main_~x~0#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset;havoc modf_float_#res#1;havoc modf_float_#t~mem4#1, modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset, modf_float_#t~mem5#1, modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset, modf_float_#t~mem6#1, modf_float_~#gf_u~1#1.base, modf_float_~#gf_u~1#1.offset, modf_float_#t~mem7#1, modf_float_~#sf_u~1#1.base, modf_float_~#sf_u~1#1.offset, modf_float_~ix~0#1, modf_float_#t~mem8#1, modf_float_~#sf_u~2#1.base, modf_float_~#sf_u~2#1.offset, modf_float_#t~mem9#1, modf_float_#t~mem10#1, modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset, modf_float_#t~mem11#1, modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset, modf_float_~ix~1#1, modf_float_~x#1, modf_float_~iptr#1.base, modf_float_~iptr#1.offset, modf_float_~i0~0#1, modf_float_~j0~0#1, modf_float_~i~0#1;modf_float_~x#1 := modf_float_#in~x#1;modf_float_~iptr#1.base, modf_float_~iptr#1.offset := modf_float_#in~iptr#1.base, modf_float_#in~iptr#1.offset;havoc modf_float_~i0~0#1;havoc modf_float_~j0~0#1;havoc modf_float_~i~0#1; {912#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_modf_float_~x#1|))} is VALID [2022-02-20 16:46:48,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_modf_float_~x#1|))} call modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(modf_float_~x#1, modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset, 4bv32);call modf_float_#t~mem4#1 := read~intINTTYPE4(modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset, 4bv32);modf_float_~i0~0#1 := modf_float_#t~mem4#1;havoc modf_float_#t~mem4#1;call ULTIMATE.dealloc(modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset);havoc modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset; {912#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_modf_float_~x#1|))} is VALID [2022-02-20 16:46:48,664 INFO L290 TraceCheckUtils]: 3: Hoare triple {912#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_modf_float_~x#1|))} goto; {912#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_modf_float_~x#1|))} is VALID [2022-02-20 16:46:48,664 INFO L290 TraceCheckUtils]: 4: Hoare triple {912#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_modf_float_~x#1|))} modf_float_~j0~0#1 := ~bvsub32(~bvand32(255bv32, ~bvashr32(modf_float_~i0~0#1, 23bv32)), 127bv32); {912#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_modf_float_~x#1|))} is VALID [2022-02-20 16:46:48,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {912#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_modf_float_~x#1|))} assume !~bvslt32(modf_float_~j0~0#1, 23bv32);havoc modf_float_~ix~1#1;call write~intFLOATTYPE4(~fp.mul~FLOAT(currentRoundingMode, modf_float_~x#1, ~one_modf~0), modf_float_~iptr#1.base, modf_float_~iptr#1.offset, 4bv32); {912#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_modf_float_~x#1|))} is VALID [2022-02-20 16:46:48,667 INFO L290 TraceCheckUtils]: 6: Hoare triple {912#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_modf_float_~x#1|))} call modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(modf_float_~x#1, modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset, 4bv32);call modf_float_#t~mem10#1 := read~intINTTYPE4(modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset, 4bv32);modf_float_~ix~1#1 := modf_float_#t~mem10#1;havoc modf_float_#t~mem10#1;call ULTIMATE.dealloc(modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset);havoc modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset; {928#(exists ((|v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_8| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_8|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_8|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_8|) (_ bv0 32)))) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))) (= (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_8|) (_ bv0 32)) |ULTIMATE.start_modf_float_~ix~1#1|)))} is VALID [2022-02-20 16:46:48,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {928#(exists ((|v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_8| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_8|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_8|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_8|) (_ bv0 32)))) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))) (= (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_8|) (_ bv0 32)) |ULTIMATE.start_modf_float_~ix~1#1|)))} goto; {928#(exists ((|v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_8| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_8|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_8|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_8|) (_ bv0 32)))) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))) (= (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_8|) (_ bv0 32)) |ULTIMATE.start_modf_float_~ix~1#1|)))} is VALID [2022-02-20 16:46:48,670 INFO L290 TraceCheckUtils]: 8: Hoare triple {928#(exists ((|v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_8| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_8|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_8|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_8|) (_ bv0 32)))) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))) (= (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_8|) (_ bv0 32)) |ULTIMATE.start_modf_float_~ix~1#1|)))} call modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(~bvand32(2147483648bv32, modf_float_~ix~1#1), modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset, 4bv32);call modf_float_#t~mem11#1 := read~intFLOATTYPE4(modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset, 4bv32);modf_float_~x#1 := modf_float_#t~mem11#1;havoc modf_float_#t~mem11#1;call ULTIMATE.dealloc(modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset);havoc modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset; {935#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (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))) (= |ULTIMATE.start_modf_float_~x#1| (fp ((_ extract 31 31) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_1 (_ bv2147483648 32)))))))} is VALID [2022-02-20 16:46:48,672 INFO L290 TraceCheckUtils]: 9: Hoare triple {935#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (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))) (= |ULTIMATE.start_modf_float_~x#1| (fp ((_ extract 31 31) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_1 (_ bv2147483648 32)))))))} goto; {935#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (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))) (= |ULTIMATE.start_modf_float_~x#1| (fp ((_ extract 31 31) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_1 (_ bv2147483648 32)))))))} is VALID [2022-02-20 16:46:48,673 INFO L290 TraceCheckUtils]: 10: Hoare triple {935#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (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))) (= |ULTIMATE.start_modf_float_~x#1| (fp ((_ extract 31 31) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_1 (_ bv2147483648 32)))))))} modf_float_#res#1 := modf_float_~x#1; {942#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= |ULTIMATE.start_modf_float_#res#1| (fp ((_ extract 31 31) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_1 (_ bv2147483648 32))))) (= (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)))))} is VALID [2022-02-20 16:46:48,674 INFO L290 TraceCheckUtils]: 11: Hoare triple {942#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= |ULTIMATE.start_modf_float_#res#1| (fp ((_ extract 31 31) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_1 (_ bv2147483648 32))))) (= (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)))))} main_#t~ret15#1 := modf_float_#res#1;assume { :end_inline_modf_float } true;main_~res~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1;call main_#t~mem16#1 := read~intFLOATTYPE4(main_~#iptr~0#1.base, main_~#iptr~0#1.offset, 4bv32);assume { :begin_inline_isinf_float } true;isinf_float_#in~x#1 := main_#t~mem16#1;havoc isinf_float_#res#1;havoc isinf_float_#t~mem13#1, isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset, isinf_float_~x#1, isinf_float_~ix~2#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~2#1; {946#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= |ULTIMATE.start_main_~res~0#1| (fp ((_ extract 31 31) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_1 (_ bv2147483648 32))))) (= (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)))))} is VALID [2022-02-20 16:46:48,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {946#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= |ULTIMATE.start_main_~res~0#1| (fp ((_ extract 31 31) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_1 (_ bv2147483648 32))))) (= (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)))))} call isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(isinf_float_~x#1, isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset, 4bv32);call isinf_float_#t~mem13#1 := read~intINTTYPE4(isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset, 4bv32);isinf_float_~ix~2#1 := isinf_float_#t~mem13#1;havoc isinf_float_#t~mem13#1;call ULTIMATE.dealloc(isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset);havoc isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset; {946#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= |ULTIMATE.start_main_~res~0#1| (fp ((_ extract 31 31) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_1 (_ bv2147483648 32))))) (= (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)))))} is VALID [2022-02-20 16:46:48,677 INFO L290 TraceCheckUtils]: 13: Hoare triple {946#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= |ULTIMATE.start_main_~res~0#1| (fp ((_ extract 31 31) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_1 (_ bv2147483648 32))))) (= (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)))))} goto; {946#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= |ULTIMATE.start_main_~res~0#1| (fp ((_ extract 31 31) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_1 (_ bv2147483648 32))))) (= (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)))))} is VALID [2022-02-20 16:46:48,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {946#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= |ULTIMATE.start_main_~res~0#1| (fp ((_ extract 31 31) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_1 (_ bv2147483648 32))))) (= (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)))))} isinf_float_~ix~2#1 := ~bvand32(2147483647bv32, isinf_float_~ix~2#1);isinf_float_#res#1 := (if 2139095040bv32 == isinf_float_~ix~2#1 then 1bv32 else 0bv32); {946#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= |ULTIMATE.start_main_~res~0#1| (fp ((_ extract 31 31) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_1 (_ bv2147483648 32))))) (= (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)))))} is VALID [2022-02-20 16:46:48,680 INFO L290 TraceCheckUtils]: 15: Hoare triple {946#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= |ULTIMATE.start_main_~res~0#1| (fp ((_ extract 31 31) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_1 (_ bv2147483648 32))))) (= (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)))))} main_#t~ret17#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true;main_#t~short20#1 := 0bv32 != main_#t~ret17#1; {946#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= |ULTIMATE.start_main_~res~0#1| (fp ((_ extract 31 31) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_1 (_ bv2147483648 32))))) (= (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)))))} is VALID [2022-02-20 16:46:48,682 INFO L290 TraceCheckUtils]: 16: Hoare triple {946#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= |ULTIMATE.start_main_~res~0#1| (fp ((_ extract 31 31) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_1 (_ bv2147483648 32))))) (= (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)))))} assume main_#t~short20#1;main_#t~short19#1 := ~fp.eq~FLOAT(main_~res~0#1, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {946#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= |ULTIMATE.start_main_~res~0#1| (fp ((_ extract 31 31) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_1 (_ bv2147483648 32))))) (= (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)))))} is VALID [2022-02-20 16:46:48,682 INFO L290 TraceCheckUtils]: 17: Hoare triple {946#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= |ULTIMATE.start_main_~res~0#1| (fp ((_ extract 31 31) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_1 (_ bv2147483648 32))))) (= (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)))))} assume main_#t~short19#1;assume { :begin_inline___signbit_float } true;__signbit_float_#in~x#1 := main_~res~0#1;havoc __signbit_float_#res#1;havoc __signbit_float_#t~mem12#1, __signbit_float_~#gf_u~3#1.base, __signbit_float_~#gf_u~3#1.offset, __signbit_float_~x#1, __signbit_float_~w~0#1;__signbit_float_~x#1 := __signbit_float_#in~x#1;havoc __signbit_float_~w~0#1; {965#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_1 (_ bv2147483648 32)))) |ULTIMATE.start___signbit_float_~x#1|) (= (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)))))} is VALID [2022-02-20 16:46:48,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {965#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_1 (_ bv2147483648 32)))) |ULTIMATE.start___signbit_float_~x#1|) (= (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)))))} call __signbit_float_~#gf_u~3#1.base, __signbit_float_~#gf_u~3#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__signbit_float_~x#1, __signbit_float_~#gf_u~3#1.base, __signbit_float_~#gf_u~3#1.offset, 4bv32);call __signbit_float_#t~mem12#1 := read~intINTTYPE4(__signbit_float_~#gf_u~3#1.base, __signbit_float_~#gf_u~3#1.offset, 4bv32);__signbit_float_~w~0#1 := __signbit_float_#t~mem12#1;havoc __signbit_float_#t~mem12#1;call ULTIMATE.dealloc(__signbit_float_~#gf_u~3#1.base, __signbit_float_~#gf_u~3#1.offset);havoc __signbit_float_~#gf_u~3#1.base, __signbit_float_~#gf_u~3#1.offset; {969#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_1 (_ bv2147483648 32)))) (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~0#1|))) (= (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)))))} is VALID [2022-02-20 16:46:48,686 INFO L290 TraceCheckUtils]: 19: Hoare triple {969#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_1 (_ bv2147483648 32)))) (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~0#1|))) (= (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)))))} goto; {969#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_1 (_ bv2147483648 32)))) (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~0#1|))) (= (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)))))} is VALID [2022-02-20 16:46:48,688 INFO L290 TraceCheckUtils]: 20: Hoare triple {969#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_1 (_ bv2147483648 32)))) (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~0#1|))) (= (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)))))} __signbit_float_#res#1 := (if 0bv32 != ~bvand32(2147483648bv32, __signbit_float_~w~0#1) then 1bv32 else 0bv32); {976#(exists ((|ULTIMATE.start___signbit_float_~w~0#1| (_ BitVec 32))) (and (or (and (= |ULTIMATE.start___signbit_float_#res#1| (_ bv0 32)) (= (bvand |ULTIMATE.start___signbit_float_~w~0#1| (_ bv2147483648 32)) (_ bv0 32))) (and (not (= (bvand |ULTIMATE.start___signbit_float_~w~0#1| (_ bv2147483648 32)) (_ bv0 32))) (= |ULTIMATE.start___signbit_float_#res#1| (_ bv1 32)))) (exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_1 (_ bv2147483648 32)))) (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~0#1|))) (= (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)))))))} is VALID [2022-02-20 16:46:48,690 INFO L290 TraceCheckUtils]: 21: Hoare triple {976#(exists ((|ULTIMATE.start___signbit_float_~w~0#1| (_ BitVec 32))) (and (or (and (= |ULTIMATE.start___signbit_float_#res#1| (_ bv0 32)) (= (bvand |ULTIMATE.start___signbit_float_~w~0#1| (_ bv2147483648 32)) (_ bv0 32))) (and (not (= (bvand |ULTIMATE.start___signbit_float_~w~0#1| (_ bv2147483648 32)) (_ bv0 32))) (= |ULTIMATE.start___signbit_float_#res#1| (_ bv1 32)))) (exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_1 (_ bv2147483648 32)))) (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~0#1|))) (= (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)))))))} main_#t~ret18#1 := __signbit_float_#res#1;assume { :end_inline___signbit_float } true;main_#t~short19#1 := 1bv32 == main_#t~ret18#1; {980#|ULTIMATE.start_main_#t~short19#1|} is VALID [2022-02-20 16:46:48,690 INFO L290 TraceCheckUtils]: 22: Hoare triple {980#|ULTIMATE.start_main_#t~short19#1|} main_#t~short20#1 := !main_#t~short19#1; {984#(not |ULTIMATE.start_main_#t~short20#1|)} is VALID [2022-02-20 16:46:48,690 INFO L290 TraceCheckUtils]: 23: Hoare triple {984#(not |ULTIMATE.start_main_#t~short20#1|)} assume main_#t~short20#1;havoc main_#t~mem16#1;havoc main_#t~ret17#1;havoc main_#t~ret18#1;havoc main_#t~short19#1;havoc main_#t~short20#1; {905#false} is VALID [2022-02-20 16:46:48,690 INFO L290 TraceCheckUtils]: 24: Hoare triple {905#false} assume !false; {905#false} is VALID [2022-02-20 16:46:48,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:46:48,691 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:48,691 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:48,691 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [680753858] [2022-02-20 16:46:48,691 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [680753858] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:48,691 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:48,691 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 16:46:48,691 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268469061] [2022-02-20 16:46:48,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:48,692 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 16:46:48,692 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:48,692 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:48,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:48,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 16:46:48,753 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:48,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 16:46:48,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=108, Unknown=3, NotChecked=0, Total=132 [2022-02-20 16:46:48,754 INFO L87 Difference]: Start difference. First operand 26 states and 25 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:53,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:53,031 INFO L93 Difference]: Finished difference Result 26 states and 25 transitions. [2022-02-20 16:46:53,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 16:46:53,031 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 16:46:53,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:53,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:53,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 25 transitions. [2022-02-20 16:46:53,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:53,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 25 transitions. [2022-02-20 16:46:53,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 25 transitions. [2022-02-20 16:46:53,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:53,105 INFO L225 Difference]: With dead ends: 26 [2022-02-20 16:46:53,105 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:46:53,105 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=25, Invalid=128, Unknown=3, NotChecked=0, Total=156 [2022-02-20 16:46:53,106 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:53,106 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 95 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 33 Unchecked, 0.0s Time] [2022-02-20 16:46:53,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:46:53,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:46:53,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:53,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second 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) [2022-02-20 16:46:53,108 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second 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) [2022-02-20 16:46:53,108 INFO L87 Difference]: Start difference. First operand 0 states. Second 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) [2022-02-20 16:46:53,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:53,108 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:46:53,108 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:53,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:53,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:53,108 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 0 states. [2022-02-20 16:46:53,108 INFO L87 Difference]: Start difference. First 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) Second operand 0 states. [2022-02-20 16:46:53,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:53,108 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:46:53,108 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:53,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:53,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:53,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:53,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:53,109 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) [2022-02-20 16:46:53,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:46:53,109 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2022-02-20 16:46:53,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:53,109 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:46:53,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:53,109 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:53,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:53,111 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:46:53,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:53,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:46:53,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:46:53,392 INFO L858 garLoopResultBuilder]: For program point L27-1(lines 27 31) no Hoare annotation was computed. [2022-02-20 16:46:53,392 INFO L854 garLoopResultBuilder]: At program point L27-2(lines 27 31) the Hoare annotation is: false [2022-02-20 16:46:53,392 INFO L858 garLoopResultBuilder]: For program point L27-3(lines 27 31) no Hoare annotation was computed. [2022-02-20 16:46:53,392 INFO L858 garLoopResultBuilder]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2022-02-20 16:46:53,392 INFO L854 garLoopResultBuilder]: At program point L19-2(lines 19 23) the Hoare annotation is: (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_modf_float_~x#1|)) [2022-02-20 16:46:53,392 INFO L858 garLoopResultBuilder]: For program point L19-3(lines 19 23) no Hoare annotation was computed. [2022-02-20 16:46:53,392 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:46:53,392 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:46:53,392 INFO L858 garLoopResultBuilder]: For program point L61-1(lines 61 65) no Hoare annotation was computed. [2022-02-20 16:46:53,392 INFO L854 garLoopResultBuilder]: At program point L61-2(lines 61 65) the Hoare annotation is: (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_modf_float_~x#1|)) [2022-02-20 16:46:53,392 INFO L858 garLoopResultBuilder]: For program point L111(line 111) no Hoare annotation was computed. [2022-02-20 16:46:53,393 INFO L858 garLoopResultBuilder]: For program point L111-1(line 111) no Hoare annotation was computed. [2022-02-20 16:46:53,393 INFO L858 garLoopResultBuilder]: For program point L78-1(lines 78 82) no Hoare annotation was computed. [2022-02-20 16:46:53,393 INFO L854 garLoopResultBuilder]: At program point L78-2(lines 78 82) the Hoare annotation is: (and |ULTIMATE.start_main_#t~short19#1| (exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (let ((.cse0 (bvand v_arrayElimCell_1 (_ bv2147483648 32)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) |ULTIMATE.start___signbit_float_~x#1|) (= (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)))))) [2022-02-20 16:46:53,393 INFO L858 garLoopResultBuilder]: For program point L111-3(line 111) no Hoare annotation was computed. [2022-02-20 16:46:53,393 INFO L858 garLoopResultBuilder]: For program point L78-3(lines 78 82) no Hoare annotation was computed. [2022-02-20 16:46:53,393 INFO L858 garLoopResultBuilder]: For program point L111-5(lines 111 114) no Hoare annotation was computed. [2022-02-20 16:46:53,393 INFO L858 garLoopResultBuilder]: For program point L112(line 112) no Hoare annotation was computed. [2022-02-20 16:46:53,393 INFO L854 garLoopResultBuilder]: At program point L71(lines 16 73) the Hoare annotation is: (exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= |ULTIMATE.start_modf_float_#res#1| (let ((.cse0 (bvand v_arrayElimCell_1 (_ bv2147483648 32)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (= (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))))) [2022-02-20 16:46:53,393 INFO L858 garLoopResultBuilder]: For program point L38-1(lines 38 42) no Hoare annotation was computed. [2022-02-20 16:46:53,393 INFO L854 garLoopResultBuilder]: At program point L38-2(lines 38 42) the Hoare annotation is: false [2022-02-20 16:46:53,393 INFO L854 garLoopResultBuilder]: At program point L96(lines 88 97) the Hoare annotation is: (exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= |ULTIMATE.start_main_~res~0#1| (let ((.cse0 (bvand v_arrayElimCell_1 (_ bv2147483648 32)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (= (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))))) [2022-02-20 16:46:53,394 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:46:53,394 INFO L858 garLoopResultBuilder]: For program point L90-1(lines 90 94) no Hoare annotation was computed. [2022-02-20 16:46:53,394 INFO L854 garLoopResultBuilder]: At program point L90-2(lines 90 94) the Hoare annotation is: (exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= |ULTIMATE.start_main_~res~0#1| (let ((.cse0 (bvand v_arrayElimCell_1 (_ bv2147483648 32)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (= (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))))) [2022-02-20 16:46:53,394 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 112) no Hoare annotation was computed. [2022-02-20 16:46:53,394 INFO L858 garLoopResultBuilder]: For program point L90-3(lines 90 94) no Hoare annotation was computed. [2022-02-20 16:46:53,394 INFO L858 garLoopResultBuilder]: For program point L66(lines 66 70) no Hoare annotation was computed. [2022-02-20 16:46:53,394 INFO L858 garLoopResultBuilder]: For program point L66-1(lines 58 72) no Hoare annotation was computed. [2022-02-20 16:46:53,394 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:46:53,394 INFO L858 garLoopResultBuilder]: For program point L66-2(lines 66 70) no Hoare annotation was computed. [2022-02-20 16:46:53,394 INFO L858 garLoopResultBuilder]: For program point L25(lines 25 72) no Hoare annotation was computed. [2022-02-20 16:46:53,394 INFO L861 garLoopResultBuilder]: At program point L116(lines 99 117) the Hoare annotation is: true [2022-02-20 16:46:53,394 INFO L858 garLoopResultBuilder]: For program point L50-1(lines 50 54) no Hoare annotation was computed. [2022-02-20 16:46:53,394 INFO L854 garLoopResultBuilder]: At program point L50-2(lines 50 54) the Hoare annotation is: false [2022-02-20 16:46:53,394 INFO L858 garLoopResultBuilder]: For program point L50-3(lines 50 54) no Hoare annotation was computed. [2022-02-20 16:46:53,394 INFO L858 garLoopResultBuilder]: For program point L26(lines 26 57) no Hoare annotation was computed. [2022-02-20 16:46:53,394 INFO L854 garLoopResultBuilder]: At program point L84(lines 75 85) the Hoare annotation is: (and |ULTIMATE.start_main_#t~short19#1| (exists ((|ULTIMATE.start___signbit_float_~w~0#1| (_ BitVec 32))) (and (let ((.cse0 (= (bvand |ULTIMATE.start___signbit_float_~w~0#1| (_ bv2147483648 32)) (_ bv0 32)))) (or (and (= |ULTIMATE.start___signbit_float_#res#1| (_ bv0 32)) .cse0) (and (not .cse0) (= |ULTIMATE.start___signbit_float_#res#1| (_ bv1 32))))) (exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (let ((.cse1 (bvand v_arrayElimCell_1 (_ bv2147483648 32)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~0#1|))) (= (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)))))))) [2022-02-20 16:46:53,395 INFO L858 garLoopResultBuilder]: For program point L43(lines 43 47) no Hoare annotation was computed. [2022-02-20 16:46:53,395 INFO L858 garLoopResultBuilder]: For program point L43-1(lines 35 49) no Hoare annotation was computed. [2022-02-20 16:46:53,395 INFO L858 garLoopResultBuilder]: For program point L43-2(lines 43 47) no Hoare annotation was computed. [2022-02-20 16:46:53,395 INFO L858 garLoopResultBuilder]: For program point L35(lines 35 56) no Hoare annotation was computed. [2022-02-20 16:46:53,397 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-02-20 16:46:53,397 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:46:53,399 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:46:53,399 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:46:53,399 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2022-02-20 16:46:53,400 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2022-02-20 16:46:53,400 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2022-02-20 16:46:53,400 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2022-02-20 16:46:53,400 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2022-02-20 16:46:53,400 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-02-20 16:46:53,401 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-02-20 16:46:53,401 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 16:46:53,401 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 16:46:53,401 WARN L170 areAnnotationChecker]: L61-1 has no Hoare annotation [2022-02-20 16:46:53,401 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2022-02-20 16:46:53,401 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:46:53,401 WARN L170 areAnnotationChecker]: L27-3 has no Hoare annotation [2022-02-20 16:46:53,401 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-02-20 16:46:53,401 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-02-20 16:46:53,402 WARN L170 areAnnotationChecker]: L61-1 has no Hoare annotation [2022-02-20 16:46:53,402 WARN L170 areAnnotationChecker]: L61-1 has no Hoare annotation [2022-02-20 16:46:53,402 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2022-02-20 16:46:53,402 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2022-02-20 16:46:53,402 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:46:53,402 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:46:53,402 WARN L170 areAnnotationChecker]: L27-3 has no Hoare annotation [2022-02-20 16:46:53,402 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2022-02-20 16:46:53,402 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2022-02-20 16:46:53,402 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2022-02-20 16:46:53,402 WARN L170 areAnnotationChecker]: L50-3 has no Hoare annotation [2022-02-20 16:46:53,403 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-20 16:46:53,403 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-20 16:46:53,403 WARN L170 areAnnotationChecker]: L66-2 has no Hoare annotation [2022-02-20 16:46:53,404 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2022-02-20 16:46:53,404 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2022-02-20 16:46:53,404 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2022-02-20 16:46:53,404 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2022-02-20 16:46:53,404 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2022-02-20 16:46:53,404 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2022-02-20 16:46:53,404 WARN L170 areAnnotationChecker]: L50-3 has no Hoare annotation [2022-02-20 16:46:53,404 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:46:53,404 WARN L170 areAnnotationChecker]: L90-3 has no Hoare annotation [2022-02-20 16:46:53,404 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 16:46:53,405 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 16:46:53,405 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:46:53,405 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:46:53,405 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:46:53,405 WARN L170 areAnnotationChecker]: L90-3 has no Hoare annotation [2022-02-20 16:46:53,405 WARN L170 areAnnotationChecker]: L111 has no Hoare annotation [2022-02-20 16:46:53,405 WARN L170 areAnnotationChecker]: L111 has no Hoare annotation [2022-02-20 16:46:53,405 WARN L170 areAnnotationChecker]: L111 has no Hoare annotation [2022-02-20 16:46:53,405 WARN L170 areAnnotationChecker]: L111-1 has no Hoare annotation [2022-02-20 16:46:53,405 WARN L170 areAnnotationChecker]: L111-1 has no Hoare annotation [2022-02-20 16:46:53,405 WARN L170 areAnnotationChecker]: L111-5 has no Hoare annotation [2022-02-20 16:46:53,405 WARN L170 areAnnotationChecker]: L111-5 has no Hoare annotation [2022-02-20 16:46:53,405 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-02-20 16:46:53,406 WARN L170 areAnnotationChecker]: L78-3 has no Hoare annotation [2022-02-20 16:46:53,406 WARN L170 areAnnotationChecker]: L111-3 has no Hoare annotation [2022-02-20 16:46:53,406 WARN L170 areAnnotationChecker]: L112 has no Hoare annotation [2022-02-20 16:46:53,406 WARN L170 areAnnotationChecker]: L112 has no Hoare annotation [2022-02-20 16:46:53,406 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:53,406 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-02-20 16:46:53,406 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-02-20 16:46:53,406 WARN L170 areAnnotationChecker]: L78-3 has no Hoare annotation [2022-02-20 16:46:53,406 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:53,406 WARN L170 areAnnotationChecker]: L111-3 has no Hoare annotation [2022-02-20 16:46:53,406 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:46:53,409 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:53,409 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:53,409 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,409 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,410 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,410 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:53,410 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:53,410 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:53,410 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,410 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,410 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,410 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,410 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,419 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:53,419 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:53,419 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,419 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,419 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,420 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:53,420 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:53,420 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:53,420 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,420 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,420 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,420 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,420 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,421 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,422 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,422 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,422 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,424 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,424 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,424 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,424 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,425 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,425 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,425 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,425 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,425 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,425 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,425 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,425 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,425 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,426 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,426 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,426 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,428 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,428 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,428 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,428 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,428 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,428 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,428 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,428 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,429 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,431 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,431 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,431 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,431 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,431 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,431 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,431 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,433 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,433 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,433 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,434 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,434 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,435 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,435 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,435 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,435 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,435 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,435 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,435 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,435 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,435 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,436 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,436 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,436 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,436 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,436 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,436 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,437 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,437 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,437 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,437 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,437 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,437 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,437 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,437 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,438 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,438 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,438 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,438 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,439 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,439 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,439 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,440 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:46:53 BoogieIcfgContainer [2022-02-20 16:46:53,440 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:46:53,441 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:46:53,441 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:46:53,441 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:46:53,441 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:38" (3/4) ... [2022-02-20 16:46:53,443 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:46:53,452 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2022-02-20 16:46:53,452 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-02-20 16:46:53,452 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:46:53,453 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:46:53,469 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == x) [2022-02-20 16:46:53,470 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == x) [2022-02-20 16:46:53,470 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists v_arrayElimCell_1 : bv32, currentRoundingMode : FloatRoundingMode :: \result == ~fp~LONGDOUBLE(~bvand32(v_arrayElimCell_1, 2147483648bv32)[31:31], ~bvand32(v_arrayElimCell_1, 2147483648bv32)[30:23], ~bvand32(v_arrayElimCell_1, 2147483648bv32)[22:0]) && ~fp~LONGDOUBLE(v_arrayElimCell_1[31:31], v_arrayElimCell_1[30:23], v_arrayElimCell_1[22:0]) == ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE())) [2022-02-20 16:46:53,470 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists v_arrayElimCell_1 : bv32, currentRoundingMode : FloatRoundingMode :: res == ~fp~LONGDOUBLE(~bvand32(v_arrayElimCell_1, 2147483648bv32)[31:31], ~bvand32(v_arrayElimCell_1, 2147483648bv32)[30:23], ~bvand32(v_arrayElimCell_1, 2147483648bv32)[22:0]) && ~fp~LONGDOUBLE(v_arrayElimCell_1[31:31], v_arrayElimCell_1[30:23], v_arrayElimCell_1[22:0]) == ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE())) [2022-02-20 16:46:53,470 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists v_arrayElimCell_1 : bv32, currentRoundingMode : FloatRoundingMode :: res == ~fp~LONGDOUBLE(~bvand32(v_arrayElimCell_1, 2147483648bv32)[31:31], ~bvand32(v_arrayElimCell_1, 2147483648bv32)[30:23], ~bvand32(v_arrayElimCell_1, 2147483648bv32)[22:0]) && ~fp~LONGDOUBLE(v_arrayElimCell_1[31:31], v_arrayElimCell_1[30:23], v_arrayElimCell_1[22:0]) == ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE())) [2022-02-20 16:46:53,471 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: aux-res == -0.0f && __signbit_float(res) == 1-aux && (\exists v_arrayElimCell_1 : bv32, currentRoundingMode : FloatRoundingMode :: ~fp~LONGDOUBLE(~bvand32(v_arrayElimCell_1, 2147483648bv32)[31:31], ~bvand32(v_arrayElimCell_1, 2147483648bv32)[30:23], ~bvand32(v_arrayElimCell_1, 2147483648bv32)[22:0]) == x && ~fp~LONGDOUBLE(v_arrayElimCell_1[31:31], v_arrayElimCell_1[30:23], v_arrayElimCell_1[22:0]) == ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE())) [2022-02-20 16:46:53,471 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: aux-res == -0.0f && __signbit_float(res) == 1-aux && (\exists ULTIMATE.start___signbit_float_~w~0#1 : bv32 :: ((\result == 0bv32 && ~bvand32(ULTIMATE.start___signbit_float_~w~0#1, 2147483648bv32) == 0bv32) || (!(~bvand32(ULTIMATE.start___signbit_float_~w~0#1, 2147483648bv32) == 0bv32) && \result == 1bv32)) && (\exists v_arrayElimCell_1 : bv32, currentRoundingMode : FloatRoundingMode :: ~fp~LONGDOUBLE(~bvand32(v_arrayElimCell_1, 2147483648bv32)[31:31], ~bvand32(v_arrayElimCell_1, 2147483648bv32)[30:23], ~bvand32(v_arrayElimCell_1, 2147483648bv32)[22:0]) == ~fp~LONGDOUBLE(ULTIMATE.start___signbit_float_~w~0#1[31:31], ULTIMATE.start___signbit_float_~w~0#1[30:23], ULTIMATE.start___signbit_float_~w~0#1[22:0]) && ~fp~LONGDOUBLE(v_arrayElimCell_1[31:31], v_arrayElimCell_1[30:23], v_arrayElimCell_1[22:0]) == ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()))) [2022-02-20 16:46:53,478 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:46:53,478 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:46:53,479 INFO L158 Benchmark]: Toolchain (without parser) took 15921.56ms. Allocated memory was 65.0MB in the beginning and 90.2MB in the end (delta: 25.2MB). Free memory was 45.6MB in the beginning and 52.9MB in the end (delta: -7.3MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2022-02-20 16:46:53,479 INFO L158 Benchmark]: CDTParser took 0.47ms. Allocated memory is still 65.0MB. Free memory was 47.1MB in the beginning and 47.0MB in the end (delta: 48.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:53,479 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.27ms. Allocated memory is still 65.0MB. Free memory was 45.5MB in the beginning and 46.2MB in the end (delta: -774.0kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 16:46:53,479 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.88ms. Allocated memory is still 65.0MB. Free memory was 46.2MB in the beginning and 43.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:53,479 INFO L158 Benchmark]: Boogie Preprocessor took 63.29ms. Allocated memory is still 65.0MB. Free memory was 43.8MB in the beginning and 41.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:53,479 INFO L158 Benchmark]: RCFGBuilder took 585.08ms. Allocated memory was 65.0MB in the beginning and 90.2MB in the end (delta: 25.2MB). Free memory was 41.5MB in the beginning and 66.8MB in the end (delta: -25.3MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2022-02-20 16:46:53,480 INFO L158 Benchmark]: TraceAbstraction took 14970.78ms. Allocated memory is still 90.2MB. Free memory was 66.4MB in the beginning and 57.1MB in the end (delta: 9.3MB). Peak memory consumption was 37.5MB. Max. memory is 16.1GB. [2022-02-20 16:46:53,480 INFO L158 Benchmark]: Witness Printer took 37.46ms. Allocated memory is still 90.2MB. Free memory was 57.1MB in the beginning and 52.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:46:53,481 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.47ms. Allocated memory is still 65.0MB. Free memory was 47.1MB in the beginning and 47.0MB in the end (delta: 48.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 220.27ms. Allocated memory is still 65.0MB. Free memory was 45.5MB in the beginning and 46.2MB in the end (delta: -774.0kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.88ms. Allocated memory is still 65.0MB. Free memory was 46.2MB in the beginning and 43.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.29ms. Allocated memory is still 65.0MB. Free memory was 43.8MB in the beginning and 41.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 585.08ms. Allocated memory was 65.0MB in the beginning and 90.2MB in the end (delta: 25.2MB). Free memory was 41.5MB in the beginning and 66.8MB in the end (delta: -25.3MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * TraceAbstraction took 14970.78ms. Allocated memory is still 90.2MB. Free memory was 66.4MB in the beginning and 57.1MB in the end (delta: 9.3MB). Peak memory consumption was 37.5MB. Max. memory is 16.1GB. * Witness Printer took 37.46ms. Allocated memory is still 90.2MB. Free memory was 57.1MB in the beginning and 52.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 112]: 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, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.9s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 364 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 53 IncrementalHoareTripleChecker+Unchecked, 235 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13 IncrementalHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 129 mSDtfsCounter, 13 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 11 PreInvPairs, 19 NumberOfFragments, 216 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 51 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 98 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 93 ConstructedInterpolants, 32 QuantifiedInterpolants, 838 SizeOfPredicates, 28 NumberOfNonLiveVariables, 475 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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 - InvariantResult [Line: 75]: Loop Invariant [2022-02-20 16:46:53,502 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:53,502 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:53,502 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,502 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,502 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,502 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:53,503 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:53,503 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:53,503 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,503 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,503 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,503 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,503 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,504 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:53,504 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:53,504 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,504 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,504 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,504 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:53,504 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:53,504 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:53,504 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,504 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,504 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,505 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,505 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: aux-res == -0.0f && __signbit_float(res) == 1-aux && (\exists ULTIMATE.start___signbit_float_~w~0#1 : bv32 :: ((\result == 0bv32 && ~bvand32(ULTIMATE.start___signbit_float_~w~0#1, 2147483648bv32) == 0bv32) || (!(~bvand32(ULTIMATE.start___signbit_float_~w~0#1, 2147483648bv32) == 0bv32) && \result == 1bv32)) && (\exists v_arrayElimCell_1 : bv32, currentRoundingMode : FloatRoundingMode :: ~fp~LONGDOUBLE(~bvand32(v_arrayElimCell_1, 2147483648bv32)[31:31], ~bvand32(v_arrayElimCell_1, 2147483648bv32)[30:23], ~bvand32(v_arrayElimCell_1, 2147483648bv32)[22:0]) == ~fp~LONGDOUBLE(ULTIMATE.start___signbit_float_~w~0#1[31:31], ULTIMATE.start___signbit_float_~w~0#1[30:23], ULTIMATE.start___signbit_float_~w~0#1[22:0]) && ~fp~LONGDOUBLE(v_arrayElimCell_1[31:31], v_arrayElimCell_1[30:23], v_arrayElimCell_1[22:0]) == ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()))) - InvariantResult [Line: 19]: Loop Invariant [2022-02-20 16:46:53,508 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,508 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,509 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,509 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == x) - InvariantResult [Line: 88]: Loop Invariant [2022-02-20 16:46:53,511 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,511 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,511 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,511 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,511 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,512 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,512 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,512 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,512 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,512 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,513 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,513 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,513 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,513 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,513 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,513 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (\exists v_arrayElimCell_1 : bv32, currentRoundingMode : FloatRoundingMode :: res == ~fp~LONGDOUBLE(~bvand32(v_arrayElimCell_1, 2147483648bv32)[31:31], ~bvand32(v_arrayElimCell_1, 2147483648bv32)[30:23], ~bvand32(v_arrayElimCell_1, 2147483648bv32)[22:0]) && ~fp~LONGDOUBLE(v_arrayElimCell_1[31:31], v_arrayElimCell_1[30:23], v_arrayElimCell_1[22:0]) == ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 78]: Loop Invariant [2022-02-20 16:46:53,514 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,514 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,514 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,514 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,514 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,514 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,514 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,515 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,515 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,515 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,515 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,515 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,515 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,516 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,516 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,516 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: aux-res == -0.0f && __signbit_float(res) == 1-aux && (\exists v_arrayElimCell_1 : bv32, currentRoundingMode : FloatRoundingMode :: ~fp~LONGDOUBLE(~bvand32(v_arrayElimCell_1, 2147483648bv32)[31:31], ~bvand32(v_arrayElimCell_1, 2147483648bv32)[30:23], ~bvand32(v_arrayElimCell_1, 2147483648bv32)[22:0]) == x && ~fp~LONGDOUBLE(v_arrayElimCell_1[31:31], v_arrayElimCell_1[30:23], v_arrayElimCell_1[22:0]) == ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 16]: Loop Invariant [2022-02-20 16:46:53,516 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,516 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,516 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,516 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,517 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,517 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,517 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,517 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,517 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,517 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,517 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,517 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,517 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,517 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,518 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,518 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (\exists v_arrayElimCell_1 : bv32, currentRoundingMode : FloatRoundingMode :: \result == ~fp~LONGDOUBLE(~bvand32(v_arrayElimCell_1, 2147483648bv32)[31:31], ~bvand32(v_arrayElimCell_1, 2147483648bv32)[30:23], ~bvand32(v_arrayElimCell_1, 2147483648bv32)[22:0]) && ~fp~LONGDOUBLE(v_arrayElimCell_1[31:31], v_arrayElimCell_1[30:23], v_arrayElimCell_1[22:0]) == ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 90]: Loop Invariant [2022-02-20 16:46:53,518 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,518 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,518 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,518 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,518 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,519 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,519 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,519 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,519 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,519 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,519 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,519 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,519 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,519 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:53,519 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,520 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (\exists v_arrayElimCell_1 : bv32, currentRoundingMode : FloatRoundingMode :: res == ~fp~LONGDOUBLE(~bvand32(v_arrayElimCell_1, 2147483648bv32)[31:31], ~bvand32(v_arrayElimCell_1, 2147483648bv32)[30:23], ~bvand32(v_arrayElimCell_1, 2147483648bv32)[22:0]) && ~fp~LONGDOUBLE(v_arrayElimCell_1[31:31], v_arrayElimCell_1[30:23], v_arrayElimCell_1[22:0]) == ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 61]: Loop Invariant [2022-02-20 16:46:53,520 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,520 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,520 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,521 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == x) - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2022-02-20 16:46:53,553 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE