./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1072a.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_1072a.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 bf11eea526b888c65da8e6a790bf111238c1a4f38cbbc626b5ee67504f89d28c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:46:07,670 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:46:07,671 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:46:07,689 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:46:07,694 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:46:07,696 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:46:07,698 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:46:07,703 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:46:07,705 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:46:07,712 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:46:07,712 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:46:07,713 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:46:07,714 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:46:07,715 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:46:07,716 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:46:07,718 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:46:07,719 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:46:07,720 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:46:07,721 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:46:07,724 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:46:07,727 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:46:07,728 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:46:07,729 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:46:07,730 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:46:07,731 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:46:07,732 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:46:07,733 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:46:07,734 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:46:07,734 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:46:07,735 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:46:07,735 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:46:07,736 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:46:07,737 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:46:07,738 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:46:07,738 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:46:07,739 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:46:07,739 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:46:07,739 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:46:07,739 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:46:07,740 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:46:07,740 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:46:07,742 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:07,765 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:46:07,765 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:46:07,765 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:46:07,765 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:46:07,766 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:46:07,766 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:46:07,766 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:46:07,766 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:46:07,767 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:46:07,767 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:46:07,767 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:46:07,767 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:46:07,767 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:46:07,767 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:46:07,767 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:46:07,768 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:46:07,768 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:46:07,768 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:46:07,768 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:46:07,768 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:46:07,768 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:46:07,768 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:46:07,769 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:46:07,769 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:46:07,769 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:07,769 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:46:07,769 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:46:07,770 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:46:07,771 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:46:07,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:46:07,771 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:46:07,771 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:46:07,771 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:46:07,771 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 -> bf11eea526b888c65da8e6a790bf111238c1a4f38cbbc626b5ee67504f89d28c [2022-02-20 16:46:07,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:46:07,995 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:46:07,997 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:46:07,998 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:46:07,998 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:46:07,999 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1072a.c [2022-02-20 16:46:08,049 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67e83d8ee/c6c88fbc972f4e25a8bcd01989b46e4a/FLAGf1b6f7cb1 [2022-02-20 16:46:08,402 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:46:08,403 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1072a.c [2022-02-20 16:46:08,407 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67e83d8ee/c6c88fbc972f4e25a8bcd01989b46e4a/FLAGf1b6f7cb1 [2022-02-20 16:46:08,418 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67e83d8ee/c6c88fbc972f4e25a8bcd01989b46e4a [2022-02-20 16:46:08,420 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:46:08,421 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:46:08,422 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:08,422 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:46:08,425 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:46:08,425 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:08" (1/1) ... [2022-02-20 16:46:08,426 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5281ed25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:08, skipping insertion in model container [2022-02-20 16:46:08,426 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:08" (1/1) ... [2022-02-20 16:46:08,434 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:46:08,447 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:46:08,594 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_1072a.c[1607,1620] [2022-02-20 16:46:08,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:08,606 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:46:08,632 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_1072a.c[1607,1620] [2022-02-20 16:46:08,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:08,646 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:46:08,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:08 WrapperNode [2022-02-20 16:46:08,647 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:08,648 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:08,648 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:46:08,649 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:46:08,653 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:08" (1/1) ... [2022-02-20 16:46:08,661 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:08" (1/1) ... [2022-02-20 16:46:08,693 INFO L137 Inliner]: procedures = 16, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2022-02-20 16:46:08,693 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:08,694 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:46:08,694 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:46:08,694 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:46:08,708 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:08" (1/1) ... [2022-02-20 16:46:08,708 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:08" (1/1) ... [2022-02-20 16:46:08,716 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:08" (1/1) ... [2022-02-20 16:46:08,716 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:08" (1/1) ... [2022-02-20 16:46:08,727 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:08" (1/1) ... [2022-02-20 16:46:08,730 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:08" (1/1) ... [2022-02-20 16:46:08,732 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:08" (1/1) ... [2022-02-20 16:46:08,734 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:46:08,735 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:46:08,735 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:46:08,735 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:46:08,744 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:08" (1/1) ... [2022-02-20 16:46:08,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:08,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:46:08,778 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:08,783 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:08,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:46:08,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:46:08,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:46:08,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:46:08,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:46:08,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:46:08,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:46:08,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:46:08,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:46:08,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:46:08,859 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:46:08,860 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:46:09,102 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:46:09,107 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:46:09,107 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-02-20 16:46:09,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:09 BoogieIcfgContainer [2022-02-20 16:46:09,109 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:46:09,110 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:46:09,110 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:46:09,112 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:46:09,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:46:08" (1/3) ... [2022-02-20 16:46:09,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49e2fc70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:09, skipping insertion in model container [2022-02-20 16:46:09,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:08" (2/3) ... [2022-02-20 16:46:09,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49e2fc70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:09, skipping insertion in model container [2022-02-20 16:46:09,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:09" (3/3) ... [2022-02-20 16:46:09,115 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1072a.c [2022-02-20 16:46:09,118 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:46:09,118 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:46:09,152 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:46:09,157 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:09,157 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:46:09,168 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 27 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:09,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:46:09,172 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:09,172 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:09,173 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:09,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:09,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1668952722, now seen corresponding path program 1 times [2022-02-20 16:46:09,183 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:09,184 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297577848] [2022-02-20 16:46:09,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:09,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:09,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:09,315 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#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); {31#true} is VALID [2022-02-20 16:46:09,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1, main_#t~ret10#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(1.0, 0.0);assume { :begin_inline_trunc_float } true;trunc_float_#in~x#1 := main_~x~0#1;havoc trunc_float_#res#1;havoc trunc_float_#t~mem4#1, trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset, trunc_float_#t~mem6#1, trunc_float_~#sf_u~0#1.base, trunc_float_~#sf_u~0#1.offset, trunc_float_#t~mem7#1, trunc_float_~#sf_u~1#1.base, trunc_float_~#sf_u~1#1.offset, trunc_float_~x#1, trunc_float_~signbit~0#1, trunc_float_~w~0#1, trunc_float_~exponent_less_127~0#1, trunc_float_#t~nondet5#1;trunc_float_~x#1 := trunc_float_#in~x#1;havoc trunc_float_~signbit~0#1;havoc trunc_float_~w~0#1;havoc trunc_float_~exponent_less_127~0#1; {31#true} is VALID [2022-02-20 16:46:09,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume !true; {32#false} is VALID [2022-02-20 16:46:09,317 INFO L290 TraceCheckUtils]: 3: Hoare triple {32#false} assume 0 == trunc_float_~w~0#1;trunc_float_~signbit~0#1 := 0; {32#false} is VALID [2022-02-20 16:46:09,317 INFO L290 TraceCheckUtils]: 4: Hoare triple {32#false} trunc_float_~exponent_less_127~0#1 := (if 0 == trunc_float_~w~0#1 then 0 else (if 1 == trunc_float_~w~0#1 then 0 else ~bitwiseAnd(trunc_float_~w~0#1, 2139095040))) / 8388608 - 127; {32#false} is VALID [2022-02-20 16:46:09,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#false} assume !(trunc_float_~exponent_less_127~0#1 < 23); {32#false} is VALID [2022-02-20 16:46:09,318 INFO L290 TraceCheckUtils]: 6: Hoare triple {32#false} assume 255 == trunc_float_~exponent_less_127~0#1;trunc_float_#res#1 := ~someBinaryArithmeticFLOAToperation(trunc_float_~x#1, trunc_float_~x#1); {32#false} is VALID [2022-02-20 16:46:09,319 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#false} main_#t~ret9#1 := trunc_float_#res#1;assume { :end_inline_trunc_float } true;main_~res~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_isinf_float } true;isinf_float_#in~x#1 := main_~res~0#1;havoc isinf_float_#res#1;havoc isinf_float_#t~mem8#1, isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, isinf_float_~x#1, isinf_float_~ix~0#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~0#1; {32#false} is VALID [2022-02-20 16:46:09,319 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#false} assume !true; {32#false} is VALID [2022-02-20 16:46:09,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#false} isinf_float_~ix~0#1 := (if 0 == isinf_float_~ix~0#1 then 0 else (if 1 == isinf_float_~ix~0#1 then 1 else ~bitwiseAnd(isinf_float_~ix~0#1, 2147483647)));isinf_float_#res#1 := (if 2139095040 == isinf_float_~ix~0#1 then 1 else 0); {32#false} is VALID [2022-02-20 16:46:09,320 INFO L290 TraceCheckUtils]: 10: Hoare triple {32#false} main_#t~ret10#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true;assume -2147483648 <= main_#t~ret10#1 && main_#t~ret10#1 <= 2147483647; {32#false} is VALID [2022-02-20 16:46:09,320 INFO L290 TraceCheckUtils]: 11: Hoare triple {32#false} assume 0 == main_#t~ret10#1;havoc main_#t~ret10#1; {32#false} is VALID [2022-02-20 16:46:09,321 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-02-20 16:46:09,322 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:09,322 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:46:09,323 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297577848] [2022-02-20 16:46:09,323 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297577848] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:09,323 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:09,324 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:46:09,326 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111868003] [2022-02-20 16:46:09,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:09,331 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:09,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:09,334 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:09,356 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:09,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:46:09,357 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:46:09,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:46:09,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:09,382 INFO L87 Difference]: Start difference. First operand has 28 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 27 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 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:09,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:09,438 INFO L93 Difference]: Finished difference Result 54 states and 84 transitions. [2022-02-20 16:46:09,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:46:09,438 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:09,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:09,440 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:09,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 84 transitions. [2022-02-20 16:46:09,449 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:09,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 84 transitions. [2022-02-20 16:46:09,451 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 84 transitions. [2022-02-20 16:46:09,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:09,552 INFO L225 Difference]: With dead ends: 54 [2022-02-20 16:46:09,552 INFO L226 Difference]: Without dead ends: 25 [2022-02-20 16:46:09,554 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:09,557 INFO L933 BasicCegarLoop]: 32 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, 32 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:09,559 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 32 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:09,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-20 16:46:09,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-02-20 16:46:09,585 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:09,586 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:09,587 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:09,588 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:09,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:09,592 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-02-20 16:46:09,592 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-02-20 16:46:09,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:09,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:09,593 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 25 states. [2022-02-20 16:46:09,593 INFO L87 Difference]: Start difference. First operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 25 states. [2022-02-20 16:46:09,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:09,594 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-02-20 16:46:09,594 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-02-20 16:46:09,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:09,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:09,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:09,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:09,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:09,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-02-20 16:46:09,597 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 13 [2022-02-20 16:46:09,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:09,598 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-02-20 16:46:09,598 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:09,598 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-02-20 16:46:09,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:46:09,598 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:09,599 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:09,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:46:09,599 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:09,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:09,600 INFO L85 PathProgramCache]: Analyzing trace with hash -698107015, now seen corresponding path program 1 times [2022-02-20 16:46:09,600 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:09,600 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260039547] [2022-02-20 16:46:09,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:09,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:09,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:09,662 INFO L290 TraceCheckUtils]: 0: Hoare triple {184#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); {184#true} is VALID [2022-02-20 16:46:09,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {184#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1, main_#t~ret10#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(1.0, 0.0);assume { :begin_inline_trunc_float } true;trunc_float_#in~x#1 := main_~x~0#1;havoc trunc_float_#res#1;havoc trunc_float_#t~mem4#1, trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset, trunc_float_#t~mem6#1, trunc_float_~#sf_u~0#1.base, trunc_float_~#sf_u~0#1.offset, trunc_float_#t~mem7#1, trunc_float_~#sf_u~1#1.base, trunc_float_~#sf_u~1#1.offset, trunc_float_~x#1, trunc_float_~signbit~0#1, trunc_float_~w~0#1, trunc_float_~exponent_less_127~0#1, trunc_float_#t~nondet5#1;trunc_float_~x#1 := trunc_float_#in~x#1;havoc trunc_float_~signbit~0#1;havoc trunc_float_~w~0#1;havoc trunc_float_~exponent_less_127~0#1; {184#true} is VALID [2022-02-20 16:46:09,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {184#true} call trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4);call write~real(trunc_float_~x#1, trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset, 4);call trunc_float_#t~mem4#1 := read~int(trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset, 4);trunc_float_~w~0#1 := (if trunc_float_#t~mem4#1 % 4294967296 % 4294967296 <= 2147483647 then trunc_float_#t~mem4#1 % 4294967296 % 4294967296 else trunc_float_#t~mem4#1 % 4294967296 % 4294967296 - 4294967296);havoc trunc_float_#t~mem4#1;call ULTIMATE.dealloc(trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset);havoc trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset; {184#true} is VALID [2022-02-20 16:46:09,663 INFO L290 TraceCheckUtils]: 3: Hoare triple {184#true} goto; {184#true} is VALID [2022-02-20 16:46:09,663 INFO L290 TraceCheckUtils]: 4: Hoare triple {184#true} assume 0 == trunc_float_~w~0#1;trunc_float_~signbit~0#1 := 0; {186#(= |ULTIMATE.start_trunc_float_~w~0#1| 0)} is VALID [2022-02-20 16:46:09,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {186#(= |ULTIMATE.start_trunc_float_~w~0#1| 0)} trunc_float_~exponent_less_127~0#1 := (if 0 == trunc_float_~w~0#1 then 0 else (if 1 == trunc_float_~w~0#1 then 0 else ~bitwiseAnd(trunc_float_~w~0#1, 2139095040))) / 8388608 - 127; {187#(<= (+ 127 |ULTIMATE.start_trunc_float_~exponent_less_127~0#1|) 0)} is VALID [2022-02-20 16:46:09,664 INFO L290 TraceCheckUtils]: 6: Hoare triple {187#(<= (+ 127 |ULTIMATE.start_trunc_float_~exponent_less_127~0#1|) 0)} assume !(trunc_float_~exponent_less_127~0#1 < 23); {187#(<= (+ 127 |ULTIMATE.start_trunc_float_~exponent_less_127~0#1|) 0)} is VALID [2022-02-20 16:46:09,665 INFO L290 TraceCheckUtils]: 7: Hoare triple {187#(<= (+ 127 |ULTIMATE.start_trunc_float_~exponent_less_127~0#1|) 0)} assume 255 == trunc_float_~exponent_less_127~0#1;trunc_float_#res#1 := ~someBinaryArithmeticFLOAToperation(trunc_float_~x#1, trunc_float_~x#1); {185#false} is VALID [2022-02-20 16:46:09,665 INFO L290 TraceCheckUtils]: 8: Hoare triple {185#false} main_#t~ret9#1 := trunc_float_#res#1;assume { :end_inline_trunc_float } true;main_~res~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_isinf_float } true;isinf_float_#in~x#1 := main_~res~0#1;havoc isinf_float_#res#1;havoc isinf_float_#t~mem8#1, isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, isinf_float_~x#1, isinf_float_~ix~0#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~0#1; {185#false} is VALID [2022-02-20 16:46:09,666 INFO L290 TraceCheckUtils]: 9: Hoare triple {185#false} call isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4);call write~real(isinf_float_~x#1, isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, 4);call isinf_float_#t~mem8#1 := read~int(isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, 4);isinf_float_~ix~0#1 := (if isinf_float_#t~mem8#1 % 4294967296 % 4294967296 <= 2147483647 then isinf_float_#t~mem8#1 % 4294967296 % 4294967296 else isinf_float_#t~mem8#1 % 4294967296 % 4294967296 - 4294967296);havoc isinf_float_#t~mem8#1;call ULTIMATE.dealloc(isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset);havoc isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset; {185#false} is VALID [2022-02-20 16:46:09,666 INFO L290 TraceCheckUtils]: 10: Hoare triple {185#false} goto; {185#false} is VALID [2022-02-20 16:46:09,667 INFO L290 TraceCheckUtils]: 11: Hoare triple {185#false} isinf_float_~ix~0#1 := (if 0 == isinf_float_~ix~0#1 then 0 else (if 1 == isinf_float_~ix~0#1 then 1 else ~bitwiseAnd(isinf_float_~ix~0#1, 2147483647)));isinf_float_#res#1 := (if 2139095040 == isinf_float_~ix~0#1 then 1 else 0); {185#false} is VALID [2022-02-20 16:46:09,667 INFO L290 TraceCheckUtils]: 12: Hoare triple {185#false} main_#t~ret10#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true;assume -2147483648 <= main_#t~ret10#1 && main_#t~ret10#1 <= 2147483647; {185#false} is VALID [2022-02-20 16:46:09,667 INFO L290 TraceCheckUtils]: 13: Hoare triple {185#false} assume 0 == main_#t~ret10#1;havoc main_#t~ret10#1; {185#false} is VALID [2022-02-20 16:46:09,668 INFO L290 TraceCheckUtils]: 14: Hoare triple {185#false} assume !false; {185#false} is VALID [2022-02-20 16:46:09,668 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:09,668 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:46:09,669 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260039547] [2022-02-20 16:46:09,669 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260039547] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:09,669 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:09,669 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:46:09,669 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241676017] [2022-02-20 16:46:09,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:09,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 16:46:09,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:09,671 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:09,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:09,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:46:09,683 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:46:09,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:46:09,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:46:09,684 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:09,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:09,793 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2022-02-20 16:46:09,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:46:09,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 16:46:09,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:09,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:09,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-02-20 16:46:09,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:09,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-02-20 16:46:09,796 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2022-02-20 16:46:09,834 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:09,836 INFO L225 Difference]: With dead ends: 51 [2022-02-20 16:46:09,836 INFO L226 Difference]: Without dead ends: 39 [2022-02-20 16:46:09,836 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:09,837 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 25 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:09,837 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 67 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:46:09,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-20 16:46:09,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2022-02-20 16:46:09,840 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:09,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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:09,840 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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:09,841 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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:09,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:09,842 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-02-20 16:46:09,842 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-02-20 16:46:09,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:09,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:09,843 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 39 states. [2022-02-20 16:46:09,843 INFO L87 Difference]: Start difference. First operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 39 states. [2022-02-20 16:46:09,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:09,845 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-02-20 16:46:09,845 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-02-20 16:46:09,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:09,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:09,845 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:09,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:09,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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:09,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-02-20 16:46:09,847 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 15 [2022-02-20 16:46:09,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:09,847 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-02-20 16:46:09,847 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:09,847 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-02-20 16:46:09,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 16:46:09,848 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:09,848 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:09,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:46:09,849 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:09,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:09,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1571195850, now seen corresponding path program 1 times [2022-02-20 16:46:09,849 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:09,849 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200849959] [2022-02-20 16:46:09,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:09,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:46:09,920 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:46:09,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:46:09,959 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:46:09,959 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:46:09,960 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:46:09,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:46:09,964 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 16:46:09,967 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:46:09,992 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:46:09,992 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:46:09,992 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-02-20 16:46:09,992 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-02-20 16:46:09,992 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2022-02-20 16:46:09,992 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2022-02-20 16:46:09,992 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2022-02-20 16:46:09,993 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2022-02-20 16:46:09,993 WARN L170 areAnnotationChecker]: L21-7 has no Hoare annotation [2022-02-20 16:46:09,993 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-02-20 16:46:09,993 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-02-20 16:46:09,993 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-02-20 16:46:09,993 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-02-20 16:46:09,993 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2022-02-20 16:46:09,993 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2022-02-20 16:46:09,993 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-02-20 16:46:09,994 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-02-20 16:46:09,994 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 16:46:09,994 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 16:46:09,994 WARN L170 areAnnotationChecker]: L21-5 has no Hoare annotation [2022-02-20 16:46:09,994 WARN L170 areAnnotationChecker]: L21-5 has no Hoare annotation [2022-02-20 16:46:09,994 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2022-02-20 16:46:09,994 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2022-02-20 16:46:09,994 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2022-02-20 16:46:09,994 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2022-02-20 16:46:09,995 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:46:09,995 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2022-02-20 16:46:09,995 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-02-20 16:46:09,995 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-02-20 16:46:09,995 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2022-02-20 16:46:09,995 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2022-02-20 16:46:09,995 WARN L170 areAnnotationChecker]: L48-2 has no Hoare annotation [2022-02-20 16:46:09,995 WARN L170 areAnnotationChecker]: L48-2 has no Hoare annotation [2022-02-20 16:46:09,995 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-02-20 16:46:09,995 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-02-20 16:46:09,996 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2022-02-20 16:46:09,996 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:46:09,996 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-02-20 16:46:09,996 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-02-20 16:46:09,996 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:46:09,996 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:46:09,996 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-02-20 16:46:09,996 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:09,997 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:09,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:46:09 BoogieIcfgContainer [2022-02-20 16:46:09,997 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:46:09,998 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:46:09,998 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:46:09,998 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:46:09,998 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:09" (3/4) ... [2022-02-20 16:46:10,000 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:46:10,001 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:46:10,002 INFO L158 Benchmark]: Toolchain (without parser) took 1580.24ms. Allocated memory is still 130.0MB. Free memory was 92.3MB in the beginning and 63.7MB in the end (delta: 28.6MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. [2022-02-20 16:46:10,002 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 130.0MB. Free memory is still 109.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:10,002 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.86ms. Allocated memory is still 130.0MB. Free memory was 92.1MB in the beginning and 103.1MB in the end (delta: -11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:46:10,003 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.15ms. Allocated memory is still 130.0MB. Free memory was 103.1MB in the beginning and 99.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:46:10,003 INFO L158 Benchmark]: Boogie Preprocessor took 40.54ms. Allocated memory is still 130.0MB. Free memory was 99.7MB in the beginning and 97.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:10,003 INFO L158 Benchmark]: RCFGBuilder took 373.70ms. Allocated memory is still 130.0MB. Free memory was 97.2MB in the beginning and 76.2MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-02-20 16:46:10,004 INFO L158 Benchmark]: TraceAbstraction took 887.49ms. Allocated memory is still 130.0MB. Free memory was 75.8MB in the beginning and 63.7MB in the end (delta: 12.1MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2022-02-20 16:46:10,004 INFO L158 Benchmark]: Witness Printer took 3.01ms. Allocated memory is still 130.0MB. Free memory is still 63.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:10,005 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 130.0MB. Free memory is still 109.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 224.86ms. Allocated memory is still 130.0MB. Free memory was 92.1MB in the beginning and 103.1MB in the end (delta: -11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.15ms. Allocated memory is still 130.0MB. Free memory was 103.1MB in the beginning and 99.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.54ms. Allocated memory is still 130.0MB. Free memory was 99.7MB in the beginning and 97.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 373.70ms. Allocated memory is still 130.0MB. Free memory was 97.2MB in the beginning and 76.2MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 887.49ms. Allocated memory is still 130.0MB. Free memory was 75.8MB in the beginning and 63.7MB in the end (delta: 12.1MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. * Witness Printer took 3.01ms. Allocated memory is still 130.0MB. Free memory is still 63.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 69]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticFLOAToperation at line 64, overapproximation of bitwiseAnd at line 53. Possible FailurePath: [L64] float x = 1.0f / 0.0f; [L65] CALL, EXPR trunc_float(x) [L15] __int32_t signbit, w, exponent_less_127; VAL [\old(x)=4294967305, x=4294967305] [L17] ieee_float_shape_type gf_u; [L18] gf_u.value = (x) [L19] EXPR gf_u.word [L19] (w) = gf_u.word [L21] signbit = w & 0x80000000 VAL [\old(x)=4294967305, signbit=0, w=0, x=4294967305] [L22] exponent_less_127 = ((w & 0x7f800000) >> 23) - 127 VAL [\old(x)=4294967305, exponent_less_127=-127, signbit=0, w=0, x=4294967305] [L23] COND TRUE exponent_less_127 < 23 VAL [\old(x)=4294967305, exponent_less_127=-127, signbit=0, w=0, x=4294967305] [L24] COND TRUE exponent_less_127 < 0 VAL [\old(x)=4294967305, exponent_less_127=-127, signbit=0, w=0, x=4294967305] [L27] ieee_float_shape_type sf_u; [L28] sf_u.word = (signbit) [L29] EXPR sf_u.value [L29] (x) = sf_u.value [L42] return x; VAL [\old(x)=4294967305, \result=4294967306, exponent_less_127=-127, signbit=0, w=0, x=4294967306] [L65] RET, EXPR trunc_float(x) [L65] float res = trunc_float(x); [L68] CALL, EXPR isinf_float(res) [L47] __int32_t ix; VAL [\old(x)=4294967306, x=4294967306] [L49] ieee_float_shape_type gf_u; [L50] gf_u.value = (x) [L51] EXPR gf_u.word [L51] (ix) = gf_u.word [L53] ix &= 0x7fffffff [L54] return ((ix) == 0x7f800000L); VAL [\old(x)=4294967306, \result=0, ix=0, x=4294967306] [L68] RET, EXPR isinf_float(res) [L68] COND TRUE !isinf_float(res) [L69] reach_error() VAL [res=4294967306, x=4294967305] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 25 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 99 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19 IncrementalHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 58 mSDtfsCounter, 19 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 11 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 46 NumberOfCodeBlocks, 46 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 26 ConstructedInterpolants, 0 QuantifiedInterpolants, 36 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-02-20 16:46:10,032 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_1072a.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 bf11eea526b888c65da8e6a790bf111238c1a4f38cbbc626b5ee67504f89d28c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:46:11,667 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:46:11,669 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:46:11,694 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:46:11,694 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:46:11,697 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:46:11,698 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:46:11,700 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:46:11,702 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:46:11,707 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:46:11,708 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:46:11,709 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:46:11,709 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:46:11,711 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:46:11,712 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:46:11,718 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:46:11,719 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:46:11,719 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:46:11,721 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:46:11,725 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:46:11,726 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:46:11,727 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:46:11,728 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:46:11,729 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:46:11,734 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:46:11,734 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:46:11,734 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:46:11,736 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:46:11,736 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:46:11,737 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:46:11,738 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:46:11,738 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:46:11,739 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:46:11,740 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:46:11,741 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:46:11,741 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:46:11,742 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:46:11,742 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:46:11,742 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:46:11,743 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:46:11,744 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:46:11,744 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:11,773 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:46:11,774 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:46:11,774 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:46:11,775 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:46:11,775 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:46:11,775 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:46:11,776 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:46:11,777 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:46:11,777 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:46:11,777 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:46:11,777 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:46:11,778 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:46:11,778 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:46:11,778 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:46:11,778 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:46:11,778 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:46:11,778 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:46:11,778 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:46:11,779 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:46:11,779 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:46:11,779 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:46:11,779 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:46:11,779 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:46:11,786 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:46:11,786 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:46:11,787 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:46:11,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:11,787 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:46:11,787 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:46:11,787 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:46:11,788 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:46:11,788 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:46:11,788 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:46:11,788 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:46:11,788 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:46:11,788 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:46:11,789 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 -> bf11eea526b888c65da8e6a790bf111238c1a4f38cbbc626b5ee67504f89d28c [2022-02-20 16:46:12,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:46:12,044 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:46:12,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:46:12,047 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:46:12,047 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:46:12,049 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1072a.c [2022-02-20 16:46:12,096 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/968914dda/c43086e68f0d4327b289530532624524/FLAG2427e177b [2022-02-20 16:46:12,458 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:46:12,459 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1072a.c [2022-02-20 16:46:12,464 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/968914dda/c43086e68f0d4327b289530532624524/FLAG2427e177b [2022-02-20 16:46:12,894 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/968914dda/c43086e68f0d4327b289530532624524 [2022-02-20 16:46:12,896 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:46:12,897 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:46:12,898 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:12,898 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:46:12,910 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:46:12,912 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:12" (1/1) ... [2022-02-20 16:46:12,913 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4993dd86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:12, skipping insertion in model container [2022-02-20 16:46:12,913 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:12" (1/1) ... [2022-02-20 16:46:12,918 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:46:12,929 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:46:13,042 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_1072a.c[1607,1620] [2022-02-20 16:46:13,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:13,053 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:46:13,100 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_1072a.c[1607,1620] [2022-02-20 16:46:13,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:13,111 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:46:13,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:13 WrapperNode [2022-02-20 16:46:13,112 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:13,113 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:13,113 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:46:13,113 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:46:13,117 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:13" (1/1) ... [2022-02-20 16:46:13,127 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:13" (1/1) ... [2022-02-20 16:46:13,153 INFO L137 Inliner]: procedures = 19, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 86 [2022-02-20 16:46:13,153 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:13,154 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:46:13,154 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:46:13,154 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:46:13,159 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:13" (1/1) ... [2022-02-20 16:46:13,159 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:13" (1/1) ... [2022-02-20 16:46:13,162 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:13" (1/1) ... [2022-02-20 16:46:13,162 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:13" (1/1) ... [2022-02-20 16:46:13,173 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:13" (1/1) ... [2022-02-20 16:46:13,182 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:13" (1/1) ... [2022-02-20 16:46:13,186 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:13" (1/1) ... [2022-02-20 16:46:13,193 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:46:13,193 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:46:13,194 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:46:13,194 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:46:13,194 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:13" (1/1) ... [2022-02-20 16:46:13,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:13,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:46:13,218 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:13,234 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:13,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:46:13,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:46:13,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:46:13,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:46:13,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:46:13,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:46:13,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:46:13,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:46:13,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:46:13,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:46:13,314 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:46:13,315 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:46:13,526 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:46:13,533 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:46:13,533 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-02-20 16:46:13,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:13 BoogieIcfgContainer [2022-02-20 16:46:13,535 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:46:13,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:46:13,555 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:46:13,558 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:46:13,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:46:12" (1/3) ... [2022-02-20 16:46:13,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47f4af4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:13, skipping insertion in model container [2022-02-20 16:46:13,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:13" (2/3) ... [2022-02-20 16:46:13,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47f4af4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:13, skipping insertion in model container [2022-02-20 16:46:13,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:13" (3/3) ... [2022-02-20 16:46:13,561 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1072a.c [2022-02-20 16:46:13,565 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:46:13,565 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:46:13,614 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:46:13,632 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:13,632 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:46:13,645 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 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:13,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 16:46:13,649 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:13,649 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:13,650 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:13,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:13,657 INFO L85 PathProgramCache]: Analyzing trace with hash 936253238, now seen corresponding path program 1 times [2022-02-20 16:46:13,666 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:13,667 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [178384920] [2022-02-20 16:46:13,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:13,668 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:13,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:13,673 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:13,674 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:13,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:13,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:46:13,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:13,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:13,851 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#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); {27#true} is VALID [2022-02-20 16:46:13,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_#t~ret9#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~to_fp~FLOAT(currentRoundingMode, 1.0), ~Pluszero~FLOAT());assume { :begin_inline_trunc_float } true;trunc_float_#in~x#1 := main_~x~0#1;havoc trunc_float_#res#1;havoc trunc_float_#t~mem4#1, trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset, trunc_float_#t~mem5#1, trunc_float_~#sf_u~0#1.base, trunc_float_~#sf_u~0#1.offset, trunc_float_#t~mem6#1, trunc_float_~#sf_u~1#1.base, trunc_float_~#sf_u~1#1.offset, trunc_float_~x#1, trunc_float_~signbit~0#1, trunc_float_~w~0#1, trunc_float_~exponent_less_127~0#1;trunc_float_~x#1 := trunc_float_#in~x#1;havoc trunc_float_~signbit~0#1;havoc trunc_float_~w~0#1;havoc trunc_float_~exponent_less_127~0#1; {27#true} is VALID [2022-02-20 16:46:13,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume !true; {28#false} is VALID [2022-02-20 16:46:13,853 INFO L290 TraceCheckUtils]: 3: Hoare triple {28#false} trunc_float_~signbit~0#1 := ~bvand32(2147483648bv32, trunc_float_~w~0#1);trunc_float_~exponent_less_127~0#1 := ~bvsub32(~bvashr32(~bvand32(2139095040bv32, trunc_float_~w~0#1), 23bv32), 127bv32); {28#false} is VALID [2022-02-20 16:46:13,854 INFO L290 TraceCheckUtils]: 4: Hoare triple {28#false} assume !~bvslt32(trunc_float_~exponent_less_127~0#1, 23bv32); {28#false} is VALID [2022-02-20 16:46:13,854 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#false} assume 255bv32 == trunc_float_~exponent_less_127~0#1;trunc_float_#res#1 := ~fp.add~FLOAT(currentRoundingMode, trunc_float_~x#1, trunc_float_~x#1); {28#false} is VALID [2022-02-20 16:46:13,855 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#false} main_#t~ret8#1 := trunc_float_#res#1;assume { :end_inline_trunc_float } true;main_~res~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_isinf_float } true;isinf_float_#in~x#1 := main_~res~0#1;havoc isinf_float_#res#1;havoc isinf_float_#t~mem7#1, isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, isinf_float_~x#1, isinf_float_~ix~0#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~0#1; {28#false} is VALID [2022-02-20 16:46:13,855 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#false} assume !true; {28#false} is VALID [2022-02-20 16:46:13,855 INFO L290 TraceCheckUtils]: 8: Hoare triple {28#false} isinf_float_~ix~0#1 := ~bvand32(2147483647bv32, isinf_float_~ix~0#1);isinf_float_#res#1 := (if 2139095040bv32 == isinf_float_~ix~0#1 then 1bv32 else 0bv32); {28#false} is VALID [2022-02-20 16:46:13,856 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#false} main_#t~ret9#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true; {28#false} is VALID [2022-02-20 16:46:13,856 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#false} assume 0bv32 == main_#t~ret9#1;havoc main_#t~ret9#1; {28#false} is VALID [2022-02-20 16:46:13,856 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-02-20 16:46:13,857 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:13,857 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:13,858 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:13,858 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [178384920] [2022-02-20 16:46:13,859 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [178384920] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:13,859 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:13,859 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:46:13,862 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353804047] [2022-02-20 16:46:13,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:13,867 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2022-02-20 16:46:13,868 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:13,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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:13,892 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:13,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:46:13,893 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:13,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:46:13,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:13,913 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 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.0) internal successors, (12), 2 states have internal predecessors, (12), 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:13,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:13,969 INFO L93 Difference]: Finished difference Result 46 states and 68 transitions. [2022-02-20 16:46:13,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:46:13,969 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2022-02-20 16:46:13,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:13,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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:13,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 68 transitions. [2022-02-20 16:46:13,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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:13,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 68 transitions. [2022-02-20 16:46:13,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 68 transitions. [2022-02-20 16:46:14,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:14,068 INFO L225 Difference]: With dead ends: 46 [2022-02-20 16:46:14,069 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 16:46:14,071 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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:14,077 INFO L933 BasicCegarLoop]: 26 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, 26 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:14,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 26 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:14,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 16:46:14,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-20 16:46:14,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:14,098 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:14,098 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:14,098 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:14,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:14,100 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-02-20 16:46:14,100 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 16:46:14,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:14,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:14,101 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 21 states. [2022-02-20 16:46:14,101 INFO L87 Difference]: Start difference. First operand has 21 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 21 states. [2022-02-20 16:46:14,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:14,102 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-02-20 16:46:14,102 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 16:46:14,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:14,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:14,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:14,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:14,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:14,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-02-20 16:46:14,105 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 12 [2022-02-20 16:46:14,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:14,106 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-02-20 16:46:14,106 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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:14,106 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 16:46:14,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:46:14,107 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:14,107 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:14,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:14,315 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:14,316 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:14,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:14,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1792517302, now seen corresponding path program 1 times [2022-02-20 16:46:14,317 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:14,317 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [520264281] [2022-02-20 16:46:14,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:14,317 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:14,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:14,319 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:14,320 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:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:14,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:46:14,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:14,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:14,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {193#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); {193#true} is VALID [2022-02-20 16:46:14,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {193#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_#t~ret9#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~to_fp~FLOAT(currentRoundingMode, 1.0), ~Pluszero~FLOAT());assume { :begin_inline_trunc_float } true;trunc_float_#in~x#1 := main_~x~0#1;havoc trunc_float_#res#1;havoc trunc_float_#t~mem4#1, trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset, trunc_float_#t~mem5#1, trunc_float_~#sf_u~0#1.base, trunc_float_~#sf_u~0#1.offset, trunc_float_#t~mem6#1, trunc_float_~#sf_u~1#1.base, trunc_float_~#sf_u~1#1.offset, trunc_float_~x#1, trunc_float_~signbit~0#1, trunc_float_~w~0#1, trunc_float_~exponent_less_127~0#1;trunc_float_~x#1 := trunc_float_#in~x#1;havoc trunc_float_~signbit~0#1;havoc trunc_float_~w~0#1;havoc trunc_float_~exponent_less_127~0#1; {201#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_trunc_float_~x#1|))} is VALID [2022-02-20 16:46:14,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {201#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_trunc_float_~x#1|))} call trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(trunc_float_~x#1, trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset, 4bv32);call trunc_float_#t~mem4#1 := read~intINTTYPE4(trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset, 4bv32);trunc_float_~w~0#1 := trunc_float_#t~mem4#1;havoc trunc_float_#t~mem4#1;call ULTIMATE.dealloc(trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset);havoc trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset; {205#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_trunc_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_trunc_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_trunc_float_~w~0#1|))))} is VALID [2022-02-20 16:46:14,593 INFO L290 TraceCheckUtils]: 3: Hoare triple {205#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_trunc_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_trunc_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_trunc_float_~w~0#1|))))} goto; {205#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_trunc_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_trunc_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_trunc_float_~w~0#1|))))} is VALID [2022-02-20 16:46:14,599 INFO L290 TraceCheckUtils]: 4: Hoare triple {205#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_trunc_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_trunc_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_trunc_float_~w~0#1|))))} trunc_float_~signbit~0#1 := ~bvand32(2147483648bv32, trunc_float_~w~0#1);trunc_float_~exponent_less_127~0#1 := ~bvsub32(~bvashr32(~bvand32(2139095040bv32, trunc_float_~w~0#1), 23bv32), 127bv32); {212#(exists ((|ULTIMATE.start_trunc_float_~w~0#1| (_ BitVec 32))) (and (= (bvadd (bvashr (bvand |ULTIMATE.start_trunc_float_~w~0#1| (_ bv2139095040 32)) (_ bv23 32)) (_ bv4294967169 32)) |ULTIMATE.start_trunc_float_~exponent_less_127~0#1|) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_trunc_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_trunc_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_trunc_float_~w~0#1|))))))} is VALID [2022-02-20 16:46:14,602 INFO L290 TraceCheckUtils]: 5: Hoare triple {212#(exists ((|ULTIMATE.start_trunc_float_~w~0#1| (_ BitVec 32))) (and (= (bvadd (bvashr (bvand |ULTIMATE.start_trunc_float_~w~0#1| (_ bv2139095040 32)) (_ bv23 32)) (_ bv4294967169 32)) |ULTIMATE.start_trunc_float_~exponent_less_127~0#1|) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_trunc_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_trunc_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_trunc_float_~w~0#1|))))))} assume !~bvslt32(trunc_float_~exponent_less_127~0#1, 23bv32); {212#(exists ((|ULTIMATE.start_trunc_float_~w~0#1| (_ BitVec 32))) (and (= (bvadd (bvashr (bvand |ULTIMATE.start_trunc_float_~w~0#1| (_ bv2139095040 32)) (_ bv23 32)) (_ bv4294967169 32)) |ULTIMATE.start_trunc_float_~exponent_less_127~0#1|) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_trunc_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_trunc_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_trunc_float_~w~0#1|))))))} is VALID [2022-02-20 16:46:14,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {212#(exists ((|ULTIMATE.start_trunc_float_~w~0#1| (_ BitVec 32))) (and (= (bvadd (bvashr (bvand |ULTIMATE.start_trunc_float_~w~0#1| (_ bv2139095040 32)) (_ bv23 32)) (_ bv4294967169 32)) |ULTIMATE.start_trunc_float_~exponent_less_127~0#1|) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_trunc_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_trunc_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_trunc_float_~w~0#1|))))))} assume 255bv32 == trunc_float_~exponent_less_127~0#1;trunc_float_#res#1 := ~fp.add~FLOAT(currentRoundingMode, trunc_float_~x#1, trunc_float_~x#1); {194#false} is VALID [2022-02-20 16:46:14,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {194#false} main_#t~ret8#1 := trunc_float_#res#1;assume { :end_inline_trunc_float } true;main_~res~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_isinf_float } true;isinf_float_#in~x#1 := main_~res~0#1;havoc isinf_float_#res#1;havoc isinf_float_#t~mem7#1, isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, isinf_float_~x#1, isinf_float_~ix~0#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~0#1; {194#false} is VALID [2022-02-20 16:46:14,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {194#false} call isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(isinf_float_~x#1, isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, 4bv32);call isinf_float_#t~mem7#1 := read~intINTTYPE4(isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, 4bv32);isinf_float_~ix~0#1 := isinf_float_#t~mem7#1;havoc isinf_float_#t~mem7#1;call ULTIMATE.dealloc(isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset);havoc isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset; {194#false} is VALID [2022-02-20 16:46:14,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {194#false} goto; {194#false} is VALID [2022-02-20 16:46:14,610 INFO L290 TraceCheckUtils]: 10: Hoare triple {194#false} isinf_float_~ix~0#1 := ~bvand32(2147483647bv32, isinf_float_~ix~0#1);isinf_float_#res#1 := (if 2139095040bv32 == isinf_float_~ix~0#1 then 1bv32 else 0bv32); {194#false} is VALID [2022-02-20 16:46:14,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {194#false} main_#t~ret9#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true; {194#false} is VALID [2022-02-20 16:46:14,610 INFO L290 TraceCheckUtils]: 12: Hoare triple {194#false} assume 0bv32 == main_#t~ret9#1;havoc main_#t~ret9#1; {194#false} is VALID [2022-02-20 16:46:14,611 INFO L290 TraceCheckUtils]: 13: Hoare triple {194#false} assume !false; {194#false} is VALID [2022-02-20 16:46:14,611 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:14,611 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:14,611 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:14,612 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [520264281] [2022-02-20 16:46:14,612 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [520264281] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:14,612 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:14,612 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:46:14,612 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436305666] [2022-02-20 16:46:14,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:14,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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:14,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:14,614 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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:14,642 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:14,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:46:14,644 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:14,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:46:14,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:14,646 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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:14,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:14,736 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-02-20 16:46:14,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:46:14,737 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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:14,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:14,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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:14,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-02-20 16:46:14,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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:14,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-02-20 16:46:14,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2022-02-20 16:46:14,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:14,782 INFO L225 Difference]: With dead ends: 29 [2022-02-20 16:46:14,782 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 16:46:14,783 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:14,784 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:14,784 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 14 Unchecked, 0.0s Time] [2022-02-20 16:46:14,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 16:46:14,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-20 16:46:14,786 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:14,786 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 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:14,786 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 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:14,786 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 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:14,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:14,787 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-02-20 16:46:14,787 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-02-20 16:46:14,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:14,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:14,788 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 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 21 states. [2022-02-20 16:46:14,788 INFO L87 Difference]: Start difference. First operand has 21 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 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 21 states. [2022-02-20 16:46:14,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:14,788 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-02-20 16:46:14,789 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-02-20 16:46:14,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:14,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:14,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:14,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:14,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 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:14,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-02-20 16:46:14,790 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2022-02-20 16:46:14,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:14,790 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-02-20 16:46:14,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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:14,790 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-02-20 16:46:14,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:46:14,791 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:14,791 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:14,824 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:15,001 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:15,001 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:15,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:15,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1848622454, now seen corresponding path program 1 times [2022-02-20 16:46:15,002 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:15,002 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2086072303] [2022-02-20 16:46:15,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:15,003 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:15,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:15,004 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:15,007 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:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:15,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 16:46:15,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:15,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:15,307 INFO L290 TraceCheckUtils]: 0: Hoare triple {346#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); {346#true} is VALID [2022-02-20 16:46:15,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {346#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_#t~ret9#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~to_fp~FLOAT(currentRoundingMode, 1.0), ~Pluszero~FLOAT());assume { :begin_inline_trunc_float } true;trunc_float_#in~x#1 := main_~x~0#1;havoc trunc_float_#res#1;havoc trunc_float_#t~mem4#1, trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset, trunc_float_#t~mem5#1, trunc_float_~#sf_u~0#1.base, trunc_float_~#sf_u~0#1.offset, trunc_float_#t~mem6#1, trunc_float_~#sf_u~1#1.base, trunc_float_~#sf_u~1#1.offset, trunc_float_~x#1, trunc_float_~signbit~0#1, trunc_float_~w~0#1, trunc_float_~exponent_less_127~0#1;trunc_float_~x#1 := trunc_float_#in~x#1;havoc trunc_float_~signbit~0#1;havoc trunc_float_~w~0#1;havoc trunc_float_~exponent_less_127~0#1; {354#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_trunc_float_~x#1|))} is VALID [2022-02-20 16:46:15,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {354#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_trunc_float_~x#1|))} call trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(trunc_float_~x#1, trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset, 4bv32);call trunc_float_#t~mem4#1 := read~intINTTYPE4(trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset, 4bv32);trunc_float_~w~0#1 := trunc_float_#t~mem4#1;havoc trunc_float_#t~mem4#1;call ULTIMATE.dealloc(trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset);havoc trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset; {354#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_trunc_float_~x#1|))} is VALID [2022-02-20 16:46:15,310 INFO L290 TraceCheckUtils]: 3: Hoare triple {354#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_trunc_float_~x#1|))} goto; {354#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_trunc_float_~x#1|))} is VALID [2022-02-20 16:46:15,311 INFO L290 TraceCheckUtils]: 4: Hoare triple {354#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_trunc_float_~x#1|))} trunc_float_~signbit~0#1 := ~bvand32(2147483648bv32, trunc_float_~w~0#1);trunc_float_~exponent_less_127~0#1 := ~bvsub32(~bvashr32(~bvand32(2139095040bv32, trunc_float_~w~0#1), 23bv32), 127bv32); {354#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_trunc_float_~x#1|))} is VALID [2022-02-20 16:46:15,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {354#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_trunc_float_~x#1|))} assume !~bvslt32(trunc_float_~exponent_less_127~0#1, 23bv32); {354#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_trunc_float_~x#1|))} is VALID [2022-02-20 16:46:15,312 INFO L290 TraceCheckUtils]: 6: Hoare triple {354#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_trunc_float_~x#1|))} assume !(255bv32 == trunc_float_~exponent_less_127~0#1); {354#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_trunc_float_~x#1|))} is VALID [2022-02-20 16:46:15,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {354#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_trunc_float_~x#1|))} trunc_float_#res#1 := trunc_float_~x#1; {373#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_trunc_float_#res#1|))} is VALID [2022-02-20 16:46:15,316 INFO L290 TraceCheckUtils]: 8: Hoare triple {373#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_trunc_float_#res#1|))} main_#t~ret8#1 := trunc_float_#res#1;assume { :end_inline_trunc_float } true;main_~res~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_isinf_float } true;isinf_float_#in~x#1 := main_~res~0#1;havoc isinf_float_#res#1;havoc isinf_float_#t~mem7#1, isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, isinf_float_~x#1, isinf_float_~ix~0#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~0#1; {377#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_isinf_float_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:15,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {377#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_isinf_float_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} call isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(isinf_float_~x#1, isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, 4bv32);call isinf_float_#t~mem7#1 := read~intINTTYPE4(isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, 4bv32);isinf_float_~ix~0#1 := isinf_float_#t~mem7#1;havoc isinf_float_#t~mem7#1;call ULTIMATE.dealloc(isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset);havoc isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset; {381#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_isinf_float_~ix~0#1|) ((_ extract 30 23) |ULTIMATE.start_isinf_float_~ix~0#1|) ((_ extract 22 0) |ULTIMATE.start_isinf_float_~ix~0#1|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:15,319 INFO L290 TraceCheckUtils]: 10: Hoare triple {381#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_isinf_float_~ix~0#1|) ((_ extract 30 23) |ULTIMATE.start_isinf_float_~ix~0#1|) ((_ extract 22 0) |ULTIMATE.start_isinf_float_~ix~0#1|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} goto; {381#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_isinf_float_~ix~0#1|) ((_ extract 30 23) |ULTIMATE.start_isinf_float_~ix~0#1|) ((_ extract 22 0) |ULTIMATE.start_isinf_float_~ix~0#1|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:15,321 INFO L290 TraceCheckUtils]: 11: Hoare triple {381#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_isinf_float_~ix~0#1|) ((_ extract 30 23) |ULTIMATE.start_isinf_float_~ix~0#1|) ((_ extract 22 0) |ULTIMATE.start_isinf_float_~ix~0#1|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} isinf_float_~ix~0#1 := ~bvand32(2147483647bv32, isinf_float_~ix~0#1);isinf_float_#res#1 := (if 2139095040bv32 == isinf_float_~ix~0#1 then 1bv32 else 0bv32); {388#(= |ULTIMATE.start_isinf_float_#res#1| (_ bv1 32))} is VALID [2022-02-20 16:46:15,321 INFO L290 TraceCheckUtils]: 12: Hoare triple {388#(= |ULTIMATE.start_isinf_float_#res#1| (_ bv1 32))} main_#t~ret9#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true; {392#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret9#1|)} is VALID [2022-02-20 16:46:15,321 INFO L290 TraceCheckUtils]: 13: Hoare triple {392#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret9#1|)} assume 0bv32 == main_#t~ret9#1;havoc main_#t~ret9#1; {347#false} is VALID [2022-02-20 16:46:15,322 INFO L290 TraceCheckUtils]: 14: Hoare triple {347#false} assume !false; {347#false} is VALID [2022-02-20 16:46:15,322 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:15,322 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:15,322 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:15,322 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2086072303] [2022-02-20 16:46:15,322 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2086072303] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:15,322 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:15,322 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 16:46:15,322 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74360203] [2022-02-20 16:46:15,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:15,323 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 16:46:15,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:15,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:15,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:15,351 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 16:46:15,351 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:15,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 16:46:15,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 16:46:15,352 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:15,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:15,542 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-02-20 16:46:15,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 16:46:15,542 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 16:46:15,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:15,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:15,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2022-02-20 16:46:15,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:15,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2022-02-20 16:46:15,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 30 transitions. [2022-02-20 16:46:15,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:15,585 INFO L225 Difference]: With dead ends: 30 [2022-02-20 16:46:15,585 INFO L226 Difference]: Without dead ends: 20 [2022-02-20 16:46:15,585 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 16:46:15,586 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:15,586 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 99 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 12 Unchecked, 0.0s Time] [2022-02-20 16:46:15,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-02-20 16:46:15,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-02-20 16:46:15,588 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:15,588 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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:15,589 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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:15,589 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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:15,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:15,590 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-02-20 16:46:15,590 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-02-20 16:46:15,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:15,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:15,590 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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 20 states. [2022-02-20 16:46:15,591 INFO L87 Difference]: Start difference. First operand has 20 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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 20 states. [2022-02-20 16:46:15,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:15,591 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-02-20 16:46:15,592 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-02-20 16:46:15,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:15,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:15,592 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:15,592 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:15,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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:15,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-02-20 16:46:15,593 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 15 [2022-02-20 16:46:15,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:15,593 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-02-20 16:46:15,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:15,593 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-02-20 16:46:15,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 16:46:15,593 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:15,593 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:15,609 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:15,794 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:15,794 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:15,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:15,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1768065978, now seen corresponding path program 1 times [2022-02-20 16:46:15,795 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:15,795 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1534216623] [2022-02-20 16:46:15,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:15,795 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:15,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:15,796 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:15,798 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:15,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:15,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:46:15,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:15,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:15,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {505#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); {505#true} is VALID [2022-02-20 16:46:15,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {505#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_#t~ret9#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~to_fp~FLOAT(currentRoundingMode, 1.0), ~Pluszero~FLOAT());assume { :begin_inline_trunc_float } true;trunc_float_#in~x#1 := main_~x~0#1;havoc trunc_float_#res#1;havoc trunc_float_#t~mem4#1, trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset, trunc_float_#t~mem5#1, trunc_float_~#sf_u~0#1.base, trunc_float_~#sf_u~0#1.offset, trunc_float_#t~mem6#1, trunc_float_~#sf_u~1#1.base, trunc_float_~#sf_u~1#1.offset, trunc_float_~x#1, trunc_float_~signbit~0#1, trunc_float_~w~0#1, trunc_float_~exponent_less_127~0#1;trunc_float_~x#1 := trunc_float_#in~x#1;havoc trunc_float_~signbit~0#1;havoc trunc_float_~w~0#1;havoc trunc_float_~exponent_less_127~0#1; {513#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_trunc_float_~x#1|))} is VALID [2022-02-20 16:46:15,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {513#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_trunc_float_~x#1|))} call trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(trunc_float_~x#1, trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset, 4bv32);call trunc_float_#t~mem4#1 := read~intINTTYPE4(trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset, 4bv32);trunc_float_~w~0#1 := trunc_float_#t~mem4#1;havoc trunc_float_#t~mem4#1;call ULTIMATE.dealloc(trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset);havoc trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset; {517#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_trunc_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_trunc_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_trunc_float_~w~0#1|))))} is VALID [2022-02-20 16:46:15,986 INFO L290 TraceCheckUtils]: 3: Hoare triple {517#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_trunc_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_trunc_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_trunc_float_~w~0#1|))))} goto; {517#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_trunc_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_trunc_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_trunc_float_~w~0#1|))))} is VALID [2022-02-20 16:46:15,987 INFO L290 TraceCheckUtils]: 4: Hoare triple {517#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_trunc_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_trunc_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_trunc_float_~w~0#1|))))} trunc_float_~signbit~0#1 := ~bvand32(2147483648bv32, trunc_float_~w~0#1);trunc_float_~exponent_less_127~0#1 := ~bvsub32(~bvashr32(~bvand32(2139095040bv32, trunc_float_~w~0#1), 23bv32), 127bv32); {524#(exists ((|ULTIMATE.start_trunc_float_~w~0#1| (_ BitVec 32))) (and (= (bvadd (bvashr (bvand |ULTIMATE.start_trunc_float_~w~0#1| (_ bv2139095040 32)) (_ bv23 32)) (_ bv4294967169 32)) |ULTIMATE.start_trunc_float_~exponent_less_127~0#1|) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_trunc_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_trunc_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_trunc_float_~w~0#1|))))))} is VALID [2022-02-20 16:46:15,989 INFO L290 TraceCheckUtils]: 5: Hoare triple {524#(exists ((|ULTIMATE.start_trunc_float_~w~0#1| (_ BitVec 32))) (and (= (bvadd (bvashr (bvand |ULTIMATE.start_trunc_float_~w~0#1| (_ bv2139095040 32)) (_ bv23 32)) (_ bv4294967169 32)) |ULTIMATE.start_trunc_float_~exponent_less_127~0#1|) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_trunc_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_trunc_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_trunc_float_~w~0#1|))))))} assume ~bvslt32(trunc_float_~exponent_less_127~0#1, 23bv32); {506#false} is VALID [2022-02-20 16:46:15,989 INFO L290 TraceCheckUtils]: 6: Hoare triple {506#false} assume !~bvslt32(trunc_float_~exponent_less_127~0#1, 0bv32); {506#false} is VALID [2022-02-20 16:46:15,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {506#false} call trunc_float_~#sf_u~1#1.base, trunc_float_~#sf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(~bvor32(trunc_float_~signbit~0#1, ~bvand32(trunc_float_~w~0#1, ~bvnot32(~bvashr32(8388607bv32, trunc_float_~exponent_less_127~0#1)))), trunc_float_~#sf_u~1#1.base, trunc_float_~#sf_u~1#1.offset, 4bv32);call trunc_float_#t~mem6#1 := read~intFLOATTYPE4(trunc_float_~#sf_u~1#1.base, trunc_float_~#sf_u~1#1.offset, 4bv32);trunc_float_~x#1 := trunc_float_#t~mem6#1;havoc trunc_float_#t~mem6#1;call ULTIMATE.dealloc(trunc_float_~#sf_u~1#1.base, trunc_float_~#sf_u~1#1.offset);havoc trunc_float_~#sf_u~1#1.base, trunc_float_~#sf_u~1#1.offset; {506#false} is VALID [2022-02-20 16:46:15,989 INFO L290 TraceCheckUtils]: 8: Hoare triple {506#false} goto; {506#false} is VALID [2022-02-20 16:46:15,989 INFO L290 TraceCheckUtils]: 9: Hoare triple {506#false} trunc_float_#res#1 := trunc_float_~x#1; {506#false} is VALID [2022-02-20 16:46:15,990 INFO L290 TraceCheckUtils]: 10: Hoare triple {506#false} main_#t~ret8#1 := trunc_float_#res#1;assume { :end_inline_trunc_float } true;main_~res~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_isinf_float } true;isinf_float_#in~x#1 := main_~res~0#1;havoc isinf_float_#res#1;havoc isinf_float_#t~mem7#1, isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, isinf_float_~x#1, isinf_float_~ix~0#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~0#1; {506#false} is VALID [2022-02-20 16:46:15,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {506#false} call isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(isinf_float_~x#1, isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, 4bv32);call isinf_float_#t~mem7#1 := read~intINTTYPE4(isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, 4bv32);isinf_float_~ix~0#1 := isinf_float_#t~mem7#1;havoc isinf_float_#t~mem7#1;call ULTIMATE.dealloc(isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset);havoc isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset; {506#false} is VALID [2022-02-20 16:46:15,990 INFO L290 TraceCheckUtils]: 12: Hoare triple {506#false} goto; {506#false} is VALID [2022-02-20 16:46:15,990 INFO L290 TraceCheckUtils]: 13: Hoare triple {506#false} isinf_float_~ix~0#1 := ~bvand32(2147483647bv32, isinf_float_~ix~0#1);isinf_float_#res#1 := (if 2139095040bv32 == isinf_float_~ix~0#1 then 1bv32 else 0bv32); {506#false} is VALID [2022-02-20 16:46:15,990 INFO L290 TraceCheckUtils]: 14: Hoare triple {506#false} main_#t~ret9#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true; {506#false} is VALID [2022-02-20 16:46:15,990 INFO L290 TraceCheckUtils]: 15: Hoare triple {506#false} assume 0bv32 == main_#t~ret9#1;havoc main_#t~ret9#1; {506#false} is VALID [2022-02-20 16:46:15,990 INFO L290 TraceCheckUtils]: 16: Hoare triple {506#false} assume !false; {506#false} is VALID [2022-02-20 16:46:15,990 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:15,990 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:15,991 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:15,991 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1534216623] [2022-02-20 16:46:15,991 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1534216623] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:15,991 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:15,991 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:46:15,991 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484176955] [2022-02-20 16:46:15,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:15,991 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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:15,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:15,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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:16,013 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:16,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:46:16,013 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:16,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:46:16,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:16,014 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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:16,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:16,039 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-02-20 16:46:16,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:46:16,039 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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:16,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:16,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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:16,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2022-02-20 16:46:16,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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:16,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2022-02-20 16:46:16,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 20 transitions. [2022-02-20 16:46:16,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:16,069 INFO L225 Difference]: With dead ends: 20 [2022-02-20 16:46:16,069 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:46:16,069 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:16,070 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:16,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 4 Unchecked, 0.0s Time] [2022-02-20 16:46:16,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:46:16,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:46:16,071 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:16,071 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:16,071 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:16,071 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:16,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:16,071 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:46:16,071 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:16,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:16,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:16,072 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:16,072 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:16,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:16,072 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:46:16,072 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:16,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:16,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:16,072 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:16,072 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:16,072 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:16,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:46:16,073 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2022-02-20 16:46:16,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:16,073 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:46:16,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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:16,073 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:16,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:16,075 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:46:16,091 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:16,289 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:16,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:46:16,317 INFO L858 garLoopResultBuilder]: For program point L23(lines 23 41) no Hoare annotation was computed. [2022-02-20 16:46:16,317 INFO L858 garLoopResultBuilder]: For program point L23-1(lines 23 41) no Hoare annotation was computed. [2022-02-20 16:46:16,317 INFO L858 garLoopResultBuilder]: For program point L48-1(lines 48 52) no Hoare annotation was computed. [2022-02-20 16:46:16,317 INFO L854 garLoopResultBuilder]: At program point L48-2(lines 48 52) the Hoare annotation is: (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_isinf_float_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))) [2022-02-20 16:46:16,317 INFO L858 garLoopResultBuilder]: For program point L48-3(lines 48 52) no Hoare annotation was computed. [2022-02-20 16:46:16,317 INFO L861 garLoopResultBuilder]: At program point L73(lines 57 74) the Hoare annotation is: true [2022-02-20 16:46:16,318 INFO L858 garLoopResultBuilder]: For program point L69(line 69) no Hoare annotation was computed. [2022-02-20 16:46:16,318 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:46:16,318 INFO L858 garLoopResultBuilder]: For program point L32-1(lines 32 36) no Hoare annotation was computed. [2022-02-20 16:46:16,318 INFO L854 garLoopResultBuilder]: At program point L32-2(lines 32 36) the Hoare annotation is: false [2022-02-20 16:46:16,318 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:46:16,318 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:46:16,318 INFO L858 garLoopResultBuilder]: For program point L24(lines 24 37) no Hoare annotation was computed. [2022-02-20 16:46:16,318 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 69) no Hoare annotation was computed. [2022-02-20 16:46:16,318 INFO L858 garLoopResultBuilder]: For program point L16-1(lines 16 20) no Hoare annotation was computed. [2022-02-20 16:46:16,318 INFO L854 garLoopResultBuilder]: At program point L16-2(lines 16 20) the Hoare annotation is: (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_trunc_float_~x#1|)) [2022-02-20 16:46:16,318 INFO L858 garLoopResultBuilder]: For program point L16-3(lines 16 20) no Hoare annotation was computed. [2022-02-20 16:46:16,318 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:46:16,318 INFO L854 garLoopResultBuilder]: At program point L54(lines 46 55) the Hoare annotation is: (= |ULTIMATE.start_isinf_float_#res#1| (_ bv1 32)) [2022-02-20 16:46:16,318 INFO L854 garLoopResultBuilder]: At program point L42(lines 14 43) the Hoare annotation is: (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_trunc_float_#res#1|)) [2022-02-20 16:46:16,318 INFO L858 garLoopResultBuilder]: For program point L26-1(lines 26 30) no Hoare annotation was computed. [2022-02-20 16:46:16,318 INFO L854 garLoopResultBuilder]: At program point L26-2(lines 26 30) the Hoare annotation is: false [2022-02-20 16:46:16,318 INFO L858 garLoopResultBuilder]: For program point L39(lines 39 40) no Hoare annotation was computed. [2022-02-20 16:46:16,318 INFO L858 garLoopResultBuilder]: For program point L68(lines 68 71) no Hoare annotation was computed. [2022-02-20 16:46:16,321 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-20 16:46:16,321 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:46:16,324 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:46:16,324 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:46:16,324 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2022-02-20 16:46:16,324 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2022-02-20 16:46:16,324 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2022-02-20 16:46:16,324 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2022-02-20 16:46:16,324 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2022-02-20 16:46:16,324 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-02-20 16:46:16,324 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-02-20 16:46:16,324 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-02-20 16:46:16,324 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-02-20 16:46:16,324 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 16:46:16,324 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 16:46:16,324 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-02-20 16:46:16,324 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2022-02-20 16:46:16,324 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2022-02-20 16:46:16,324 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2022-02-20 16:46:16,325 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2022-02-20 16:46:16,325 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-02-20 16:46:16,325 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-02-20 16:46:16,325 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2022-02-20 16:46:16,325 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2022-02-20 16:46:16,325 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-02-20 16:46:16,325 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2022-02-20 16:46:16,325 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-02-20 16:46:16,325 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-02-20 16:46:16,325 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2022-02-20 16:46:16,325 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-02-20 16:46:16,325 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-02-20 16:46:16,325 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-02-20 16:46:16,326 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:46:16,326 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:46:16,326 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:16,326 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:16,326 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:16,331 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:16,331 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:16,331 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:16,332 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:16,332 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:16,332 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:16,332 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:16,332 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:16,332 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:16,333 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:16,333 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:16,333 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:16,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:46:16 BoogieIcfgContainer [2022-02-20 16:46:16,333 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:46:16,334 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:46:16,334 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:46:16,334 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:46:16,334 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:13" (3/4) ... [2022-02-20 16:46:16,336 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:46:16,341 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-02-20 16:46:16,342 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-02-20 16:46:16,342 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:46:16,342 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:46:16,356 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE()) == x) [2022-02-20 16:46:16,356 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE()) == \result) [2022-02-20 16:46:16,357 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~FLOAT(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE())) [2022-02-20 16:46:16,357 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \result == 1bv32 [2022-02-20 16:46:16,365 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:46:16,366 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:46:16,367 INFO L158 Benchmark]: Toolchain (without parser) took 3469.52ms. Allocated memory was 67.1MB in the beginning and 83.9MB in the end (delta: 16.8MB). Free memory was 47.7MB in the beginning and 58.7MB in the end (delta: -11.0MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2022-02-20 16:46:16,367 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 67.1MB. Free memory is still 49.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:16,367 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.59ms. Allocated memory is still 67.1MB. Free memory was 47.6MB in the beginning and 49.9MB in the end (delta: -2.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 16:46:16,367 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.41ms. Allocated memory is still 67.1MB. Free memory was 49.7MB in the beginning and 47.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:16,368 INFO L158 Benchmark]: Boogie Preprocessor took 39.23ms. Allocated memory is still 67.1MB. Free memory was 47.8MB in the beginning and 46.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:16,368 INFO L158 Benchmark]: RCFGBuilder took 346.98ms. Allocated memory was 67.1MB in the beginning and 83.9MB in the end (delta: 16.8MB). Free memory was 46.1MB in the beginning and 66.7MB in the end (delta: -20.6MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. [2022-02-20 16:46:16,368 INFO L158 Benchmark]: TraceAbstraction took 2791.64ms. Allocated memory is still 83.9MB. Free memory was 66.2MB in the beginning and 61.5MB in the end (delta: 4.7MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. [2022-02-20 16:46:16,368 INFO L158 Benchmark]: Witness Printer took 32.31ms. Allocated memory is still 83.9MB. Free memory was 61.5MB in the beginning and 58.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:16,370 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.23ms. Allocated memory is still 67.1MB. Free memory is still 49.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 214.59ms. Allocated memory is still 67.1MB. Free memory was 47.6MB in the beginning and 49.9MB in the end (delta: -2.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.41ms. Allocated memory is still 67.1MB. Free memory was 49.7MB in the beginning and 47.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.23ms. Allocated memory is still 67.1MB. Free memory was 47.8MB in the beginning and 46.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 346.98ms. Allocated memory was 67.1MB in the beginning and 83.9MB in the end (delta: 16.8MB). Free memory was 46.1MB in the beginning and 66.7MB in the end (delta: -20.6MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2791.64ms. Allocated memory is still 83.9MB. Free memory was 66.2MB in the beginning and 61.5MB in the end (delta: 4.7MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. * Witness Printer took 32.31ms. Allocated memory is still 83.9MB. Free memory was 61.5MB in the beginning and 58.7MB in the end (delta: 2.8MB). 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[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[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 69]: 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, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4 mSDsluCounter, 190 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 30 IncrementalHoareTripleChecker+Unchecked, 128 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 62 mSDtfsCounter, 5 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=0, InterpolantAutomatonStates: 20, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 12 NumberOfFragments, 33 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 58 NumberOfCodeBlocks, 58 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 54 ConstructedInterpolants, 19 QuantifiedInterpolants, 297 SizeOfPredicates, 25 NumberOfNonLiveVariables, 216 ConjunctsInSsa, 37 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: 32]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: \result == 1bv32 - InvariantResult [Line: 48]: Loop Invariant [2022-02-20 16:46:16,385 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:16,386 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:16,386 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:16,386 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~FLOAT(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 16]: Loop Invariant [2022-02-20 16:46:16,387 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:16,387 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:16,387 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:16,388 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE()) == x) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 14]: Loop Invariant [2022-02-20 16:46:16,388 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:16,388 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:16,388 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:16,388 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE()) == \result) RESULT: Ultimate proved your program to be correct! [2022-02-20 16:46:16,416 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