./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1072c.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_1072c.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 04c436006742f36e09d723f85653028f787f4ee63bf5ff6f9895b53f3ce3aea9 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:46:10,821 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:46:10,823 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:46:10,846 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:46:10,847 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:46:10,848 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:46:10,849 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:46:10,851 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:46:10,852 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:46:10,853 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:46:10,854 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:46:10,854 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:46:10,855 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:46:10,856 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:46:10,857 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:46:10,858 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:46:10,858 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:46:10,859 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:46:10,860 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:46:10,862 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:46:10,863 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:46:10,865 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:46:10,866 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:46:10,867 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:46:10,869 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:46:10,869 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:46:10,870 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:46:10,871 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:46:10,871 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:46:10,872 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:46:10,872 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:46:10,873 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:46:10,874 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:46:10,874 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:46:10,875 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:46:10,875 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:46:10,876 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:46:10,876 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:46:10,877 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:46:10,877 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:46:10,878 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:46:10,879 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:10,897 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:46:10,897 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:46:10,898 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:46:10,898 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:46:10,899 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:46:10,899 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:46:10,900 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:46:10,900 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:46:10,900 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:46:10,901 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:46:10,901 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:46:10,901 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:46:10,901 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:46:10,902 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:46:10,902 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:46:10,902 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:46:10,902 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:46:10,902 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:46:10,903 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:46:10,903 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:46:10,903 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:46:10,903 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:46:10,904 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:46:10,904 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:46:10,904 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:10,904 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:46:10,905 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:46:10,905 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:46:10,905 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:46:10,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:46:10,906 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:46:10,906 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:46:10,906 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:46:10,906 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 -> 04c436006742f36e09d723f85653028f787f4ee63bf5ff6f9895b53f3ce3aea9 [2022-02-20 16:46:11,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:46:11,144 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:46:11,147 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:46:11,148 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:46:11,148 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:46:11,149 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1072c.c [2022-02-20 16:46:11,223 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/426998dff/3ae0e312121f468a9ccfb15324723a74/FLAGbe2e2077a [2022-02-20 16:46:11,647 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:46:11,648 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1072c.c [2022-02-20 16:46:11,657 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/426998dff/3ae0e312121f468a9ccfb15324723a74/FLAGbe2e2077a [2022-02-20 16:46:12,052 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/426998dff/3ae0e312121f468a9ccfb15324723a74 [2022-02-20 16:46:12,055 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:46:12,058 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:46:12,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:12,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:46:12,063 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:46:12,065 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,067 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f3b3e50 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,068 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,074 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:46:12,089 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:46:12,265 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_1072c.c[1571,1584] [2022-02-20 16:46:12,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:12,275 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:46:12,295 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_1072c.c[1571,1584] [2022-02-20 16:46:12,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:12,308 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:46:12,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:12 WrapperNode [2022-02-20 16:46:12,309 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:12,310 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:12,310 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:46:12,310 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:46:12,317 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:12" (1/1) ... [2022-02-20 16:46:12,332 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:12" (1/1) ... [2022-02-20 16:46:12,381 INFO L137 Inliner]: procedures = 16, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 102 [2022-02-20 16:46:12,382 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:12,382 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:46:12,383 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:46:12,383 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:46:12,393 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:12" (1/1) ... [2022-02-20 16:46:12,396 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:12" (1/1) ... [2022-02-20 16:46:12,400 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:12" (1/1) ... [2022-02-20 16:46:12,401 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:12" (1/1) ... [2022-02-20 16:46:12,420 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:12" (1/1) ... [2022-02-20 16:46:12,428 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:12" (1/1) ... [2022-02-20 16:46:12,430 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:12" (1/1) ... [2022-02-20 16:46:12,440 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:46:12,441 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:46:12,441 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:46:12,441 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:46:12,449 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:12" (1/1) ... [2022-02-20 16:46:12,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:12,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:46:12,476 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:12,478 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:12,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:46:12,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:46:12,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:46:12,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:46:12,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:46:12,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:46:12,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:46:12,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:46:12,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:46:12,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:46:12,599 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:46:12,602 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:46:12,968 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:46:12,974 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:46:12,975 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-02-20 16:46:12,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:12 BoogieIcfgContainer [2022-02-20 16:46:12,977 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:46:12,978 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:46:12,978 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:46:12,981 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:46:12,982 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:12,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4106329a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:12, skipping insertion in model container [2022-02-20 16:46:12,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:12" (2/3) ... [2022-02-20 16:46:12,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4106329a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:12, skipping insertion in model container [2022-02-20 16:46:12,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:12" (3/3) ... [2022-02-20 16:46:12,984 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1072c.c [2022-02-20 16:46:12,989 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:46:12,989 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:46:13,027 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:46:13,033 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,033 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:46:13,046 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 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,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:46:13,050 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:13,050 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:13,051 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:13,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:13,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1236259765, now seen corresponding path program 1 times [2022-02-20 16:46:13,062 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:13,063 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997615814] [2022-02-20 16:46:13,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:13,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:13,176 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#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); {32#true} is VALID [2022-02-20 16:46:13,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#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_#t~short11#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := 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; {32#true} is VALID [2022-02-20 16:46:13,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume !true; {33#false} is VALID [2022-02-20 16:46:13,177 INFO L290 TraceCheckUtils]: 3: Hoare triple {33#false} assume 0 == trunc_float_~w~0#1;trunc_float_~signbit~0#1 := 0; {33#false} is VALID [2022-02-20 16:46:13,177 INFO L290 TraceCheckUtils]: 4: Hoare triple {33#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; {33#false} is VALID [2022-02-20 16:46:13,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#false} assume !(trunc_float_~exponent_less_127~0#1 < 23); {33#false} is VALID [2022-02-20 16:46:13,178 INFO L290 TraceCheckUtils]: 6: Hoare triple {33#false} assume 255 == trunc_float_~exponent_less_127~0#1;trunc_float_#res#1 := ~someBinaryArithmeticFLOAToperation(trunc_float_~x#1, trunc_float_~x#1); {33#false} is VALID [2022-02-20 16:46:13,178 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#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;main_#t~short11#1 := ~someBinaryFLOATComparisonOperation(main_~res~0#1, 0.0); {33#false} is VALID [2022-02-20 16:46:13,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#false} assume !main_#t~short11#1; {33#false} is VALID [2022-02-20 16:46:13,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume !main_#t~short11#1;havoc main_#t~ret10#1;havoc main_#t~short11#1; {33#false} is VALID [2022-02-20 16:46:13,179 INFO L290 TraceCheckUtils]: 10: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-02-20 16:46:13,179 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,180 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:46:13,180 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997615814] [2022-02-20 16:46:13,181 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997615814] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:13,181 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:13,181 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:46:13,182 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145002343] [2022-02-20 16:46:13,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:13,187 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-02-20 16:46:13,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:13,190 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:13,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:46:13,203 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:46:13,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:46:13,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:13,242 INFO L87 Difference]: Start difference. First operand has 29 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 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 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:13,310 INFO L93 Difference]: Finished difference Result 56 states and 88 transitions. [2022-02-20 16:46:13,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:46:13,311 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-02-20 16:46:13,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:13,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 88 transitions. [2022-02-20 16:46:13,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 88 transitions. [2022-02-20 16:46:13,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 88 transitions. [2022-02-20 16:46:13,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:13,424 INFO L225 Difference]: With dead ends: 56 [2022-02-20 16:46:13,424 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 16:46:13,427 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:13,430 INFO L933 BasicCegarLoop]: 34 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, 34 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:13,431 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 34 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:13,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 16:46:13,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-02-20 16:46:13,453 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:13,454 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 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,455 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 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,456 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 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,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:13,460 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-02-20 16:46:13,460 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-02-20 16:46:13,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:13,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:13,462 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 26 states. [2022-02-20 16:46:13,462 INFO L87 Difference]: Start difference. First operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 26 states. [2022-02-20 16:46:13,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:13,465 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-02-20 16:46:13,466 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-02-20 16:46:13,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:13,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:13,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:13,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:13,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 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,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-02-20 16:46:13,470 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 11 [2022-02-20 16:46:13,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:13,470 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-02-20 16:46:13,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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,471 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-02-20 16:46:13,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 16:46:13,472 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:13,473 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:13,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:46:13,477 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:13,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:13,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1856180690, now seen corresponding path program 1 times [2022-02-20 16:46:13,480 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:13,480 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96413173] [2022-02-20 16:46:13,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:13,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:13,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:13,595 INFO L290 TraceCheckUtils]: 0: Hoare triple {190#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); {190#true} is VALID [2022-02-20 16:46:13,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {190#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_#t~short11#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := 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; {190#true} is VALID [2022-02-20 16:46:13,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {190#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; {190#true} is VALID [2022-02-20 16:46:13,596 INFO L290 TraceCheckUtils]: 3: Hoare triple {190#true} goto; {190#true} is VALID [2022-02-20 16:46:13,597 INFO L290 TraceCheckUtils]: 4: Hoare triple {190#true} assume 0 == trunc_float_~w~0#1;trunc_float_~signbit~0#1 := 0; {192#(= |ULTIMATE.start_trunc_float_~w~0#1| 0)} is VALID [2022-02-20 16:46:13,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {192#(= |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; {193#(<= (+ 127 |ULTIMATE.start_trunc_float_~exponent_less_127~0#1|) 0)} is VALID [2022-02-20 16:46:13,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {193#(<= (+ 127 |ULTIMATE.start_trunc_float_~exponent_less_127~0#1|) 0)} assume !(trunc_float_~exponent_less_127~0#1 < 23); {193#(<= (+ 127 |ULTIMATE.start_trunc_float_~exponent_less_127~0#1|) 0)} is VALID [2022-02-20 16:46:13,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {193#(<= (+ 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); {191#false} is VALID [2022-02-20 16:46:13,599 INFO L290 TraceCheckUtils]: 8: Hoare triple {191#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;main_#t~short11#1 := ~someBinaryFLOATComparisonOperation(main_~res~0#1, 0.0); {191#false} is VALID [2022-02-20 16:46:13,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {191#false} assume !main_#t~short11#1; {191#false} is VALID [2022-02-20 16:46:13,599 INFO L290 TraceCheckUtils]: 10: Hoare triple {191#false} assume !main_#t~short11#1;havoc main_#t~ret10#1;havoc main_#t~short11#1; {191#false} is VALID [2022-02-20 16:46:13,600 INFO L290 TraceCheckUtils]: 11: Hoare triple {191#false} assume !false; {191#false} is VALID [2022-02-20 16:46:13,600 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,600 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:46:13,601 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96413173] [2022-02-20 16:46:13,601 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96413173] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:13,601 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:13,601 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:46:13,602 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469771977] [2022-02-20 16:46:13,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:13,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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,604 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:13,604 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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,618 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,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:46:13,619 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:46:13,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:46:13,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:46:13,621 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:13,735 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-02-20 16:46:13,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:46:13,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:13,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-02-20 16:46:13,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-02-20 16:46:13,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 62 transitions. [2022-02-20 16:46:13,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:13,794 INFO L225 Difference]: With dead ends: 54 [2022-02-20 16:46:13,794 INFO L226 Difference]: Without dead ends: 41 [2022-02-20 16:46:13,794 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:13,804 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 29 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 73 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:13,805 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 73 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:13,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-02-20 16:46:13,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2022-02-20 16:46:13,808 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:13,809 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 29 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:13,809 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 29 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:13,809 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 29 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:13,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:13,812 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-02-20 16:46:13,812 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-02-20 16:46:13,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:13,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:13,813 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 41 states. [2022-02-20 16:46:13,813 INFO L87 Difference]: Start difference. First operand has 29 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 41 states. [2022-02-20 16:46:13,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:13,815 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-02-20 16:46:13,815 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-02-20 16:46:13,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:13,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:13,816 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:13,816 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:13,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:13,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-02-20 16:46:13,818 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 12 [2022-02-20 16:46:13,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:13,818 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-02-20 16:46:13,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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,819 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-02-20 16:46:13,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:46:13,819 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:13,819 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:13,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:46:13,820 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:13,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:13,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1128631073, now seen corresponding path program 1 times [2022-02-20 16:46:13,821 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:13,821 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976608970] [2022-02-20 16:46:13,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:13,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:13,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:46:13,867 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:46:13,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:46:13,912 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:46:13,912 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:46:13,913 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:46:13,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:46:13,917 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 16:46:13,919 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:46:13,938 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:46:13,939 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:46:13,939 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-02-20 16:46:13,939 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-02-20 16:46:13,939 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2022-02-20 16:46:13,939 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2022-02-20 16:46:13,939 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2022-02-20 16:46:13,939 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2022-02-20 16:46:13,939 WARN L170 areAnnotationChecker]: L21-7 has no Hoare annotation [2022-02-20 16:46:13,940 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-02-20 16:46:13,940 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-02-20 16:46:13,940 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-02-20 16:46:13,940 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-02-20 16:46:13,940 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2022-02-20 16:46:13,941 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2022-02-20 16:46:13,941 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-02-20 16:46:13,941 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-02-20 16:46:13,941 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 16:46:13,941 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 16:46:13,941 WARN L170 areAnnotationChecker]: L21-5 has no Hoare annotation [2022-02-20 16:46:13,941 WARN L170 areAnnotationChecker]: L21-5 has no Hoare annotation [2022-02-20 16:46:13,941 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2022-02-20 16:46:13,941 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2022-02-20 16:46:13,941 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2022-02-20 16:46:13,941 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2022-02-20 16:46:13,942 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:46:13,945 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2022-02-20 16:46:13,945 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-02-20 16:46:13,945 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-02-20 16:46:13,945 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2022-02-20 16:46:13,945 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2022-02-20 16:46:13,945 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-02-20 16:46:13,945 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-02-20 16:46:13,945 WARN L170 areAnnotationChecker]: L48-2 has no Hoare annotation [2022-02-20 16:46:13,945 WARN L170 areAnnotationChecker]: L48-2 has no Hoare annotation [2022-02-20 16:46:13,945 WARN L170 areAnnotationChecker]: L68-2 has no Hoare annotation [2022-02-20 16:46:13,949 WARN L170 areAnnotationChecker]: L68-2 has no Hoare annotation [2022-02-20 16:46:13,949 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-02-20 16:46:13,949 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-02-20 16:46:13,949 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2022-02-20 16:46:13,949 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:46:13,950 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:46:13,950 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-02-20 16:46:13,950 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:46:13,950 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:13,950 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:13,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:46:13 BoogieIcfgContainer [2022-02-20 16:46:13,951 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:46:13,952 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:46:13,952 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:46:13,952 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:46:13,953 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:12" (3/4) ... [2022-02-20 16:46:13,955 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:46:13,955 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:46:13,956 INFO L158 Benchmark]: Toolchain (without parser) took 1898.32ms. Allocated memory is still 121.6MB. Free memory was 90.3MB in the beginning and 86.4MB in the end (delta: 3.9MB). Peak memory consumption was 2.6MB. Max. memory is 16.1GB. [2022-02-20 16:46:13,956 INFO L158 Benchmark]: CDTParser took 0.62ms. Allocated memory is still 86.0MB. Free memory was 41.7MB in the beginning and 41.6MB in the end (delta: 40.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:13,957 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.24ms. Allocated memory is still 121.6MB. Free memory was 90.1MB in the beginning and 97.2MB in the end (delta: -7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:46:13,960 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.92ms. Allocated memory is still 121.6MB. Free memory was 97.2MB in the beginning and 93.5MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:46:13,962 INFO L158 Benchmark]: Boogie Preprocessor took 57.47ms. Allocated memory is still 121.6MB. Free memory was 93.5MB in the beginning and 91.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:13,964 INFO L158 Benchmark]: RCFGBuilder took 535.93ms. Allocated memory is still 121.6MB. Free memory was 91.4MB in the beginning and 70.9MB in the end (delta: 20.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-02-20 16:46:13,965 INFO L158 Benchmark]: TraceAbstraction took 972.79ms. Allocated memory is still 121.6MB. Free memory was 70.0MB in the beginning and 86.4MB in the end (delta: -16.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:13,965 INFO L158 Benchmark]: Witness Printer took 3.25ms. Allocated memory is still 121.6MB. Free memory is still 86.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:13,968 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.62ms. Allocated memory is still 86.0MB. Free memory was 41.7MB in the beginning and 41.6MB in the end (delta: 40.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 249.24ms. Allocated memory is still 121.6MB. Free memory was 90.1MB in the beginning and 97.2MB in the end (delta: -7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.92ms. Allocated memory is still 121.6MB. Free memory was 97.2MB in the beginning and 93.5MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.47ms. Allocated memory is still 121.6MB. Free memory was 93.5MB in the beginning and 91.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 535.93ms. Allocated memory is still 121.6MB. Free memory was 91.4MB in the beginning and 70.9MB in the end (delta: 20.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 972.79ms. Allocated memory is still 121.6MB. Free memory was 70.0MB in the beginning and 86.4MB in the end (delta: -16.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.25ms. Allocated memory is still 121.6MB. Free memory is still 86.4MB. 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 someBinaryFLOATComparisonOperation at line 68, overapproximation of bitwiseAnd at line 22. Possible FailurePath: [L64] float x = 0.0f; [L65] CALL, EXPR trunc_float(x) [L15] __int32_t signbit, w, exponent_less_127; VAL [\old(x)=0, x=0] [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)=0, signbit=0, w=0, x=0] [L22] exponent_less_127 = ((w & 0x7f800000) >> 23) - 127 VAL [\old(x)=0, exponent_less_127=-127, signbit=0, w=0, x=0] [L23] COND TRUE exponent_less_127 < 23 VAL [\old(x)=0, exponent_less_127=-127, signbit=0, w=0, x=0] [L24] COND TRUE exponent_less_127 < 0 VAL [\old(x)=0, exponent_less_127=-127, signbit=0, w=0, x=0] [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)=0, \result=4294967297, exponent_less_127=-127, signbit=0, w=0, x=4294967297] [L65] RET, EXPR trunc_float(x) [L65] float res = trunc_float(x); [L68] EXPR res == 0.0f && __signbit_float(res) == 0 VAL [res=4294967297, res == 0.0f && __signbit_float(res) == 0=0, x=0] [L68] COND TRUE !(res == 0.0f && __signbit_float(res) == 0) [L69] reach_error() VAL [res=4294967297, x=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, 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, 29 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29 mSDsluCounter, 107 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 45 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19 IncrementalHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 62 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=29occurred 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, 12 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 38 NumberOfCodeBlocks, 38 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 31 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:13,999 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_1072c.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 04c436006742f36e09d723f85653028f787f4ee63bf5ff6f9895b53f3ce3aea9 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:46:15,884 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:46:15,888 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:46:15,927 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:46:15,928 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:46:15,932 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:46:15,933 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:46:15,938 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:46:15,941 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:46:15,945 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:46:15,946 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:46:15,949 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:46:15,950 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:46:15,952 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:46:15,953 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:46:15,956 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:46:15,957 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:46:15,957 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:46:15,960 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:46:15,965 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:46:15,967 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:46:15,968 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:46:15,969 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:46:15,971 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:46:15,976 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:46:15,977 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:46:15,977 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:46:15,979 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:46:15,979 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:46:15,980 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:46:15,980 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:46:15,981 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:46:15,982 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:46:15,983 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:46:15,984 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:46:15,984 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:46:15,985 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:46:15,985 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:46:15,985 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:46:15,987 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:46:15,987 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:46:15,988 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:16,026 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:46:16,026 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:46:16,027 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:46:16,027 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:46:16,028 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:46:16,029 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:46:16,030 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:46:16,030 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:46:16,030 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:46:16,030 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:46:16,031 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:46:16,031 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:46:16,032 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:46:16,032 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:46:16,032 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:46:16,032 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:46:16,032 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:46:16,032 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:46:16,033 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:46:16,033 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:46:16,033 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:46:16,033 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:46:16,033 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:46:16,034 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:46:16,034 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:46:16,045 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:46:16,045 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:16,045 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:46:16,045 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:46:16,045 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:46:16,046 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:46:16,046 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:46:16,046 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:46:16,046 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:46:16,046 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:46:16,047 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:46:16,047 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 -> 04c436006742f36e09d723f85653028f787f4ee63bf5ff6f9895b53f3ce3aea9 [2022-02-20 16:46:16,333 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:46:16,362 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:46:16,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:46:16,365 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:46:16,366 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:46:16,367 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1072c.c [2022-02-20 16:46:16,420 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52d4a25f4/77e213a2526f40d6af05771b84a5d052/FLAG25a749971 [2022-02-20 16:46:16,888 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:46:16,889 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1072c.c [2022-02-20 16:46:16,895 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52d4a25f4/77e213a2526f40d6af05771b84a5d052/FLAG25a749971 [2022-02-20 16:46:16,915 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52d4a25f4/77e213a2526f40d6af05771b84a5d052 [2022-02-20 16:46:16,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:46:16,919 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:46:16,922 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:16,923 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:46:16,926 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:46:16,927 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:16" (1/1) ... [2022-02-20 16:46:16,928 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58917a99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:16, skipping insertion in model container [2022-02-20 16:46:16,929 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:16" (1/1) ... [2022-02-20 16:46:16,936 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:46:16,951 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:46:17,116 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_1072c.c[1571,1584] [2022-02-20 16:46:17,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:17,164 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:46:17,185 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_1072c.c[1571,1584] [2022-02-20 16:46:17,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:17,199 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:46:17,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:17 WrapperNode [2022-02-20 16:46:17,200 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:17,201 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:17,201 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:46:17,201 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:46:17,206 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:17" (1/1) ... [2022-02-20 16:46:17,223 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:17" (1/1) ... [2022-02-20 16:46:17,249 INFO L137 Inliner]: procedures = 19, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 90 [2022-02-20 16:46:17,249 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:17,250 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:46:17,250 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:46:17,250 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:46:17,257 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:17" (1/1) ... [2022-02-20 16:46:17,257 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:17" (1/1) ... [2022-02-20 16:46:17,268 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:17" (1/1) ... [2022-02-20 16:46:17,268 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:17" (1/1) ... [2022-02-20 16:46:17,289 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:17" (1/1) ... [2022-02-20 16:46:17,300 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:17" (1/1) ... [2022-02-20 16:46:17,307 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:17" (1/1) ... [2022-02-20 16:46:17,313 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:46:17,317 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:46:17,318 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:46:17,318 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:46:17,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:17" (1/1) ... [2022-02-20 16:46:17,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:17,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:46:17,348 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:17,364 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:17,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:46:17,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:46:17,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:46:17,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:46:17,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:46:17,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:46:17,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:46:17,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:46:17,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:46:17,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:46:17,475 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:46:17,477 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:46:17,762 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:46:17,768 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:46:17,769 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-02-20 16:46:17,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:17 BoogieIcfgContainer [2022-02-20 16:46:17,770 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:46:17,772 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:46:17,772 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:46:17,775 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:46:17,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:46:16" (1/3) ... [2022-02-20 16:46:17,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729e5e76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:17, skipping insertion in model container [2022-02-20 16:46:17,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:17" (2/3) ... [2022-02-20 16:46:17,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729e5e76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:17, skipping insertion in model container [2022-02-20 16:46:17,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:17" (3/3) ... [2022-02-20 16:46:17,777 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1072c.c [2022-02-20 16:46:17,782 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:46:17,795 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:46:17,853 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:46:17,861 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:17,861 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:46:17,876 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.608695652173913) internal successors, (37), 24 states have internal predecessors, (37), 0 states have call successors, (0), 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:17,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:46:17,880 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:17,881 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:17,882 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:17,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:17,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1945115165, now seen corresponding path program 1 times [2022-02-20 16:46:17,902 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:17,902 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1379119074] [2022-02-20 16:46:17,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:17,904 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:17,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:17,909 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:17,910 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:17,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:17,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:46:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:17,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:18,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#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); {28#true} is VALID [2022-02-20 16:46:18,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#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_#t~short10#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~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; {28#true} is VALID [2022-02-20 16:46:18,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} assume !true; {29#false} is VALID [2022-02-20 16:46:18,045 INFO L290 TraceCheckUtils]: 3: Hoare triple {29#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); {29#false} is VALID [2022-02-20 16:46:18,045 INFO L290 TraceCheckUtils]: 4: Hoare triple {29#false} assume !~bvslt32(trunc_float_~exponent_less_127~0#1, 23bv32); {29#false} is VALID [2022-02-20 16:46:18,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#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); {29#false} is VALID [2022-02-20 16:46:18,045 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#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;main_#t~short10#1 := ~fp.eq~FLOAT(main_~res~0#1, ~Pluszero~FLOAT()); {29#false} is VALID [2022-02-20 16:46:18,046 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#false} assume !main_#t~short10#1; {29#false} is VALID [2022-02-20 16:46:18,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#false} assume !main_#t~short10#1;havoc main_#t~ret9#1;havoc main_#t~short10#1; {29#false} is VALID [2022-02-20 16:46:18,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-02-20 16:46:18,062 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:18,062 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:18,063 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:18,063 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1379119074] [2022-02-20 16:46:18,064 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1379119074] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:18,064 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:18,064 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:46:18,065 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080220923] [2022-02-20 16:46:18,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:18,070 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-02-20 16:46:18,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:18,073 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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:18,096 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:18,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:46:18,097 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:18,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:46:18,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:18,117 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.608695652173913) internal successors, (37), 24 states have internal predecessors, (37), 0 states have call successors, (0), 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 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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:18,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:18,177 INFO L93 Difference]: Finished difference Result 48 states and 72 transitions. [2022-02-20 16:46:18,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:46:18,178 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-02-20 16:46:18,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:18,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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:18,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 72 transitions. [2022-02-20 16:46:18,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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:18,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 72 transitions. [2022-02-20 16:46:18,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 72 transitions. [2022-02-20 16:46:18,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:18,286 INFO L225 Difference]: With dead ends: 48 [2022-02-20 16:46:18,287 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 16:46:18,289 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 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:18,292 INFO L933 BasicCegarLoop]: 28 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, 28 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:18,293 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 28 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:18,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 16:46:18,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 16:46:18,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:18,315 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:18,316 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:18,316 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:18,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:18,319 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-02-20 16:46:18,319 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-02-20 16:46:18,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:18,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:18,320 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 22 states. [2022-02-20 16:46:18,320 INFO L87 Difference]: Start difference. First operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 22 states. [2022-02-20 16:46:18,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:18,322 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-02-20 16:46:18,322 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-02-20 16:46:18,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:18,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:18,323 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:18,323 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:18,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:18,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-02-20 16:46:18,326 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 10 [2022-02-20 16:46:18,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:18,326 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-02-20 16:46:18,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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:18,327 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-02-20 16:46:18,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:46:18,327 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:18,327 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:18,340 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:18,541 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:18,541 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:18,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:18,542 INFO L85 PathProgramCache]: Analyzing trace with hash -390192032, now seen corresponding path program 1 times [2022-02-20 16:46:18,543 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:18,543 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [533063359] [2022-02-20 16:46:18,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:18,543 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:18,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:18,545 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:18,547 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:18,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:18,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:46:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:18,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:18,798 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:18,799 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_#t~short10#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~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#(= |ULTIMATE.start_trunc_float_~x#1| (_ +zero 8 24))} is VALID [2022-02-20 16:46:18,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {201#(= |ULTIMATE.start_trunc_float_~x#1| (_ +zero 8 24))} 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#(= (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|)) (_ +zero 8 24))} is VALID [2022-02-20 16:46:18,801 INFO L290 TraceCheckUtils]: 3: Hoare triple {205#(= (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|)) (_ +zero 8 24))} goto; {205#(= (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|)) (_ +zero 8 24))} is VALID [2022-02-20 16:46:18,803 INFO L290 TraceCheckUtils]: 4: Hoare triple {205#(= (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|)) (_ +zero 8 24))} 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|) (= (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|)) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:18,804 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|) (= (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|)) (_ +zero 8 24))))} assume !~bvslt32(trunc_float_~exponent_less_127~0#1, 23bv32); {194#false} is VALID [2022-02-20 16:46:18,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {194#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); {194#false} is VALID [2022-02-20 16:46:18,804 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;main_#t~short10#1 := ~fp.eq~FLOAT(main_~res~0#1, ~Pluszero~FLOAT()); {194#false} is VALID [2022-02-20 16:46:18,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {194#false} assume !main_#t~short10#1; {194#false} is VALID [2022-02-20 16:46:18,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {194#false} assume !main_#t~short10#1;havoc main_#t~ret9#1;havoc main_#t~short10#1; {194#false} is VALID [2022-02-20 16:46:18,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {194#false} assume !false; {194#false} is VALID [2022-02-20 16:46:18,805 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:18,806 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:18,806 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:18,806 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [533063359] [2022-02-20 16:46:18,806 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [533063359] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:18,806 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:18,806 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:46:18,807 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579054236] [2022-02-20 16:46:18,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:18,811 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-02-20 16:46:18,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:18,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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:18,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:18,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:46:18,831 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:18,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:46:18,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:18,832 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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:18,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:18,968 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-02-20 16:46:18,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:46:18,969 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-02-20 16:46:18,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:18,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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:18,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-02-20 16:46:18,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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:18,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-02-20 16:46:18,971 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2022-02-20 16:46:19,018 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:19,020 INFO L225 Difference]: With dead ends: 32 [2022-02-20 16:46:19,020 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 16:46:19,020 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:46:19,021 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:19,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 64 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 6 Unchecked, 0.0s Time] [2022-02-20 16:46:19,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 16:46:19,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-20 16:46:19,024 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:19,024 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:19,025 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:19,025 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:19,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:19,026 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-02-20 16:46:19,026 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-02-20 16:46:19,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:19,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:19,027 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:19,028 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:19,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:19,029 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-02-20 16:46:19,029 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-02-20 16:46:19,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:19,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:19,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:19,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:19,030 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:19,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-02-20 16:46:19,031 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 11 [2022-02-20 16:46:19,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:19,032 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-02-20 16:46:19,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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:19,032 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-02-20 16:46:19,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:46:19,033 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:19,033 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:19,049 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:19,243 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:19,244 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:19,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:19,244 INFO L85 PathProgramCache]: Analyzing trace with hash -2105213232, now seen corresponding path program 1 times [2022-02-20 16:46:19,245 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:19,245 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1692558469] [2022-02-20 16:46:19,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:19,245 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:19,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:19,246 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:19,250 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:19,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:19,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:46:19,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:19,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:19,460 INFO L290 TraceCheckUtils]: 0: Hoare triple {344#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); {344#true} is VALID [2022-02-20 16:46:19,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {344#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_#t~short10#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~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; {352#(= |ULTIMATE.start_trunc_float_~x#1| (_ +zero 8 24))} is VALID [2022-02-20 16:46:19,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {352#(= |ULTIMATE.start_trunc_float_~x#1| (_ +zero 8 24))} 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; {356#(= (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|)) (_ +zero 8 24))} is VALID [2022-02-20 16:46:19,464 INFO L290 TraceCheckUtils]: 3: Hoare triple {356#(= (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|)) (_ +zero 8 24))} goto; {356#(= (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|)) (_ +zero 8 24))} is VALID [2022-02-20 16:46:19,465 INFO L290 TraceCheckUtils]: 4: Hoare triple {356#(= (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|)) (_ +zero 8 24))} 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); {363#(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|) (= (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|)) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:19,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {363#(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|) (= (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|)) (_ +zero 8 24))))} assume ~bvslt32(trunc_float_~exponent_less_127~0#1, 23bv32); {363#(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|) (= (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|)) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:19,469 INFO L290 TraceCheckUtils]: 6: Hoare triple {363#(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|) (= (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|)) (_ +zero 8 24))))} assume !~bvslt32(trunc_float_~exponent_less_127~0#1, 0bv32); {345#false} is VALID [2022-02-20 16:46:19,469 INFO L290 TraceCheckUtils]: 7: Hoare triple {345#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; {345#false} is VALID [2022-02-20 16:46:19,469 INFO L290 TraceCheckUtils]: 8: Hoare triple {345#false} goto; {345#false} is VALID [2022-02-20 16:46:19,469 INFO L290 TraceCheckUtils]: 9: Hoare triple {345#false} trunc_float_#res#1 := trunc_float_~x#1; {345#false} is VALID [2022-02-20 16:46:19,470 INFO L290 TraceCheckUtils]: 10: Hoare triple {345#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;main_#t~short10#1 := ~fp.eq~FLOAT(main_~res~0#1, ~Pluszero~FLOAT()); {345#false} is VALID [2022-02-20 16:46:19,470 INFO L290 TraceCheckUtils]: 11: Hoare triple {345#false} assume !main_#t~short10#1; {345#false} is VALID [2022-02-20 16:46:19,470 INFO L290 TraceCheckUtils]: 12: Hoare triple {345#false} assume !main_#t~short10#1;havoc main_#t~ret9#1;havoc main_#t~short10#1; {345#false} is VALID [2022-02-20 16:46:19,470 INFO L290 TraceCheckUtils]: 13: Hoare triple {345#false} assume !false; {345#false} is VALID [2022-02-20 16:46:19,471 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:19,471 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:19,471 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:19,471 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1692558469] [2022-02-20 16:46:19,471 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1692558469] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:19,472 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:19,472 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:46:19,472 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092999925] [2022-02-20 16:46:19,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:19,473 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:19,473 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:19,473 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:19,490 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:19,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:46:19,491 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:19,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:46:19,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:19,492 INFO L87 Difference]: Start difference. First operand 21 states and 22 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:19,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:19,611 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2022-02-20 16:46:19,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:46:19,611 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:19,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:19,611 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:19,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-02-20 16:46:19,612 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:19,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-02-20 16:46:19,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2022-02-20 16:46:19,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:19,651 INFO L225 Difference]: With dead ends: 31 [2022-02-20 16:46:19,651 INFO L226 Difference]: Without dead ends: 19 [2022-02-20 16:46:19,651 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:46:19,652 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:19,652 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 53 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 4 Unchecked, 0.0s Time] [2022-02-20 16:46:19,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-02-20 16:46:19,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-02-20 16:46:19,656 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:19,656 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:19,658 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:19,659 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:19,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:19,660 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-02-20 16:46:19,660 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-02-20 16:46:19,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:19,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:19,661 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states. [2022-02-20 16:46:19,662 INFO L87 Difference]: Start difference. First operand has 19 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states. [2022-02-20 16:46:19,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:19,663 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-02-20 16:46:19,663 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-02-20 16:46:19,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:19,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:19,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:19,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:19,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:19,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2022-02-20 16:46:19,666 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 14 [2022-02-20 16:46:19,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:19,666 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2022-02-20 16:46:19,666 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:19,666 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-02-20 16:46:19,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:46:19,667 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:19,670 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:19,683 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:19,879 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:19,880 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:19,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:19,880 INFO L85 PathProgramCache]: Analyzing trace with hash -675711906, now seen corresponding path program 1 times [2022-02-20 16:46:19,881 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:19,881 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [492042816] [2022-02-20 16:46:19,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:19,881 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:19,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:19,883 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:19,884 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:19,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:19,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-20 16:46:19,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:19,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:20,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 16:46:20,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2022-02-20 16:46:20,227 INFO L290 TraceCheckUtils]: 0: Hoare triple {496#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); {496#true} is VALID [2022-02-20 16:46:20,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {496#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_#t~short10#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~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; {504#(= |ULTIMATE.start_trunc_float_~x#1| (_ +zero 8 24))} is VALID [2022-02-20 16:46:20,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {504#(= |ULTIMATE.start_trunc_float_~x#1| (_ +zero 8 24))} 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; {508#(exists ((|v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10|) (_ bv0 32)))) (_ +zero 8 24)) (= (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10|) (_ bv0 32)) |ULTIMATE.start_trunc_float_~w~0#1|)))} is VALID [2022-02-20 16:46:20,231 INFO L290 TraceCheckUtils]: 3: Hoare triple {508#(exists ((|v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10|) (_ bv0 32)))) (_ +zero 8 24)) (= (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10|) (_ bv0 32)) |ULTIMATE.start_trunc_float_~w~0#1|)))} goto; {508#(exists ((|v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10|) (_ bv0 32)))) (_ +zero 8 24)) (= (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10|) (_ bv0 32)) |ULTIMATE.start_trunc_float_~w~0#1|)))} is VALID [2022-02-20 16:46:20,233 INFO L290 TraceCheckUtils]: 4: Hoare triple {508#(exists ((|v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10|) (_ bv0 32)))) (_ +zero 8 24)) (= (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10|) (_ bv0 32)) |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); {515#(exists ((|v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10| (_ BitVec 32))) (and (= |ULTIMATE.start_trunc_float_~signbit~0#1| (bvand (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10|) (_ bv0 32)) (_ bv2147483648 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10|) (_ bv0 32)))) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:20,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {515#(exists ((|v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10| (_ BitVec 32))) (and (= |ULTIMATE.start_trunc_float_~signbit~0#1| (bvand (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10|) (_ bv0 32)) (_ bv2147483648 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10|) (_ bv0 32)))) (_ +zero 8 24))))} assume ~bvslt32(trunc_float_~exponent_less_127~0#1, 23bv32); {515#(exists ((|v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10| (_ BitVec 32))) (and (= |ULTIMATE.start_trunc_float_~signbit~0#1| (bvand (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10|) (_ bv0 32)) (_ bv2147483648 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10|) (_ bv0 32)))) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:20,236 INFO L290 TraceCheckUtils]: 6: Hoare triple {515#(exists ((|v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10| (_ BitVec 32))) (and (= |ULTIMATE.start_trunc_float_~signbit~0#1| (bvand (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10|) (_ bv0 32)) (_ bv2147483648 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10|) (_ bv0 32)))) (_ +zero 8 24))))} assume ~bvslt32(trunc_float_~exponent_less_127~0#1, 0bv32); {515#(exists ((|v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10| (_ BitVec 32))) (and (= |ULTIMATE.start_trunc_float_~signbit~0#1| (bvand (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10|) (_ bv0 32)) (_ bv2147483648 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10|) (_ bv0 32)))) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:20,242 INFO L290 TraceCheckUtils]: 7: Hoare triple {515#(exists ((|v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10| (_ BitVec 32))) (and (= |ULTIMATE.start_trunc_float_~signbit~0#1| (bvand (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10|) (_ bv0 32)) (_ bv2147483648 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_10|) (_ bv0 32)))) (_ +zero 8 24))))} call trunc_float_~#sf_u~0#1.base, trunc_float_~#sf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(trunc_float_~signbit~0#1, trunc_float_~#sf_u~0#1.base, trunc_float_~#sf_u~0#1.offset, 4bv32);call trunc_float_#t~mem5#1 := read~intFLOATTYPE4(trunc_float_~#sf_u~0#1.base, trunc_float_~#sf_u~0#1.offset, 4bv32);trunc_float_~x#1 := trunc_float_#t~mem5#1;havoc trunc_float_#t~mem5#1;call ULTIMATE.dealloc(trunc_float_~#sf_u~0#1.base, trunc_float_~#sf_u~0#1.offset);havoc trunc_float_~#sf_u~0#1.base, trunc_float_~#sf_u~0#1.offset; {504#(= |ULTIMATE.start_trunc_float_~x#1| (_ +zero 8 24))} is VALID [2022-02-20 16:46:20,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {504#(= |ULTIMATE.start_trunc_float_~x#1| (_ +zero 8 24))} goto; {504#(= |ULTIMATE.start_trunc_float_~x#1| (_ +zero 8 24))} is VALID [2022-02-20 16:46:20,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {504#(= |ULTIMATE.start_trunc_float_~x#1| (_ +zero 8 24))} trunc_float_#res#1 := trunc_float_~x#1; {531#(= (_ +zero 8 24) |ULTIMATE.start_trunc_float_#res#1|)} is VALID [2022-02-20 16:46:20,244 INFO L290 TraceCheckUtils]: 10: Hoare triple {531#(= (_ +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;main_#t~short10#1 := ~fp.eq~FLOAT(main_~res~0#1, ~Pluszero~FLOAT()); {535#|ULTIMATE.start_main_#t~short10#1|} is VALID [2022-02-20 16:46:20,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {535#|ULTIMATE.start_main_#t~short10#1|} assume !main_#t~short10#1; {497#false} is VALID [2022-02-20 16:46:20,244 INFO L290 TraceCheckUtils]: 12: Hoare triple {497#false} assume !main_#t~short10#1;havoc main_#t~ret9#1;havoc main_#t~short10#1; {497#false} is VALID [2022-02-20 16:46:20,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {497#false} assume !false; {497#false} is VALID [2022-02-20 16:46:20,245 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:20,245 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:20,245 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:20,245 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [492042816] [2022-02-20 16:46:20,247 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [492042816] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:20,247 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:20,247 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 16:46:20,250 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278097140] [2022-02-20 16:46:20,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:20,251 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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:20,251 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:20,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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:20,275 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:20,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:46:20,276 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:20,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:46:20,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:46:20,277 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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:20,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:20,440 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2022-02-20 16:46:20,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:46:20,440 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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:20,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:20,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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:20,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-02-20 16:46:20,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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:20,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-02-20 16:46:20,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 21 transitions. [2022-02-20 16:46:20,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:20,476 INFO L225 Difference]: With dead ends: 22 [2022-02-20 16:46:20,476 INFO L226 Difference]: Without dead ends: 19 [2022-02-20 16:46:20,476 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-02-20 16:46:20,477 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 23 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:20,477 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 41 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 15 Unchecked, 0.0s Time] [2022-02-20 16:46:20,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-02-20 16:46:20,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-02-20 16:46:20,480 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:20,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 18 states have (on average 1.0) internal successors, (18), 18 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:20,480 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 18 states have (on average 1.0) internal successors, (18), 18 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:20,481 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 18 states have (on average 1.0) internal successors, (18), 18 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:20,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:20,482 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2022-02-20 16:46:20,482 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2022-02-20 16:46:20,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:20,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:20,483 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 18 states have (on average 1.0) internal successors, (18), 18 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states. [2022-02-20 16:46:20,483 INFO L87 Difference]: Start difference. First operand has 19 states, 18 states have (on average 1.0) internal successors, (18), 18 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states. [2022-02-20 16:46:20,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:20,487 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2022-02-20 16:46:20,487 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2022-02-20 16:46:20,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:20,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:20,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:20,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:20,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.0) internal successors, (18), 18 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:20,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 18 transitions. [2022-02-20 16:46:20,488 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 18 transitions. Word has length 14 [2022-02-20 16:46:20,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:20,489 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 18 transitions. [2022-02-20 16:46:20,489 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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:20,489 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2022-02-20 16:46:20,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 16:46:20,490 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:20,490 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:20,503 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:20,699 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:20,700 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:20,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:20,700 INFO L85 PathProgramCache]: Analyzing trace with hash 438125939, now seen corresponding path program 1 times [2022-02-20 16:46:20,701 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:20,701 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1428738185] [2022-02-20 16:46:20,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:20,701 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:20,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:20,702 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:46:20,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 16:46:20,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:20,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-20 16:46:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:20,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:20,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 16:46:20,953 INFO L356 Elim1Store]: treesize reduction 19, result has 26.9 percent of original size [2022-02-20 16:46:20,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-02-20 16:46:21,248 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-02-20 16:46:21,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 30 [2022-02-20 16:46:21,491 INFO L290 TraceCheckUtils]: 0: Hoare triple {639#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); {639#true} is VALID [2022-02-20 16:46:21,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {639#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_#t~short10#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~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; {647#(= |ULTIMATE.start_trunc_float_~x#1| (_ +zero 8 24))} is VALID [2022-02-20 16:46:21,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {647#(= |ULTIMATE.start_trunc_float_~x#1| (_ +zero 8 24))} 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; {651#(exists ((|v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32)) |ULTIMATE.start_trunc_float_~w~0#1|) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32)))) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:21,498 INFO L290 TraceCheckUtils]: 3: Hoare triple {651#(exists ((|v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32)) |ULTIMATE.start_trunc_float_~w~0#1|) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32)))) (_ +zero 8 24))))} goto; {651#(exists ((|v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32)) |ULTIMATE.start_trunc_float_~w~0#1|) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32)))) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:21,505 INFO L290 TraceCheckUtils]: 4: Hoare triple {651#(exists ((|v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32)) |ULTIMATE.start_trunc_float_~w~0#1|) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32)))) (_ +zero 8 24))))} 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); {658#(exists ((|v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12| (_ BitVec 32))) (and (= |ULTIMATE.start_trunc_float_~signbit~0#1| (bvand (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32)) (_ bv2147483648 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32)))) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:21,507 INFO L290 TraceCheckUtils]: 5: Hoare triple {658#(exists ((|v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12| (_ BitVec 32))) (and (= |ULTIMATE.start_trunc_float_~signbit~0#1| (bvand (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32)) (_ bv2147483648 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32)))) (_ +zero 8 24))))} assume ~bvslt32(trunc_float_~exponent_less_127~0#1, 23bv32); {658#(exists ((|v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12| (_ BitVec 32))) (and (= |ULTIMATE.start_trunc_float_~signbit~0#1| (bvand (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32)) (_ bv2147483648 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32)))) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:21,508 INFO L290 TraceCheckUtils]: 6: Hoare triple {658#(exists ((|v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12| (_ BitVec 32))) (and (= |ULTIMATE.start_trunc_float_~signbit~0#1| (bvand (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32)) (_ bv2147483648 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32)))) (_ +zero 8 24))))} assume ~bvslt32(trunc_float_~exponent_less_127~0#1, 0bv32); {658#(exists ((|v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12| (_ BitVec 32))) (and (= |ULTIMATE.start_trunc_float_~signbit~0#1| (bvand (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32)) (_ bv2147483648 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32)))) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:21,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {658#(exists ((|v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12| (_ BitVec 32))) (and (= |ULTIMATE.start_trunc_float_~signbit~0#1| (bvand (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32)) (_ bv2147483648 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32)))) (_ +zero 8 24))))} call trunc_float_~#sf_u~0#1.base, trunc_float_~#sf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(trunc_float_~signbit~0#1, trunc_float_~#sf_u~0#1.base, trunc_float_~#sf_u~0#1.offset, 4bv32);call trunc_float_#t~mem5#1 := read~intFLOATTYPE4(trunc_float_~#sf_u~0#1.base, trunc_float_~#sf_u~0#1.offset, 4bv32);trunc_float_~x#1 := trunc_float_#t~mem5#1;havoc trunc_float_#t~mem5#1;call ULTIMATE.dealloc(trunc_float_~#sf_u~0#1.base, trunc_float_~#sf_u~0#1.offset);havoc trunc_float_~#sf_u~0#1.base, trunc_float_~#sf_u~0#1.offset; {668#(exists ((|v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8| (_ BitVec 32)) (|v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32)))) (_ +zero 8 24)) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8|) (_ bv0 32)))) |ULTIMATE.start_trunc_float_~x#1|) (= (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8|) (_ bv0 32)) (bvand (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32)) (_ bv2147483648 32)))))} is VALID [2022-02-20 16:46:21,513 INFO L290 TraceCheckUtils]: 8: Hoare triple {668#(exists ((|v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8| (_ BitVec 32)) (|v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32)))) (_ +zero 8 24)) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8|) (_ bv0 32)))) |ULTIMATE.start_trunc_float_~x#1|) (= (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8|) (_ bv0 32)) (bvand (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32)) (_ bv2147483648 32)))))} goto; {668#(exists ((|v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8| (_ BitVec 32)) (|v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32)))) (_ +zero 8 24)) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8|) (_ bv0 32)))) |ULTIMATE.start_trunc_float_~x#1|) (= (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8|) (_ bv0 32)) (bvand (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32)) (_ bv2147483648 32)))))} is VALID [2022-02-20 16:46:21,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {668#(exists ((|v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8| (_ BitVec 32)) (|v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32)))) (_ +zero 8 24)) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8|) (_ bv0 32)))) |ULTIMATE.start_trunc_float_~x#1|) (= (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8|) (_ bv0 32)) (bvand (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32)) (_ bv2147483648 32)))))} trunc_float_#res#1 := trunc_float_~x#1; {675#(exists ((|v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8| (_ BitVec 32)) (|v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32)))) (_ +zero 8 24)) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8|) (_ bv0 32)))) |ULTIMATE.start_trunc_float_#res#1|) (= (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8|) (_ bv0 32)) (bvand (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32)) (_ bv2147483648 32)))))} is VALID [2022-02-20 16:46:21,517 INFO L290 TraceCheckUtils]: 10: Hoare triple {675#(exists ((|v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8| (_ BitVec 32)) (|v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32)))) (_ +zero 8 24)) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8|) (_ bv0 32)))) |ULTIMATE.start_trunc_float_#res#1|) (= (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8|) (_ bv0 32)) (bvand (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32)) (_ bv2147483648 32)))))} 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;main_#t~short10#1 := ~fp.eq~FLOAT(main_~res~0#1, ~Pluszero~FLOAT()); {679#(exists ((|v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8| (_ BitVec 32)) (|v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32)))) (_ +zero 8 24)) (= |ULTIMATE.start_main_~res~0#1| (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8|) (_ bv0 32))))) (= (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8|) (_ bv0 32)) (bvand (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32)) (_ bv2147483648 32)))))} is VALID [2022-02-20 16:46:21,519 INFO L290 TraceCheckUtils]: 11: Hoare triple {679#(exists ((|v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8| (_ BitVec 32)) (|v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32)))) (_ +zero 8 24)) (= |ULTIMATE.start_main_~res~0#1| (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8|) (_ bv0 32))))) (= (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8|) (_ bv0 32)) (bvand (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32)) (_ bv2147483648 32)))))} assume main_#t~short10#1;assume { :begin_inline___signbit_float } true;__signbit_float_#in~x#1 := main_~res~0#1;havoc __signbit_float_#res#1;havoc __signbit_float_#t~mem7#1, __signbit_float_~#gf_u~1#1.base, __signbit_float_~#gf_u~1#1.offset, __signbit_float_~x#1, __signbit_float_~w~1#1;__signbit_float_~x#1 := __signbit_float_#in~x#1;havoc __signbit_float_~w~1#1; {683#(exists ((|v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8| (_ BitVec 32)) (|v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32)))) (_ +zero 8 24)) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8|) (_ bv0 32)))) |ULTIMATE.start___signbit_float_~x#1|) (= (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8|) (_ bv0 32)) (bvand (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32)) (_ bv2147483648 32)))))} is VALID [2022-02-20 16:46:21,523 INFO L290 TraceCheckUtils]: 12: Hoare triple {683#(exists ((|v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8| (_ BitVec 32)) (|v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32)))) (_ +zero 8 24)) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8|) (_ bv0 32)))) |ULTIMATE.start___signbit_float_~x#1|) (= (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8|) (_ bv0 32)) (bvand (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32)) (_ bv2147483648 32)))))} call __signbit_float_~#gf_u~1#1.base, __signbit_float_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__signbit_float_~x#1, __signbit_float_~#gf_u~1#1.base, __signbit_float_~#gf_u~1#1.offset, 4bv32);call __signbit_float_#t~mem7#1 := read~intINTTYPE4(__signbit_float_~#gf_u~1#1.base, __signbit_float_~#gf_u~1#1.offset, 4bv32);__signbit_float_~w~1#1 := __signbit_float_#t~mem7#1;havoc __signbit_float_#t~mem7#1;call ULTIMATE.dealloc(__signbit_float_~#gf_u~1#1.base, __signbit_float_~#gf_u~1#1.offset);havoc __signbit_float_~#gf_u~1#1.base, __signbit_float_~#gf_u~1#1.offset; {687#(exists ((v_arrayElimCell_4 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~1#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~1#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~1#1|)) (fp ((_ extract 31 31) (bvand v_arrayElimCell_4 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_4 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_4 (_ bv2147483648 32))))) (= (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:21,524 INFO L290 TraceCheckUtils]: 13: Hoare triple {687#(exists ((v_arrayElimCell_4 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~1#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~1#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~1#1|)) (fp ((_ extract 31 31) (bvand v_arrayElimCell_4 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_4 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_4 (_ bv2147483648 32))))) (= (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)) (_ +zero 8 24))))} goto; {687#(exists ((v_arrayElimCell_4 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~1#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~1#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~1#1|)) (fp ((_ extract 31 31) (bvand v_arrayElimCell_4 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_4 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_4 (_ bv2147483648 32))))) (= (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:21,526 INFO L290 TraceCheckUtils]: 14: Hoare triple {687#(exists ((v_arrayElimCell_4 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~1#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~1#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~1#1|)) (fp ((_ extract 31 31) (bvand v_arrayElimCell_4 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_4 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_4 (_ bv2147483648 32))))) (= (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)) (_ +zero 8 24))))} __signbit_float_#res#1 := (if 0bv32 != ~bvand32(2147483648bv32, __signbit_float_~w~1#1) then 1bv32 else 0bv32); {694#(exists ((|ULTIMATE.start___signbit_float_~w~1#1| (_ BitVec 32))) (and (exists ((v_arrayElimCell_4 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~1#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~1#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~1#1|)) (fp ((_ extract 31 31) (bvand v_arrayElimCell_4 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_4 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_4 (_ bv2147483648 32))))) (= (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)) (_ +zero 8 24)))) (or (and (not (= (bvand |ULTIMATE.start___signbit_float_~w~1#1| (_ bv2147483648 32)) (_ bv0 32))) (= |ULTIMATE.start___signbit_float_#res#1| (_ bv1 32))) (and (= |ULTIMATE.start___signbit_float_#res#1| (_ bv0 32)) (= (bvand |ULTIMATE.start___signbit_float_~w~1#1| (_ bv2147483648 32)) (_ bv0 32))))))} is VALID [2022-02-20 16:46:21,528 INFO L290 TraceCheckUtils]: 15: Hoare triple {694#(exists ((|ULTIMATE.start___signbit_float_~w~1#1| (_ BitVec 32))) (and (exists ((v_arrayElimCell_4 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~1#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~1#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~1#1|)) (fp ((_ extract 31 31) (bvand v_arrayElimCell_4 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_4 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_4 (_ bv2147483648 32))))) (= (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)) (_ +zero 8 24)))) (or (and (not (= (bvand |ULTIMATE.start___signbit_float_~w~1#1| (_ bv2147483648 32)) (_ bv0 32))) (= |ULTIMATE.start___signbit_float_#res#1| (_ bv1 32))) (and (= |ULTIMATE.start___signbit_float_#res#1| (_ bv0 32)) (= (bvand |ULTIMATE.start___signbit_float_~w~1#1| (_ bv2147483648 32)) (_ bv0 32))))))} main_#t~ret9#1 := __signbit_float_#res#1;assume { :end_inline___signbit_float } true;main_#t~short10#1 := 0bv32 == main_#t~ret9#1; {698#|ULTIMATE.start_main_#t~short10#1|} is VALID [2022-02-20 16:46:21,529 INFO L290 TraceCheckUtils]: 16: Hoare triple {698#|ULTIMATE.start_main_#t~short10#1|} assume !main_#t~short10#1;havoc main_#t~ret9#1;havoc main_#t~short10#1; {640#false} is VALID [2022-02-20 16:46:21,529 INFO L290 TraceCheckUtils]: 17: Hoare triple {640#false} assume !false; {640#false} is VALID [2022-02-20 16:46:21,529 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:21,529 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:21,529 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:21,529 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1428738185] [2022-02-20 16:46:21,530 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1428738185] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:21,530 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:21,530 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 16:46:21,530 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582308082] [2022-02-20 16:46:21,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:21,530 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 16:46:21,531 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:21,531 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:21,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:21,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 16:46:21,560 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:21,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 16:46:21,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-02-20 16:46:21,560 INFO L87 Difference]: Start difference. First operand 19 states and 18 transitions. Second operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:21,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:21,712 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2022-02-20 16:46:21,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 16:46:21,713 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 16:46:21,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:21,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:21,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 18 transitions. [2022-02-20 16:46:21,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:21,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 18 transitions. [2022-02-20 16:46:21,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 18 transitions. [2022-02-20 16:46:21,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:21,757 INFO L225 Difference]: With dead ends: 19 [2022-02-20 16:46:21,757 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:46:21,758 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-02-20 16:46:21,758 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 4 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:21,759 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 53 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 25 Unchecked, 0.0s Time] [2022-02-20 16:46:21,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:46:21,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:46:21,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:21,760 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:21,760 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:21,760 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:21,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:21,760 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:46:21,760 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:21,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:21,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:21,760 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:21,760 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:21,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:21,761 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:46:21,761 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:21,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:21,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:21,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:21,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:21,761 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:21,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:46:21,761 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2022-02-20 16:46:21,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:21,762 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:46:21,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:21,762 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:21,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:21,764 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:46:21,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:21,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:46:21,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:46:22,042 INFO L858 garLoopResultBuilder]: For program point L23(lines 23 41) no Hoare annotation was computed. [2022-02-20 16:46:22,042 INFO L858 garLoopResultBuilder]: For program point L23-1(lines 23 41) no Hoare annotation was computed. [2022-02-20 16:46:22,042 INFO L858 garLoopResultBuilder]: For program point L48-1(lines 48 52) no Hoare annotation was computed. [2022-02-20 16:46:22,043 INFO L854 garLoopResultBuilder]: At program point L48-2(lines 48 52) the Hoare annotation is: (and (= (_ +zero 8 24) |ULTIMATE.start_trunc_float_#res#1|) |ULTIMATE.start_main_#t~short10#1| (exists ((|v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8| (_ BitVec 32)) (|v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12| (_ BitVec 32))) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8|) (_ bv0 32))) (.cse0 (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32)))) (and (= (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)) (_ +zero 8 24)) (= (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)) |ULTIMATE.start___signbit_float_~x#1|) (= .cse1 (bvand .cse0 (_ bv2147483648 32)))))) (= |ULTIMATE.start_trunc_float_~x#1| (_ +zero 8 24))) [2022-02-20 16:46:22,043 INFO L858 garLoopResultBuilder]: For program point L48-3(lines 48 52) no Hoare annotation was computed. [2022-02-20 16:46:22,043 INFO L861 garLoopResultBuilder]: At program point L73(lines 57 74) the Hoare annotation is: true [2022-02-20 16:46:22,043 INFO L858 garLoopResultBuilder]: For program point L69(line 69) no Hoare annotation was computed. [2022-02-20 16:46:22,043 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:46:22,043 INFO L858 garLoopResultBuilder]: For program point L32-1(lines 32 36) no Hoare annotation was computed. [2022-02-20 16:46:22,043 INFO L854 garLoopResultBuilder]: At program point L32-2(lines 32 36) the Hoare annotation is: false [2022-02-20 16:46:22,044 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:46:22,044 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:46:22,044 INFO L858 garLoopResultBuilder]: For program point L24(lines 24 37) no Hoare annotation was computed. [2022-02-20 16:46:22,044 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 69) no Hoare annotation was computed. [2022-02-20 16:46:22,044 INFO L858 garLoopResultBuilder]: For program point L16-1(lines 16 20) no Hoare annotation was computed. [2022-02-20 16:46:22,044 INFO L854 garLoopResultBuilder]: At program point L16-2(lines 16 20) the Hoare annotation is: (= |ULTIMATE.start_trunc_float_~x#1| (_ +zero 8 24)) [2022-02-20 16:46:22,044 INFO L858 garLoopResultBuilder]: For program point L16-3(lines 16 20) no Hoare annotation was computed. [2022-02-20 16:46:22,044 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:46:22,044 INFO L854 garLoopResultBuilder]: At program point L54(lines 45 55) the Hoare annotation is: (and (= (_ +zero 8 24) |ULTIMATE.start_trunc_float_#res#1|) (exists ((|ULTIMATE.start___signbit_float_~w~1#1| (_ BitVec 32))) (and (exists ((v_arrayElimCell_4 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~1#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~1#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~1#1|)) (let ((.cse0 (bvand v_arrayElimCell_4 (_ bv2147483648 32)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (= (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)) (_ +zero 8 24)))) (let ((.cse1 (= (bvand |ULTIMATE.start___signbit_float_~w~1#1| (_ bv2147483648 32)) (_ bv0 32)))) (or (and (not .cse1) (= |ULTIMATE.start___signbit_float_#res#1| (_ bv1 32))) (and (= |ULTIMATE.start___signbit_float_#res#1| (_ bv0 32)) .cse1))))) |ULTIMATE.start_main_#t~short10#1| (= |ULTIMATE.start_trunc_float_~x#1| (_ +zero 8 24))) [2022-02-20 16:46:22,045 INFO L854 garLoopResultBuilder]: At program point L42(lines 14 43) the Hoare annotation is: (and (exists ((|v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8| (_ BitVec 32)) (|v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12| (_ BitVec 32))) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8|) (_ bv0 32))) (.cse0 (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32)))) (and (= (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)) (_ +zero 8 24)) (= (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)) |ULTIMATE.start_trunc_float_#res#1|) (= .cse1 (bvand .cse0 (_ bv2147483648 32)))))) (= |ULTIMATE.start_trunc_float_~x#1| (_ +zero 8 24))) [2022-02-20 16:46:22,045 INFO L858 garLoopResultBuilder]: For program point L26-1(lines 26 30) no Hoare annotation was computed. [2022-02-20 16:46:22,045 INFO L854 garLoopResultBuilder]: At program point L26-2(lines 26 30) the Hoare annotation is: (exists ((|v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12| (_ BitVec 32))) (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12|) (_ bv0 32)))) (and (= |ULTIMATE.start_trunc_float_~signbit~0#1| (bvand .cse0 (_ bv2147483648 32))) (= (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)) (_ +zero 8 24))))) [2022-02-20 16:46:22,045 INFO L858 garLoopResultBuilder]: For program point L39(lines 39 40) no Hoare annotation was computed. [2022-02-20 16:46:22,045 INFO L858 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2022-02-20 16:46:22,045 INFO L858 garLoopResultBuilder]: For program point L68-2(lines 68 71) no Hoare annotation was computed. [2022-02-20 16:46:22,048 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-02-20 16:46:22,049 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:46:22,052 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:46:22,053 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:46:22,053 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2022-02-20 16:46:22,053 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2022-02-20 16:46:22,053 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2022-02-20 16:46:22,053 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2022-02-20 16:46:22,053 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2022-02-20 16:46:22,053 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-02-20 16:46:22,053 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-02-20 16:46:22,054 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-02-20 16:46:22,054 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-02-20 16:46:22,054 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 16:46:22,054 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 16:46:22,054 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-02-20 16:46:22,054 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2022-02-20 16:46:22,054 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2022-02-20 16:46:22,054 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2022-02-20 16:46:22,054 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-02-20 16:46:22,055 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2022-02-20 16:46:22,055 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-02-20 16:46:22,055 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-02-20 16:46:22,055 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2022-02-20 16:46:22,055 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2022-02-20 16:46:22,055 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-02-20 16:46:22,055 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-02-20 16:46:22,055 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-02-20 16:46:22,055 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2022-02-20 16:46:22,055 WARN L170 areAnnotationChecker]: L68-2 has no Hoare annotation [2022-02-20 16:46:22,056 WARN L170 areAnnotationChecker]: L68-2 has no Hoare annotation [2022-02-20 16:46:22,056 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-02-20 16:46:22,056 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-02-20 16:46:22,056 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2022-02-20 16:46:22,056 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:46:22,056 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:46:22,056 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:22,056 WARN L170 areAnnotationChecker]: L68-2 has no Hoare annotation [2022-02-20 16:46:22,056 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:22,057 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:22,062 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:22,063 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:22,063 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:22,063 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,063 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,063 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,064 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,064 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,064 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,064 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:22,064 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:22,067 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:22,067 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:22,067 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:22,067 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,068 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,068 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,068 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,068 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,068 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,068 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:22,069 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:22,070 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] [2022-02-20 16:46:22,070 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] [2022-02-20 16:46:22,070 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] [2022-02-20 16:46:22,071 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] [2022-02-20 16:46:22,071 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] [2022-02-20 16:46:22,071 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] [2022-02-20 16:46:22,071 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] [2022-02-20 16:46:22,071 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] [2022-02-20 16:46:22,072 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] [2022-02-20 16:46:22,073 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] [2022-02-20 16:46:22,073 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] [2022-02-20 16:46:22,073 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] [2022-02-20 16:46:22,073 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] [2022-02-20 16:46:22,073 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] [2022-02-20 16:46:22,073 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] [2022-02-20 16:46:22,074 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] [2022-02-20 16:46:22,075 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] [2022-02-20 16:46:22,075 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] [2022-02-20 16:46:22,075 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] [2022-02-20 16:46:22,075 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] [2022-02-20 16:46:22,076 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] [2022-02-20 16:46:22,076 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] [2022-02-20 16:46:22,076 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] [2022-02-20 16:46:22,077 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] [2022-02-20 16:46:22,078 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] [2022-02-20 16:46:22,078 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] [2022-02-20 16:46:22,078 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] [2022-02-20 16:46:22,078 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] [2022-02-20 16:46:22,078 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] [2022-02-20 16:46:22,079 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] [2022-02-20 16:46:22,079 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] [2022-02-20 16:46:22,079 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] [2022-02-20 16:46:22,079 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] [2022-02-20 16:46:22,080 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] [2022-02-20 16:46:22,080 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] [2022-02-20 16:46:22,080 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] [2022-02-20 16:46:22,080 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] [2022-02-20 16:46:22,080 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] [2022-02-20 16:46:22,080 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] [2022-02-20 16:46:22,081 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] [2022-02-20 16:46:22,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:46:22 BoogieIcfgContainer [2022-02-20 16:46:22,082 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:46:22,082 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:46:22,082 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:46:22,082 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:46:22,083 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:17" (3/4) ... [2022-02-20 16:46:22,085 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:46:22,094 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-02-20 16:46:22,094 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-02-20 16:46:22,094 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:46:22,094 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:46:22,115 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12 : bv32 :: signbit == ~bvand32(unknown-#memory_int-unknown[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12][0bv32], 2147483648bv32) && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12][0bv32][22:0]) == ~Pluszero~LONGDOUBLE()) [2022-02-20 16:46:22,116 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8 : bv32, v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12 : bv32 :: (~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12][0bv32][22:0]) == ~Pluszero~LONGDOUBLE() && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8][0bv32][22:0]) == \result) && unknown-#memory_int-unknown[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8][0bv32] == ~bvand32(unknown-#memory_int-unknown[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12][0bv32], 2147483648bv32)) && x == ~Pluszero~LONGDOUBLE() [2022-02-20 16:46:22,116 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((~Pluszero~LONGDOUBLE() == \result && aux-res == 0.0f && __signbit_float(res) == 0-aux) && (\exists v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8 : bv32, v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12 : bv32 :: (~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12][0bv32][22:0]) == ~Pluszero~LONGDOUBLE() && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8][0bv32][22:0]) == x) && unknown-#memory_int-unknown[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8][0bv32] == ~bvand32(unknown-#memory_int-unknown[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12][0bv32], 2147483648bv32))) && x == ~Pluszero~LONGDOUBLE() [2022-02-20 16:46:22,116 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((~Pluszero~LONGDOUBLE() == \result && (\exists ULTIMATE.start___signbit_float_~w~1#1 : bv32 :: (\exists v_arrayElimCell_4 : bv32 :: ~fp~LONGDOUBLE(ULTIMATE.start___signbit_float_~w~1#1[31:31], ULTIMATE.start___signbit_float_~w~1#1[30:23], ULTIMATE.start___signbit_float_~w~1#1[22:0]) == ~fp~LONGDOUBLE(~bvand32(v_arrayElimCell_4, 2147483648bv32)[31:31], ~bvand32(v_arrayElimCell_4, 2147483648bv32)[30:23], ~bvand32(v_arrayElimCell_4, 2147483648bv32)[22:0]) && ~fp~LONGDOUBLE(v_arrayElimCell_4[31:31], v_arrayElimCell_4[30:23], v_arrayElimCell_4[22:0]) == ~Pluszero~LONGDOUBLE()) && ((!(~bvand32(ULTIMATE.start___signbit_float_~w~1#1, 2147483648bv32) == 0bv32) && \result == 1bv32) || (\result == 0bv32 && ~bvand32(ULTIMATE.start___signbit_float_~w~1#1, 2147483648bv32) == 0bv32)))) && aux-res == 0.0f && __signbit_float(res) == 0-aux) && x == ~Pluszero~LONGDOUBLE() [2022-02-20 16:46:22,124 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:46:22,124 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:46:22,125 INFO L158 Benchmark]: Toolchain (without parser) took 5205.95ms. Allocated memory was 54.5MB in the beginning and 83.9MB in the end (delta: 29.4MB). Free memory was 33.1MB in the beginning and 54.2MB in the end (delta: -21.1MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2022-02-20 16:46:22,126 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 54.5MB. Free memory was 36.4MB in the beginning and 36.3MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:22,126 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.51ms. Allocated memory is still 54.5MB. Free memory was 32.9MB in the beginning and 35.9MB in the end (delta: -3.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 16:46:22,126 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.59ms. Allocated memory is still 54.5MB. Free memory was 35.9MB in the beginning and 34.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:22,126 INFO L158 Benchmark]: Boogie Preprocessor took 66.14ms. Allocated memory is still 54.5MB. Free memory was 34.0MB in the beginning and 32.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:22,127 INFO L158 Benchmark]: RCFGBuilder took 453.71ms. Allocated memory was 54.5MB in the beginning and 69.2MB in the end (delta: 14.7MB). Free memory was 32.2MB in the beginning and 47.0MB in the end (delta: -14.8MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. [2022-02-20 16:46:22,127 INFO L158 Benchmark]: TraceAbstraction took 4309.59ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 46.5MB in the beginning and 57.7MB in the end (delta: -11.2MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. [2022-02-20 16:46:22,127 INFO L158 Benchmark]: Witness Printer took 42.39ms. Allocated memory is still 83.9MB. Free memory was 57.7MB in the beginning and 54.2MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:46:22,129 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.28ms. Allocated memory is still 54.5MB. Free memory was 36.4MB in the beginning and 36.3MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.51ms. Allocated memory is still 54.5MB. Free memory was 32.9MB in the beginning and 35.9MB in the end (delta: -3.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.59ms. Allocated memory is still 54.5MB. Free memory was 35.9MB in the beginning and 34.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.14ms. Allocated memory is still 54.5MB. Free memory was 34.0MB in the beginning and 32.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 453.71ms. Allocated memory was 54.5MB in the beginning and 69.2MB in the end (delta: 14.7MB). Free memory was 32.2MB in the beginning and 47.0MB in the end (delta: -14.8MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. * TraceAbstraction took 4309.59ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 46.5MB in the beginning and 57.7MB in the end (delta: -11.2MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. * Witness Printer took 42.39ms. Allocated memory is still 83.9MB. Free memory was 57.7MB in the beginning and 54.2MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,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, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 35 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 35 mSDsluCounter, 239 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 50 IncrementalHoareTripleChecker+Unchecked, 158 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26 IncrementalHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 81 mSDtfsCounter, 26 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 13 NumberOfFragments, 225 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 36 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 67 NumberOfCodeBlocks, 67 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 62 ConstructedInterpolants, 21 QuantifiedInterpolants, 862 SizeOfPredicates, 35 NumberOfNonLiveVariables, 247 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 45]: Loop Invariant [2022-02-20 16:46:22,142 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:22,143 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:22,143 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:22,143 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,143 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,143 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,143 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,144 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,144 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,144 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:22,144 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:22,145 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:22,145 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:22,145 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:22,145 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,145 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,145 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,146 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,146 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,146 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,146 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:22,146 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] Derived loop invariant: ((~Pluszero~LONGDOUBLE() == \result && (\exists ULTIMATE.start___signbit_float_~w~1#1 : bv32 :: (\exists v_arrayElimCell_4 : bv32 :: ~fp~LONGDOUBLE(ULTIMATE.start___signbit_float_~w~1#1[31:31], ULTIMATE.start___signbit_float_~w~1#1[30:23], ULTIMATE.start___signbit_float_~w~1#1[22:0]) == ~fp~LONGDOUBLE(~bvand32(v_arrayElimCell_4, 2147483648bv32)[31:31], ~bvand32(v_arrayElimCell_4, 2147483648bv32)[30:23], ~bvand32(v_arrayElimCell_4, 2147483648bv32)[22:0]) && ~fp~LONGDOUBLE(v_arrayElimCell_4[31:31], v_arrayElimCell_4[30:23], v_arrayElimCell_4[22:0]) == ~Pluszero~LONGDOUBLE()) && ((!(~bvand32(ULTIMATE.start___signbit_float_~w~1#1, 2147483648bv32) == 0bv32) && \result == 1bv32) || (\result == 0bv32 && ~bvand32(ULTIMATE.start___signbit_float_~w~1#1, 2147483648bv32) == 0bv32)))) && aux-res == 0.0f && __signbit_float(res) == 0-aux) && x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 48]: Loop Invariant [2022-02-20 16:46:22,147 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] [2022-02-20 16:46:22,147 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] [2022-02-20 16:46:22,147 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] [2022-02-20 16:46:22,147 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] [2022-02-20 16:46:22,147 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] [2022-02-20 16:46:22,148 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] [2022-02-20 16:46:22,148 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] [2022-02-20 16:46:22,148 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] [2022-02-20 16:46:22,148 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] [2022-02-20 16:46:22,149 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] [2022-02-20 16:46:22,149 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] [2022-02-20 16:46:22,149 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] [2022-02-20 16:46:22,149 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] [2022-02-20 16:46:22,149 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] [2022-02-20 16:46:22,149 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] [2022-02-20 16:46:22,150 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] Derived loop invariant: ((~Pluszero~LONGDOUBLE() == \result && aux-res == 0.0f && __signbit_float(res) == 0-aux) && (\exists v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8 : bv32, v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12 : bv32 :: (~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12][0bv32][22:0]) == ~Pluszero~LONGDOUBLE() && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8][0bv32][22:0]) == x) && unknown-#memory_int-unknown[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8][0bv32] == ~bvand32(unknown-#memory_int-unknown[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12][0bv32], 2147483648bv32))) && x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 26]: Loop Invariant [2022-02-20 16:46:22,150 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] [2022-02-20 16:46:22,150 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] [2022-02-20 16:46:22,151 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] [2022-02-20 16:46:22,151 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] [2022-02-20 16:46:22,151 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] [2022-02-20 16:46:22,151 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] [2022-02-20 16:46:22,151 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] [2022-02-20 16:46:22,152 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] Derived loop invariant: (\exists v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12 : bv32 :: signbit == ~bvand32(unknown-#memory_int-unknown[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12][0bv32], 2147483648bv32) && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12][0bv32][22:0]) == ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 14]: Loop Invariant [2022-02-20 16:46:22,152 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] [2022-02-20 16:46:22,153 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] [2022-02-20 16:46:22,153 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] [2022-02-20 16:46:22,153 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] [2022-02-20 16:46:22,153 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] [2022-02-20 16:46:22,153 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] [2022-02-20 16:46:22,153 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] [2022-02-20 16:46:22,154 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] [2022-02-20 16:46:22,154 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] [2022-02-20 16:46:22,154 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] [2022-02-20 16:46:22,154 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] [2022-02-20 16:46:22,155 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] [2022-02-20 16:46:22,155 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] [2022-02-20 16:46:22,155 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] [2022-02-20 16:46:22,155 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8,QUANTIFIED] [2022-02-20 16:46:22,155 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12,QUANTIFIED] Derived loop invariant: (\exists v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8 : bv32, v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12 : bv32 :: (~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12][0bv32][22:0]) == ~Pluszero~LONGDOUBLE() && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8][0bv32][22:0]) == \result) && unknown-#memory_int-unknown[v_ULTIMATE.start_trunc_float_~#sf_u~0#1.base_8][0bv32] == ~bvand32(unknown-#memory_int-unknown[v_ULTIMATE.start_trunc_float_~#gf_u~0#1.base_12][0bv32], 2147483648bv32)) && x == ~Pluszero~LONGDOUBLE() RESULT: Ultimate proved your program to be correct! [2022-02-20 16:46:22,189 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