./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1131b.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_1131b.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 13787d2cb5ffea0911ec7bb9f969ca72234ab27d7c89c5aec775ef624e14d583 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:46:29,612 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:46:29,613 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:46:29,659 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:46:29,659 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:46:29,662 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:46:29,663 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:46:29,665 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:46:29,666 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:46:29,669 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:46:29,670 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:46:29,671 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:46:29,671 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:46:29,673 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:46:29,674 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:46:29,676 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:46:29,677 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:46:29,678 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:46:29,678 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:46:29,679 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:46:29,680 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:46:29,696 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:46:29,697 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:46:29,698 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:46:29,704 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:46:29,704 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:46:29,705 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:46:29,706 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:46:29,706 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:46:29,707 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:46:29,707 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:46:29,707 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:46:29,708 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:46:29,709 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:46:29,710 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:46:29,710 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:46:29,711 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:46:29,711 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:46:29,711 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:46:29,712 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:46:29,712 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:46:29,714 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:29,738 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:46:29,738 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:46:29,738 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:46:29,738 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:46:29,739 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:46:29,739 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:46:29,740 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:46:29,740 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:46:29,740 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:46:29,740 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:46:29,741 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:46:29,741 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:46:29,741 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:46:29,741 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:46:29,741 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:46:29,742 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:46:29,742 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:46:29,742 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:46:29,742 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:46:29,742 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:46:29,742 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:46:29,742 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:46:29,743 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:46:29,743 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:46:29,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:29,743 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:46:29,743 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:46:29,743 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:46:29,744 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:46:29,744 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:46:29,744 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:46:29,744 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:46:29,744 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:46:29,744 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 -> 13787d2cb5ffea0911ec7bb9f969ca72234ab27d7c89c5aec775ef624e14d583 [2022-02-20 16:46:29,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:46:29,955 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:46:29,958 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:46:29,959 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:46:29,959 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:46:29,960 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1131b.c [2022-02-20 16:46:30,024 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7745249c4/b9ac07251c164240bcf3679c0da0ad2d/FLAG8e7cb1571 [2022-02-20 16:46:30,376 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:46:30,376 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1131b.c [2022-02-20 16:46:30,383 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7745249c4/b9ac07251c164240bcf3679c0da0ad2d/FLAG8e7cb1571 [2022-02-20 16:46:30,813 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7745249c4/b9ac07251c164240bcf3679c0da0ad2d [2022-02-20 16:46:30,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:46:30,816 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:46:30,818 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:30,818 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:46:30,821 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:46:30,822 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:30" (1/1) ... [2022-02-20 16:46:30,823 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cb6323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:30, skipping insertion in model container [2022-02-20 16:46:30,823 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:30" (1/1) ... [2022-02-20 16:46:30,828 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:46:30,845 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:46:30,993 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_1131b.c[2947,2960] [2022-02-20 16:46:30,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:31,000 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:46:31,039 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_1131b.c[2947,2960] [2022-02-20 16:46:31,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:31,052 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:46:31,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:31 WrapperNode [2022-02-20 16:46:31,052 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:31,053 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:31,053 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:46:31,053 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:46:31,058 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:31" (1/1) ... [2022-02-20 16:46:31,065 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:31" (1/1) ... [2022-02-20 16:46:31,090 INFO L137 Inliner]: procedures = 18, calls = 35, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 219 [2022-02-20 16:46:31,091 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:31,091 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:46:31,092 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:46:31,092 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:46:31,102 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:31" (1/1) ... [2022-02-20 16:46:31,102 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:31" (1/1) ... [2022-02-20 16:46:31,105 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:31" (1/1) ... [2022-02-20 16:46:31,113 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:31" (1/1) ... [2022-02-20 16:46:31,121 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:31" (1/1) ... [2022-02-20 16:46:31,132 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:31" (1/1) ... [2022-02-20 16:46:31,133 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:31" (1/1) ... [2022-02-20 16:46:31,135 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:46:31,143 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:46:31,143 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:46:31,143 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:46:31,144 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:31" (1/1) ... [2022-02-20 16:46:31,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:31,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:46:31,172 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:31,189 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:31,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:46:31,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:46:31,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:46:31,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:46:31,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:46:31,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:46:31,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:46:31,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:46:31,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:46:31,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-02-20 16:46:31,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:46:31,270 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:46:31,271 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:46:31,644 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:46:31,649 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:46:31,649 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2022-02-20 16:46:31,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:31 BoogieIcfgContainer [2022-02-20 16:46:31,651 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:46:31,652 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:46:31,652 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:46:31,654 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:46:31,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:46:30" (1/3) ... [2022-02-20 16:46:31,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e46fe56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:31, skipping insertion in model container [2022-02-20 16:46:31,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:31" (2/3) ... [2022-02-20 16:46:31,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e46fe56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:31, skipping insertion in model container [2022-02-20 16:46:31,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:31" (3/3) ... [2022-02-20 16:46:31,661 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1131b.c [2022-02-20 16:46:31,665 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:46:31,666 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:46:31,707 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:46:31,729 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:31,729 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:46:31,742 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 57 states have (on average 1.7894736842105263) internal successors, (102), 58 states have internal predecessors, (102), 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:31,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:46:31,745 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:31,746 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:31,746 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:31,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:31,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1228515262, now seen corresponding path program 1 times [2022-02-20 16:46:31,757 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:31,758 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617872353] [2022-02-20 16:46:31,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:31,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:31,876 INFO L290 TraceCheckUtils]: 0: Hoare triple {62#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_fmod~0 := 1.0;~#Zero_fmod~0.base, ~#Zero_fmod~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~real(0.0, ~#Zero_fmod~0.base, ~#Zero_fmod~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.0), ~#Zero_fmod~0.base, 4 + ~#Zero_fmod~0.offset, 4); {62#true} is VALID [2022-02-20 16:46:31,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {62#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~ret17#1, main_#t~ret18#1, main_~res~0#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;main_~y~0#1 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0);assume { :begin_inline_isfinite_float } true;isfinite_float_#in~x#1 := main_~x~0#1;havoc isfinite_float_#res#1;havoc isfinite_float_#t~mem15#1, isfinite_float_~#gf_u~2#1.base, isfinite_float_~#gf_u~2#1.offset, isfinite_float_~x#1, isfinite_float_~ix~1#1;isfinite_float_~x#1 := isfinite_float_#in~x#1;havoc isfinite_float_~ix~1#1; {62#true} is VALID [2022-02-20 16:46:31,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {62#true} assume !true; {63#false} is VALID [2022-02-20 16:46:31,878 INFO L290 TraceCheckUtils]: 3: Hoare triple {63#false} isfinite_float_~ix~1#1 := (if 0 == isfinite_float_~ix~1#1 then 0 else (if 1 == isfinite_float_~ix~1#1 then 1 else ~bitwiseAnd(isfinite_float_~ix~1#1, 2147483647)));isfinite_float_#res#1 := (if isfinite_float_~ix~1#1 < 2139095040 then 1 else 0); {63#false} is VALID [2022-02-20 16:46:31,878 INFO L290 TraceCheckUtils]: 4: Hoare triple {63#false} main_#t~ret17#1 := isfinite_float_#res#1;assume { :end_inline_isfinite_float } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {63#false} is VALID [2022-02-20 16:46:31,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {63#false} assume 0 != main_#t~ret17#1;havoc main_#t~ret17#1;assume { :begin_inline_fmod_float } true;fmod_float_#in~x#1, fmod_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmod_float_#res#1;havoc fmod_float_#t~mem4#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, fmod_float_#t~mem5#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, fmod_float_#t~mem7#1, fmod_float_#t~mem11#1, fmod_float_#t~post10#1, fmod_float_#t~mem12#1, fmod_float_#t~mem13#1, fmod_float_~#sf_u~0#1.base, fmod_float_~#sf_u~0#1.offset, fmod_float_#t~mem14#1, fmod_float_~#sf_u~1#1.base, fmod_float_~#sf_u~1#1.offset, fmod_float_~x#1, fmod_float_~y#1, fmod_float_~n~0#1, fmod_float_~hx~0#1, fmod_float_~hy~0#1, fmod_float_~hz~0#1, fmod_float_~ix~0#1, fmod_float_~iy~0#1, fmod_float_~sx~0#1, fmod_float_~i~0#1, fmod_float_#t~nondet6#1, fmod_float_#t~nondet8#1, fmod_float_#t~nondet9#1;fmod_float_~x#1 := fmod_float_#in~x#1;fmod_float_~y#1 := fmod_float_#in~y#1;havoc fmod_float_~n~0#1;havoc fmod_float_~hx~0#1;havoc fmod_float_~hy~0#1;havoc fmod_float_~hz~0#1;havoc fmod_float_~ix~0#1;havoc fmod_float_~iy~0#1;havoc fmod_float_~sx~0#1;havoc fmod_float_~i~0#1; {63#false} is VALID [2022-02-20 16:46:31,879 INFO L290 TraceCheckUtils]: 6: Hoare triple {63#false} assume !true; {63#false} is VALID [2022-02-20 16:46:31,879 INFO L290 TraceCheckUtils]: 7: Hoare triple {63#false} assume !true; {63#false} is VALID [2022-02-20 16:46:31,880 INFO L290 TraceCheckUtils]: 8: Hoare triple {63#false} assume 0 == fmod_float_~hx~0#1;fmod_float_~sx~0#1 := 0; {63#false} is VALID [2022-02-20 16:46:31,880 INFO L290 TraceCheckUtils]: 9: Hoare triple {63#false} fmod_float_~hx~0#1 := (if (1 == fmod_float_~hx~0#1 || 0 == fmod_float_~hx~0#1) && (1 == fmod_float_~sx~0#1 || 0 == fmod_float_~sx~0#1) then (if fmod_float_~hx~0#1 == fmod_float_~sx~0#1 then 0 else 1) else (if 0 == fmod_float_~hx~0#1 then fmod_float_~sx~0#1 else (if 0 == fmod_float_~sx~0#1 then fmod_float_~hx~0#1 else ~bitwiseXOr(fmod_float_~hx~0#1, fmod_float_~sx~0#1))));fmod_float_~hy~0#1 := (if 0 == fmod_float_~hy~0#1 then 0 else (if 1 == fmod_float_~hy~0#1 then 1 else ~bitwiseAnd(fmod_float_~hy~0#1, 2147483647))); {63#false} is VALID [2022-02-20 16:46:31,880 INFO L290 TraceCheckUtils]: 10: Hoare triple {63#false} assume (0 == fmod_float_~hy~0#1 || !(fmod_float_~hx~0#1 < 2139095040)) || fmod_float_~hy~0#1 > 2139095040;fmod_float_#res#1 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(fmod_float_~x#1, fmod_float_~y#1), ~someBinaryArithmeticFLOAToperation(fmod_float_~x#1, fmod_float_~y#1)); {63#false} is VALID [2022-02-20 16:46:31,881 INFO L290 TraceCheckUtils]: 11: Hoare triple {63#false} main_#t~ret18#1 := fmod_float_#res#1;assume { :end_inline_fmod_float } true;main_~res~0#1 := main_#t~ret18#1;havoc main_#t~ret18#1; {63#false} is VALID [2022-02-20 16:46:31,881 INFO L290 TraceCheckUtils]: 12: Hoare triple {63#false} assume ~someBinaryFLOATComparisonOperation(main_~res~0#1, main_~x~0#1); {63#false} is VALID [2022-02-20 16:46:31,881 INFO L290 TraceCheckUtils]: 13: Hoare triple {63#false} assume !false; {63#false} is VALID [2022-02-20 16:46:31,882 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:31,883 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:46:31,883 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617872353] [2022-02-20 16:46:31,884 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617872353] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:31,884 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:31,884 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:46:31,885 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958201558] [2022-02-20 16:46:31,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:31,889 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 16:46:31,890 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:31,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:31,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:31,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:46:31,908 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:46:31,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:46:31,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:31,933 INFO L87 Difference]: Start difference. First operand has 59 states, 57 states have (on average 1.7894736842105263) internal successors, (102), 58 states have internal predecessors, (102), 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.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:32,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:32,017 INFO L93 Difference]: Finished difference Result 116 states and 202 transitions. [2022-02-20 16:46:32,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:46:32,018 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 16:46:32,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:32,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:32,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 202 transitions. [2022-02-20 16:46:32,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:32,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 202 transitions. [2022-02-20 16:46:32,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 202 transitions. [2022-02-20 16:46:32,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:32,194 INFO L225 Difference]: With dead ends: 116 [2022-02-20 16:46:32,194 INFO L226 Difference]: Without dead ends: 55 [2022-02-20 16:46:32,197 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:32,202 INFO L933 BasicCegarLoop]: 79 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, 79 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:32,203 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 79 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:32,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-02-20 16:46:32,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-02-20 16:46:32,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:32,226 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 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:32,226 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 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:32,227 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 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:32,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:32,236 INFO L93 Difference]: Finished difference Result 55 states and 74 transitions. [2022-02-20 16:46:32,236 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 74 transitions. [2022-02-20 16:46:32,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:32,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:32,237 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 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 55 states. [2022-02-20 16:46:32,238 INFO L87 Difference]: Start difference. First operand has 55 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 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 55 states. [2022-02-20 16:46:32,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:32,241 INFO L93 Difference]: Finished difference Result 55 states and 74 transitions. [2022-02-20 16:46:32,241 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 74 transitions. [2022-02-20 16:46:32,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:32,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:32,242 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:32,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:32,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 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:32,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 74 transitions. [2022-02-20 16:46:32,251 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 74 transitions. Word has length 14 [2022-02-20 16:46:32,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:32,252 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 74 transitions. [2022-02-20 16:46:32,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:32,254 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 74 transitions. [2022-02-20 16:46:32,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 16:46:32,255 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:32,255 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:32,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:46:32,256 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:32,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:32,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1196155650, now seen corresponding path program 1 times [2022-02-20 16:46:32,257 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:32,257 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098893767] [2022-02-20 16:46:32,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:32,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:32,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:46:32,336 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:46:32,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:46:32,421 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:46:32,421 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:46:32,422 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:46:32,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:46:32,432 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 16:46:32,436 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:46:32,478 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:46:32,479 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:46:32,479 WARN L170 areAnnotationChecker]: L112-2 has no Hoare annotation [2022-02-20 16:46:32,479 WARN L170 areAnnotationChecker]: L112-2 has no Hoare annotation [2022-02-20 16:46:32,479 WARN L170 areAnnotationChecker]: L112-1 has no Hoare annotation [2022-02-20 16:46:32,479 WARN L170 areAnnotationChecker]: L112-1 has no Hoare annotation [2022-02-20 16:46:32,479 WARN L170 areAnnotationChecker]: L112-3 has no Hoare annotation [2022-02-20 16:46:32,479 WARN L170 areAnnotationChecker]: L118 has no Hoare annotation [2022-02-20 16:46:32,480 WARN L170 areAnnotationChecker]: L131 has no Hoare annotation [2022-02-20 16:46:32,480 WARN L170 areAnnotationChecker]: L131 has no Hoare annotation [2022-02-20 16:46:32,480 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-02-20 16:46:32,480 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-02-20 16:46:32,480 WARN L170 areAnnotationChecker]: L131-2 has no Hoare annotation [2022-02-20 16:46:32,480 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:46:32,480 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:46:32,480 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:46:32,480 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:46:32,480 WARN L170 areAnnotationChecker]: L142 has no Hoare annotation [2022-02-20 16:46:32,481 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:32,481 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:32,481 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2022-02-20 16:46:32,481 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2022-02-20 16:46:32,481 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:32,481 WARN L170 areAnnotationChecker]: L32-7 has no Hoare annotation [2022-02-20 16:46:32,481 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2022-02-20 16:46:32,481 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2022-02-20 16:46:32,481 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:46:32,482 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:46:32,482 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-02-20 16:46:32,482 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-02-20 16:46:32,482 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2022-02-20 16:46:32,482 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:46:32,482 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:46:32,482 WARN L170 areAnnotationChecker]: L32-5 has no Hoare annotation [2022-02-20 16:46:32,482 WARN L170 areAnnotationChecker]: L32-5 has no Hoare annotation [2022-02-20 16:46:32,482 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2022-02-20 16:46:32,483 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2022-02-20 16:46:32,483 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:46:32,483 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:46:32,483 WARN L170 areAnnotationChecker]: L137 has no Hoare annotation [2022-02-20 16:46:32,483 WARN L170 areAnnotationChecker]: L137 has no Hoare annotation [2022-02-20 16:46:32,483 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:46:32,483 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:46:32,483 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2022-02-20 16:46:32,483 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2022-02-20 16:46:32,484 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2022-02-20 16:46:32,484 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:46:32,484 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:46:32,484 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:46:32,484 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2022-02-20 16:46:32,485 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2022-02-20 16:46:32,485 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2022-02-20 16:46:32,486 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:46:32,486 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:46:32,486 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2022-02-20 16:46:32,486 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-02-20 16:46:32,486 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-02-20 16:46:32,486 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:46:32,487 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:46:32,487 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-02-20 16:46:32,487 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-02-20 16:46:32,487 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 16:46:32,487 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 16:46:32,487 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-02-20 16:46:32,487 WARN L170 areAnnotationChecker]: L55-4 has no Hoare annotation [2022-02-20 16:46:32,487 WARN L170 areAnnotationChecker]: L55-4 has no Hoare annotation [2022-02-20 16:46:32,487 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2022-02-20 16:46:32,488 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2022-02-20 16:46:32,488 WARN L170 areAnnotationChecker]: L69-2 has no Hoare annotation [2022-02-20 16:46:32,488 WARN L170 areAnnotationChecker]: L69-2 has no Hoare annotation [2022-02-20 16:46:32,488 WARN L170 areAnnotationChecker]: L55-6 has no Hoare annotation [2022-02-20 16:46:32,488 WARN L170 areAnnotationChecker]: L55-6 has no Hoare annotation [2022-02-20 16:46:32,488 WARN L170 areAnnotationChecker]: L61-4 has no Hoare annotation [2022-02-20 16:46:32,488 WARN L170 areAnnotationChecker]: L61-4 has no Hoare annotation [2022-02-20 16:46:32,488 WARN L170 areAnnotationChecker]: L67-3 has no Hoare annotation [2022-02-20 16:46:32,489 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:46:32,489 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:46:32,489 WARN L170 areAnnotationChecker]: L61-6 has no Hoare annotation [2022-02-20 16:46:32,489 WARN L170 areAnnotationChecker]: L61-6 has no Hoare annotation [2022-02-20 16:46:32,489 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:46:32,489 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:46:32,489 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:46:32,489 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:46:32,489 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:46:32,490 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:46:32,490 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:46:32,490 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:46:32,490 WARN L170 areAnnotationChecker]: L84-2 has no Hoare annotation [2022-02-20 16:46:32,490 WARN L170 areAnnotationChecker]: L84-2 has no Hoare annotation [2022-02-20 16:46:32,490 WARN L170 areAnnotationChecker]: L84-2 has no Hoare annotation [2022-02-20 16:46:32,490 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:46:32,490 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:46:32,490 WARN L170 areAnnotationChecker]: L90-2 has no Hoare annotation [2022-02-20 16:46:32,490 WARN L170 areAnnotationChecker]: L90-2 has no Hoare annotation [2022-02-20 16:46:32,491 WARN L170 areAnnotationChecker]: L99-2 has no Hoare annotation [2022-02-20 16:46:32,491 WARN L170 areAnnotationChecker]: L99-2 has no Hoare annotation [2022-02-20 16:46:32,491 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:46:32,491 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:46:32,491 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-02-20 16:46:32,491 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:46:32,492 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:46:32,492 WARN L170 areAnnotationChecker]: L99-3 has no Hoare annotation [2022-02-20 16:46:32,492 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:32,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:46:32 BoogieIcfgContainer [2022-02-20 16:46:32,493 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:46:32,495 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:46:32,498 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:46:32,498 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:46:32,499 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:31" (3/4) ... [2022-02-20 16:46:32,501 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:46:32,501 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:46:32,503 INFO L158 Benchmark]: Toolchain (without parser) took 1685.61ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 42.6MB in the beginning and 50.9MB in the end (delta: -8.4MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2022-02-20 16:46:32,503 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 75.5MB. Free memory was 48.7MB in the beginning and 48.7MB in the end (delta: 29.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:32,506 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.22ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 42.4MB in the beginning and 66.0MB in the end (delta: -23.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:46:32,507 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.79ms. Allocated memory is still 92.3MB. Free memory was 66.0MB in the beginning and 62.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:46:32,509 INFO L158 Benchmark]: Boogie Preprocessor took 51.22ms. Allocated memory is still 92.3MB. Free memory was 62.6MB in the beginning and 60.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:32,513 INFO L158 Benchmark]: RCFGBuilder took 507.93ms. Allocated memory is still 92.3MB. Free memory was 60.5MB in the beginning and 36.6MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:32,513 INFO L158 Benchmark]: TraceAbstraction took 841.09ms. Allocated memory is still 92.3MB. Free memory was 36.2MB in the beginning and 50.9MB in the end (delta: -14.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:32,513 INFO L158 Benchmark]: Witness Printer took 6.48ms. Allocated memory is still 92.3MB. Free memory was 50.9MB in the beginning and 50.9MB in the end (delta: 2.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:32,517 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 75.5MB. Free memory was 48.7MB in the beginning and 48.7MB in the end (delta: 29.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 234.22ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 42.4MB in the beginning and 66.0MB in the end (delta: -23.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.79ms. Allocated memory is still 92.3MB. Free memory was 66.0MB in the beginning and 62.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.22ms. Allocated memory is still 92.3MB. Free memory was 62.6MB in the beginning and 60.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 507.93ms. Allocated memory is still 92.3MB. Free memory was 60.5MB in the beginning and 36.6MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 841.09ms. Allocated memory is still 92.3MB. Free memory was 36.2MB in the beginning and 50.9MB in the end (delta: -14.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 6.48ms. Allocated memory is still 92.3MB. Free memory was 50.9MB in the beginning and 50.9MB in the end (delta: 2.8kB). 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: 137]: 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 136, overapproximation of someUnaryDOUBLEoperation at line 16, overapproximation of bitwiseAnd at line 34, overapproximation of someBinaryArithmeticFLOAToperation at line 37, overapproximation of bitwiseXOr at line 33. Possible FailurePath: [L14-L17] static const float one_fmod = 1.0, Zero_fmod[] = { 0.0, -0.0, }; VAL [one_fmod=1, Zero_fmod={4:0}] [L128] float x = __VERIFIER_nondet_float(); [L129] float y = -1.0f / 0.0f; [L131] CALL isfinite_float(x) [L111] __int32_t ix; VAL [\old(x)=4294967307, one_fmod=1, x=4294967307, Zero_fmod={4:0}] [L113] ieee_float_shape_type gf_u; [L114] gf_u.value = (x) [L115] EXPR gf_u.word [L115] (ix) = gf_u.word [L117] ix &= 0x7fffffff [L118] return (((ix) < 0x7f800000L)); VAL [\old(x)=4294967307, \result=1, ix=1, one_fmod=1, x=4294967307, Zero_fmod={4:0}] [L131] RET isfinite_float(x) [L131] COND TRUE isfinite_float(x) [L133] CALL, EXPR fmod_float(x, y) [L20] __int32_t n, hx, hy, hz, ix, iy, sx, i; VAL [\old(x)=4294967307, \old(y)=4294967306, one_fmod=1, x=4294967307, y=4294967306, Zero_fmod={4:0}] [L23] ieee_float_shape_type gf_u; [L24] gf_u.value = (x) [L25] EXPR gf_u.word [L25] (hx) = gf_u.word [L28] ieee_float_shape_type gf_u; [L29] gf_u.value = (y) [L30] EXPR gf_u.word [L30] (hy) = gf_u.word [L32] sx = hx & 0x80000000 VAL [\old(x)=4294967307, \old(y)=4294967306, hx=0, hy=-1, one_fmod=1, sx=0, x=4294967307, y=4294967306, Zero_fmod={4:0}] [L33] hx ^= sx [L34] hy &= 0x7fffffff VAL [\old(x)=4294967307, \old(y)=4294967306, hx=0, hy=0, one_fmod=1, sx=0, x=4294967307, y=4294967306, Zero_fmod={4:0}] [L36] COND TRUE ((hy) == 0) || !((hx) < 0x7f800000L) || ((hy) > 0x7f800000L) [L37] return (x * y) / (x * y); VAL [\old(x)=4294967307, \old(y)=4294967306, hx=0, hy=0, one_fmod=1, sx=0, x=4294967307, y=4294967306, Zero_fmod={4:0}] [L133] RET, EXPR fmod_float(x, y) [L133] float res = fmod_float(x, y); [L136] COND TRUE res != x VAL [one_fmod=1, res=4294967309, x=4294967307, y=4294967306, Zero_fmod={4:0}] [L137] reach_error() VAL [one_fmod=1, res=4294967309, x=4294967307, y=4294967306, Zero_fmod={4:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, 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, 79 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 79 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 13 ConstructedInterpolants, 0 QuantifiedInterpolants, 13 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-02-20 16:46:32,550 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_1131b.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 13787d2cb5ffea0911ec7bb9f969ca72234ab27d7c89c5aec775ef624e14d583 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:46:34,133 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:46:34,134 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:46:34,153 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:46:34,153 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:46:34,154 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:46:34,155 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:46:34,156 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:46:34,157 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:46:34,158 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:46:34,158 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:46:34,159 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:46:34,159 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:46:34,164 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:46:34,165 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:46:34,166 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:46:34,166 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:46:34,167 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:46:34,168 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:46:34,173 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:46:34,176 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:46:34,177 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:46:34,178 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:46:34,179 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:46:34,181 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:46:34,185 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:46:34,186 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:46:34,186 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:46:34,187 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:46:34,188 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:46:34,188 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:46:34,188 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:46:34,189 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:46:34,191 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:46:34,192 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:46:34,192 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:46:34,193 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:46:34,193 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:46:34,193 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:46:34,194 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:46:34,196 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:46:34,196 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:34,212 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:46:34,212 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:46:34,213 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:46:34,213 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:46:34,214 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:46:34,214 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:46:34,215 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:46:34,215 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:46:34,215 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:46:34,215 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:46:34,216 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:46:34,216 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:46:34,216 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:46:34,216 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:46:34,216 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:46:34,216 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:46:34,217 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:46:34,217 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:46:34,217 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:46:34,217 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:46:34,217 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:46:34,217 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:46:34,217 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:46:34,218 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:46:34,218 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:46:34,218 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:46:34,218 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:34,218 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:46:34,218 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:46:34,218 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:46:34,219 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:46:34,219 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:46:34,219 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:46:34,219 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:46:34,219 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:46:34,219 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:46:34,220 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 -> 13787d2cb5ffea0911ec7bb9f969ca72234ab27d7c89c5aec775ef624e14d583 [2022-02-20 16:46:34,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:46:34,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:46:34,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:46:34,477 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:46:34,477 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:46:34,478 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1131b.c [2022-02-20 16:46:34,523 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0acb1858e/c7a25066030a4a34830fa383b27219c4/FLAGacc51b5fd [2022-02-20 16:46:34,892 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:46:34,892 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1131b.c [2022-02-20 16:46:34,897 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0acb1858e/c7a25066030a4a34830fa383b27219c4/FLAGacc51b5fd [2022-02-20 16:46:34,911 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0acb1858e/c7a25066030a4a34830fa383b27219c4 [2022-02-20 16:46:34,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:46:34,915 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:46:34,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:34,917 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:46:34,919 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:46:34,920 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:34" (1/1) ... [2022-02-20 16:46:34,920 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ec49ecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:34, skipping insertion in model container [2022-02-20 16:46:34,921 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:34" (1/1) ... [2022-02-20 16:46:34,925 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:46:34,943 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:46:35,151 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_1131b.c[2947,2960] [2022-02-20 16:46:35,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:35,168 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:46:35,211 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_1131b.c[2947,2960] [2022-02-20 16:46:35,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:35,224 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:46:35,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:35 WrapperNode [2022-02-20 16:46:35,226 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:35,227 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:35,227 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:46:35,228 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:46:35,233 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:35" (1/1) ... [2022-02-20 16:46:35,251 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:35" (1/1) ... [2022-02-20 16:46:35,287 INFO L137 Inliner]: procedures = 21, calls = 35, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 183 [2022-02-20 16:46:35,287 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:35,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:46:35,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:46:35,289 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:46:35,296 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:35" (1/1) ... [2022-02-20 16:46:35,297 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:35" (1/1) ... [2022-02-20 16:46:35,320 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:35" (1/1) ... [2022-02-20 16:46:35,320 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:35" (1/1) ... [2022-02-20 16:46:35,327 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:35" (1/1) ... [2022-02-20 16:46:35,330 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:35" (1/1) ... [2022-02-20 16:46:35,331 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:35" (1/1) ... [2022-02-20 16:46:35,334 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:46:35,334 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:46:35,334 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:46:35,334 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:46:35,335 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:35" (1/1) ... [2022-02-20 16:46:35,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:35,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:46:35,383 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:35,411 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:35,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:46:35,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2022-02-20 16:46:35,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:46:35,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:46:35,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:46:35,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:46:35,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:46:35,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:46:35,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:46:35,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:46:35,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:46:35,514 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:46:35,515 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:46:38,065 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:46:38,071 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:46:38,071 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2022-02-20 16:46:38,072 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,073 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:46:38,074 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:46:38,074 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:46:38,077 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:46:38,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:46:34" (1/3) ... [2022-02-20 16:46:38,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a388d23 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,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:35" (2/3) ... [2022-02-20 16:46:38,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a388d23 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,078 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,079 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1131b.c [2022-02-20 16:46:38,083 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:46:38,084 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:46:38,114 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:46:38,119 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,119 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:46:38,130 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 45 states have (on average 1.7333333333333334) internal successors, (78), 46 states have internal predecessors, (78), 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,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:46:38,133 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:38,134 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:38,134 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:38,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:38,138 INFO L85 PathProgramCache]: Analyzing trace with hash 2036314411, now seen corresponding path program 1 times [2022-02-20 16:46:38,147 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:38,148 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1288536539] [2022-02-20 16:46:38,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:38,149 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:38,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:38,152 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,163 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,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:38,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:46:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:38,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:38,487 INFO L290 TraceCheckUtils]: 0: Hoare triple {50#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_fmod~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~#Zero_fmod~0.base, ~#Zero_fmod~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(8bv32, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE()), ~#Zero_fmod~0.base, ~#Zero_fmod~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())), ~#Zero_fmod~0.base, ~bvadd32(4bv32, ~#Zero_fmod~0.offset), 4bv32); {50#true} is VALID [2022-02-20 16:46:38,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {50#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~ret15#1, main_~res~0#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;main_~y~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 1.0)), ~Pluszero~FLOAT());assume { :begin_inline_isfinite_float } true;isfinite_float_#in~x#1 := main_~x~0#1;havoc isfinite_float_#res#1;havoc isfinite_float_#t~mem12#1, isfinite_float_~#gf_u~2#1.base, isfinite_float_~#gf_u~2#1.offset, isfinite_float_~x#1, isfinite_float_~ix~1#1;isfinite_float_~x#1 := isfinite_float_#in~x#1;havoc isfinite_float_~ix~1#1; {50#true} is VALID [2022-02-20 16:46:38,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {50#true} assume !true; {51#false} is VALID [2022-02-20 16:46:38,489 INFO L290 TraceCheckUtils]: 3: Hoare triple {51#false} isfinite_float_~ix~1#1 := ~bvand32(2147483647bv32, isfinite_float_~ix~1#1);isfinite_float_#res#1 := (if ~bvslt32(isfinite_float_~ix~1#1, 2139095040bv32) then 1bv32 else 0bv32); {51#false} is VALID [2022-02-20 16:46:38,490 INFO L290 TraceCheckUtils]: 4: Hoare triple {51#false} main_#t~ret14#1 := isfinite_float_#res#1;assume { :end_inline_isfinite_float } true; {51#false} is VALID [2022-02-20 16:46:38,491 INFO L290 TraceCheckUtils]: 5: Hoare triple {51#false} assume 0bv32 != main_#t~ret14#1;havoc main_#t~ret14#1;assume { :begin_inline_fmod_float } true;fmod_float_#in~x#1, fmod_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmod_float_#res#1;havoc fmod_float_#t~mem4#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, fmod_float_#t~mem5#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, fmod_float_#t~mem6#1, fmod_float_#t~mem8#1, fmod_float_#t~post7#1, fmod_float_#t~mem9#1, fmod_float_#t~mem10#1, fmod_float_~#sf_u~0#1.base, fmod_float_~#sf_u~0#1.offset, fmod_float_#t~mem11#1, fmod_float_~#sf_u~1#1.base, fmod_float_~#sf_u~1#1.offset, fmod_float_~x#1, fmod_float_~y#1, fmod_float_~n~0#1, fmod_float_~hx~0#1, fmod_float_~hy~0#1, fmod_float_~hz~0#1, fmod_float_~ix~0#1, fmod_float_~iy~0#1, fmod_float_~sx~0#1, fmod_float_~i~0#1;fmod_float_~x#1 := fmod_float_#in~x#1;fmod_float_~y#1 := fmod_float_#in~y#1;havoc fmod_float_~n~0#1;havoc fmod_float_~hx~0#1;havoc fmod_float_~hy~0#1;havoc fmod_float_~hz~0#1;havoc fmod_float_~ix~0#1;havoc fmod_float_~iy~0#1;havoc fmod_float_~sx~0#1;havoc fmod_float_~i~0#1; {51#false} is VALID [2022-02-20 16:46:38,491 INFO L290 TraceCheckUtils]: 6: Hoare triple {51#false} assume !true; {51#false} is VALID [2022-02-20 16:46:38,491 INFO L290 TraceCheckUtils]: 7: Hoare triple {51#false} assume !true; {51#false} is VALID [2022-02-20 16:46:38,492 INFO L290 TraceCheckUtils]: 8: Hoare triple {51#false} fmod_float_~sx~0#1 := ~bvand32(2147483648bv32, fmod_float_~hx~0#1);fmod_float_~hx~0#1 := ~bvxor32(fmod_float_~hx~0#1, fmod_float_~sx~0#1);fmod_float_~hy~0#1 := ~bvand32(2147483647bv32, fmod_float_~hy~0#1); {51#false} is VALID [2022-02-20 16:46:38,492 INFO L290 TraceCheckUtils]: 9: Hoare triple {51#false} assume (0bv32 == fmod_float_~hy~0#1 || !~bvslt32(fmod_float_~hx~0#1, 2139095040bv32)) || ~bvsgt32(fmod_float_~hy~0#1, 2139095040bv32);fmod_float_#res#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, fmod_float_~x#1, fmod_float_~y#1), ~fp.mul~FLOAT(currentRoundingMode, fmod_float_~x#1, fmod_float_~y#1)); {51#false} is VALID [2022-02-20 16:46:38,492 INFO L290 TraceCheckUtils]: 10: Hoare triple {51#false} main_#t~ret15#1 := fmod_float_#res#1;assume { :end_inline_fmod_float } true;main_~res~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1; {51#false} is VALID [2022-02-20 16:46:38,493 INFO L290 TraceCheckUtils]: 11: Hoare triple {51#false} assume !~fp.eq~FLOAT(main_~res~0#1, main_~x~0#1); {51#false} is VALID [2022-02-20 16:46:38,493 INFO L290 TraceCheckUtils]: 12: Hoare triple {51#false} assume !false; {51#false} is VALID [2022-02-20 16:46:38,494 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,494 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:38,494 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:38,494 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1288536539] [2022-02-20 16:46:38,495 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1288536539] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:38,495 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:38,495 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:46:38,498 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469864617] [2022-02-20 16:46:38,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:38,502 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 16:46:38,503 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:38,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:38,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:46:38,729 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:38,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:46:38,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:38,753 INFO L87 Difference]: Start difference. First operand has 47 states, 45 states have (on average 1.7333333333333334) internal successors, (78), 46 states have internal predecessors, (78), 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 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:41,126 INFO L93 Difference]: Finished difference Result 92 states and 154 transitions. [2022-02-20 16:46:41,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:46:41,127 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 16:46:41,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:41,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 154 transitions. [2022-02-20 16:46:41,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 154 transitions. [2022-02-20 16:46:41,145 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 154 transitions. [2022-02-20 16:46:41,807 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:41,813 INFO L225 Difference]: With dead ends: 92 [2022-02-20 16:46:41,813 INFO L226 Difference]: Without dead ends: 43 [2022-02-20 16:46:41,816 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 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:41,818 INFO L933 BasicCegarLoop]: 63 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, 63 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:41,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 63 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:41,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-20 16:46:41,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-02-20 16:46:41,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:41,839 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 42 states have (on average 1.380952380952381) internal successors, (58), 42 states have internal predecessors, (58), 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,840 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 42 states have (on average 1.380952380952381) internal successors, (58), 42 states have internal predecessors, (58), 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,841 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 42 states have (on average 1.380952380952381) internal successors, (58), 42 states have internal predecessors, (58), 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,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:41,843 INFO L93 Difference]: Finished difference Result 43 states and 58 transitions. [2022-02-20 16:46:41,843 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2022-02-20 16:46:41,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:41,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:41,844 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 42 states have (on average 1.380952380952381) internal successors, (58), 42 states have internal predecessors, (58), 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 43 states. [2022-02-20 16:46:41,845 INFO L87 Difference]: Start difference. First operand has 43 states, 42 states have (on average 1.380952380952381) internal successors, (58), 42 states have internal predecessors, (58), 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 43 states. [2022-02-20 16:46:41,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:41,846 INFO L93 Difference]: Finished difference Result 43 states and 58 transitions. [2022-02-20 16:46:41,847 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2022-02-20 16:46:41,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:41,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:41,847 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:41,847 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:41,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.380952380952381) internal successors, (58), 42 states have internal predecessors, (58), 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,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2022-02-20 16:46:41,850 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 13 [2022-02-20 16:46:41,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:41,851 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2022-02-20 16:46:41,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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,859 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2022-02-20 16:46:41,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 16:46:41,860 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:41,860 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:41,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 16:46:42,072 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:42,073 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:42,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:42,073 INFO L85 PathProgramCache]: Analyzing trace with hash -794964373, now seen corresponding path program 1 times [2022-02-20 16:46:42,074 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:42,074 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [330637210] [2022-02-20 16:46:42,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:42,075 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:42,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:42,081 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:42,082 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:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:42,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 30 conjunts are in the unsatisfiable core [2022-02-20 16:46:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:42,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:42,492 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:43,293 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-02-20 16:46:43,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 35 [2022-02-20 16:46:43,625 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-02-20 16:46:43,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 24 [2022-02-20 16:46:44,072 INFO L290 TraceCheckUtils]: 0: Hoare triple {343#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_fmod~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~#Zero_fmod~0.base, ~#Zero_fmod~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(8bv32, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE()), ~#Zero_fmod~0.base, ~#Zero_fmod~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())), ~#Zero_fmod~0.base, ~bvadd32(4bv32, ~#Zero_fmod~0.offset), 4bv32); {343#true} is VALID [2022-02-20 16:46:44,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {343#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~ret15#1, main_~res~0#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;main_~y~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 1.0)), ~Pluszero~FLOAT());assume { :begin_inline_isfinite_float } true;isfinite_float_#in~x#1 := main_~x~0#1;havoc isfinite_float_#res#1;havoc isfinite_float_#t~mem12#1, isfinite_float_~#gf_u~2#1.base, isfinite_float_~#gf_u~2#1.offset, isfinite_float_~x#1, isfinite_float_~ix~1#1;isfinite_float_~x#1 := isfinite_float_#in~x#1;havoc isfinite_float_~ix~1#1; {351#(and (= |ULTIMATE.start_isfinite_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 16:46:44,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {351#(and (= |ULTIMATE.start_isfinite_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|)))} call isfinite_float_~#gf_u~2#1.base, isfinite_float_~#gf_u~2#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(isfinite_float_~x#1, isfinite_float_~#gf_u~2#1.base, isfinite_float_~#gf_u~2#1.offset, 4bv32);call isfinite_float_#t~mem12#1 := read~intINTTYPE4(isfinite_float_~#gf_u~2#1.base, isfinite_float_~#gf_u~2#1.offset, 4bv32);isfinite_float_~ix~1#1 := isfinite_float_#t~mem12#1;havoc isfinite_float_#t~mem12#1;call ULTIMATE.dealloc(isfinite_float_~#gf_u~2#1.base, isfinite_float_~#gf_u~2#1.offset);havoc isfinite_float_~#gf_u~2#1.base, isfinite_float_~#gf_u~2#1.offset; {355#(and (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32)))) |ULTIMATE.start_main_~x~0#1|) (= (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32)) |ULTIMATE.start_isfinite_float_~ix~1#1|))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 16:46:44,092 INFO L290 TraceCheckUtils]: 3: Hoare triple {355#(and (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32)))) |ULTIMATE.start_main_~x~0#1|) (= (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32)) |ULTIMATE.start_isfinite_float_~ix~1#1|))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|)))} goto; {355#(and (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32)))) |ULTIMATE.start_main_~x~0#1|) (= (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32)) |ULTIMATE.start_isfinite_float_~ix~1#1|))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 16:46:44,096 INFO L290 TraceCheckUtils]: 4: Hoare triple {355#(and (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32)))) |ULTIMATE.start_main_~x~0#1|) (= (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32)) |ULTIMATE.start_isfinite_float_~ix~1#1|))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|)))} isfinite_float_~ix~1#1 := ~bvand32(2147483647bv32, isfinite_float_~ix~1#1);isfinite_float_#res#1 := (if ~bvslt32(isfinite_float_~ix~1#1, 2139095040bv32) then 1bv32 else 0bv32); {362#(and (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32)))) |ULTIMATE.start_main_~x~0#1|) (or (and (not (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) (_ bv2139095040 32))) (= |ULTIMATE.start_isfinite_float_#res#1| (_ bv0 32))) (and (= |ULTIMATE.start_isfinite_float_#res#1| (_ bv1 32)) (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) (_ bv2139095040 32)))))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 16:46:44,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {362#(and (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32)))) |ULTIMATE.start_main_~x~0#1|) (or (and (not (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) (_ bv2139095040 32))) (= |ULTIMATE.start_isfinite_float_#res#1| (_ bv0 32))) (and (= |ULTIMATE.start_isfinite_float_#res#1| (_ bv1 32)) (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) (_ bv2139095040 32)))))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|)))} main_#t~ret14#1 := isfinite_float_#res#1;assume { :end_inline_isfinite_float } true; {366#(and (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6| (_ BitVec 32))) (and (or (and (= |ULTIMATE.start_main_#t~ret14#1| (_ bv0 32)) (not (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) (_ bv2139095040 32)))) (and (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) (_ bv2139095040 32)) (= |ULTIMATE.start_main_#t~ret14#1| (_ bv1 32)))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32)))) |ULTIMATE.start_main_~x~0#1|))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 16:46:44,105 INFO L290 TraceCheckUtils]: 6: Hoare triple {366#(and (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6| (_ BitVec 32))) (and (or (and (= |ULTIMATE.start_main_#t~ret14#1| (_ bv0 32)) (not (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) (_ bv2139095040 32)))) (and (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) (_ bv2139095040 32)) (= |ULTIMATE.start_main_#t~ret14#1| (_ bv1 32)))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32)))) |ULTIMATE.start_main_~x~0#1|))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|)))} assume 0bv32 != main_#t~ret14#1;havoc main_#t~ret14#1;assume { :begin_inline_fmod_float } true;fmod_float_#in~x#1, fmod_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmod_float_#res#1;havoc fmod_float_#t~mem4#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, fmod_float_#t~mem5#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, fmod_float_#t~mem6#1, fmod_float_#t~mem8#1, fmod_float_#t~post7#1, fmod_float_#t~mem9#1, fmod_float_#t~mem10#1, fmod_float_~#sf_u~0#1.base, fmod_float_~#sf_u~0#1.offset, fmod_float_#t~mem11#1, fmod_float_~#sf_u~1#1.base, fmod_float_~#sf_u~1#1.offset, fmod_float_~x#1, fmod_float_~y#1, fmod_float_~n~0#1, fmod_float_~hx~0#1, fmod_float_~hy~0#1, fmod_float_~hz~0#1, fmod_float_~ix~0#1, fmod_float_~iy~0#1, fmod_float_~sx~0#1, fmod_float_~i~0#1;fmod_float_~x#1 := fmod_float_#in~x#1;fmod_float_~y#1 := fmod_float_#in~y#1;havoc fmod_float_~n~0#1;havoc fmod_float_~hx~0#1;havoc fmod_float_~hy~0#1;havoc fmod_float_~hz~0#1;havoc fmod_float_~ix~0#1;havoc fmod_float_~iy~0#1;havoc fmod_float_~sx~0#1;havoc fmod_float_~i~0#1; {370#(and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_fmod_float_~y#1|)) (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32)))) |ULTIMATE.start_fmod_float_~x#1|))))} is VALID [2022-02-20 16:46:44,110 INFO L290 TraceCheckUtils]: 7: Hoare triple {370#(and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_fmod_float_~y#1|)) (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32)))) |ULTIMATE.start_fmod_float_~x#1|))))} call fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(fmod_float_~x#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, 4bv32);call fmod_float_#t~mem4#1 := read~intINTTYPE4(fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, 4bv32);fmod_float_~hx~0#1 := fmod_float_#t~mem4#1;havoc fmod_float_#t~mem4#1;call ULTIMATE.dealloc(fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset);havoc fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset; {374#(and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_fmod_float_~y#1|)) (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6| (_ BitVec 32)) (|v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32)))) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32))))) (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) (_ bv2139095040 32)) (= (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32)) |ULTIMATE.start_fmod_float_~hx~0#1|))))} is VALID [2022-02-20 16:46:44,114 INFO L290 TraceCheckUtils]: 8: Hoare triple {374#(and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_fmod_float_~y#1|)) (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6| (_ BitVec 32)) (|v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32)))) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32))))) (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) (_ bv2139095040 32)) (= (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32)) |ULTIMATE.start_fmod_float_~hx~0#1|))))} goto; {374#(and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_fmod_float_~y#1|)) (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6| (_ BitVec 32)) (|v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32)))) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32))))) (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) (_ bv2139095040 32)) (= (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32)) |ULTIMATE.start_fmod_float_~hx~0#1|))))} is VALID [2022-02-20 16:46:44,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {374#(and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_fmod_float_~y#1|)) (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6| (_ BitVec 32)) (|v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32)))) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32))))) (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) (_ bv2139095040 32)) (= (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32)) |ULTIMATE.start_fmod_float_~hx~0#1|))))} call fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(fmod_float_~y#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, 4bv32);call fmod_float_#t~mem5#1 := read~intINTTYPE4(fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, 4bv32);fmod_float_~hy~0#1 := fmod_float_#t~mem5#1;havoc fmod_float_#t~mem5#1;call ULTIMATE.dealloc(fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset);havoc fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset; {381#(and (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hy~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)))) (exists ((v_arrayElimCell_3 (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) v_arrayElimCell_3) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)) (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|))))))} is VALID [2022-02-20 16:46:44,129 INFO L290 TraceCheckUtils]: 10: Hoare triple {381#(and (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hy~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)))) (exists ((v_arrayElimCell_3 (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) v_arrayElimCell_3) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)) (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|))))))} goto; {381#(and (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hy~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)))) (exists ((v_arrayElimCell_3 (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) v_arrayElimCell_3) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)) (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|))))))} is VALID [2022-02-20 16:46:44,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {381#(and (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hy~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)))) (exists ((v_arrayElimCell_3 (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) v_arrayElimCell_3) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)) (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|))))))} fmod_float_~sx~0#1 := ~bvand32(2147483648bv32, fmod_float_~hx~0#1);fmod_float_~hx~0#1 := ~bvxor32(fmod_float_~hx~0#1, fmod_float_~sx~0#1);fmod_float_~hy~0#1 := ~bvand32(2147483647bv32, fmod_float_~hy~0#1); {388#(and (exists ((currentRoundingMode RoundingMode) (|v_ULTIMATE.start_fmod_float_~hy~0#1_20| (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_20|) |ULTIMATE.start_fmod_float_~hy~0#1|) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hy~0#1_20|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hy~0#1_20|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hy~0#1_20|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))) (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_35| (_ BitVec 32)) (v_arrayElimCell_3 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)) (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_35|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_35|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_35|))) (bvslt (bvand (_ bv2147483647 32) v_arrayElimCell_3) (_ bv2139095040 32)) (= (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_35| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_35|) |ULTIMATE.start_fmod_float_~hx~0#1|))))} is VALID [2022-02-20 16:46:44,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {388#(and (exists ((currentRoundingMode RoundingMode) (|v_ULTIMATE.start_fmod_float_~hy~0#1_20| (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_20|) |ULTIMATE.start_fmod_float_~hy~0#1|) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hy~0#1_20|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hy~0#1_20|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hy~0#1_20|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))) (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_35| (_ BitVec 32)) (v_arrayElimCell_3 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)) (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_35|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_35|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_35|))) (bvslt (bvand (_ bv2147483647 32) v_arrayElimCell_3) (_ bv2139095040 32)) (= (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_35| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_35|) |ULTIMATE.start_fmod_float_~hx~0#1|))))} assume (0bv32 == fmod_float_~hy~0#1 || !~bvslt32(fmod_float_~hx~0#1, 2139095040bv32)) || ~bvsgt32(fmod_float_~hy~0#1, 2139095040bv32);fmod_float_#res#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, fmod_float_~x#1, fmod_float_~y#1), ~fp.mul~FLOAT(currentRoundingMode, fmod_float_~x#1, fmod_float_~y#1)); {344#false} is VALID [2022-02-20 16:46:44,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {344#false} main_#t~ret15#1 := fmod_float_#res#1;assume { :end_inline_fmod_float } true;main_~res~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1; {344#false} is VALID [2022-02-20 16:46:44,375 INFO L290 TraceCheckUtils]: 14: Hoare triple {344#false} assume !~fp.eq~FLOAT(main_~res~0#1, main_~x~0#1); {344#false} is VALID [2022-02-20 16:46:44,375 INFO L290 TraceCheckUtils]: 15: Hoare triple {344#false} assume !false; {344#false} is VALID [2022-02-20 16:46:44,376 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:44,376 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:44,376 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:44,376 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [330637210] [2022-02-20 16:46:44,376 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [330637210] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:44,376 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:44,376 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 16:46:44,376 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925489032] [2022-02-20 16:46:44,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:44,377 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 16:46:44,377 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:44,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:44,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:44,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 16:46:44,722 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:44,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 16:46:44,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-02-20 16:46:44,723 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:47,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:47,106 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2022-02-20 16:46:47,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 16:46:47,106 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 16:46:47,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:47,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:47,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 61 transitions. [2022-02-20 16:46:47,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:47,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 61 transitions. [2022-02-20 16:46:47,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 61 transitions. [2022-02-20 16:46:48,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:48,090 INFO L225 Difference]: With dead ends: 47 [2022-02-20 16:46:48,090 INFO L226 Difference]: Without dead ends: 43 [2022-02-20 16:46:48,091 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-02-20 16:46:48,093 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:48,094 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 330 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 115 Unchecked, 0.0s Time] [2022-02-20 16:46:48,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-20 16:46:48,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-02-20 16:46:48,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:48,097 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 42 states have internal predecessors, (57), 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,097 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 42 states have internal predecessors, (57), 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,098 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 42 states have internal predecessors, (57), 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,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:48,099 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2022-02-20 16:46:48,099 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2022-02-20 16:46:48,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:48,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:48,100 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 42 states have internal predecessors, (57), 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 43 states. [2022-02-20 16:46:48,100 INFO L87 Difference]: Start difference. First operand has 43 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 42 states have internal predecessors, (57), 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 43 states. [2022-02-20 16:46:48,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:48,101 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2022-02-20 16:46:48,102 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2022-02-20 16:46:48,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:48,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:48,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:48,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:48,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 42 states have internal predecessors, (57), 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,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2022-02-20 16:46:48,104 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 57 transitions. Word has length 16 [2022-02-20 16:46:48,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:48,104 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 57 transitions. [2022-02-20 16:46:48,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:48,104 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2022-02-20 16:46:48,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 16:46:48,105 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:48,105 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:48,121 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:48,320 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:48,321 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:48,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:48,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1123581797, now seen corresponding path program 1 times [2022-02-20 16:46:48,322 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:48,322 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1741825216] [2022-02-20 16:46:48,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:48,322 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:48,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:48,323 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:48,324 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:48,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:48,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 16:46:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:48,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:49,267 INFO L290 TraceCheckUtils]: 0: Hoare triple {597#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_fmod~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~#Zero_fmod~0.base, ~#Zero_fmod~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(8bv32, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE()), ~#Zero_fmod~0.base, ~#Zero_fmod~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())), ~#Zero_fmod~0.base, ~bvadd32(4bv32, ~#Zero_fmod~0.offset), 4bv32); {597#true} is VALID [2022-02-20 16:46:49,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {597#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~ret15#1, main_~res~0#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;main_~y~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 1.0)), ~Pluszero~FLOAT());assume { :begin_inline_isfinite_float } true;isfinite_float_#in~x#1 := main_~x~0#1;havoc isfinite_float_#res#1;havoc isfinite_float_#t~mem12#1, isfinite_float_~#gf_u~2#1.base, isfinite_float_~#gf_u~2#1.offset, isfinite_float_~x#1, isfinite_float_~ix~1#1;isfinite_float_~x#1 := isfinite_float_#in~x#1;havoc isfinite_float_~ix~1#1; {605#(= |ULTIMATE.start_isfinite_float_~x#1| |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 16:46:49,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {605#(= |ULTIMATE.start_isfinite_float_~x#1| |ULTIMATE.start_main_~x~0#1|)} call isfinite_float_~#gf_u~2#1.base, isfinite_float_~#gf_u~2#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(isfinite_float_~x#1, isfinite_float_~#gf_u~2#1.base, isfinite_float_~#gf_u~2#1.offset, 4bv32);call isfinite_float_#t~mem12#1 := read~intINTTYPE4(isfinite_float_~#gf_u~2#1.base, isfinite_float_~#gf_u~2#1.offset, 4bv32);isfinite_float_~ix~1#1 := isfinite_float_#t~mem12#1;havoc isfinite_float_#t~mem12#1;call ULTIMATE.dealloc(isfinite_float_~#gf_u~2#1.base, isfinite_float_~#gf_u~2#1.offset);havoc isfinite_float_~#gf_u~2#1.base, isfinite_float_~#gf_u~2#1.offset; {609#(= (fp ((_ extract 31 31) |ULTIMATE.start_isfinite_float_~ix~1#1|) ((_ extract 30 23) |ULTIMATE.start_isfinite_float_~ix~1#1|) ((_ extract 22 0) |ULTIMATE.start_isfinite_float_~ix~1#1|)) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 16:46:49,287 INFO L290 TraceCheckUtils]: 3: Hoare triple {609#(= (fp ((_ extract 31 31) |ULTIMATE.start_isfinite_float_~ix~1#1|) ((_ extract 30 23) |ULTIMATE.start_isfinite_float_~ix~1#1|) ((_ extract 22 0) |ULTIMATE.start_isfinite_float_~ix~1#1|)) |ULTIMATE.start_main_~x~0#1|)} goto; {609#(= (fp ((_ extract 31 31) |ULTIMATE.start_isfinite_float_~ix~1#1|) ((_ extract 30 23) |ULTIMATE.start_isfinite_float_~ix~1#1|) ((_ extract 22 0) |ULTIMATE.start_isfinite_float_~ix~1#1|)) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 16:46:49,288 INFO L290 TraceCheckUtils]: 4: Hoare triple {609#(= (fp ((_ extract 31 31) |ULTIMATE.start_isfinite_float_~ix~1#1|) ((_ extract 30 23) |ULTIMATE.start_isfinite_float_~ix~1#1|) ((_ extract 22 0) |ULTIMATE.start_isfinite_float_~ix~1#1|)) |ULTIMATE.start_main_~x~0#1|)} isfinite_float_~ix~1#1 := ~bvand32(2147483647bv32, isfinite_float_~ix~1#1);isfinite_float_#res#1 := (if ~bvslt32(isfinite_float_~ix~1#1, 2139095040bv32) then 1bv32 else 0bv32); {616#(exists ((|v_ULTIMATE.start_isfinite_float_~ix~1#1_7| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 30 23) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 22 0) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|)) |ULTIMATE.start_main_~x~0#1|) (or (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)) (= |ULTIMATE.start_isfinite_float_#res#1| (_ bv1 32))) (and (= |ULTIMATE.start_isfinite_float_#res#1| (_ bv0 32)) (not (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)))))))} is VALID [2022-02-20 16:46:49,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {616#(exists ((|v_ULTIMATE.start_isfinite_float_~ix~1#1_7| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 30 23) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 22 0) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|)) |ULTIMATE.start_main_~x~0#1|) (or (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)) (= |ULTIMATE.start_isfinite_float_#res#1| (_ bv1 32))) (and (= |ULTIMATE.start_isfinite_float_#res#1| (_ bv0 32)) (not (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)))))))} main_#t~ret14#1 := isfinite_float_#res#1;assume { :end_inline_isfinite_float } true; {620#(exists ((|v_ULTIMATE.start_isfinite_float_~ix~1#1_7| (_ BitVec 32))) (and (or (and (= |ULTIMATE.start_main_#t~ret14#1| (_ bv0 32)) (not (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)))) (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)) (= |ULTIMATE.start_main_#t~ret14#1| (_ bv1 32)))) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 30 23) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 22 0) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|)) |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-20 16:46:49,290 INFO L290 TraceCheckUtils]: 6: Hoare triple {620#(exists ((|v_ULTIMATE.start_isfinite_float_~ix~1#1_7| (_ BitVec 32))) (and (or (and (= |ULTIMATE.start_main_#t~ret14#1| (_ bv0 32)) (not (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)))) (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)) (= |ULTIMATE.start_main_#t~ret14#1| (_ bv1 32)))) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 30 23) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 22 0) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|)) |ULTIMATE.start_main_~x~0#1|)))} assume 0bv32 != main_#t~ret14#1;havoc main_#t~ret14#1;assume { :begin_inline_fmod_float } true;fmod_float_#in~x#1, fmod_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmod_float_#res#1;havoc fmod_float_#t~mem4#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, fmod_float_#t~mem5#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, fmod_float_#t~mem6#1, fmod_float_#t~mem8#1, fmod_float_#t~post7#1, fmod_float_#t~mem9#1, fmod_float_#t~mem10#1, fmod_float_~#sf_u~0#1.base, fmod_float_~#sf_u~0#1.offset, fmod_float_#t~mem11#1, fmod_float_~#sf_u~1#1.base, fmod_float_~#sf_u~1#1.offset, fmod_float_~x#1, fmod_float_~y#1, fmod_float_~n~0#1, fmod_float_~hx~0#1, fmod_float_~hy~0#1, fmod_float_~hz~0#1, fmod_float_~ix~0#1, fmod_float_~iy~0#1, fmod_float_~sx~0#1, fmod_float_~i~0#1;fmod_float_~x#1 := fmod_float_#in~x#1;fmod_float_~y#1 := fmod_float_#in~y#1;havoc fmod_float_~n~0#1;havoc fmod_float_~hx~0#1;havoc fmod_float_~hy~0#1;havoc fmod_float_~hz~0#1;havoc fmod_float_~ix~0#1;havoc fmod_float_~iy~0#1;havoc fmod_float_~sx~0#1;havoc fmod_float_~i~0#1; {624#(and (= |ULTIMATE.start_fmod_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (exists ((|v_ULTIMATE.start_isfinite_float_~ix~1#1_7| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 30 23) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 22 0) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|)) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-20 16:46:49,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {624#(and (= |ULTIMATE.start_fmod_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (exists ((|v_ULTIMATE.start_isfinite_float_~ix~1#1_7| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 30 23) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 22 0) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|)) |ULTIMATE.start_main_~x~0#1|))))} call fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(fmod_float_~x#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, 4bv32);call fmod_float_#t~mem4#1 := read~intINTTYPE4(fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, 4bv32);fmod_float_~hx~0#1 := fmod_float_#t~mem4#1;havoc fmod_float_#t~mem4#1;call ULTIMATE.dealloc(fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset);havoc fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset; {624#(and (= |ULTIMATE.start_fmod_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (exists ((|v_ULTIMATE.start_isfinite_float_~ix~1#1_7| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 30 23) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 22 0) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|)) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-20 16:46:49,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {624#(and (= |ULTIMATE.start_fmod_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (exists ((|v_ULTIMATE.start_isfinite_float_~ix~1#1_7| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 30 23) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 22 0) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|)) |ULTIMATE.start_main_~x~0#1|))))} goto; {624#(and (= |ULTIMATE.start_fmod_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (exists ((|v_ULTIMATE.start_isfinite_float_~ix~1#1_7| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 30 23) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 22 0) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|)) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-20 16:46:49,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {624#(and (= |ULTIMATE.start_fmod_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (exists ((|v_ULTIMATE.start_isfinite_float_~ix~1#1_7| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 30 23) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 22 0) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|)) |ULTIMATE.start_main_~x~0#1|))))} call fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(fmod_float_~y#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, 4bv32);call fmod_float_#t~mem5#1 := read~intINTTYPE4(fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, 4bv32);fmod_float_~hy~0#1 := fmod_float_#t~mem5#1;havoc fmod_float_#t~mem5#1;call ULTIMATE.dealloc(fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset);havoc fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset; {624#(and (= |ULTIMATE.start_fmod_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (exists ((|v_ULTIMATE.start_isfinite_float_~ix~1#1_7| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 30 23) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 22 0) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|)) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-20 16:46:49,296 INFO L290 TraceCheckUtils]: 10: Hoare triple {624#(and (= |ULTIMATE.start_fmod_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (exists ((|v_ULTIMATE.start_isfinite_float_~ix~1#1_7| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 30 23) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 22 0) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|)) |ULTIMATE.start_main_~x~0#1|))))} goto; {624#(and (= |ULTIMATE.start_fmod_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (exists ((|v_ULTIMATE.start_isfinite_float_~ix~1#1_7| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 30 23) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 22 0) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|)) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-20 16:46:49,296 INFO L290 TraceCheckUtils]: 11: Hoare triple {624#(and (= |ULTIMATE.start_fmod_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (exists ((|v_ULTIMATE.start_isfinite_float_~ix~1#1_7| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 30 23) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 22 0) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|)) |ULTIMATE.start_main_~x~0#1|))))} fmod_float_~sx~0#1 := ~bvand32(2147483648bv32, fmod_float_~hx~0#1);fmod_float_~hx~0#1 := ~bvxor32(fmod_float_~hx~0#1, fmod_float_~sx~0#1);fmod_float_~hy~0#1 := ~bvand32(2147483647bv32, fmod_float_~hy~0#1); {624#(and (= |ULTIMATE.start_fmod_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (exists ((|v_ULTIMATE.start_isfinite_float_~ix~1#1_7| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 30 23) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 22 0) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|)) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-20 16:46:49,297 INFO L290 TraceCheckUtils]: 12: Hoare triple {624#(and (= |ULTIMATE.start_fmod_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (exists ((|v_ULTIMATE.start_isfinite_float_~ix~1#1_7| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 30 23) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 22 0) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|)) |ULTIMATE.start_main_~x~0#1|))))} assume !((0bv32 == fmod_float_~hy~0#1 || !~bvslt32(fmod_float_~hx~0#1, 2139095040bv32)) || ~bvsgt32(fmod_float_~hy~0#1, 2139095040bv32)); {624#(and (= |ULTIMATE.start_fmod_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (exists ((|v_ULTIMATE.start_isfinite_float_~ix~1#1_7| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 30 23) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 22 0) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|)) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-20 16:46:49,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {624#(and (= |ULTIMATE.start_fmod_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (exists ((|v_ULTIMATE.start_isfinite_float_~ix~1#1_7| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 30 23) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 22 0) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|)) |ULTIMATE.start_main_~x~0#1|))))} assume ~bvslt32(fmod_float_~hx~0#1, fmod_float_~hy~0#1);fmod_float_#res#1 := fmod_float_~x#1; {646#(and (= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_fmod_float_#res#1|) (exists ((|v_ULTIMATE.start_isfinite_float_~ix~1#1_7| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 30 23) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 22 0) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|)) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-20 16:46:49,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {646#(and (= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_fmod_float_#res#1|) (exists ((|v_ULTIMATE.start_isfinite_float_~ix~1#1_7| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 30 23) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 22 0) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|)) |ULTIMATE.start_main_~x~0#1|))))} main_#t~ret15#1 := fmod_float_#res#1;assume { :end_inline_fmod_float } true;main_~res~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1; {650#(and (= |ULTIMATE.start_main_~res~0#1| |ULTIMATE.start_main_~x~0#1|) (exists ((|v_ULTIMATE.start_isfinite_float_~ix~1#1_7| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 30 23) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 22 0) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|)) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-20 16:46:49,299 INFO L290 TraceCheckUtils]: 15: Hoare triple {650#(and (= |ULTIMATE.start_main_~res~0#1| |ULTIMATE.start_main_~x~0#1|) (exists ((|v_ULTIMATE.start_isfinite_float_~ix~1#1_7| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 30 23) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 22 0) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|)) |ULTIMATE.start_main_~x~0#1|))))} assume !~fp.eq~FLOAT(main_~res~0#1, main_~x~0#1); {598#false} is VALID [2022-02-20 16:46:49,299 INFO L290 TraceCheckUtils]: 16: Hoare triple {598#false} assume !false; {598#false} is VALID [2022-02-20 16:46:49,299 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:49,299 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:49,299 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:49,299 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1741825216] [2022-02-20 16:46:49,300 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1741825216] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:49,300 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:49,300 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 16:46:49,300 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62334624] [2022-02-20 16:46:49,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:49,301 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 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 17 [2022-02-20 16:46:49,302 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:49,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 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:49,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:49,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 16:46:49,356 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:49,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 16:46:49,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 16:46:49,356 INFO L87 Difference]: Start difference. First operand 43 states and 57 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 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:51,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:51,265 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2022-02-20 16:46:51,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 16:46:51,265 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 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 17 [2022-02-20 16:46:51,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:51,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 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:51,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2022-02-20 16:46:51,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 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:51,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2022-02-20 16:46:51,267 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 62 transitions. [2022-02-20 16:46:51,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:51,399 INFO L225 Difference]: With dead ends: 49 [2022-02-20 16:46:51,399 INFO L226 Difference]: Without dead ends: 45 [2022-02-20 16:46:51,399 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-02-20 16:46:51,400 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 37 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:51,401 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 341 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 31 Unchecked, 0.0s Time] [2022-02-20 16:46:51,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-02-20 16:46:51,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2022-02-20 16:46:51,405 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:51,405 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 43 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 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:51,405 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 43 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 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:51,405 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 43 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 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:51,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:51,408 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-02-20 16:46:51,409 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2022-02-20 16:46:51,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:51,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:51,410 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 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 45 states. [2022-02-20 16:46:51,410 INFO L87 Difference]: Start difference. First operand has 43 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 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 45 states. [2022-02-20 16:46:51,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:51,412 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-02-20 16:46:51,413 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2022-02-20 16:46:51,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:51,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:51,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:51,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:51,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 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:51,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 56 transitions. [2022-02-20 16:46:51,415 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 56 transitions. Word has length 17 [2022-02-20 16:46:51,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:51,415 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 56 transitions. [2022-02-20 16:46:51,415 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 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:51,415 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 56 transitions. [2022-02-20 16:46:51,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 16:46:51,416 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:51,417 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:51,443 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:51,627 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:51,629 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:51,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:51,630 INFO L85 PathProgramCache]: Analyzing trace with hash 469119878, now seen corresponding path program 1 times [2022-02-20 16:46:51,630 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:51,630 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1281579823] [2022-02-20 16:46:51,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:51,631 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:51,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:51,632 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:51,633 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:51,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:51,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 16:46:51,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:51,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:52,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {864#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_fmod~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~#Zero_fmod~0.base, ~#Zero_fmod~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(8bv32, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE()), ~#Zero_fmod~0.base, ~#Zero_fmod~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())), ~#Zero_fmod~0.base, ~bvadd32(4bv32, ~#Zero_fmod~0.offset), 4bv32); {864#true} is VALID [2022-02-20 16:46:52,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {864#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~ret15#1, main_~res~0#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;main_~y~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 1.0)), ~Pluszero~FLOAT());assume { :begin_inline_isfinite_float } true;isfinite_float_#in~x#1 := main_~x~0#1;havoc isfinite_float_#res#1;havoc isfinite_float_#t~mem12#1, isfinite_float_~#gf_u~2#1.base, isfinite_float_~#gf_u~2#1.offset, isfinite_float_~x#1, isfinite_float_~ix~1#1;isfinite_float_~x#1 := isfinite_float_#in~x#1;havoc isfinite_float_~ix~1#1; {872#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 16:46:52,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {872#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|))} call isfinite_float_~#gf_u~2#1.base, isfinite_float_~#gf_u~2#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(isfinite_float_~x#1, isfinite_float_~#gf_u~2#1.base, isfinite_float_~#gf_u~2#1.offset, 4bv32);call isfinite_float_#t~mem12#1 := read~intINTTYPE4(isfinite_float_~#gf_u~2#1.base, isfinite_float_~#gf_u~2#1.offset, 4bv32);isfinite_float_~ix~1#1 := isfinite_float_#t~mem12#1;havoc isfinite_float_#t~mem12#1;call ULTIMATE.dealloc(isfinite_float_~#gf_u~2#1.base, isfinite_float_~#gf_u~2#1.offset);havoc isfinite_float_~#gf_u~2#1.base, isfinite_float_~#gf_u~2#1.offset; {872#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 16:46:52,240 INFO L290 TraceCheckUtils]: 3: Hoare triple {872#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|))} goto; {872#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 16:46:52,243 INFO L290 TraceCheckUtils]: 4: Hoare triple {872#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|))} isfinite_float_~ix~1#1 := ~bvand32(2147483647bv32, isfinite_float_~ix~1#1);isfinite_float_#res#1 := (if ~bvslt32(isfinite_float_~ix~1#1, 2139095040bv32) then 1bv32 else 0bv32); {872#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 16:46:52,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {872#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|))} main_#t~ret14#1 := isfinite_float_#res#1;assume { :end_inline_isfinite_float } true; {872#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 16:46:52,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {872#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|))} assume 0bv32 != main_#t~ret14#1;havoc main_#t~ret14#1;assume { :begin_inline_fmod_float } true;fmod_float_#in~x#1, fmod_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmod_float_#res#1;havoc fmod_float_#t~mem4#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, fmod_float_#t~mem5#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, fmod_float_#t~mem6#1, fmod_float_#t~mem8#1, fmod_float_#t~post7#1, fmod_float_#t~mem9#1, fmod_float_#t~mem10#1, fmod_float_~#sf_u~0#1.base, fmod_float_~#sf_u~0#1.offset, fmod_float_#t~mem11#1, fmod_float_~#sf_u~1#1.base, fmod_float_~#sf_u~1#1.offset, fmod_float_~x#1, fmod_float_~y#1, fmod_float_~n~0#1, fmod_float_~hx~0#1, fmod_float_~hy~0#1, fmod_float_~hz~0#1, fmod_float_~ix~0#1, fmod_float_~iy~0#1, fmod_float_~sx~0#1, fmod_float_~i~0#1;fmod_float_~x#1 := fmod_float_#in~x#1;fmod_float_~y#1 := fmod_float_#in~y#1;havoc fmod_float_~n~0#1;havoc fmod_float_~hx~0#1;havoc fmod_float_~hy~0#1;havoc fmod_float_~hz~0#1;havoc fmod_float_~ix~0#1;havoc fmod_float_~iy~0#1;havoc fmod_float_~sx~0#1;havoc fmod_float_~i~0#1; {888#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_fmod_float_~y#1|))} is VALID [2022-02-20 16:46:52,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {888#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_fmod_float_~y#1|))} call fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(fmod_float_~x#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, 4bv32);call fmod_float_#t~mem4#1 := read~intINTTYPE4(fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, 4bv32);fmod_float_~hx~0#1 := fmod_float_#t~mem4#1;havoc fmod_float_#t~mem4#1;call ULTIMATE.dealloc(fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset);havoc fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset; {888#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_fmod_float_~y#1|))} is VALID [2022-02-20 16:46:52,250 INFO L290 TraceCheckUtils]: 8: Hoare triple {888#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_fmod_float_~y#1|))} goto; {888#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_fmod_float_~y#1|))} is VALID [2022-02-20 16:46:52,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {888#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_fmod_float_~y#1|))} call fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(fmod_float_~y#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, 4bv32);call fmod_float_#t~mem5#1 := read~intINTTYPE4(fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, 4bv32);fmod_float_~hy~0#1 := fmod_float_#t~mem5#1;havoc fmod_float_#t~mem5#1;call ULTIMATE.dealloc(fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset);havoc fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset; {898#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hy~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:52,252 INFO L290 TraceCheckUtils]: 10: Hoare triple {898#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hy~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))} goto; {898#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hy~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:52,266 INFO L290 TraceCheckUtils]: 11: Hoare triple {898#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hy~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))} fmod_float_~sx~0#1 := ~bvand32(2147483648bv32, fmod_float_~hx~0#1);fmod_float_~hx~0#1 := ~bvxor32(fmod_float_~hx~0#1, fmod_float_~sx~0#1);fmod_float_~hy~0#1 := ~bvand32(2147483647bv32, fmod_float_~hy~0#1); {905#(and (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_36| (_ BitVec 32))) (= (bvxor |v_ULTIMATE.start_fmod_float_~hx~0#1_36| (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_36| (_ bv2147483648 32))) |ULTIMATE.start_fmod_float_~hx~0#1|)) (exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_21| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hy~0#1_21|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hy~0#1_21|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hy~0#1_21|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))) (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_21|) |ULTIMATE.start_fmod_float_~hy~0#1|))))} is VALID [2022-02-20 16:46:52,269 INFO L290 TraceCheckUtils]: 12: Hoare triple {905#(and (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_36| (_ BitVec 32))) (= (bvxor |v_ULTIMATE.start_fmod_float_~hx~0#1_36| (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_36| (_ bv2147483648 32))) |ULTIMATE.start_fmod_float_~hx~0#1|)) (exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_21| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hy~0#1_21|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hy~0#1_21|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hy~0#1_21|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))) (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_21|) |ULTIMATE.start_fmod_float_~hy~0#1|))))} assume !((0bv32 == fmod_float_~hy~0#1 || !~bvslt32(fmod_float_~hx~0#1, 2139095040bv32)) || ~bvsgt32(fmod_float_~hy~0#1, 2139095040bv32)); {909#(and (bvslt |ULTIMATE.start_fmod_float_~hx~0#1| (_ bv2139095040 32)) (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_36| (_ BitVec 32))) (= (bvxor |v_ULTIMATE.start_fmod_float_~hx~0#1_36| (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_36| (_ bv2147483648 32))) |ULTIMATE.start_fmod_float_~hx~0#1|)) (exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_21| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hy~0#1_21|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hy~0#1_21|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hy~0#1_21|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))) (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_21|) |ULTIMATE.start_fmod_float_~hy~0#1|))))} is VALID [2022-02-20 16:46:52,271 INFO L290 TraceCheckUtils]: 13: Hoare triple {909#(and (bvslt |ULTIMATE.start_fmod_float_~hx~0#1| (_ bv2139095040 32)) (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_36| (_ BitVec 32))) (= (bvxor |v_ULTIMATE.start_fmod_float_~hx~0#1_36| (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_36| (_ bv2147483648 32))) |ULTIMATE.start_fmod_float_~hx~0#1|)) (exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_21| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hy~0#1_21|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hy~0#1_21|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hy~0#1_21|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))) (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_21|) |ULTIMATE.start_fmod_float_~hy~0#1|))))} assume !~bvslt32(fmod_float_~hx~0#1, fmod_float_~hy~0#1); {865#false} is VALID [2022-02-20 16:46:52,271 INFO L290 TraceCheckUtils]: 14: Hoare triple {865#false} assume fmod_float_~hx~0#1 == fmod_float_~hy~0#1;call fmod_float_#t~mem6#1 := read~intFLOATTYPE4(~#Zero_fmod~0.base, ~bvadd32(~#Zero_fmod~0.offset, ~bvmul32(4bv32, ~bvlshr32(fmod_float_~sx~0#1, 31bv32))), 4bv32);fmod_float_#res#1 := fmod_float_#t~mem6#1;havoc fmod_float_#t~mem6#1; {865#false} is VALID [2022-02-20 16:46:52,271 INFO L290 TraceCheckUtils]: 15: Hoare triple {865#false} main_#t~ret15#1 := fmod_float_#res#1;assume { :end_inline_fmod_float } true;main_~res~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1; {865#false} is VALID [2022-02-20 16:46:52,271 INFO L290 TraceCheckUtils]: 16: Hoare triple {865#false} assume !~fp.eq~FLOAT(main_~res~0#1, main_~x~0#1); {865#false} is VALID [2022-02-20 16:46:52,271 INFO L290 TraceCheckUtils]: 17: Hoare triple {865#false} assume !false; {865#false} is VALID [2022-02-20 16:46:52,271 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:52,271 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:52,272 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:52,272 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1281579823] [2022-02-20 16:46:52,272 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1281579823] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:52,272 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:52,272 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 16:46:52,272 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121067255] [2022-02-20 16:46:52,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:52,272 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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:52,273 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:52,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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:52,319 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:52,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:46:52,320 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:52,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:46:52,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:46:52,321 INFO L87 Difference]: Start difference. First operand 43 states and 56 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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:52,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:52,607 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2022-02-20 16:46:52,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:46:52,607 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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:52,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:52,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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:52,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2022-02-20 16:46:52,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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:52,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2022-02-20 16:46:52,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 56 transitions. [2022-02-20 16:46:52,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:52,720 INFO L225 Difference]: With dead ends: 43 [2022-02-20 16:46:52,721 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:46:52,721 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:46:52,722 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:52,722 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 6 Unchecked, 0.0s Time] [2022-02-20 16:46:52,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:46:52,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:46:52,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:52,723 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:52,723 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:52,723 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:52,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:52,723 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:46:52,723 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:52,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:52,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:52,724 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:52,724 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:52,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:52,724 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:46:52,724 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:52,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:52,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:52,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:52,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:52,725 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:52,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:46:52,725 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2022-02-20 16:46:52,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:52,725 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:46:52,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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:52,725 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:52,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:52,727 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:46:52,736 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:52,928 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:52,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:46:53,487 INFO L858 garLoopResultBuilder]: For program point L27(lines 27 31) no Hoare annotation was computed. [2022-02-20 16:46:53,487 INFO L858 garLoopResultBuilder]: For program point L60-1(lines 60 65) no Hoare annotation was computed. [2022-02-20 16:46:53,487 INFO L858 garLoopResultBuilder]: For program point L27-1(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:46:53,487 INFO L858 garLoopResultBuilder]: For program point L27-2(lines 27 31) no Hoare annotation was computed. [2022-02-20 16:46:53,487 INFO L854 garLoopResultBuilder]: At program point L118(lines 110 119) the Hoare annotation is: (and (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6| (_ BitVec 32))) (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32)))) (and (= (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)) |ULTIMATE.start_main_~x~0#1|) (let ((.cse1 (bvslt (bvand (_ bv2147483647 32) .cse0) (_ bv2139095040 32)))) (or (and (not .cse1) (= |ULTIMATE.start_isfinite_float_#res#1| (_ bv0 32))) (and (= |ULTIMATE.start_isfinite_float_#res#1| (_ bv1 32)) .cse1)))))) (= |ULTIMATE.start_isfinite_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|))) [2022-02-20 16:46:53,487 INFO L858 garLoopResultBuilder]: For program point L69(lines 69 75) no Hoare annotation was computed. [2022-02-20 16:46:53,487 INFO L858 garLoopResultBuilder]: For program point L36(lines 36 37) no Hoare annotation was computed. [2022-02-20 16:46:53,488 INFO L854 garLoopResultBuilder]: At program point L69-2(lines 67 76) the Hoare annotation is: false [2022-02-20 16:46:53,488 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:46:53,488 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:46:53,488 INFO L858 garLoopResultBuilder]: For program point L78(lines 78 80) no Hoare annotation was computed. [2022-02-20 16:46:53,488 INFO L858 garLoopResultBuilder]: For program point L78-2(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:46:53,488 INFO L858 garLoopResultBuilder]: For program point L136(lines 136 139) no Hoare annotation was computed. [2022-02-20 16:46:53,488 INFO L858 garLoopResultBuilder]: For program point L54-1(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:46:53,488 INFO L858 garLoopResultBuilder]: For program point L112-1(lines 112 116) no Hoare annotation was computed. [2022-02-20 16:46:53,488 INFO L854 garLoopResultBuilder]: At program point L112-2(lines 112 116) the Hoare annotation is: (and (= |ULTIMATE.start_isfinite_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|))) [2022-02-20 16:46:53,488 INFO L858 garLoopResultBuilder]: For program point L112-3(lines 112 116) no Hoare annotation was computed. [2022-02-20 16:46:53,488 INFO L858 garLoopResultBuilder]: For program point L137(line 137) no Hoare annotation was computed. [2022-02-20 16:46:53,489 INFO L858 garLoopResultBuilder]: For program point L38(lines 38 39) no Hoare annotation was computed. [2022-02-20 16:46:53,489 INFO L858 garLoopResultBuilder]: For program point L88(lines 88 105) no Hoare annotation was computed. [2022-02-20 16:46:53,489 INFO L858 garLoopResultBuilder]: For program point L22-1(lines 22 26) no Hoare annotation was computed. [2022-02-20 16:46:53,489 INFO L854 garLoopResultBuilder]: At program point L22-2(lines 22 26) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_fmod_float_~y#1|)) (= |ULTIMATE.start_fmod_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6| (_ BitVec 32))) (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32)))) (and (bvslt (bvand (_ bv2147483647 32) .cse0) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)) |ULTIMATE.start_fmod_float_~x#1|))))) [2022-02-20 16:46:53,489 INFO L858 garLoopResultBuilder]: For program point L72(lines 72 73) no Hoare annotation was computed. [2022-02-20 16:46:53,489 INFO L858 garLoopResultBuilder]: For program point L48(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:46:53,489 INFO L854 garLoopResultBuilder]: At program point L106(lines 19 107) the Hoare annotation is: (and (= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_fmod_float_#res#1|) (exists ((|v_ULTIMATE.start_isfinite_float_~ix~1#1_7| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 30 23) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 22 0) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|)) |ULTIMATE.start_main_~x~0#1|)))) [2022-02-20 16:46:53,489 INFO L858 garLoopResultBuilder]: For program point L40(lines 40 41) no Hoare annotation was computed. [2022-02-20 16:46:53,489 INFO L858 garLoopResultBuilder]: For program point L131(lines 131 140) no Hoare annotation was computed. [2022-02-20 16:46:53,489 INFO L858 garLoopResultBuilder]: For program point L131-2(lines 131 140) no Hoare annotation was computed. [2022-02-20 16:46:53,489 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:46:53,489 INFO L858 garLoopResultBuilder]: For program point L90-1(lines 90 94) no Hoare annotation was computed. [2022-02-20 16:46:53,489 INFO L854 garLoopResultBuilder]: At program point L90-2(lines 90 94) the Hoare annotation is: false [2022-02-20 16:46:53,490 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 137) no Hoare annotation was computed. [2022-02-20 16:46:53,490 INFO L858 garLoopResultBuilder]: For program point L49-2(lines 49 50) no Hoare annotation was computed. [2022-02-20 16:46:53,490 INFO L854 garLoopResultBuilder]: At program point L49-3(lines 49 50) the Hoare annotation is: false [2022-02-20 16:46:53,490 INFO L858 garLoopResultBuilder]: For program point L99-1(lines 99 103) no Hoare annotation was computed. [2022-02-20 16:46:53,490 INFO L854 garLoopResultBuilder]: At program point L99-2(lines 99 103) the Hoare annotation is: false [2022-02-20 16:46:53,490 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:46:53,490 INFO L858 garLoopResultBuilder]: For program point L99-3(lines 99 103) no Hoare annotation was computed. [2022-02-20 16:46:53,490 INFO L858 garLoopResultBuilder]: For program point L42(lines 42 46) no Hoare annotation was computed. [2022-02-20 16:46:53,490 INFO L858 garLoopResultBuilder]: For program point L42-1(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:46:53,490 INFO L858 garLoopResultBuilder]: For program point L67-1(lines 67 76) no Hoare annotation was computed. [2022-02-20 16:46:53,490 INFO L858 garLoopResultBuilder]: For program point L67-3(lines 67 76) no Hoare annotation was computed. [2022-02-20 16:46:53,490 INFO L854 garLoopResultBuilder]: At program point L84-2(lines 84 87) the Hoare annotation is: false [2022-02-20 16:46:53,490 INFO L858 garLoopResultBuilder]: For program point L84-3(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:46:53,491 INFO L861 garLoopResultBuilder]: At program point L142(lines 121 143) the Hoare annotation is: true [2022-02-20 16:46:53,491 INFO L858 garLoopResultBuilder]: For program point L43-2(lines 43 44) no Hoare annotation was computed. [2022-02-20 16:46:53,491 INFO L854 garLoopResultBuilder]: At program point L43-3(lines 43 44) the Hoare annotation is: false [2022-02-20 16:46:53,493 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-20 16:46:53,494 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:46:53,496 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:46:53,496 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:46:53,496 WARN L170 areAnnotationChecker]: L112-1 has no Hoare annotation [2022-02-20 16:46:53,496 WARN L170 areAnnotationChecker]: L112-3 has no Hoare annotation [2022-02-20 16:46:53,496 WARN L170 areAnnotationChecker]: L112-1 has no Hoare annotation [2022-02-20 16:46:53,496 WARN L170 areAnnotationChecker]: L112-1 has no Hoare annotation [2022-02-20 16:46:53,496 WARN L170 areAnnotationChecker]: L112-3 has no Hoare annotation [2022-02-20 16:46:53,496 WARN L170 areAnnotationChecker]: L131 has no Hoare annotation [2022-02-20 16:46:53,497 WARN L170 areAnnotationChecker]: L131 has no Hoare annotation [2022-02-20 16:46:53,497 WARN L170 areAnnotationChecker]: L131 has no Hoare annotation [2022-02-20 16:46:53,497 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:46:53,497 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:46:53,497 WARN L170 areAnnotationChecker]: L131-2 has no Hoare annotation [2022-02-20 16:46:53,497 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:46:53,497 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:46:53,497 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:46:53,497 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:46:53,497 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:53,497 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:53,497 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:53,498 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2022-02-20 16:46:53,498 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:53,498 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:46:53,498 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:46:53,498 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2022-02-20 16:46:53,498 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:46:53,498 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:46:53,498 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2022-02-20 16:46:53,498 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2022-02-20 16:46:53,498 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:46:53,498 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:46:53,499 WARN L170 areAnnotationChecker]: L137 has no Hoare annotation [2022-02-20 16:46:53,499 WARN L170 areAnnotationChecker]: L137 has no Hoare annotation [2022-02-20 16:46:53,499 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:46:53,499 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:46:53,499 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:46:53,499 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:46:53,499 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:46:53,499 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:46:53,499 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:46:53,499 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:46:53,499 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:46:53,500 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:46:53,500 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2022-02-20 16:46:53,500 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:46:53,500 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:46:53,500 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2022-02-20 16:46:53,500 WARN L170 areAnnotationChecker]: L54-1 has no Hoare annotation [2022-02-20 16:46:53,500 WARN L170 areAnnotationChecker]: L54-1 has no Hoare annotation [2022-02-20 16:46:53,500 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2022-02-20 16:46:53,500 WARN L170 areAnnotationChecker]: L67-3 has no Hoare annotation [2022-02-20 16:46:53,500 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:46:53,500 WARN L170 areAnnotationChecker]: L67-3 has no Hoare annotation [2022-02-20 16:46:53,500 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:46:53,501 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:46:53,501 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:46:53,501 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:46:53,501 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:46:53,501 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:46:53,501 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:46:53,501 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:46:53,501 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:46:53,501 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:46:53,501 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:46:53,501 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:46:53,502 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:46:53,502 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:46:53,502 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:46:53,502 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-02-20 16:46:53,502 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:46:53,502 WARN L170 areAnnotationChecker]: L99-3 has no Hoare annotation [2022-02-20 16:46:53,502 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:46:53,502 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:46:53,502 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-02-20 16:46:53,502 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:46:53,502 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:46:53,502 WARN L170 areAnnotationChecker]: L99-3 has no Hoare annotation [2022-02-20 16:46:53,503 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,513 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,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,514 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:53,514 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:53,514 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:53,514 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,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,518 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:53,518 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:53,518 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:53,518 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:53,528 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:53,528 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:53,528 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:53,528 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:53,529 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:53,529 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,529 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,529 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:53,529 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:53,529 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:53,530 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:53,530 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:53,530 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,530 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,530 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,530 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,530 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,530 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,531 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~ix~1#1_7,QUANTIFIED] [2022-02-20 16:46:53,531 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~ix~1#1_7,QUANTIFIED] [2022-02-20 16:46:53,531 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~ix~1#1_7,QUANTIFIED] [2022-02-20 16:46:53,531 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~ix~1#1_7,QUANTIFIED] [2022-02-20 16:46:53,531 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~ix~1#1_7,QUANTIFIED] [2022-02-20 16:46:53,532 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~ix~1#1_7,QUANTIFIED] [2022-02-20 16:46:53,532 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~ix~1#1_7,QUANTIFIED] [2022-02-20 16:46:53,532 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~ix~1#1_7,QUANTIFIED] [2022-02-20 16:46:53,532 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,532 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:46:53,533 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:46:53,533 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:46:53,533 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:46:53,533 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,535 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:46:53,541 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2022-02-20 16:46:53,541 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-02-20 16:46:53,542 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:46:53,542 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:46:53,560 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: x == x && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == y) [2022-02-20 16:46:53,560 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\exists v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6 : bv32 :: ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6][0bv32][22:0]) == x && ((!~bvslt32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6][0bv32]), 2139095040bv32) && \result == 0bv32) || (\result == 1bv32 && ~bvslt32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6][0bv32]), 2139095040bv32)))) && x == x) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == y) [2022-02-20 16:46:53,560 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()) == y) && x == x) && (\exists v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6 : bv32 :: ~bvslt32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6][0bv32]), 2139095040bv32) && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6][0bv32][22:0]) == x) [2022-02-20 16:46:53,566 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:46:53,568 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:46:53,569 INFO L158 Benchmark]: Toolchain (without parser) took 18654.06ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 41.0MB in the beginning and 53.1MB in the end (delta: -12.1MB). Peak memory consumption was 29.8MB. Max. memory is 16.1GB. [2022-02-20 16:46:53,569 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 60.8MB. Free memory was 42.6MB in the beginning and 42.6MB in the end (delta: 44.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:53,569 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.19ms. Allocated memory is still 60.8MB. Free memory was 40.9MB in the beginning and 39.8MB in the end (delta: 1.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 16:46:53,569 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.38ms. Allocated memory is still 60.8MB. Free memory was 39.7MB in the beginning and 37.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:53,570 INFO L158 Benchmark]: Boogie Preprocessor took 44.92ms. Allocated memory is still 60.8MB. Free memory was 37.2MB in the beginning and 34.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:53,570 INFO L158 Benchmark]: RCFGBuilder took 2738.67ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 34.9MB in the beginning and 46.4MB in the end (delta: -11.5MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2022-02-20 16:46:53,570 INFO L158 Benchmark]: TraceAbstraction took 15458.40ms. Allocated memory is still 73.4MB. Free memory was 46.1MB in the beginning and 26.0MB in the end (delta: 20.1MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. [2022-02-20 16:46:53,570 INFO L158 Benchmark]: Witness Printer took 35.51ms. Allocated memory is still 73.4MB. Free memory was 26.0MB in the beginning and 53.1MB in the end (delta: -27.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:53,572 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.14ms. Allocated memory is still 60.8MB. Free memory was 42.6MB in the beginning and 42.6MB in the end (delta: 44.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 310.19ms. Allocated memory is still 60.8MB. Free memory was 40.9MB in the beginning and 39.8MB in the end (delta: 1.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.38ms. Allocated memory is still 60.8MB. Free memory was 39.7MB in the beginning and 37.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.92ms. Allocated memory is still 60.8MB. Free memory was 37.2MB in the beginning and 34.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 2738.67ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 34.9MB in the beginning and 46.4MB in the end (delta: -11.5MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * TraceAbstraction took 15458.40ms. Allocated memory is still 73.4MB. Free memory was 46.1MB in the beginning and 26.0MB in the end (delta: 20.1MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. * Witness Printer took 35.51ms. Allocated memory is still 73.4MB. Free memory was 26.0MB in the beginning and 53.1MB in the end (delta: -27.1MB). Peak memory consumption was 2.1MB. 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[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_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,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_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,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_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,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_ULTIMATE.start_isfinite_float_~ix~1#1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~ix~1#1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~ix~1#1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~ix~1#1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~ix~1#1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~ix~1#1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~ix~1#1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~ix~1#1_7,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: 137]: 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, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.4s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 37 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37 mSDsluCounter, 778 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 152 IncrementalHoareTripleChecker+Unchecked, 607 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4 IncrementalHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 171 mSDtfsCounter, 4 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred 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.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 11 PreInvPairs, 16 NumberOfFragments, 152 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 47 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 64 NumberOfCodeBlocks, 64 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 60 ConstructedInterpolants, 34 QuantifiedInterpolants, 992 SizeOfPredicates, 33 NumberOfNonLiveVariables, 299 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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: 67]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 90]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 22]: Loop Invariant [2022-02-20 16:46:53,588 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,589 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,589 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:53,589 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:53,589 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:53,589 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:53,590 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,590 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,590 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:53,590 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:53,590 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:53,590 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] Derived loop invariant: ((\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == y) && x == x) && (\exists v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6 : bv32 :: ~bvslt32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6][0bv32]), 2139095040bv32) && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6][0bv32][22:0]) == x) - InvariantResult [Line: 121]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 110]: Loop Invariant [2022-02-20 16:46:53,595 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:53,595 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:53,595 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:53,595 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:53,595 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:53,595 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,596 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,596 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:53,596 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:53,596 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:53,596 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:53,596 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:53,596 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,596 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: ((\exists v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6 : bv32 :: ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6][0bv32][22:0]) == x && ((!~bvslt32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6][0bv32]), 2139095040bv32) && \result == 0bv32) || (\result == 1bv32 && ~bvslt32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6][0bv32]), 2139095040bv32)))) && x == x) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == y) - InvariantResult [Line: 112]: Loop Invariant [2022-02-20 16:46:53,597 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,597 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,597 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:53,597 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: x == x && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == y) - InvariantResult [Line: 19]: Loop Invariant [2022-02-20 16:46:53,597 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~ix~1#1_7,QUANTIFIED] [2022-02-20 16:46:53,597 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~ix~1#1_7,QUANTIFIED] [2022-02-20 16:46:53,597 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~ix~1#1_7,QUANTIFIED] [2022-02-20 16:46:53,597 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~ix~1#1_7,QUANTIFIED] [2022-02-20 16:46:53,597 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~ix~1#1_7,QUANTIFIED] [2022-02-20 16:46:53,597 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~ix~1#1_7,QUANTIFIED] [2022-02-20 16:46:53,597 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~ix~1#1_7,QUANTIFIED] [2022-02-20 16:46:53,597 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~ix~1#1_7,QUANTIFIED] Derived loop invariant: x == \result && (\exists v_ULTIMATE.start_isfinite_float_~ix~1#1_7 : bv32 :: ~bvslt32(~bvand32(2147483647bv32, v_ULTIMATE.start_isfinite_float_~ix~1#1_7), 2139095040bv32) && ~fp~LONGDOUBLE(v_ULTIMATE.start_isfinite_float_~ix~1#1_7[31:31], v_ULTIMATE.start_isfinite_float_~ix~1#1_7[30:23], v_ULTIMATE.start_isfinite_float_~ix~1#1_7[22:0]) == x) RESULT: Ultimate proved your program to be correct! [2022-02-20 16:46:53,662 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