./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_2.c.cil.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows 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/bitvector/soft_float_2.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 31f10835cae624a55ab7ddafebce266aec4d698d20be3ba19631eaedd9136bff --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:09:46,678 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:09:46,680 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:09:46,707 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:09:46,708 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:09:46,710 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:09:46,712 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:09:46,716 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:09:46,718 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:09:46,722 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:09:46,723 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:09:46,724 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:09:46,724 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:09:46,726 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:09:46,727 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:09:46,728 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:09:46,728 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:09:46,729 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:09:46,729 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:09:46,730 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:09:46,731 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:09:46,732 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:09:46,732 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:09:46,733 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:09:46,735 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:09:46,735 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:09:46,735 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:09:46,736 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:09:46,736 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:09:46,736 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:09:46,737 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:09:46,737 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:09:46,738 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:09:46,739 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:09:46,740 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:09:46,740 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:09:46,741 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:09:46,741 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:09:46,742 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:09:46,742 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:09:46,743 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:09:46,743 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-02-21 03:09:46,778 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:09:46,779 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:09:46,779 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:09:46,780 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:09:46,781 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:09:46,781 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:09:46,781 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:09:46,782 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:09:46,782 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:09:46,782 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:09:46,783 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:09:46,783 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:09:46,783 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:09:46,783 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:09:46,783 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:09:46,783 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:09:46,783 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:09:46,784 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:09:46,784 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:09:46,784 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:09:46,784 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:09:46,784 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:09:46,784 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:09:46,785 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:09:46,785 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:09:46,785 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:09:46,785 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:09:46,785 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:09:46,785 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:09:46,785 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:09:46,786 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:09:46,786 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:09:46,786 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:09:46,786 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 ! overflow) ) 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 -> 31f10835cae624a55ab7ddafebce266aec4d698d20be3ba19631eaedd9136bff [2022-02-21 03:09:46,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:09:47,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:09:47,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:09:47,017 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:09:47,017 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:09:47,018 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_2.c.cil.c [2022-02-21 03:09:47,083 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea1f886d1/92c13bf444fa42c688c7cfd30101bbd8/FLAG955408728 [2022-02-21 03:09:47,445 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:09:47,449 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_2.c.cil.c [2022-02-21 03:09:47,464 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea1f886d1/92c13bf444fa42c688c7cfd30101bbd8/FLAG955408728 [2022-02-21 03:09:47,476 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea1f886d1/92c13bf444fa42c688c7cfd30101bbd8 [2022-02-21 03:09:47,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:09:47,481 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:09:47,482 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:09:47,483 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:09:47,485 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:09:47,486 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:09:47" (1/1) ... [2022-02-21 03:09:47,487 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bd79385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:09:47, skipping insertion in model container [2022-02-21 03:09:47,488 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:09:47" (1/1) ... [2022-02-21 03:09:47,492 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:09:47,520 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:09:47,645 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/bitvector/soft_float_2.c.cil.c[727,740] [2022-02-21 03:09:47,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:09:47,715 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:09:47,723 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/bitvector/soft_float_2.c.cil.c[727,740] [2022-02-21 03:09:47,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:09:47,786 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:09:47,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:09:47 WrapperNode [2022-02-21 03:09:47,787 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:09:47,788 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:09:47,788 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:09:47,788 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:09:47,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:09:47" (1/1) ... [2022-02-21 03:09:47,804 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:09:47" (1/1) ... [2022-02-21 03:09:47,840 INFO L137 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 196 [2022-02-21 03:09:47,840 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:09:47,841 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:09:47,841 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:09:47,841 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:09:47,853 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:09:47" (1/1) ... [2022-02-21 03:09:47,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:09:47" (1/1) ... [2022-02-21 03:09:47,858 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:09:47" (1/1) ... [2022-02-21 03:09:47,859 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:09:47" (1/1) ... [2022-02-21 03:09:47,866 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:09:47" (1/1) ... [2022-02-21 03:09:47,873 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:09:47" (1/1) ... [2022-02-21 03:09:47,874 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:09:47" (1/1) ... [2022-02-21 03:09:47,876 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:09:47,877 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:09:47,877 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:09:47,877 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:09:47,878 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:09:47" (1/1) ... [2022-02-21 03:09:47,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:09:47,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:09:47,905 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-21 03:09:47,911 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-21 03:09:47,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:09:47,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:09:47,932 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-02-21 03:09:47,932 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-02-21 03:09:47,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:09:47,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:09:47,935 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-21 03:09:47,935 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-21 03:09:47,985 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:09:47,986 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:09:48,486 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:09:48,495 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:09:48,496 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:09:48,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:09:48 BoogieIcfgContainer [2022-02-21 03:09:48,497 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:09:48,499 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:09:48,499 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:09:48,501 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:09:48,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:09:47" (1/3) ... [2022-02-21 03:09:48,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3adc60f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:09:48, skipping insertion in model container [2022-02-21 03:09:48,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:09:47" (2/3) ... [2022-02-21 03:09:48,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3adc60f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:09:48, skipping insertion in model container [2022-02-21 03:09:48,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:09:48" (3/3) ... [2022-02-21 03:09:48,504 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_2.c.cil.c [2022-02-21 03:09:48,508 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:09:48,508 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-02-21 03:09:48,545 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:09:48,549 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-21 03:09:48,553 INFO L340 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2022-02-21 03:09:48,571 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 106 states have (on average 1.8018867924528301) internal successors, (191), 137 states have internal predecessors, (191), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:48,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-21 03:09:48,575 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:09:48,575 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:09:48,576 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-02-21 03:09:48,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:09:48,584 INFO L85 PathProgramCache]: Analyzing trace with hash 147391961, now seen corresponding path program 1 times [2022-02-21 03:09:48,591 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:09:48,592 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892190770] [2022-02-21 03:09:48,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:48,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:09:48,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:48,695 INFO L290 TraceCheckUtils]: 0: Hoare triple {147#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); {147#true} is VALID [2022-02-21 03:09:48,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {147#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {147#true} is VALID [2022-02-21 03:09:48,696 INFO L272 TraceCheckUtils]: 2: Hoare triple {147#true} call main_#t~ret22#1 := base2flt(0, 0); {147#true} is VALID [2022-02-21 03:09:48,696 INFO L290 TraceCheckUtils]: 3: Hoare triple {147#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {147#true} is VALID [2022-02-21 03:09:48,696 INFO L290 TraceCheckUtils]: 4: Hoare triple {147#true} assume !(0 == ~m % 4294967296); {147#true} is VALID [2022-02-21 03:09:48,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {147#true} assume !(~m % 4294967296 < 16777216); {147#true} is VALID [2022-02-21 03:09:48,697 INFO L290 TraceCheckUtils]: 6: Hoare triple {147#true} assume !true; {148#false} is VALID [2022-02-21 03:09:48,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {148#false} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {148#false} is VALID [2022-02-21 03:09:48,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {148#false} assume !(128 + ~e <= 2147483647); {148#false} is VALID [2022-02-21 03:09:48,698 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-21 03:09:48,699 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:09:48,699 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892190770] [2022-02-21 03:09:48,699 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892190770] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:09:48,700 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:09:48,700 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:09:48,701 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308367560] [2022-02-21 03:09:48,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:09:48,704 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-21 03:09:48,705 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:09:48,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:09:48,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:48,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-21 03:09:48,716 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:09:48,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 03:09:48,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 03:09:48,733 INFO L87 Difference]: Start difference. First operand has 144 states, 106 states have (on average 1.8018867924528301) internal successors, (191), 137 states have internal predecessors, (191), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:09:48,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:48,886 INFO L93 Difference]: Finished difference Result 283 states and 403 transitions. [2022-02-21 03:09:48,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 03:09:48,886 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-21 03:09:48,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:09:48,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:09:48,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 403 transitions. [2022-02-21 03:09:48,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:09:48,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 403 transitions. [2022-02-21 03:09:48,902 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 403 transitions. [2022-02-21 03:09:49,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 403 edges. 403 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:49,158 INFO L225 Difference]: With dead ends: 283 [2022-02-21 03:09:49,158 INFO L226 Difference]: Without dead ends: 121 [2022-02-21 03:09:49,162 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-21 03:09:49,164 INFO L933 BasicCegarLoop]: 184 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, 184 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-21 03:09:49,165 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:09:49,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-02-21 03:09:49,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-02-21 03:09:49,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:09:49,206 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand has 121 states, 88 states have (on average 1.625) internal successors, (143), 115 states have internal predecessors, (143), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:09:49,207 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand has 121 states, 88 states have (on average 1.625) internal successors, (143), 115 states have internal predecessors, (143), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:09:49,208 INFO L87 Difference]: Start difference. First operand 121 states. Second operand has 121 states, 88 states have (on average 1.625) internal successors, (143), 115 states have internal predecessors, (143), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:09:49,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:49,214 INFO L93 Difference]: Finished difference Result 121 states and 151 transitions. [2022-02-21 03:09:49,214 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 151 transitions. [2022-02-21 03:09:49,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:49,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:49,216 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 88 states have (on average 1.625) internal successors, (143), 115 states have internal predecessors, (143), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 121 states. [2022-02-21 03:09:49,217 INFO L87 Difference]: Start difference. First operand has 121 states, 88 states have (on average 1.625) internal successors, (143), 115 states have internal predecessors, (143), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 121 states. [2022-02-21 03:09:49,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:49,222 INFO L93 Difference]: Finished difference Result 121 states and 151 transitions. [2022-02-21 03:09:49,222 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 151 transitions. [2022-02-21 03:09:49,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:49,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:49,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:09:49,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:09:49,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 88 states have (on average 1.625) internal successors, (143), 115 states have internal predecessors, (143), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:09:49,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 151 transitions. [2022-02-21 03:09:49,229 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 151 transitions. Word has length 9 [2022-02-21 03:09:49,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:09:49,229 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 151 transitions. [2022-02-21 03:09:49,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:09:49,230 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 151 transitions. [2022-02-21 03:09:49,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-21 03:09:49,230 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:09:49,231 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:09:49,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:09:49,231 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-02-21 03:09:49,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:09:49,232 INFO L85 PathProgramCache]: Analyzing trace with hash 146450613, now seen corresponding path program 1 times [2022-02-21 03:09:49,232 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:09:49,232 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422075778] [2022-02-21 03:09:49,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:49,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:09:49,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:49,279 INFO L290 TraceCheckUtils]: 0: Hoare triple {833#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); {833#true} is VALID [2022-02-21 03:09:49,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {833#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {833#true} is VALID [2022-02-21 03:09:49,280 INFO L272 TraceCheckUtils]: 2: Hoare triple {833#true} call main_#t~ret22#1 := base2flt(0, 0); {835#(= |base2flt_#in~e| 0)} is VALID [2022-02-21 03:09:49,280 INFO L290 TraceCheckUtils]: 3: Hoare triple {835#(= |base2flt_#in~e| 0)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {836#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:49,281 INFO L290 TraceCheckUtils]: 4: Hoare triple {836#(= base2flt_~e 0)} assume !(0 == ~m % 4294967296); {836#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:49,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {836#(= base2flt_~e 0)} assume ~m % 4294967296 < 16777216; {836#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:49,282 INFO L290 TraceCheckUtils]: 6: Hoare triple {836#(= base2flt_~e 0)} assume !false; {836#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:49,282 INFO L290 TraceCheckUtils]: 7: Hoare triple {836#(= base2flt_~e 0)} assume !(~e <= -128); {836#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:49,283 INFO L290 TraceCheckUtils]: 8: Hoare triple {836#(= base2flt_~e 0)} assume !(~e - 1 <= 2147483647); {834#false} is VALID [2022-02-21 03:09:49,283 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-21 03:09:49,283 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:09:49,283 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422075778] [2022-02-21 03:09:49,284 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422075778] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:09:49,284 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:09:49,284 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:09:49,284 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082259326] [2022-02-21 03:09:49,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:09:49,285 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-21 03:09:49,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:09:49,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:09:49,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:49,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:09:49,294 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:09:49,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:09:49,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:09:49,295 INFO L87 Difference]: Start difference. First operand 121 states and 151 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:09:49,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:49,580 INFO L93 Difference]: Finished difference Result 304 states and 392 transitions. [2022-02-21 03:09:49,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:09:49,581 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-21 03:09:49,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:09:49,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:09:49,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 392 transitions. [2022-02-21 03:09:49,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:09:49,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 392 transitions. [2022-02-21 03:09:49,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 392 transitions. [2022-02-21 03:09:49,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 392 edges. 392 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:49,874 INFO L225 Difference]: With dead ends: 304 [2022-02-21 03:09:49,874 INFO L226 Difference]: Without dead ends: 186 [2022-02-21 03:09:49,875 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-21 03:09:49,876 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 100 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:09:49,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 395 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:09:49,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-02-21 03:09:49,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 170. [2022-02-21 03:09:49,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:09:49,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand has 170 states, 136 states have (on average 1.6323529411764706) internal successors, (222), 163 states have internal predecessors, (222), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:09:49,888 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand has 170 states, 136 states have (on average 1.6323529411764706) internal successors, (222), 163 states have internal predecessors, (222), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:09:49,888 INFO L87 Difference]: Start difference. First operand 186 states. Second operand has 170 states, 136 states have (on average 1.6323529411764706) internal successors, (222), 163 states have internal predecessors, (222), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:09:49,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:49,893 INFO L93 Difference]: Finished difference Result 186 states and 234 transitions. [2022-02-21 03:09:49,893 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 234 transitions. [2022-02-21 03:09:49,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:49,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:49,895 INFO L74 IsIncluded]: Start isIncluded. First operand has 170 states, 136 states have (on average 1.6323529411764706) internal successors, (222), 163 states have internal predecessors, (222), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 186 states. [2022-02-21 03:09:49,896 INFO L87 Difference]: Start difference. First operand has 170 states, 136 states have (on average 1.6323529411764706) internal successors, (222), 163 states have internal predecessors, (222), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 186 states. [2022-02-21 03:09:49,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:49,901 INFO L93 Difference]: Finished difference Result 186 states and 234 transitions. [2022-02-21 03:09:49,901 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 234 transitions. [2022-02-21 03:09:49,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:49,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:49,902 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:09:49,902 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:09:49,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 136 states have (on average 1.6323529411764706) internal successors, (222), 163 states have internal predecessors, (222), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:09:49,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 230 transitions. [2022-02-21 03:09:49,907 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 230 transitions. Word has length 9 [2022-02-21 03:09:49,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:09:49,907 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 230 transitions. [2022-02-21 03:09:49,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:09:49,907 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 230 transitions. [2022-02-21 03:09:49,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-21 03:09:49,908 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:09:49,908 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:09:49,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 03:09:49,908 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-02-21 03:09:49,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:09:49,908 INFO L85 PathProgramCache]: Analyzing trace with hash 966754998, now seen corresponding path program 1 times [2022-02-21 03:09:49,909 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:09:49,909 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847856806] [2022-02-21 03:09:49,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:49,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:09:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:49,981 INFO L290 TraceCheckUtils]: 0: Hoare triple {1730#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); {1730#true} is VALID [2022-02-21 03:09:49,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {1730#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {1730#true} is VALID [2022-02-21 03:09:49,982 INFO L272 TraceCheckUtils]: 2: Hoare triple {1730#true} call main_#t~ret22#1 := base2flt(0, 0); {1732#(= |base2flt_#in~m| 0)} is VALID [2022-02-21 03:09:49,982 INFO L290 TraceCheckUtils]: 3: Hoare triple {1732#(= |base2flt_#in~m| 0)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {1733#(= base2flt_~m 0)} is VALID [2022-02-21 03:09:49,983 INFO L290 TraceCheckUtils]: 4: Hoare triple {1733#(= base2flt_~m 0)} assume !(0 == ~m % 4294967296); {1733#(= base2flt_~m 0)} is VALID [2022-02-21 03:09:49,983 INFO L290 TraceCheckUtils]: 5: Hoare triple {1733#(= base2flt_~m 0)} assume !(~m % 4294967296 < 16777216); {1731#false} is VALID [2022-02-21 03:09:49,983 INFO L290 TraceCheckUtils]: 6: Hoare triple {1731#false} assume !false; {1731#false} is VALID [2022-02-21 03:09:49,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {1731#false} assume !(~m % 4294967296 >= 33554432); {1731#false} is VALID [2022-02-21 03:09:49,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {1731#false} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {1731#false} is VALID [2022-02-21 03:09:49,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {1731#false} assume 128 + ~e <= 2147483647; {1731#false} is VALID [2022-02-21 03:09:49,984 INFO L290 TraceCheckUtils]: 10: Hoare triple {1731#false} assume 128 + ~e >= -2147483648; {1731#false} is VALID [2022-02-21 03:09:49,984 INFO L290 TraceCheckUtils]: 11: Hoare triple {1731#false} assume !(16777216 * (128 + ~e) <= 2147483647); {1731#false} is VALID [2022-02-21 03:09:49,984 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-21 03:09:49,984 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:09:49,984 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847856806] [2022-02-21 03:09:49,985 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847856806] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:09:49,985 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:09:49,985 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:09:49,985 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225339768] [2022-02-21 03:09:49,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:09:49,985 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-21 03:09:49,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:09:49,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:09:49,992 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-21 03:09:49,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:09:49,992 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:09:49,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:09:49,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:09:49,993 INFO L87 Difference]: Start difference. First operand 170 states and 230 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:09:50,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:50,205 INFO L93 Difference]: Finished difference Result 385 states and 525 transitions. [2022-02-21 03:09:50,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:09:50,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-21 03:09:50,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:09:50,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:09:50,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 337 transitions. [2022-02-21 03:09:50,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:09:50,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 337 transitions. [2022-02-21 03:09:50,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 337 transitions. [2022-02-21 03:09:50,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 337 edges. 337 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:50,424 INFO L225 Difference]: With dead ends: 385 [2022-02-21 03:09:50,424 INFO L226 Difference]: Without dead ends: 218 [2022-02-21 03:09:50,425 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-21 03:09:50,425 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 33 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:09:50,426 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 413 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:09:50,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-02-21 03:09:50,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 193. [2022-02-21 03:09:50,433 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:09:50,433 INFO L82 GeneralOperation]: Start isEquivalent. First operand 218 states. Second operand has 193 states, 158 states have (on average 1.6455696202531647) internal successors, (260), 185 states have internal predecessors, (260), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:09:50,434 INFO L74 IsIncluded]: Start isIncluded. First operand 218 states. Second operand has 193 states, 158 states have (on average 1.6455696202531647) internal successors, (260), 185 states have internal predecessors, (260), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:09:50,434 INFO L87 Difference]: Start difference. First operand 218 states. Second operand has 193 states, 158 states have (on average 1.6455696202531647) internal successors, (260), 185 states have internal predecessors, (260), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:09:50,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:50,439 INFO L93 Difference]: Finished difference Result 218 states and 292 transitions. [2022-02-21 03:09:50,439 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 292 transitions. [2022-02-21 03:09:50,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:50,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:50,441 INFO L74 IsIncluded]: Start isIncluded. First operand has 193 states, 158 states have (on average 1.6455696202531647) internal successors, (260), 185 states have internal predecessors, (260), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 218 states. [2022-02-21 03:09:50,441 INFO L87 Difference]: Start difference. First operand has 193 states, 158 states have (on average 1.6455696202531647) internal successors, (260), 185 states have internal predecessors, (260), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 218 states. [2022-02-21 03:09:50,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:50,446 INFO L93 Difference]: Finished difference Result 218 states and 292 transitions. [2022-02-21 03:09:50,446 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 292 transitions. [2022-02-21 03:09:50,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:50,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:50,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:09:50,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:09:50,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 158 states have (on average 1.6455696202531647) internal successors, (260), 185 states have internal predecessors, (260), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:09:50,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 268 transitions. [2022-02-21 03:09:50,452 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 268 transitions. Word has length 12 [2022-02-21 03:09:50,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:09:50,452 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 268 transitions. [2022-02-21 03:09:50,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:09:50,453 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 268 transitions. [2022-02-21 03:09:50,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-21 03:09:50,453 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:09:50,453 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:09:50,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 03:09:50,454 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-02-21 03:09:50,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:09:50,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1503455626, now seen corresponding path program 1 times [2022-02-21 03:09:50,454 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:09:50,455 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105072984] [2022-02-21 03:09:50,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:50,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:09:50,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:50,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:09:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:50,518 INFO L290 TraceCheckUtils]: 0: Hoare triple {2817#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {2808#true} is VALID [2022-02-21 03:09:50,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {2808#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {2808#true} is VALID [2022-02-21 03:09:50,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {2808#true} #res := ~__retres4~0; {2808#true} is VALID [2022-02-21 03:09:50,519 INFO L290 TraceCheckUtils]: 3: Hoare triple {2808#true} assume true; {2808#true} is VALID [2022-02-21 03:09:50,519 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2808#true} {2808#true} #394#return; {2808#true} is VALID [2022-02-21 03:09:50,519 INFO L290 TraceCheckUtils]: 0: Hoare triple {2808#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); {2808#true} is VALID [2022-02-21 03:09:50,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {2808#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {2808#true} is VALID [2022-02-21 03:09:50,520 INFO L272 TraceCheckUtils]: 2: Hoare triple {2808#true} call main_#t~ret22#1 := base2flt(0, 0); {2817#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:09:50,520 INFO L290 TraceCheckUtils]: 3: Hoare triple {2817#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {2808#true} is VALID [2022-02-21 03:09:50,520 INFO L290 TraceCheckUtils]: 4: Hoare triple {2808#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {2808#true} is VALID [2022-02-21 03:09:50,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {2808#true} #res := ~__retres4~0; {2808#true} is VALID [2022-02-21 03:09:50,520 INFO L290 TraceCheckUtils]: 6: Hoare triple {2808#true} assume true; {2808#true} is VALID [2022-02-21 03:09:50,520 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2808#true} {2808#true} #394#return; {2808#true} is VALID [2022-02-21 03:09:50,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {2808#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {2808#true} is VALID [2022-02-21 03:09:50,521 INFO L272 TraceCheckUtils]: 9: Hoare triple {2808#true} call main_#t~ret23#1 := base2flt(1, 0); {2815#(= |base2flt_#in~m| 1)} is VALID [2022-02-21 03:09:50,521 INFO L290 TraceCheckUtils]: 10: Hoare triple {2815#(= |base2flt_#in~m| 1)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {2816#(= (+ (- 1) base2flt_~m) 0)} is VALID [2022-02-21 03:09:50,522 INFO L290 TraceCheckUtils]: 11: Hoare triple {2816#(= (+ (- 1) base2flt_~m) 0)} assume !(0 == ~m % 4294967296); {2816#(= (+ (- 1) base2flt_~m) 0)} is VALID [2022-02-21 03:09:50,522 INFO L290 TraceCheckUtils]: 12: Hoare triple {2816#(= (+ (- 1) base2flt_~m) 0)} assume !(~m % 4294967296 < 16777216); {2809#false} is VALID [2022-02-21 03:09:50,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {2809#false} assume !false; {2809#false} is VALID [2022-02-21 03:09:50,522 INFO L290 TraceCheckUtils]: 14: Hoare triple {2809#false} assume !(~m % 4294967296 >= 33554432); {2809#false} is VALID [2022-02-21 03:09:50,522 INFO L290 TraceCheckUtils]: 15: Hoare triple {2809#false} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {2809#false} is VALID [2022-02-21 03:09:50,522 INFO L290 TraceCheckUtils]: 16: Hoare triple {2809#false} assume 128 + ~e <= 2147483647; {2809#false} is VALID [2022-02-21 03:09:50,523 INFO L290 TraceCheckUtils]: 17: Hoare triple {2809#false} assume 128 + ~e >= -2147483648; {2809#false} is VALID [2022-02-21 03:09:50,523 INFO L290 TraceCheckUtils]: 18: Hoare triple {2809#false} assume !(16777216 * (128 + ~e) <= 2147483647); {2809#false} is VALID [2022-02-21 03:09:50,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:09:50,523 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:09:50,523 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105072984] [2022-02-21 03:09:50,523 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105072984] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:09:50,524 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239127671] [2022-02-21 03:09:50,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:50,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:09:50,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:09:50,540 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:09:50,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-21 03:09:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:50,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:09:50,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:50,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:09:50,681 INFO L290 TraceCheckUtils]: 0: Hoare triple {2808#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); {2808#true} is VALID [2022-02-21 03:09:50,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {2808#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {2808#true} is VALID [2022-02-21 03:09:50,681 INFO L272 TraceCheckUtils]: 2: Hoare triple {2808#true} call main_#t~ret22#1 := base2flt(0, 0); {2808#true} is VALID [2022-02-21 03:09:50,681 INFO L290 TraceCheckUtils]: 3: Hoare triple {2808#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {2808#true} is VALID [2022-02-21 03:09:50,681 INFO L290 TraceCheckUtils]: 4: Hoare triple {2808#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {2808#true} is VALID [2022-02-21 03:09:50,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {2808#true} #res := ~__retres4~0; {2808#true} is VALID [2022-02-21 03:09:50,682 INFO L290 TraceCheckUtils]: 6: Hoare triple {2808#true} assume true; {2808#true} is VALID [2022-02-21 03:09:50,682 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2808#true} {2808#true} #394#return; {2808#true} is VALID [2022-02-21 03:09:50,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {2808#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {2808#true} is VALID [2022-02-21 03:09:50,682 INFO L272 TraceCheckUtils]: 9: Hoare triple {2808#true} call main_#t~ret23#1 := base2flt(1, 0); {2815#(= |base2flt_#in~m| 1)} is VALID [2022-02-21 03:09:50,683 INFO L290 TraceCheckUtils]: 10: Hoare triple {2815#(= |base2flt_#in~m| 1)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {2816#(= (+ (- 1) base2flt_~m) 0)} is VALID [2022-02-21 03:09:50,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {2816#(= (+ (- 1) base2flt_~m) 0)} assume !(0 == ~m % 4294967296); {2816#(= (+ (- 1) base2flt_~m) 0)} is VALID [2022-02-21 03:09:50,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {2816#(= (+ (- 1) base2flt_~m) 0)} assume !(~m % 4294967296 < 16777216); {2809#false} is VALID [2022-02-21 03:09:50,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {2809#false} assume !false; {2809#false} is VALID [2022-02-21 03:09:50,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {2809#false} assume !(~m % 4294967296 >= 33554432); {2809#false} is VALID [2022-02-21 03:09:50,684 INFO L290 TraceCheckUtils]: 15: Hoare triple {2809#false} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {2809#false} is VALID [2022-02-21 03:09:50,684 INFO L290 TraceCheckUtils]: 16: Hoare triple {2809#false} assume 128 + ~e <= 2147483647; {2809#false} is VALID [2022-02-21 03:09:50,684 INFO L290 TraceCheckUtils]: 17: Hoare triple {2809#false} assume 128 + ~e >= -2147483648; {2809#false} is VALID [2022-02-21 03:09:50,684 INFO L290 TraceCheckUtils]: 18: Hoare triple {2809#false} assume !(16777216 * (128 + ~e) <= 2147483647); {2809#false} is VALID [2022-02-21 03:09:50,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:09:50,684 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:09:50,685 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239127671] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:09:50,685 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:09:50,685 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-02-21 03:09:50,685 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577691721] [2022-02-21 03:09:50,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:09:50,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-02-21 03:09:50,686 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:09:50,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:09:50,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:50,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:09:50,698 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:09:50,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:09:50,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:09:50,698 INFO L87 Difference]: Start difference. First operand 193 states and 268 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:09:50,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:50,920 INFO L93 Difference]: Finished difference Result 365 states and 491 transitions. [2022-02-21 03:09:50,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:09:50,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-02-21 03:09:50,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:09:50,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:09:50,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 358 transitions. [2022-02-21 03:09:50,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:09:50,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 358 transitions. [2022-02-21 03:09:50,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 358 transitions. [2022-02-21 03:09:51,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 358 edges. 358 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:51,145 INFO L225 Difference]: With dead ends: 365 [2022-02-21 03:09:51,146 INFO L226 Difference]: Without dead ends: 194 [2022-02-21 03:09:51,146 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:09:51,147 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 60 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:09:51,147 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 431 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:09:51,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-02-21 03:09:51,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 176. [2022-02-21 03:09:51,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:09:51,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand has 176 states, 141 states have (on average 1.6453900709219857) internal successors, (232), 168 states have internal predecessors, (232), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:09:51,153 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand has 176 states, 141 states have (on average 1.6453900709219857) internal successors, (232), 168 states have internal predecessors, (232), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:09:51,153 INFO L87 Difference]: Start difference. First operand 194 states. Second operand has 176 states, 141 states have (on average 1.6453900709219857) internal successors, (232), 168 states have internal predecessors, (232), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:09:51,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:51,160 INFO L93 Difference]: Finished difference Result 194 states and 249 transitions. [2022-02-21 03:09:51,160 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 249 transitions. [2022-02-21 03:09:51,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:51,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:51,161 INFO L74 IsIncluded]: Start isIncluded. First operand has 176 states, 141 states have (on average 1.6453900709219857) internal successors, (232), 168 states have internal predecessors, (232), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 194 states. [2022-02-21 03:09:51,162 INFO L87 Difference]: Start difference. First operand has 176 states, 141 states have (on average 1.6453900709219857) internal successors, (232), 168 states have internal predecessors, (232), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 194 states. [2022-02-21 03:09:51,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:51,168 INFO L93 Difference]: Finished difference Result 194 states and 249 transitions. [2022-02-21 03:09:51,168 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 249 transitions. [2022-02-21 03:09:51,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:51,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:51,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:09:51,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:09:51,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 141 states have (on average 1.6453900709219857) internal successors, (232), 168 states have internal predecessors, (232), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:09:51,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 240 transitions. [2022-02-21 03:09:51,183 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 240 transitions. Word has length 19 [2022-02-21 03:09:51,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:09:51,184 INFO L470 AbstractCegarLoop]: Abstraction has 176 states and 240 transitions. [2022-02-21 03:09:51,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:09:51,184 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 240 transitions. [2022-02-21 03:09:51,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-21 03:09:51,185 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:09:51,185 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:09:51,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:09:51,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:09:51,399 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-02-21 03:09:51,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:09:51,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1863907122, now seen corresponding path program 1 times [2022-02-21 03:09:51,400 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:09:51,400 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457477159] [2022-02-21 03:09:51,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:51,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:09:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:51,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:09:51,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:51,446 INFO L290 TraceCheckUtils]: 0: Hoare triple {3862#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {3852#true} is VALID [2022-02-21 03:09:51,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {3852#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {3852#true} is VALID [2022-02-21 03:09:51,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {3852#true} #res := ~__retres4~0; {3852#true} is VALID [2022-02-21 03:09:51,446 INFO L290 TraceCheckUtils]: 3: Hoare triple {3852#true} assume true; {3852#true} is VALID [2022-02-21 03:09:51,446 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3852#true} {3852#true} #394#return; {3852#true} is VALID [2022-02-21 03:09:51,446 INFO L290 TraceCheckUtils]: 0: Hoare triple {3852#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); {3852#true} is VALID [2022-02-21 03:09:51,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {3852#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {3852#true} is VALID [2022-02-21 03:09:51,447 INFO L272 TraceCheckUtils]: 2: Hoare triple {3852#true} call main_#t~ret22#1 := base2flt(0, 0); {3862#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:09:51,447 INFO L290 TraceCheckUtils]: 3: Hoare triple {3862#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {3852#true} is VALID [2022-02-21 03:09:51,448 INFO L290 TraceCheckUtils]: 4: Hoare triple {3852#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {3852#true} is VALID [2022-02-21 03:09:51,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {3852#true} #res := ~__retres4~0; {3852#true} is VALID [2022-02-21 03:09:51,448 INFO L290 TraceCheckUtils]: 6: Hoare triple {3852#true} assume true; {3852#true} is VALID [2022-02-21 03:09:51,448 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3852#true} {3852#true} #394#return; {3852#true} is VALID [2022-02-21 03:09:51,448 INFO L290 TraceCheckUtils]: 8: Hoare triple {3852#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {3852#true} is VALID [2022-02-21 03:09:51,449 INFO L272 TraceCheckUtils]: 9: Hoare triple {3852#true} call main_#t~ret23#1 := base2flt(1, 0); {3859#(= |base2flt_#in~e| 0)} is VALID [2022-02-21 03:09:51,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {3859#(= |base2flt_#in~e| 0)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {3860#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:51,449 INFO L290 TraceCheckUtils]: 11: Hoare triple {3860#(= base2flt_~e 0)} assume !(0 == ~m % 4294967296); {3860#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:51,450 INFO L290 TraceCheckUtils]: 12: Hoare triple {3860#(= base2flt_~e 0)} assume ~m % 4294967296 < 16777216; {3860#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:51,450 INFO L290 TraceCheckUtils]: 13: Hoare triple {3860#(= base2flt_~e 0)} assume !false; {3860#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:51,450 INFO L290 TraceCheckUtils]: 14: Hoare triple {3860#(= base2flt_~e 0)} assume !(~e <= -128); {3860#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:51,450 INFO L290 TraceCheckUtils]: 15: Hoare triple {3860#(= base2flt_~e 0)} assume ~e - 1 <= 2147483647; {3860#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:51,451 INFO L290 TraceCheckUtils]: 16: Hoare triple {3860#(= base2flt_~e 0)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {3861#(<= (+ base2flt_~e 1) 0)} is VALID [2022-02-21 03:09:51,451 INFO L290 TraceCheckUtils]: 17: Hoare triple {3861#(<= (+ base2flt_~e 1) 0)} assume !(~m % 4294967296 < 16777216); {3861#(<= (+ base2flt_~e 1) 0)} is VALID [2022-02-21 03:09:51,452 INFO L290 TraceCheckUtils]: 18: Hoare triple {3861#(<= (+ base2flt_~e 1) 0)} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {3861#(<= (+ base2flt_~e 1) 0)} is VALID [2022-02-21 03:09:51,452 INFO L290 TraceCheckUtils]: 19: Hoare triple {3861#(<= (+ base2flt_~e 1) 0)} assume !(128 + ~e <= 2147483647); {3853#false} is VALID [2022-02-21 03:09:51,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:09:51,452 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:09:51,453 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457477159] [2022-02-21 03:09:51,453 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457477159] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:09:51,453 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921810858] [2022-02-21 03:09:51,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:51,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:09:51,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:09:51,454 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:09:51,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-21 03:09:51,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:51,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:09:51,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:51,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:09:51,607 INFO L290 TraceCheckUtils]: 0: Hoare triple {3852#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); {3852#true} is VALID [2022-02-21 03:09:51,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {3852#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {3852#true} is VALID [2022-02-21 03:09:51,608 INFO L272 TraceCheckUtils]: 2: Hoare triple {3852#true} call main_#t~ret22#1 := base2flt(0, 0); {3852#true} is VALID [2022-02-21 03:09:51,608 INFO L290 TraceCheckUtils]: 3: Hoare triple {3852#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {3852#true} is VALID [2022-02-21 03:09:51,608 INFO L290 TraceCheckUtils]: 4: Hoare triple {3852#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {3852#true} is VALID [2022-02-21 03:09:51,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {3852#true} #res := ~__retres4~0; {3852#true} is VALID [2022-02-21 03:09:51,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {3852#true} assume true; {3852#true} is VALID [2022-02-21 03:09:51,609 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3852#true} {3852#true} #394#return; {3852#true} is VALID [2022-02-21 03:09:51,609 INFO L290 TraceCheckUtils]: 8: Hoare triple {3852#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {3852#true} is VALID [2022-02-21 03:09:51,613 INFO L272 TraceCheckUtils]: 9: Hoare triple {3852#true} call main_#t~ret23#1 := base2flt(1, 0); {3893#(<= |base2flt_#in~e| 0)} is VALID [2022-02-21 03:09:51,613 INFO L290 TraceCheckUtils]: 10: Hoare triple {3893#(<= |base2flt_#in~e| 0)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {3897#(<= base2flt_~e 0)} is VALID [2022-02-21 03:09:51,614 INFO L290 TraceCheckUtils]: 11: Hoare triple {3897#(<= base2flt_~e 0)} assume !(0 == ~m % 4294967296); {3897#(<= base2flt_~e 0)} is VALID [2022-02-21 03:09:51,614 INFO L290 TraceCheckUtils]: 12: Hoare triple {3897#(<= base2flt_~e 0)} assume ~m % 4294967296 < 16777216; {3897#(<= base2flt_~e 0)} is VALID [2022-02-21 03:09:51,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {3897#(<= base2flt_~e 0)} assume !false; {3897#(<= base2flt_~e 0)} is VALID [2022-02-21 03:09:51,615 INFO L290 TraceCheckUtils]: 14: Hoare triple {3897#(<= base2flt_~e 0)} assume !(~e <= -128); {3897#(<= base2flt_~e 0)} is VALID [2022-02-21 03:09:51,615 INFO L290 TraceCheckUtils]: 15: Hoare triple {3897#(<= base2flt_~e 0)} assume ~e - 1 <= 2147483647; {3897#(<= base2flt_~e 0)} is VALID [2022-02-21 03:09:51,615 INFO L290 TraceCheckUtils]: 16: Hoare triple {3897#(<= base2flt_~e 0)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {3861#(<= (+ base2flt_~e 1) 0)} is VALID [2022-02-21 03:09:51,617 INFO L290 TraceCheckUtils]: 17: Hoare triple {3861#(<= (+ base2flt_~e 1) 0)} assume !(~m % 4294967296 < 16777216); {3861#(<= (+ base2flt_~e 1) 0)} is VALID [2022-02-21 03:09:51,617 INFO L290 TraceCheckUtils]: 18: Hoare triple {3861#(<= (+ base2flt_~e 1) 0)} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {3861#(<= (+ base2flt_~e 1) 0)} is VALID [2022-02-21 03:09:51,617 INFO L290 TraceCheckUtils]: 19: Hoare triple {3861#(<= (+ base2flt_~e 1) 0)} assume !(128 + ~e <= 2147483647); {3853#false} is VALID [2022-02-21 03:09:51,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:09:51,618 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:09:51,618 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921810858] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:09:51,618 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:09:51,618 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-02-21 03:09:51,618 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199498617] [2022-02-21 03:09:51,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:09:51,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-21 03:09:51,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:09:51,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:09:51,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:51,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:09:51,630 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:09:51,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:09:51,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:09:51,631 INFO L87 Difference]: Start difference. First operand 176 states and 240 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:09:51,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:51,921 INFO L93 Difference]: Finished difference Result 187 states and 244 transitions. [2022-02-21 03:09:51,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:09:51,921 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-21 03:09:51,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:09:51,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:09:51,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 209 transitions. [2022-02-21 03:09:51,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:09:51,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 209 transitions. [2022-02-21 03:09:51,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 209 transitions. [2022-02-21 03:09:52,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 209 edges. 209 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:52,052 INFO L225 Difference]: With dead ends: 187 [2022-02-21 03:09:52,052 INFO L226 Difference]: Without dead ends: 182 [2022-02-21 03:09:52,052 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-02-21 03:09:52,053 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 152 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:09:52,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 375 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:09:52,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-02-21 03:09:52,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 174. [2022-02-21 03:09:52,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:09:52,064 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand has 174 states, 141 states have (on average 1.553191489361702) internal successors, (219), 166 states have internal predecessors, (219), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:09:52,064 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand has 174 states, 141 states have (on average 1.553191489361702) internal successors, (219), 166 states have internal predecessors, (219), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:09:52,065 INFO L87 Difference]: Start difference. First operand 182 states. Second operand has 174 states, 141 states have (on average 1.553191489361702) internal successors, (219), 166 states have internal predecessors, (219), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:09:52,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:52,068 INFO L93 Difference]: Finished difference Result 182 states and 231 transitions. [2022-02-21 03:09:52,068 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 231 transitions. [2022-02-21 03:09:52,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:52,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:52,069 INFO L74 IsIncluded]: Start isIncluded. First operand has 174 states, 141 states have (on average 1.553191489361702) internal successors, (219), 166 states have internal predecessors, (219), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 182 states. [2022-02-21 03:09:52,095 INFO L87 Difference]: Start difference. First operand has 174 states, 141 states have (on average 1.553191489361702) internal successors, (219), 166 states have internal predecessors, (219), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 182 states. [2022-02-21 03:09:52,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:52,098 INFO L93 Difference]: Finished difference Result 182 states and 231 transitions. [2022-02-21 03:09:52,098 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 231 transitions. [2022-02-21 03:09:52,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:52,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:52,099 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:09:52,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:09:52,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 141 states have (on average 1.553191489361702) internal successors, (219), 166 states have internal predecessors, (219), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:09:52,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 227 transitions. [2022-02-21 03:09:52,102 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 227 transitions. Word has length 20 [2022-02-21 03:09:52,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:09:52,102 INFO L470 AbstractCegarLoop]: Abstraction has 174 states and 227 transitions. [2022-02-21 03:09:52,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:09:52,102 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 227 transitions. [2022-02-21 03:09:52,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-21 03:09:52,102 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:09:52,103 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:09:52,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:09:52,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:09:52,315 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-02-21 03:09:52,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:09:52,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1946545813, now seen corresponding path program 1 times [2022-02-21 03:09:52,316 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:09:52,316 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217516595] [2022-02-21 03:09:52,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:52,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:09:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:52,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:09:52,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:52,369 INFO L290 TraceCheckUtils]: 0: Hoare triple {4698#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {4688#true} is VALID [2022-02-21 03:09:52,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {4688#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {4688#true} is VALID [2022-02-21 03:09:52,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {4688#true} #res := ~__retres4~0; {4688#true} is VALID [2022-02-21 03:09:52,369 INFO L290 TraceCheckUtils]: 3: Hoare triple {4688#true} assume true; {4688#true} is VALID [2022-02-21 03:09:52,369 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {4688#true} {4688#true} #394#return; {4688#true} is VALID [2022-02-21 03:09:52,370 INFO L290 TraceCheckUtils]: 0: Hoare triple {4688#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); {4688#true} is VALID [2022-02-21 03:09:52,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {4688#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {4688#true} is VALID [2022-02-21 03:09:52,370 INFO L272 TraceCheckUtils]: 2: Hoare triple {4688#true} call main_#t~ret22#1 := base2flt(0, 0); {4698#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:09:52,370 INFO L290 TraceCheckUtils]: 3: Hoare triple {4698#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {4688#true} is VALID [2022-02-21 03:09:52,370 INFO L290 TraceCheckUtils]: 4: Hoare triple {4688#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {4688#true} is VALID [2022-02-21 03:09:52,370 INFO L290 TraceCheckUtils]: 5: Hoare triple {4688#true} #res := ~__retres4~0; {4688#true} is VALID [2022-02-21 03:09:52,371 INFO L290 TraceCheckUtils]: 6: Hoare triple {4688#true} assume true; {4688#true} is VALID [2022-02-21 03:09:52,371 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4688#true} {4688#true} #394#return; {4688#true} is VALID [2022-02-21 03:09:52,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {4688#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {4688#true} is VALID [2022-02-21 03:09:52,371 INFO L272 TraceCheckUtils]: 9: Hoare triple {4688#true} call main_#t~ret23#1 := base2flt(1, 0); {4695#(= |base2flt_#in~e| 0)} is VALID [2022-02-21 03:09:52,371 INFO L290 TraceCheckUtils]: 10: Hoare triple {4695#(= |base2flt_#in~e| 0)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {4696#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:52,372 INFO L290 TraceCheckUtils]: 11: Hoare triple {4696#(= base2flt_~e 0)} assume !(0 == ~m % 4294967296); {4696#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:52,372 INFO L290 TraceCheckUtils]: 12: Hoare triple {4696#(= base2flt_~e 0)} assume ~m % 4294967296 < 16777216; {4696#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:52,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {4696#(= base2flt_~e 0)} assume !false; {4696#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:52,373 INFO L290 TraceCheckUtils]: 14: Hoare triple {4696#(= base2flt_~e 0)} assume !(~e <= -128); {4696#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:52,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {4696#(= base2flt_~e 0)} assume ~e - 1 <= 2147483647; {4696#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:52,373 INFO L290 TraceCheckUtils]: 16: Hoare triple {4696#(= base2flt_~e 0)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {4697#(<= 0 (+ base2flt_~e 1))} is VALID [2022-02-21 03:09:52,374 INFO L290 TraceCheckUtils]: 17: Hoare triple {4697#(<= 0 (+ base2flt_~e 1))} assume !(~m % 4294967296 < 16777216); {4697#(<= 0 (+ base2flt_~e 1))} is VALID [2022-02-21 03:09:52,374 INFO L290 TraceCheckUtils]: 18: Hoare triple {4697#(<= 0 (+ base2flt_~e 1))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {4697#(<= 0 (+ base2flt_~e 1))} is VALID [2022-02-21 03:09:52,374 INFO L290 TraceCheckUtils]: 19: Hoare triple {4697#(<= 0 (+ base2flt_~e 1))} assume 128 + ~e <= 2147483647; {4697#(<= 0 (+ base2flt_~e 1))} is VALID [2022-02-21 03:09:52,375 INFO L290 TraceCheckUtils]: 20: Hoare triple {4697#(<= 0 (+ base2flt_~e 1))} assume !(128 + ~e >= -2147483648); {4689#false} is VALID [2022-02-21 03:09:52,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:09:52,375 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:09:52,375 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217516595] [2022-02-21 03:09:52,375 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217516595] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:09:52,375 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347506058] [2022-02-21 03:09:52,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:52,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:09:52,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:09:52,386 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:09:52,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-21 03:09:52,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:52,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:09:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:52,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:09:52,498 INFO L290 TraceCheckUtils]: 0: Hoare triple {4688#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); {4688#true} is VALID [2022-02-21 03:09:52,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {4688#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {4688#true} is VALID [2022-02-21 03:09:52,498 INFO L272 TraceCheckUtils]: 2: Hoare triple {4688#true} call main_#t~ret22#1 := base2flt(0, 0); {4688#true} is VALID [2022-02-21 03:09:52,498 INFO L290 TraceCheckUtils]: 3: Hoare triple {4688#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {4688#true} is VALID [2022-02-21 03:09:52,498 INFO L290 TraceCheckUtils]: 4: Hoare triple {4688#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {4688#true} is VALID [2022-02-21 03:09:52,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {4688#true} #res := ~__retres4~0; {4688#true} is VALID [2022-02-21 03:09:52,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {4688#true} assume true; {4688#true} is VALID [2022-02-21 03:09:52,498 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4688#true} {4688#true} #394#return; {4688#true} is VALID [2022-02-21 03:09:52,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {4688#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {4688#true} is VALID [2022-02-21 03:09:52,499 INFO L272 TraceCheckUtils]: 9: Hoare triple {4688#true} call main_#t~ret23#1 := base2flt(1, 0); {4688#true} is VALID [2022-02-21 03:09:52,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {4688#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {4688#true} is VALID [2022-02-21 03:09:52,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {4688#true} assume !(0 == ~m % 4294967296); {4688#true} is VALID [2022-02-21 03:09:52,499 INFO L290 TraceCheckUtils]: 12: Hoare triple {4688#true} assume ~m % 4294967296 < 16777216; {4688#true} is VALID [2022-02-21 03:09:52,499 INFO L290 TraceCheckUtils]: 13: Hoare triple {4688#true} assume !false; {4688#true} is VALID [2022-02-21 03:09:52,499 INFO L290 TraceCheckUtils]: 14: Hoare triple {4688#true} assume !(~e <= -128); {4744#(not (<= (+ 128 base2flt_~e) 0))} is VALID [2022-02-21 03:09:52,500 INFO L290 TraceCheckUtils]: 15: Hoare triple {4744#(not (<= (+ 128 base2flt_~e) 0))} assume ~e - 1 <= 2147483647; {4744#(not (<= (+ 128 base2flt_~e) 0))} is VALID [2022-02-21 03:09:52,500 INFO L290 TraceCheckUtils]: 16: Hoare triple {4744#(not (<= (+ 128 base2flt_~e) 0))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {4751#(< 0 (+ 129 base2flt_~e))} is VALID [2022-02-21 03:09:52,500 INFO L290 TraceCheckUtils]: 17: Hoare triple {4751#(< 0 (+ 129 base2flt_~e))} assume !(~m % 4294967296 < 16777216); {4751#(< 0 (+ 129 base2flt_~e))} is VALID [2022-02-21 03:09:52,501 INFO L290 TraceCheckUtils]: 18: Hoare triple {4751#(< 0 (+ 129 base2flt_~e))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {4751#(< 0 (+ 129 base2flt_~e))} is VALID [2022-02-21 03:09:52,501 INFO L290 TraceCheckUtils]: 19: Hoare triple {4751#(< 0 (+ 129 base2flt_~e))} assume 128 + ~e <= 2147483647; {4751#(< 0 (+ 129 base2flt_~e))} is VALID [2022-02-21 03:09:52,501 INFO L290 TraceCheckUtils]: 20: Hoare triple {4751#(< 0 (+ 129 base2flt_~e))} assume !(128 + ~e >= -2147483648); {4689#false} is VALID [2022-02-21 03:09:52,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:09:52,501 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:09:52,501 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347506058] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:09:52,502 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:09:52,502 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-02-21 03:09:52,502 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924845753] [2022-02-21 03:09:52,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:09:52,502 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-02-21 03:09:52,502 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:09:52,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:09:52,512 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:52,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:09:52,512 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:09:52,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:09:52,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:09:52,514 INFO L87 Difference]: Start difference. First operand 174 states and 227 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:09:52,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:52,756 INFO L93 Difference]: Finished difference Result 212 states and 284 transitions. [2022-02-21 03:09:52,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:09:52,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-02-21 03:09:52,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:09:52,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:09:52,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 191 transitions. [2022-02-21 03:09:52,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:09:52,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 191 transitions. [2022-02-21 03:09:52,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 191 transitions. [2022-02-21 03:09:52,868 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:52,871 INFO L225 Difference]: With dead ends: 212 [2022-02-21 03:09:52,871 INFO L226 Difference]: Without dead ends: 207 [2022-02-21 03:09:52,871 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:09:52,872 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 32 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:09:52,872 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 368 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:09:52,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-02-21 03:09:52,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 191. [2022-02-21 03:09:52,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:09:52,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 207 states. Second operand has 191 states, 159 states have (on average 1.4779874213836477) internal successors, (235), 183 states have internal predecessors, (235), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:09:52,885 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand has 191 states, 159 states have (on average 1.4779874213836477) internal successors, (235), 183 states have internal predecessors, (235), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:09:52,885 INFO L87 Difference]: Start difference. First operand 207 states. Second operand has 191 states, 159 states have (on average 1.4779874213836477) internal successors, (235), 183 states have internal predecessors, (235), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:09:52,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:52,888 INFO L93 Difference]: Finished difference Result 207 states and 266 transitions. [2022-02-21 03:09:52,888 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 266 transitions. [2022-02-21 03:09:52,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:52,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:52,889 INFO L74 IsIncluded]: Start isIncluded. First operand has 191 states, 159 states have (on average 1.4779874213836477) internal successors, (235), 183 states have internal predecessors, (235), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 207 states. [2022-02-21 03:09:52,890 INFO L87 Difference]: Start difference. First operand has 191 states, 159 states have (on average 1.4779874213836477) internal successors, (235), 183 states have internal predecessors, (235), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 207 states. [2022-02-21 03:09:52,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:52,893 INFO L93 Difference]: Finished difference Result 207 states and 266 transitions. [2022-02-21 03:09:52,893 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 266 transitions. [2022-02-21 03:09:52,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:52,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:52,893 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:09:52,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:09:52,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 159 states have (on average 1.4779874213836477) internal successors, (235), 183 states have internal predecessors, (235), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:09:52,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 243 transitions. [2022-02-21 03:09:52,896 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 243 transitions. Word has length 21 [2022-02-21 03:09:52,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:09:52,897 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 243 transitions. [2022-02-21 03:09:52,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:09:52,897 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 243 transitions. [2022-02-21 03:09:52,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-21 03:09:52,897 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:09:52,897 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:09:52,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:09:53,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:09:53,118 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-02-21 03:09:53,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:09:53,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1511766147, now seen corresponding path program 1 times [2022-02-21 03:09:53,119 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:09:53,119 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061257153] [2022-02-21 03:09:53,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:53,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:09:53,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:53,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:09:53,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:53,156 INFO L290 TraceCheckUtils]: 0: Hoare triple {5637#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5617#true} is VALID [2022-02-21 03:09:53,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {5617#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {5617#true} is VALID [2022-02-21 03:09:53,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {5617#true} #res := ~__retres4~0; {5617#true} is VALID [2022-02-21 03:09:53,156 INFO L290 TraceCheckUtils]: 3: Hoare triple {5617#true} assume true; {5617#true} is VALID [2022-02-21 03:09:53,157 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5617#true} {5617#true} #394#return; {5617#true} is VALID [2022-02-21 03:09:53,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:09:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:53,187 INFO L290 TraceCheckUtils]: 0: Hoare triple {5637#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:09:53,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !(0 == ~m % 4294967296); {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:09:53,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~m % 4294967296 < 16777216; {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:09:53,188 INFO L290 TraceCheckUtils]: 3: Hoare triple {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !false; {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:09:53,189 INFO L290 TraceCheckUtils]: 4: Hoare triple {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !(~e <= -128); {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:09:53,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~e - 1 <= 2147483647; {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:09:53,189 INFO L290 TraceCheckUtils]: 6: Hoare triple {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {5639#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:09:53,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {5639#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume ~m % 4294967296 < 16777216; {5639#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:09:53,190 INFO L290 TraceCheckUtils]: 8: Hoare triple {5639#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume !false; {5639#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:09:53,190 INFO L290 TraceCheckUtils]: 9: Hoare triple {5639#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume ~e <= -128;~__retres4~0 := 0; {5640#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:09:53,191 INFO L290 TraceCheckUtils]: 10: Hoare triple {5640#(not (= |base2flt_#in~e| 0))} #res := ~__retres4~0; {5640#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:09:53,191 INFO L290 TraceCheckUtils]: 11: Hoare triple {5640#(not (= |base2flt_#in~e| 0))} assume true; {5640#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:09:53,192 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5640#(not (= |base2flt_#in~e| 0))} {5617#true} #396#return; {5618#false} is VALID [2022-02-21 03:09:53,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {5617#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); {5617#true} is VALID [2022-02-21 03:09:53,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {5617#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {5617#true} is VALID [2022-02-21 03:09:53,192 INFO L272 TraceCheckUtils]: 2: Hoare triple {5617#true} call main_#t~ret22#1 := base2flt(0, 0); {5637#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:09:53,193 INFO L290 TraceCheckUtils]: 3: Hoare triple {5637#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5617#true} is VALID [2022-02-21 03:09:53,193 INFO L290 TraceCheckUtils]: 4: Hoare triple {5617#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {5617#true} is VALID [2022-02-21 03:09:53,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {5617#true} #res := ~__retres4~0; {5617#true} is VALID [2022-02-21 03:09:53,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {5617#true} assume true; {5617#true} is VALID [2022-02-21 03:09:53,193 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5617#true} {5617#true} #394#return; {5617#true} is VALID [2022-02-21 03:09:53,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {5617#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {5617#true} is VALID [2022-02-21 03:09:53,193 INFO L272 TraceCheckUtils]: 9: Hoare triple {5617#true} call main_#t~ret23#1 := base2flt(1, 0); {5637#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:09:53,194 INFO L290 TraceCheckUtils]: 10: Hoare triple {5637#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:09:53,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !(0 == ~m % 4294967296); {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:09:53,194 INFO L290 TraceCheckUtils]: 12: Hoare triple {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~m % 4294967296 < 16777216; {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:09:53,195 INFO L290 TraceCheckUtils]: 13: Hoare triple {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !false; {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:09:53,195 INFO L290 TraceCheckUtils]: 14: Hoare triple {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !(~e <= -128); {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:09:53,195 INFO L290 TraceCheckUtils]: 15: Hoare triple {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~e - 1 <= 2147483647; {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:09:53,196 INFO L290 TraceCheckUtils]: 16: Hoare triple {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {5639#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:09:53,196 INFO L290 TraceCheckUtils]: 17: Hoare triple {5639#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume ~m % 4294967296 < 16777216; {5639#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:09:53,196 INFO L290 TraceCheckUtils]: 18: Hoare triple {5639#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume !false; {5639#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:09:53,197 INFO L290 TraceCheckUtils]: 19: Hoare triple {5639#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume ~e <= -128;~__retres4~0 := 0; {5640#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:09:53,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {5640#(not (= |base2flt_#in~e| 0))} #res := ~__retres4~0; {5640#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:09:53,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {5640#(not (= |base2flt_#in~e| 0))} assume true; {5640#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:09:53,198 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5640#(not (= |base2flt_#in~e| 0))} {5617#true} #396#return; {5618#false} is VALID [2022-02-21 03:09:53,198 INFO L290 TraceCheckUtils]: 23: Hoare triple {5618#false} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {5618#false} is VALID [2022-02-21 03:09:53,198 INFO L272 TraceCheckUtils]: 24: Hoare triple {5618#false} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {5618#false} is VALID [2022-02-21 03:09:53,198 INFO L290 TraceCheckUtils]: 25: Hoare triple {5618#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5618#false} is VALID [2022-02-21 03:09:53,198 INFO L290 TraceCheckUtils]: 26: Hoare triple {5618#false} assume !(0 == ~m % 4294967296); {5618#false} is VALID [2022-02-21 03:09:53,198 INFO L290 TraceCheckUtils]: 27: Hoare triple {5618#false} assume ~m % 4294967296 < 16777216; {5618#false} is VALID [2022-02-21 03:09:53,198 INFO L290 TraceCheckUtils]: 28: Hoare triple {5618#false} assume !false; {5618#false} is VALID [2022-02-21 03:09:53,198 INFO L290 TraceCheckUtils]: 29: Hoare triple {5618#false} assume !(~e <= -128); {5618#false} is VALID [2022-02-21 03:09:53,199 INFO L290 TraceCheckUtils]: 30: Hoare triple {5618#false} assume !(~e - 1 <= 2147483647); {5618#false} is VALID [2022-02-21 03:09:53,199 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:09:53,199 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:09:53,199 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061257153] [2022-02-21 03:09:53,199 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061257153] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:09:53,199 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129252869] [2022-02-21 03:09:53,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:53,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:09:53,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:09:53,200 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:09:53,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-21 03:09:53,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:53,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:09:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:53,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:09:53,378 INFO L290 TraceCheckUtils]: 0: Hoare triple {5617#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); {5617#true} is VALID [2022-02-21 03:09:53,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {5617#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {5617#true} is VALID [2022-02-21 03:09:53,378 INFO L272 TraceCheckUtils]: 2: Hoare triple {5617#true} call main_#t~ret22#1 := base2flt(0, 0); {5617#true} is VALID [2022-02-21 03:09:53,379 INFO L290 TraceCheckUtils]: 3: Hoare triple {5617#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5617#true} is VALID [2022-02-21 03:09:53,379 INFO L290 TraceCheckUtils]: 4: Hoare triple {5617#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {5617#true} is VALID [2022-02-21 03:09:53,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {5617#true} #res := ~__retres4~0; {5617#true} is VALID [2022-02-21 03:09:53,379 INFO L290 TraceCheckUtils]: 6: Hoare triple {5617#true} assume true; {5617#true} is VALID [2022-02-21 03:09:53,379 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5617#true} {5617#true} #394#return; {5617#true} is VALID [2022-02-21 03:09:53,379 INFO L290 TraceCheckUtils]: 8: Hoare triple {5617#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {5617#true} is VALID [2022-02-21 03:09:53,379 INFO L272 TraceCheckUtils]: 9: Hoare triple {5617#true} call main_#t~ret23#1 := base2flt(1, 0); {5617#true} is VALID [2022-02-21 03:09:53,379 INFO L290 TraceCheckUtils]: 10: Hoare triple {5617#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5674#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:09:53,380 INFO L290 TraceCheckUtils]: 11: Hoare triple {5674#(<= |base2flt_#in~e| base2flt_~e)} assume !(0 == ~m % 4294967296); {5674#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:09:53,380 INFO L290 TraceCheckUtils]: 12: Hoare triple {5674#(<= |base2flt_#in~e| base2flt_~e)} assume ~m % 4294967296 < 16777216; {5674#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:09:53,381 INFO L290 TraceCheckUtils]: 13: Hoare triple {5674#(<= |base2flt_#in~e| base2flt_~e)} assume !false; {5674#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:09:53,381 INFO L290 TraceCheckUtils]: 14: Hoare triple {5674#(<= |base2flt_#in~e| base2flt_~e)} assume !(~e <= -128); {5674#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:09:53,381 INFO L290 TraceCheckUtils]: 15: Hoare triple {5674#(<= |base2flt_#in~e| base2flt_~e)} assume ~e - 1 <= 2147483647; {5674#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:09:53,382 INFO L290 TraceCheckUtils]: 16: Hoare triple {5674#(<= |base2flt_#in~e| base2flt_~e)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {5693#(<= |base2flt_#in~e| (+ base2flt_~e 1))} is VALID [2022-02-21 03:09:53,382 INFO L290 TraceCheckUtils]: 17: Hoare triple {5693#(<= |base2flt_#in~e| (+ base2flt_~e 1))} assume ~m % 4294967296 < 16777216; {5693#(<= |base2flt_#in~e| (+ base2flt_~e 1))} is VALID [2022-02-21 03:09:53,383 INFO L290 TraceCheckUtils]: 18: Hoare triple {5693#(<= |base2flt_#in~e| (+ base2flt_~e 1))} assume !false; {5693#(<= |base2flt_#in~e| (+ base2flt_~e 1))} is VALID [2022-02-21 03:09:53,384 INFO L290 TraceCheckUtils]: 19: Hoare triple {5693#(<= |base2flt_#in~e| (+ base2flt_~e 1))} assume ~e <= -128;~__retres4~0 := 0; {5703#(<= (+ 127 |base2flt_#in~e|) 0)} is VALID [2022-02-21 03:09:53,384 INFO L290 TraceCheckUtils]: 20: Hoare triple {5703#(<= (+ 127 |base2flt_#in~e|) 0)} #res := ~__retres4~0; {5703#(<= (+ 127 |base2flt_#in~e|) 0)} is VALID [2022-02-21 03:09:53,384 INFO L290 TraceCheckUtils]: 21: Hoare triple {5703#(<= (+ 127 |base2flt_#in~e|) 0)} assume true; {5703#(<= (+ 127 |base2flt_#in~e|) 0)} is VALID [2022-02-21 03:09:53,385 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5703#(<= (+ 127 |base2flt_#in~e|) 0)} {5617#true} #396#return; {5618#false} is VALID [2022-02-21 03:09:53,385 INFO L290 TraceCheckUtils]: 23: Hoare triple {5618#false} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {5618#false} is VALID [2022-02-21 03:09:53,385 INFO L272 TraceCheckUtils]: 24: Hoare triple {5618#false} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {5618#false} is VALID [2022-02-21 03:09:53,385 INFO L290 TraceCheckUtils]: 25: Hoare triple {5618#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5618#false} is VALID [2022-02-21 03:09:53,385 INFO L290 TraceCheckUtils]: 26: Hoare triple {5618#false} assume !(0 == ~m % 4294967296); {5618#false} is VALID [2022-02-21 03:09:53,385 INFO L290 TraceCheckUtils]: 27: Hoare triple {5618#false} assume ~m % 4294967296 < 16777216; {5618#false} is VALID [2022-02-21 03:09:53,385 INFO L290 TraceCheckUtils]: 28: Hoare triple {5618#false} assume !false; {5618#false} is VALID [2022-02-21 03:09:53,386 INFO L290 TraceCheckUtils]: 29: Hoare triple {5618#false} assume !(~e <= -128); {5618#false} is VALID [2022-02-21 03:09:53,386 INFO L290 TraceCheckUtils]: 30: Hoare triple {5618#false} assume !(~e - 1 <= 2147483647); {5618#false} is VALID [2022-02-21 03:09:53,386 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:09:53,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:09:53,597 INFO L290 TraceCheckUtils]: 30: Hoare triple {5618#false} assume !(~e - 1 <= 2147483647); {5618#false} is VALID [2022-02-21 03:09:53,597 INFO L290 TraceCheckUtils]: 29: Hoare triple {5618#false} assume !(~e <= -128); {5618#false} is VALID [2022-02-21 03:09:53,598 INFO L290 TraceCheckUtils]: 28: Hoare triple {5618#false} assume !false; {5618#false} is VALID [2022-02-21 03:09:53,598 INFO L290 TraceCheckUtils]: 27: Hoare triple {5618#false} assume ~m % 4294967296 < 16777216; {5618#false} is VALID [2022-02-21 03:09:53,598 INFO L290 TraceCheckUtils]: 26: Hoare triple {5618#false} assume !(0 == ~m % 4294967296); {5618#false} is VALID [2022-02-21 03:09:53,598 INFO L290 TraceCheckUtils]: 25: Hoare triple {5618#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5618#false} is VALID [2022-02-21 03:09:53,598 INFO L272 TraceCheckUtils]: 24: Hoare triple {5618#false} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {5618#false} is VALID [2022-02-21 03:09:53,598 INFO L290 TraceCheckUtils]: 23: Hoare triple {5618#false} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {5618#false} is VALID [2022-02-21 03:09:53,602 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5764#(not (<= 0 |base2flt_#in~e|))} {5617#true} #396#return; {5618#false} is VALID [2022-02-21 03:09:53,602 INFO L290 TraceCheckUtils]: 21: Hoare triple {5764#(not (<= 0 |base2flt_#in~e|))} assume true; {5764#(not (<= 0 |base2flt_#in~e|))} is VALID [2022-02-21 03:09:53,605 INFO L290 TraceCheckUtils]: 20: Hoare triple {5764#(not (<= 0 |base2flt_#in~e|))} #res := ~__retres4~0; {5764#(not (<= 0 |base2flt_#in~e|))} is VALID [2022-02-21 03:09:53,605 INFO L290 TraceCheckUtils]: 19: Hoare triple {5774#(or (not (<= (+ 128 base2flt_~e) 0)) (not (<= 0 |base2flt_#in~e|)))} assume ~e <= -128;~__retres4~0 := 0; {5764#(not (<= 0 |base2flt_#in~e|))} is VALID [2022-02-21 03:09:53,606 INFO L290 TraceCheckUtils]: 18: Hoare triple {5774#(or (not (<= (+ 128 base2flt_~e) 0)) (not (<= 0 |base2flt_#in~e|)))} assume !false; {5774#(or (not (<= (+ 128 base2flt_~e) 0)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:09:53,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {5774#(or (not (<= (+ 128 base2flt_~e) 0)) (not (<= 0 |base2flt_#in~e|)))} assume ~m % 4294967296 < 16777216; {5774#(or (not (<= (+ 128 base2flt_~e) 0)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:09:53,607 INFO L290 TraceCheckUtils]: 16: Hoare triple {5784#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {5774#(or (not (<= (+ 128 base2flt_~e) 0)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:09:53,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {5784#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 <= 2147483647; {5784#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:09:53,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {5784#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} assume !(~e <= -128); {5784#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:09:53,608 INFO L290 TraceCheckUtils]: 13: Hoare triple {5784#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} assume !false; {5784#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:09:53,608 INFO L290 TraceCheckUtils]: 12: Hoare triple {5784#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} assume ~m % 4294967296 < 16777216; {5784#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:09:53,608 INFO L290 TraceCheckUtils]: 11: Hoare triple {5784#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} assume !(0 == ~m % 4294967296); {5784#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:09:53,609 INFO L290 TraceCheckUtils]: 10: Hoare triple {5617#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5784#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:09:53,609 INFO L272 TraceCheckUtils]: 9: Hoare triple {5617#true} call main_#t~ret23#1 := base2flt(1, 0); {5617#true} is VALID [2022-02-21 03:09:53,609 INFO L290 TraceCheckUtils]: 8: Hoare triple {5617#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {5617#true} is VALID [2022-02-21 03:09:53,609 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5617#true} {5617#true} #394#return; {5617#true} is VALID [2022-02-21 03:09:53,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {5617#true} assume true; {5617#true} is VALID [2022-02-21 03:09:53,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {5617#true} #res := ~__retres4~0; {5617#true} is VALID [2022-02-21 03:09:53,609 INFO L290 TraceCheckUtils]: 4: Hoare triple {5617#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {5617#true} is VALID [2022-02-21 03:09:53,610 INFO L290 TraceCheckUtils]: 3: Hoare triple {5617#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5617#true} is VALID [2022-02-21 03:09:53,610 INFO L272 TraceCheckUtils]: 2: Hoare triple {5617#true} call main_#t~ret22#1 := base2flt(0, 0); {5617#true} is VALID [2022-02-21 03:09:53,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {5617#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {5617#true} is VALID [2022-02-21 03:09:53,610 INFO L290 TraceCheckUtils]: 0: Hoare triple {5617#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); {5617#true} is VALID [2022-02-21 03:09:53,610 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:09:53,610 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129252869] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:09:53,611 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:09:53,611 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2022-02-21 03:09:53,611 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013189864] [2022-02-21 03:09:53,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:09:53,611 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2022-02-21 03:09:53,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:09:53,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:09:53,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:53,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-21 03:09:53,651 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:09:53,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-21 03:09:53,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-02-21 03:09:53,652 INFO L87 Difference]: Start difference. First operand 191 states and 243 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:09:55,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:55,142 INFO L93 Difference]: Finished difference Result 829 states and 1079 transitions. [2022-02-21 03:09:55,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-21 03:09:55,142 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2022-02-21 03:09:55,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:09:55,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:09:55,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 693 transitions. [2022-02-21 03:09:55,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:09:55,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 693 transitions. [2022-02-21 03:09:55,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 693 transitions. [2022-02-21 03:09:55,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 693 edges. 693 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:55,708 INFO L225 Difference]: With dead ends: 829 [2022-02-21 03:09:55,708 INFO L226 Difference]: Without dead ends: 671 [2022-02-21 03:09:55,709 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=342, Invalid=714, Unknown=0, NotChecked=0, Total=1056 [2022-02-21 03:09:55,709 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 714 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-21 03:09:55,710 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [714 Valid, 801 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-21 03:09:55,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2022-02-21 03:09:55,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 221. [2022-02-21 03:09:55,740 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:09:55,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 671 states. Second operand has 221 states, 189 states have (on average 1.439153439153439) internal successors, (272), 213 states have internal predecessors, (272), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:09:55,741 INFO L74 IsIncluded]: Start isIncluded. First operand 671 states. Second operand has 221 states, 189 states have (on average 1.439153439153439) internal successors, (272), 213 states have internal predecessors, (272), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:09:55,741 INFO L87 Difference]: Start difference. First operand 671 states. Second operand has 221 states, 189 states have (on average 1.439153439153439) internal successors, (272), 213 states have internal predecessors, (272), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:09:55,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:55,758 INFO L93 Difference]: Finished difference Result 671 states and 858 transitions. [2022-02-21 03:09:55,759 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 858 transitions. [2022-02-21 03:09:55,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:55,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:55,760 INFO L74 IsIncluded]: Start isIncluded. First operand has 221 states, 189 states have (on average 1.439153439153439) internal successors, (272), 213 states have internal predecessors, (272), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 671 states. [2022-02-21 03:09:55,761 INFO L87 Difference]: Start difference. First operand has 221 states, 189 states have (on average 1.439153439153439) internal successors, (272), 213 states have internal predecessors, (272), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 671 states. [2022-02-21 03:09:55,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:55,778 INFO L93 Difference]: Finished difference Result 671 states and 858 transitions. [2022-02-21 03:09:55,778 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 858 transitions. [2022-02-21 03:09:55,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:55,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:55,779 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:09:55,779 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:09:55,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 189 states have (on average 1.439153439153439) internal successors, (272), 213 states have internal predecessors, (272), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:09:55,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 280 transitions. [2022-02-21 03:09:55,783 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 280 transitions. Word has length 31 [2022-02-21 03:09:55,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:09:55,783 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 280 transitions. [2022-02-21 03:09:55,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:09:55,783 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 280 transitions. [2022-02-21 03:09:55,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-21 03:09:55,784 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:09:55,784 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:09:55,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:09:56,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:09:56,001 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-02-21 03:09:56,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:09:56,001 INFO L85 PathProgramCache]: Analyzing trace with hash 24022301, now seen corresponding path program 1 times [2022-02-21 03:09:56,001 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:09:56,001 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785012743] [2022-02-21 03:09:56,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:56,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:09:56,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:56,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:09:56,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:56,062 INFO L290 TraceCheckUtils]: 0: Hoare triple {8409#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8374#true} is VALID [2022-02-21 03:09:56,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {8374#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {8374#true} is VALID [2022-02-21 03:09:56,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {8374#true} #res := ~__retres4~0; {8374#true} is VALID [2022-02-21 03:09:56,062 INFO L290 TraceCheckUtils]: 3: Hoare triple {8374#true} assume true; {8374#true} is VALID [2022-02-21 03:09:56,063 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {8374#true} {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} #394#return; {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:09:56,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:09:56,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:56,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {8409#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8374#true} is VALID [2022-02-21 03:09:56,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {8374#true} assume !(0 == ~m % 4294967296); {8374#true} is VALID [2022-02-21 03:09:56,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {8374#true} assume ~m % 4294967296 < 16777216; {8374#true} is VALID [2022-02-21 03:09:56,089 INFO L290 TraceCheckUtils]: 3: Hoare triple {8374#true} assume !false; {8374#true} is VALID [2022-02-21 03:09:56,089 INFO L290 TraceCheckUtils]: 4: Hoare triple {8374#true} assume !(~e <= -128); {8374#true} is VALID [2022-02-21 03:09:56,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {8374#true} assume ~e - 1 <= 2147483647; {8374#true} is VALID [2022-02-21 03:09:56,089 INFO L290 TraceCheckUtils]: 6: Hoare triple {8374#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {8374#true} is VALID [2022-02-21 03:09:56,089 INFO L290 TraceCheckUtils]: 7: Hoare triple {8374#true} assume !(~m % 4294967296 < 16777216); {8374#true} is VALID [2022-02-21 03:09:56,090 INFO L290 TraceCheckUtils]: 8: Hoare triple {8374#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {8374#true} is VALID [2022-02-21 03:09:56,090 INFO L290 TraceCheckUtils]: 9: Hoare triple {8374#true} assume 128 + ~e <= 2147483647; {8374#true} is VALID [2022-02-21 03:09:56,090 INFO L290 TraceCheckUtils]: 10: Hoare triple {8374#true} assume 128 + ~e >= -2147483648; {8374#true} is VALID [2022-02-21 03:09:56,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {8374#true} assume 16777216 * (128 + ~e) <= 2147483647; {8374#true} is VALID [2022-02-21 03:09:56,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {8374#true} assume 16777216 * (128 + ~e) >= -2147483648; {8374#true} is VALID [2022-02-21 03:09:56,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {8374#true} assume 128 + ~e <= 2147483647; {8374#true} is VALID [2022-02-21 03:09:56,090 INFO L290 TraceCheckUtils]: 14: Hoare triple {8374#true} assume 128 + ~e >= -2147483648; {8374#true} is VALID [2022-02-21 03:09:56,090 INFO L290 TraceCheckUtils]: 15: Hoare triple {8374#true} assume 16777216 * (128 + ~e) <= 2147483647; {8374#true} is VALID [2022-02-21 03:09:56,091 INFO L290 TraceCheckUtils]: 16: Hoare triple {8374#true} assume 16777216 * (128 + ~e) >= -2147483648; {8374#true} is VALID [2022-02-21 03:09:56,091 INFO L290 TraceCheckUtils]: 17: Hoare triple {8374#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {8374#true} is VALID [2022-02-21 03:09:56,091 INFO L290 TraceCheckUtils]: 18: Hoare triple {8374#true} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {8374#true} is VALID [2022-02-21 03:09:56,091 INFO L290 TraceCheckUtils]: 19: Hoare triple {8374#true} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {8374#true} is VALID [2022-02-21 03:09:56,091 INFO L290 TraceCheckUtils]: 20: Hoare triple {8374#true} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_77 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_77; {8374#true} is VALID [2022-02-21 03:09:56,091 INFO L290 TraceCheckUtils]: 21: Hoare triple {8374#true} ~__retres4~0 := ~res~0; {8374#true} is VALID [2022-02-21 03:09:56,091 INFO L290 TraceCheckUtils]: 22: Hoare triple {8374#true} #res := ~__retres4~0; {8374#true} is VALID [2022-02-21 03:09:56,092 INFO L290 TraceCheckUtils]: 23: Hoare triple {8374#true} assume true; {8374#true} is VALID [2022-02-21 03:09:56,092 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {8374#true} {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} #396#return; {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:09:56,092 INFO L290 TraceCheckUtils]: 0: Hoare triple {8374#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); {8374#true} is VALID [2022-02-21 03:09:56,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {8374#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:09:56,093 INFO L272 TraceCheckUtils]: 2: Hoare triple {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} call main_#t~ret22#1 := base2flt(0, 0); {8409#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:09:56,093 INFO L290 TraceCheckUtils]: 3: Hoare triple {8409#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8374#true} is VALID [2022-02-21 03:09:56,093 INFO L290 TraceCheckUtils]: 4: Hoare triple {8374#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {8374#true} is VALID [2022-02-21 03:09:56,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {8374#true} #res := ~__retres4~0; {8374#true} is VALID [2022-02-21 03:09:56,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {8374#true} assume true; {8374#true} is VALID [2022-02-21 03:09:56,094 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {8374#true} {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} #394#return; {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:09:56,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:09:56,095 INFO L272 TraceCheckUtils]: 9: Hoare triple {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} call main_#t~ret23#1 := base2flt(1, 0); {8409#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:09:56,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {8409#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8374#true} is VALID [2022-02-21 03:09:56,095 INFO L290 TraceCheckUtils]: 11: Hoare triple {8374#true} assume !(0 == ~m % 4294967296); {8374#true} is VALID [2022-02-21 03:09:56,095 INFO L290 TraceCheckUtils]: 12: Hoare triple {8374#true} assume ~m % 4294967296 < 16777216; {8374#true} is VALID [2022-02-21 03:09:56,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {8374#true} assume !false; {8374#true} is VALID [2022-02-21 03:09:56,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {8374#true} assume !(~e <= -128); {8374#true} is VALID [2022-02-21 03:09:56,096 INFO L290 TraceCheckUtils]: 15: Hoare triple {8374#true} assume ~e - 1 <= 2147483647; {8374#true} is VALID [2022-02-21 03:09:56,096 INFO L290 TraceCheckUtils]: 16: Hoare triple {8374#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {8374#true} is VALID [2022-02-21 03:09:56,096 INFO L290 TraceCheckUtils]: 17: Hoare triple {8374#true} assume !(~m % 4294967296 < 16777216); {8374#true} is VALID [2022-02-21 03:09:56,096 INFO L290 TraceCheckUtils]: 18: Hoare triple {8374#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {8374#true} is VALID [2022-02-21 03:09:56,096 INFO L290 TraceCheckUtils]: 19: Hoare triple {8374#true} assume 128 + ~e <= 2147483647; {8374#true} is VALID [2022-02-21 03:09:56,096 INFO L290 TraceCheckUtils]: 20: Hoare triple {8374#true} assume 128 + ~e >= -2147483648; {8374#true} is VALID [2022-02-21 03:09:56,096 INFO L290 TraceCheckUtils]: 21: Hoare triple {8374#true} assume 16777216 * (128 + ~e) <= 2147483647; {8374#true} is VALID [2022-02-21 03:09:56,097 INFO L290 TraceCheckUtils]: 22: Hoare triple {8374#true} assume 16777216 * (128 + ~e) >= -2147483648; {8374#true} is VALID [2022-02-21 03:09:56,097 INFO L290 TraceCheckUtils]: 23: Hoare triple {8374#true} assume 128 + ~e <= 2147483647; {8374#true} is VALID [2022-02-21 03:09:56,097 INFO L290 TraceCheckUtils]: 24: Hoare triple {8374#true} assume 128 + ~e >= -2147483648; {8374#true} is VALID [2022-02-21 03:09:56,097 INFO L290 TraceCheckUtils]: 25: Hoare triple {8374#true} assume 16777216 * (128 + ~e) <= 2147483647; {8374#true} is VALID [2022-02-21 03:09:56,097 INFO L290 TraceCheckUtils]: 26: Hoare triple {8374#true} assume 16777216 * (128 + ~e) >= -2147483648; {8374#true} is VALID [2022-02-21 03:09:56,097 INFO L290 TraceCheckUtils]: 27: Hoare triple {8374#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {8374#true} is VALID [2022-02-21 03:09:56,097 INFO L290 TraceCheckUtils]: 28: Hoare triple {8374#true} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {8374#true} is VALID [2022-02-21 03:09:56,097 INFO L290 TraceCheckUtils]: 29: Hoare triple {8374#true} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {8374#true} is VALID [2022-02-21 03:09:56,098 INFO L290 TraceCheckUtils]: 30: Hoare triple {8374#true} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_77 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_77; {8374#true} is VALID [2022-02-21 03:09:56,098 INFO L290 TraceCheckUtils]: 31: Hoare triple {8374#true} ~__retres4~0 := ~res~0; {8374#true} is VALID [2022-02-21 03:09:56,098 INFO L290 TraceCheckUtils]: 32: Hoare triple {8374#true} #res := ~__retres4~0; {8374#true} is VALID [2022-02-21 03:09:56,098 INFO L290 TraceCheckUtils]: 33: Hoare triple {8374#true} assume true; {8374#true} is VALID [2022-02-21 03:09:56,098 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8374#true} {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} #396#return; {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:09:56,099 INFO L290 TraceCheckUtils]: 35: Hoare triple {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:09:56,099 INFO L272 TraceCheckUtils]: 36: Hoare triple {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {8407#(<= |base2flt_#in~e| 127)} is VALID [2022-02-21 03:09:56,099 INFO L290 TraceCheckUtils]: 37: Hoare triple {8407#(<= |base2flt_#in~e| 127)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8408#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:56,100 INFO L290 TraceCheckUtils]: 38: Hoare triple {8408#(<= base2flt_~e 127)} assume !(0 == ~m % 4294967296); {8408#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:56,100 INFO L290 TraceCheckUtils]: 39: Hoare triple {8408#(<= base2flt_~e 127)} assume ~m % 4294967296 < 16777216; {8408#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:56,100 INFO L290 TraceCheckUtils]: 40: Hoare triple {8408#(<= base2flt_~e 127)} assume !false; {8408#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:56,101 INFO L290 TraceCheckUtils]: 41: Hoare triple {8408#(<= base2flt_~e 127)} assume !(~e <= -128); {8408#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:56,101 INFO L290 TraceCheckUtils]: 42: Hoare triple {8408#(<= base2flt_~e 127)} assume !(~e - 1 <= 2147483647); {8375#false} is VALID [2022-02-21 03:09:56,101 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-21 03:09:56,101 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:09:56,101 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785012743] [2022-02-21 03:09:56,102 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785012743] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:09:56,102 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755861096] [2022-02-21 03:09:56,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:56,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:09:56,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:09:56,103 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:09:56,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-21 03:09:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:56,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:09:56,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:56,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:09:56,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {8374#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); {8374#true} is VALID [2022-02-21 03:09:56,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {8374#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:09:56,254 INFO L272 TraceCheckUtils]: 2: Hoare triple {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} call main_#t~ret22#1 := base2flt(0, 0); {8374#true} is VALID [2022-02-21 03:09:56,254 INFO L290 TraceCheckUtils]: 3: Hoare triple {8374#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8374#true} is VALID [2022-02-21 03:09:56,254 INFO L290 TraceCheckUtils]: 4: Hoare triple {8374#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {8374#true} is VALID [2022-02-21 03:09:56,254 INFO L290 TraceCheckUtils]: 5: Hoare triple {8374#true} #res := ~__retres4~0; {8374#true} is VALID [2022-02-21 03:09:56,254 INFO L290 TraceCheckUtils]: 6: Hoare triple {8374#true} assume true; {8374#true} is VALID [2022-02-21 03:09:56,257 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {8374#true} {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} #394#return; {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:09:56,258 INFO L290 TraceCheckUtils]: 8: Hoare triple {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:09:56,258 INFO L272 TraceCheckUtils]: 9: Hoare triple {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} call main_#t~ret23#1 := base2flt(1, 0); {8374#true} is VALID [2022-02-21 03:09:56,258 INFO L290 TraceCheckUtils]: 10: Hoare triple {8374#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8374#true} is VALID [2022-02-21 03:09:56,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {8374#true} assume !(0 == ~m % 4294967296); {8374#true} is VALID [2022-02-21 03:09:56,258 INFO L290 TraceCheckUtils]: 12: Hoare triple {8374#true} assume ~m % 4294967296 < 16777216; {8374#true} is VALID [2022-02-21 03:09:56,258 INFO L290 TraceCheckUtils]: 13: Hoare triple {8374#true} assume !false; {8374#true} is VALID [2022-02-21 03:09:56,258 INFO L290 TraceCheckUtils]: 14: Hoare triple {8374#true} assume !(~e <= -128); {8374#true} is VALID [2022-02-21 03:09:56,258 INFO L290 TraceCheckUtils]: 15: Hoare triple {8374#true} assume ~e - 1 <= 2147483647; {8374#true} is VALID [2022-02-21 03:09:56,259 INFO L290 TraceCheckUtils]: 16: Hoare triple {8374#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {8374#true} is VALID [2022-02-21 03:09:56,259 INFO L290 TraceCheckUtils]: 17: Hoare triple {8374#true} assume !(~m % 4294967296 < 16777216); {8374#true} is VALID [2022-02-21 03:09:56,259 INFO L290 TraceCheckUtils]: 18: Hoare triple {8374#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {8374#true} is VALID [2022-02-21 03:09:56,259 INFO L290 TraceCheckUtils]: 19: Hoare triple {8374#true} assume 128 + ~e <= 2147483647; {8374#true} is VALID [2022-02-21 03:09:56,259 INFO L290 TraceCheckUtils]: 20: Hoare triple {8374#true} assume 128 + ~e >= -2147483648; {8374#true} is VALID [2022-02-21 03:09:56,259 INFO L290 TraceCheckUtils]: 21: Hoare triple {8374#true} assume 16777216 * (128 + ~e) <= 2147483647; {8374#true} is VALID [2022-02-21 03:09:56,259 INFO L290 TraceCheckUtils]: 22: Hoare triple {8374#true} assume 16777216 * (128 + ~e) >= -2147483648; {8374#true} is VALID [2022-02-21 03:09:56,259 INFO L290 TraceCheckUtils]: 23: Hoare triple {8374#true} assume 128 + ~e <= 2147483647; {8374#true} is VALID [2022-02-21 03:09:56,260 INFO L290 TraceCheckUtils]: 24: Hoare triple {8374#true} assume 128 + ~e >= -2147483648; {8374#true} is VALID [2022-02-21 03:09:56,260 INFO L290 TraceCheckUtils]: 25: Hoare triple {8374#true} assume 16777216 * (128 + ~e) <= 2147483647; {8374#true} is VALID [2022-02-21 03:09:56,260 INFO L290 TraceCheckUtils]: 26: Hoare triple {8374#true} assume 16777216 * (128 + ~e) >= -2147483648; {8374#true} is VALID [2022-02-21 03:09:56,260 INFO L290 TraceCheckUtils]: 27: Hoare triple {8374#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {8374#true} is VALID [2022-02-21 03:09:56,260 INFO L290 TraceCheckUtils]: 28: Hoare triple {8374#true} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {8374#true} is VALID [2022-02-21 03:09:56,260 INFO L290 TraceCheckUtils]: 29: Hoare triple {8374#true} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {8374#true} is VALID [2022-02-21 03:09:56,260 INFO L290 TraceCheckUtils]: 30: Hoare triple {8374#true} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_77 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_77; {8374#true} is VALID [2022-02-21 03:09:56,260 INFO L290 TraceCheckUtils]: 31: Hoare triple {8374#true} ~__retres4~0 := ~res~0; {8374#true} is VALID [2022-02-21 03:09:56,260 INFO L290 TraceCheckUtils]: 32: Hoare triple {8374#true} #res := ~__retres4~0; {8374#true} is VALID [2022-02-21 03:09:56,261 INFO L290 TraceCheckUtils]: 33: Hoare triple {8374#true} assume true; {8374#true} is VALID [2022-02-21 03:09:56,263 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8374#true} {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} #396#return; {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:09:56,264 INFO L290 TraceCheckUtils]: 35: Hoare triple {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:09:56,264 INFO L272 TraceCheckUtils]: 36: Hoare triple {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {8407#(<= |base2flt_#in~e| 127)} is VALID [2022-02-21 03:09:56,264 INFO L290 TraceCheckUtils]: 37: Hoare triple {8407#(<= |base2flt_#in~e| 127)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8408#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:56,265 INFO L290 TraceCheckUtils]: 38: Hoare triple {8408#(<= base2flt_~e 127)} assume !(0 == ~m % 4294967296); {8408#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:56,265 INFO L290 TraceCheckUtils]: 39: Hoare triple {8408#(<= base2flt_~e 127)} assume ~m % 4294967296 < 16777216; {8408#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:56,265 INFO L290 TraceCheckUtils]: 40: Hoare triple {8408#(<= base2flt_~e 127)} assume !false; {8408#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:56,265 INFO L290 TraceCheckUtils]: 41: Hoare triple {8408#(<= base2flt_~e 127)} assume !(~e <= -128); {8408#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:56,266 INFO L290 TraceCheckUtils]: 42: Hoare triple {8408#(<= base2flt_~e 127)} assume !(~e - 1 <= 2147483647); {8375#false} is VALID [2022-02-21 03:09:56,266 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-21 03:09:56,266 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:09:56,266 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755861096] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:09:56,266 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:09:56,266 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-02-21 03:09:56,267 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056780934] [2022-02-21 03:09:56,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:09:56,267 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2022-02-21 03:09:56,267 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:09:56,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:09:56,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:56,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:09:56,289 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:09:56,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:09:56,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:09:56,289 INFO L87 Difference]: Start difference. First operand 221 states and 280 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:09:56,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:56,701 INFO L93 Difference]: Finished difference Result 312 states and 409 transitions. [2022-02-21 03:09:56,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:09:56,701 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2022-02-21 03:09:56,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:09:56,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:09:56,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 228 transitions. [2022-02-21 03:09:56,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:09:56,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 228 transitions. [2022-02-21 03:09:56,704 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 228 transitions. [2022-02-21 03:09:56,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 228 edges. 228 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:56,842 INFO L225 Difference]: With dead ends: 312 [2022-02-21 03:09:56,842 INFO L226 Difference]: Without dead ends: 309 [2022-02-21 03:09:56,842 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:09:56,843 INFO L933 BasicCegarLoop]: 114 mSDtfsCounter, 218 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:09:56,843 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 378 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:09:56,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-02-21 03:09:56,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 290. [2022-02-21 03:09:56,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:09:56,890 INFO L82 GeneralOperation]: Start isEquivalent. First operand 309 states. Second operand has 290 states, 258 states have (on average 1.4651162790697674) internal successors, (378), 281 states have internal predecessors, (378), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:09:56,891 INFO L74 IsIncluded]: Start isIncluded. First operand 309 states. Second operand has 290 states, 258 states have (on average 1.4651162790697674) internal successors, (378), 281 states have internal predecessors, (378), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:09:56,891 INFO L87 Difference]: Start difference. First operand 309 states. Second operand has 290 states, 258 states have (on average 1.4651162790697674) internal successors, (378), 281 states have internal predecessors, (378), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:09:56,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:56,896 INFO L93 Difference]: Finished difference Result 309 states and 402 transitions. [2022-02-21 03:09:56,896 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 402 transitions. [2022-02-21 03:09:56,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:56,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:56,897 INFO L74 IsIncluded]: Start isIncluded. First operand has 290 states, 258 states have (on average 1.4651162790697674) internal successors, (378), 281 states have internal predecessors, (378), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 309 states. [2022-02-21 03:09:56,898 INFO L87 Difference]: Start difference. First operand has 290 states, 258 states have (on average 1.4651162790697674) internal successors, (378), 281 states have internal predecessors, (378), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 309 states. [2022-02-21 03:09:56,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:56,903 INFO L93 Difference]: Finished difference Result 309 states and 402 transitions. [2022-02-21 03:09:56,903 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 402 transitions. [2022-02-21 03:09:56,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:56,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:56,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:09:56,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:09:56,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 258 states have (on average 1.4651162790697674) internal successors, (378), 281 states have internal predecessors, (378), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:09:56,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 386 transitions. [2022-02-21 03:09:56,908 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 386 transitions. Word has length 43 [2022-02-21 03:09:56,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:09:56,908 INFO L470 AbstractCegarLoop]: Abstraction has 290 states and 386 transitions. [2022-02-21 03:09:56,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:09:56,909 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 386 transitions. [2022-02-21 03:09:56,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-21 03:09:56,909 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:09:56,909 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:09:56,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:09:57,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:09:57,126 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-02-21 03:09:57,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:09:57,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1796922619, now seen corresponding path program 1 times [2022-02-21 03:09:57,128 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:09:57,128 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529356668] [2022-02-21 03:09:57,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:57,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:09:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:57,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:09:57,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:57,211 INFO L290 TraceCheckUtils]: 0: Hoare triple {9856#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9821#true} is VALID [2022-02-21 03:09:57,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {9821#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {9821#true} is VALID [2022-02-21 03:09:57,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {9821#true} #res := ~__retres4~0; {9821#true} is VALID [2022-02-21 03:09:57,212 INFO L290 TraceCheckUtils]: 3: Hoare triple {9821#true} assume true; {9821#true} is VALID [2022-02-21 03:09:57,212 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {9821#true} {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} #394#return; {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:09:57,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:09:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:57,226 INFO L290 TraceCheckUtils]: 0: Hoare triple {9856#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9821#true} is VALID [2022-02-21 03:09:57,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {9821#true} assume !(0 == ~m % 4294967296); {9821#true} is VALID [2022-02-21 03:09:57,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {9821#true} assume ~m % 4294967296 < 16777216; {9821#true} is VALID [2022-02-21 03:09:57,227 INFO L290 TraceCheckUtils]: 3: Hoare triple {9821#true} assume !false; {9821#true} is VALID [2022-02-21 03:09:57,227 INFO L290 TraceCheckUtils]: 4: Hoare triple {9821#true} assume !(~e <= -128); {9821#true} is VALID [2022-02-21 03:09:57,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {9821#true} assume ~e - 1 <= 2147483647; {9821#true} is VALID [2022-02-21 03:09:57,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {9821#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {9821#true} is VALID [2022-02-21 03:09:57,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {9821#true} assume !(~m % 4294967296 < 16777216); {9821#true} is VALID [2022-02-21 03:09:57,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {9821#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {9821#true} is VALID [2022-02-21 03:09:57,227 INFO L290 TraceCheckUtils]: 9: Hoare triple {9821#true} assume 128 + ~e <= 2147483647; {9821#true} is VALID [2022-02-21 03:09:57,228 INFO L290 TraceCheckUtils]: 10: Hoare triple {9821#true} assume 128 + ~e >= -2147483648; {9821#true} is VALID [2022-02-21 03:09:57,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {9821#true} assume 16777216 * (128 + ~e) <= 2147483647; {9821#true} is VALID [2022-02-21 03:09:57,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {9821#true} assume 16777216 * (128 + ~e) >= -2147483648; {9821#true} is VALID [2022-02-21 03:09:57,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {9821#true} assume 128 + ~e <= 2147483647; {9821#true} is VALID [2022-02-21 03:09:57,228 INFO L290 TraceCheckUtils]: 14: Hoare triple {9821#true} assume 128 + ~e >= -2147483648; {9821#true} is VALID [2022-02-21 03:09:57,228 INFO L290 TraceCheckUtils]: 15: Hoare triple {9821#true} assume 16777216 * (128 + ~e) <= 2147483647; {9821#true} is VALID [2022-02-21 03:09:57,228 INFO L290 TraceCheckUtils]: 16: Hoare triple {9821#true} assume 16777216 * (128 + ~e) >= -2147483648; {9821#true} is VALID [2022-02-21 03:09:57,228 INFO L290 TraceCheckUtils]: 17: Hoare triple {9821#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {9821#true} is VALID [2022-02-21 03:09:57,228 INFO L290 TraceCheckUtils]: 18: Hoare triple {9821#true} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {9821#true} is VALID [2022-02-21 03:09:57,229 INFO L290 TraceCheckUtils]: 19: Hoare triple {9821#true} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {9821#true} is VALID [2022-02-21 03:09:57,229 INFO L290 TraceCheckUtils]: 20: Hoare triple {9821#true} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_77 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_77; {9821#true} is VALID [2022-02-21 03:09:57,229 INFO L290 TraceCheckUtils]: 21: Hoare triple {9821#true} ~__retres4~0 := ~res~0; {9821#true} is VALID [2022-02-21 03:09:57,229 INFO L290 TraceCheckUtils]: 22: Hoare triple {9821#true} #res := ~__retres4~0; {9821#true} is VALID [2022-02-21 03:09:57,229 INFO L290 TraceCheckUtils]: 23: Hoare triple {9821#true} assume true; {9821#true} is VALID [2022-02-21 03:09:57,230 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {9821#true} {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} #396#return; {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:09:57,230 INFO L290 TraceCheckUtils]: 0: Hoare triple {9821#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); {9821#true} is VALID [2022-02-21 03:09:57,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {9821#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:09:57,231 INFO L272 TraceCheckUtils]: 2: Hoare triple {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret22#1 := base2flt(0, 0); {9856#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:09:57,231 INFO L290 TraceCheckUtils]: 3: Hoare triple {9856#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9821#true} is VALID [2022-02-21 03:09:57,231 INFO L290 TraceCheckUtils]: 4: Hoare triple {9821#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {9821#true} is VALID [2022-02-21 03:09:57,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {9821#true} #res := ~__retres4~0; {9821#true} is VALID [2022-02-21 03:09:57,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {9821#true} assume true; {9821#true} is VALID [2022-02-21 03:09:57,232 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {9821#true} {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} #394#return; {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:09:57,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:09:57,232 INFO L272 TraceCheckUtils]: 9: Hoare triple {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret23#1 := base2flt(1, 0); {9856#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:09:57,233 INFO L290 TraceCheckUtils]: 10: Hoare triple {9856#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9821#true} is VALID [2022-02-21 03:09:57,233 INFO L290 TraceCheckUtils]: 11: Hoare triple {9821#true} assume !(0 == ~m % 4294967296); {9821#true} is VALID [2022-02-21 03:09:57,233 INFO L290 TraceCheckUtils]: 12: Hoare triple {9821#true} assume ~m % 4294967296 < 16777216; {9821#true} is VALID [2022-02-21 03:09:57,233 INFO L290 TraceCheckUtils]: 13: Hoare triple {9821#true} assume !false; {9821#true} is VALID [2022-02-21 03:09:57,233 INFO L290 TraceCheckUtils]: 14: Hoare triple {9821#true} assume !(~e <= -128); {9821#true} is VALID [2022-02-21 03:09:57,233 INFO L290 TraceCheckUtils]: 15: Hoare triple {9821#true} assume ~e - 1 <= 2147483647; {9821#true} is VALID [2022-02-21 03:09:57,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {9821#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {9821#true} is VALID [2022-02-21 03:09:57,233 INFO L290 TraceCheckUtils]: 17: Hoare triple {9821#true} assume !(~m % 4294967296 < 16777216); {9821#true} is VALID [2022-02-21 03:09:57,233 INFO L290 TraceCheckUtils]: 18: Hoare triple {9821#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {9821#true} is VALID [2022-02-21 03:09:57,234 INFO L290 TraceCheckUtils]: 19: Hoare triple {9821#true} assume 128 + ~e <= 2147483647; {9821#true} is VALID [2022-02-21 03:09:57,234 INFO L290 TraceCheckUtils]: 20: Hoare triple {9821#true} assume 128 + ~e >= -2147483648; {9821#true} is VALID [2022-02-21 03:09:57,234 INFO L290 TraceCheckUtils]: 21: Hoare triple {9821#true} assume 16777216 * (128 + ~e) <= 2147483647; {9821#true} is VALID [2022-02-21 03:09:57,234 INFO L290 TraceCheckUtils]: 22: Hoare triple {9821#true} assume 16777216 * (128 + ~e) >= -2147483648; {9821#true} is VALID [2022-02-21 03:09:57,234 INFO L290 TraceCheckUtils]: 23: Hoare triple {9821#true} assume 128 + ~e <= 2147483647; {9821#true} is VALID [2022-02-21 03:09:57,234 INFO L290 TraceCheckUtils]: 24: Hoare triple {9821#true} assume 128 + ~e >= -2147483648; {9821#true} is VALID [2022-02-21 03:09:57,234 INFO L290 TraceCheckUtils]: 25: Hoare triple {9821#true} assume 16777216 * (128 + ~e) <= 2147483647; {9821#true} is VALID [2022-02-21 03:09:57,234 INFO L290 TraceCheckUtils]: 26: Hoare triple {9821#true} assume 16777216 * (128 + ~e) >= -2147483648; {9821#true} is VALID [2022-02-21 03:09:57,234 INFO L290 TraceCheckUtils]: 27: Hoare triple {9821#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {9821#true} is VALID [2022-02-21 03:09:57,235 INFO L290 TraceCheckUtils]: 28: Hoare triple {9821#true} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {9821#true} is VALID [2022-02-21 03:09:57,235 INFO L290 TraceCheckUtils]: 29: Hoare triple {9821#true} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {9821#true} is VALID [2022-02-21 03:09:57,235 INFO L290 TraceCheckUtils]: 30: Hoare triple {9821#true} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_77 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_77; {9821#true} is VALID [2022-02-21 03:09:57,235 INFO L290 TraceCheckUtils]: 31: Hoare triple {9821#true} ~__retres4~0 := ~res~0; {9821#true} is VALID [2022-02-21 03:09:57,235 INFO L290 TraceCheckUtils]: 32: Hoare triple {9821#true} #res := ~__retres4~0; {9821#true} is VALID [2022-02-21 03:09:57,235 INFO L290 TraceCheckUtils]: 33: Hoare triple {9821#true} assume true; {9821#true} is VALID [2022-02-21 03:09:57,236 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9821#true} {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} #396#return; {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:09:57,236 INFO L290 TraceCheckUtils]: 35: Hoare triple {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:09:57,237 INFO L272 TraceCheckUtils]: 36: Hoare triple {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {9854#(<= 0 (+ 128 |base2flt_#in~e|))} is VALID [2022-02-21 03:09:57,237 INFO L290 TraceCheckUtils]: 37: Hoare triple {9854#(<= 0 (+ 128 |base2flt_#in~e|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9855#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:57,237 INFO L290 TraceCheckUtils]: 38: Hoare triple {9855#(<= 0 (+ 128 base2flt_~e))} assume !(0 == ~m % 4294967296); {9855#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:57,238 INFO L290 TraceCheckUtils]: 39: Hoare triple {9855#(<= 0 (+ 128 base2flt_~e))} assume !(~m % 4294967296 < 16777216); {9855#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:57,238 INFO L290 TraceCheckUtils]: 40: Hoare triple {9855#(<= 0 (+ 128 base2flt_~e))} assume !false; {9855#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:57,238 INFO L290 TraceCheckUtils]: 41: Hoare triple {9855#(<= 0 (+ 128 base2flt_~e))} assume ~m % 4294967296 >= 33554432; {9855#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:57,239 INFO L290 TraceCheckUtils]: 42: Hoare triple {9855#(<= 0 (+ 128 base2flt_~e))} assume !(~e >= 127); {9855#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:57,239 INFO L290 TraceCheckUtils]: 43: Hoare triple {9855#(<= 0 (+ 128 base2flt_~e))} assume 1 + ~e <= 2147483647; {9855#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:57,239 INFO L290 TraceCheckUtils]: 44: Hoare triple {9855#(<= 0 (+ 128 base2flt_~e))} assume !(1 + ~e >= -2147483648); {9822#false} is VALID [2022-02-21 03:09:57,239 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-21 03:09:57,240 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:09:57,240 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529356668] [2022-02-21 03:09:57,240 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529356668] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:09:57,240 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722154105] [2022-02-21 03:09:57,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:57,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:09:57,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:09:57,241 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:09:57,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-21 03:09:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:57,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:09:57,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:57,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:09:57,406 INFO L290 TraceCheckUtils]: 0: Hoare triple {9821#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); {9821#true} is VALID [2022-02-21 03:09:57,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {9821#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:09:57,406 INFO L272 TraceCheckUtils]: 2: Hoare triple {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret22#1 := base2flt(0, 0); {9821#true} is VALID [2022-02-21 03:09:57,407 INFO L290 TraceCheckUtils]: 3: Hoare triple {9821#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9821#true} is VALID [2022-02-21 03:09:57,407 INFO L290 TraceCheckUtils]: 4: Hoare triple {9821#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {9821#true} is VALID [2022-02-21 03:09:57,407 INFO L290 TraceCheckUtils]: 5: Hoare triple {9821#true} #res := ~__retres4~0; {9821#true} is VALID [2022-02-21 03:09:57,407 INFO L290 TraceCheckUtils]: 6: Hoare triple {9821#true} assume true; {9821#true} is VALID [2022-02-21 03:09:57,407 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {9821#true} {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} #394#return; {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:09:57,408 INFO L290 TraceCheckUtils]: 8: Hoare triple {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:09:57,408 INFO L272 TraceCheckUtils]: 9: Hoare triple {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret23#1 := base2flt(1, 0); {9821#true} is VALID [2022-02-21 03:09:57,408 INFO L290 TraceCheckUtils]: 10: Hoare triple {9821#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9821#true} is VALID [2022-02-21 03:09:57,408 INFO L290 TraceCheckUtils]: 11: Hoare triple {9821#true} assume !(0 == ~m % 4294967296); {9821#true} is VALID [2022-02-21 03:09:57,408 INFO L290 TraceCheckUtils]: 12: Hoare triple {9821#true} assume ~m % 4294967296 < 16777216; {9821#true} is VALID [2022-02-21 03:09:57,408 INFO L290 TraceCheckUtils]: 13: Hoare triple {9821#true} assume !false; {9821#true} is VALID [2022-02-21 03:09:57,408 INFO L290 TraceCheckUtils]: 14: Hoare triple {9821#true} assume !(~e <= -128); {9821#true} is VALID [2022-02-21 03:09:57,408 INFO L290 TraceCheckUtils]: 15: Hoare triple {9821#true} assume ~e - 1 <= 2147483647; {9821#true} is VALID [2022-02-21 03:09:57,409 INFO L290 TraceCheckUtils]: 16: Hoare triple {9821#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {9821#true} is VALID [2022-02-21 03:09:57,409 INFO L290 TraceCheckUtils]: 17: Hoare triple {9821#true} assume !(~m % 4294967296 < 16777216); {9821#true} is VALID [2022-02-21 03:09:57,409 INFO L290 TraceCheckUtils]: 18: Hoare triple {9821#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {9821#true} is VALID [2022-02-21 03:09:57,409 INFO L290 TraceCheckUtils]: 19: Hoare triple {9821#true} assume 128 + ~e <= 2147483647; {9821#true} is VALID [2022-02-21 03:09:57,409 INFO L290 TraceCheckUtils]: 20: Hoare triple {9821#true} assume 128 + ~e >= -2147483648; {9821#true} is VALID [2022-02-21 03:09:57,409 INFO L290 TraceCheckUtils]: 21: Hoare triple {9821#true} assume 16777216 * (128 + ~e) <= 2147483647; {9821#true} is VALID [2022-02-21 03:09:57,409 INFO L290 TraceCheckUtils]: 22: Hoare triple {9821#true} assume 16777216 * (128 + ~e) >= -2147483648; {9821#true} is VALID [2022-02-21 03:09:57,409 INFO L290 TraceCheckUtils]: 23: Hoare triple {9821#true} assume 128 + ~e <= 2147483647; {9821#true} is VALID [2022-02-21 03:09:57,409 INFO L290 TraceCheckUtils]: 24: Hoare triple {9821#true} assume 128 + ~e >= -2147483648; {9821#true} is VALID [2022-02-21 03:09:57,410 INFO L290 TraceCheckUtils]: 25: Hoare triple {9821#true} assume 16777216 * (128 + ~e) <= 2147483647; {9821#true} is VALID [2022-02-21 03:09:57,410 INFO L290 TraceCheckUtils]: 26: Hoare triple {9821#true} assume 16777216 * (128 + ~e) >= -2147483648; {9821#true} is VALID [2022-02-21 03:09:57,410 INFO L290 TraceCheckUtils]: 27: Hoare triple {9821#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {9821#true} is VALID [2022-02-21 03:09:57,410 INFO L290 TraceCheckUtils]: 28: Hoare triple {9821#true} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {9821#true} is VALID [2022-02-21 03:09:57,410 INFO L290 TraceCheckUtils]: 29: Hoare triple {9821#true} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {9821#true} is VALID [2022-02-21 03:09:57,410 INFO L290 TraceCheckUtils]: 30: Hoare triple {9821#true} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_77 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_77; {9821#true} is VALID [2022-02-21 03:09:57,410 INFO L290 TraceCheckUtils]: 31: Hoare triple {9821#true} ~__retres4~0 := ~res~0; {9821#true} is VALID [2022-02-21 03:09:57,410 INFO L290 TraceCheckUtils]: 32: Hoare triple {9821#true} #res := ~__retres4~0; {9821#true} is VALID [2022-02-21 03:09:57,410 INFO L290 TraceCheckUtils]: 33: Hoare triple {9821#true} assume true; {9821#true} is VALID [2022-02-21 03:09:57,410 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9821#true} {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} #396#return; {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:09:57,411 INFO L290 TraceCheckUtils]: 35: Hoare triple {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:09:57,413 INFO L272 TraceCheckUtils]: 36: Hoare triple {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {9854#(<= 0 (+ 128 |base2flt_#in~e|))} is VALID [2022-02-21 03:09:57,413 INFO L290 TraceCheckUtils]: 37: Hoare triple {9854#(<= 0 (+ 128 |base2flt_#in~e|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9855#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:57,413 INFO L290 TraceCheckUtils]: 38: Hoare triple {9855#(<= 0 (+ 128 base2flt_~e))} assume !(0 == ~m % 4294967296); {9855#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:57,414 INFO L290 TraceCheckUtils]: 39: Hoare triple {9855#(<= 0 (+ 128 base2flt_~e))} assume !(~m % 4294967296 < 16777216); {9855#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:57,414 INFO L290 TraceCheckUtils]: 40: Hoare triple {9855#(<= 0 (+ 128 base2flt_~e))} assume !false; {9855#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:57,414 INFO L290 TraceCheckUtils]: 41: Hoare triple {9855#(<= 0 (+ 128 base2flt_~e))} assume ~m % 4294967296 >= 33554432; {9855#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:57,415 INFO L290 TraceCheckUtils]: 42: Hoare triple {9855#(<= 0 (+ 128 base2flt_~e))} assume !(~e >= 127); {9855#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:57,415 INFO L290 TraceCheckUtils]: 43: Hoare triple {9855#(<= 0 (+ 128 base2flt_~e))} assume 1 + ~e <= 2147483647; {9855#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:57,417 INFO L290 TraceCheckUtils]: 44: Hoare triple {9855#(<= 0 (+ 128 base2flt_~e))} assume !(1 + ~e >= -2147483648); {9822#false} is VALID [2022-02-21 03:09:57,418 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-21 03:09:57,418 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:09:57,418 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722154105] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:09:57,418 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:09:57,418 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-02-21 03:09:57,418 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696078827] [2022-02-21 03:09:57,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:09:57,418 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2022-02-21 03:09:57,418 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:09:57,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:09:57,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:57,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:09:57,462 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:09:57,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:09:57,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:09:57,465 INFO L87 Difference]: Start difference. First operand 290 states and 386 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:09:57,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:57,884 INFO L93 Difference]: Finished difference Result 316 states and 410 transitions. [2022-02-21 03:09:57,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:09:57,885 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2022-02-21 03:09:57,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:09:57,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:09:57,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 237 transitions. [2022-02-21 03:09:57,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:09:57,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 237 transitions. [2022-02-21 03:09:57,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 237 transitions. [2022-02-21 03:09:58,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 237 edges. 237 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:58,038 INFO L225 Difference]: With dead ends: 316 [2022-02-21 03:09:58,038 INFO L226 Difference]: Without dead ends: 311 [2022-02-21 03:09:58,038 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:09:58,039 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 171 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:09:58,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 449 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:09:58,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-02-21 03:09:58,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 270. [2022-02-21 03:09:58,104 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:09:58,105 INFO L82 GeneralOperation]: Start isEquivalent. First operand 311 states. Second operand has 270 states, 238 states have (on average 1.4411764705882353) internal successors, (343), 261 states have internal predecessors, (343), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:09:58,105 INFO L74 IsIncluded]: Start isIncluded. First operand 311 states. Second operand has 270 states, 238 states have (on average 1.4411764705882353) internal successors, (343), 261 states have internal predecessors, (343), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:09:58,105 INFO L87 Difference]: Start difference. First operand 311 states. Second operand has 270 states, 238 states have (on average 1.4411764705882353) internal successors, (343), 261 states have internal predecessors, (343), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:09:58,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:58,110 INFO L93 Difference]: Finished difference Result 311 states and 401 transitions. [2022-02-21 03:09:58,110 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 401 transitions. [2022-02-21 03:09:58,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:58,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:58,110 INFO L74 IsIncluded]: Start isIncluded. First operand has 270 states, 238 states have (on average 1.4411764705882353) internal successors, (343), 261 states have internal predecessors, (343), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 311 states. [2022-02-21 03:09:58,111 INFO L87 Difference]: Start difference. First operand has 270 states, 238 states have (on average 1.4411764705882353) internal successors, (343), 261 states have internal predecessors, (343), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 311 states. [2022-02-21 03:09:58,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:58,115 INFO L93 Difference]: Finished difference Result 311 states and 401 transitions. [2022-02-21 03:09:58,115 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 401 transitions. [2022-02-21 03:09:58,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:58,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:58,116 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:09:58,116 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:09:58,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 238 states have (on average 1.4411764705882353) internal successors, (343), 261 states have internal predecessors, (343), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:09:58,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 351 transitions. [2022-02-21 03:09:58,120 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 351 transitions. Word has length 45 [2022-02-21 03:09:58,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:09:58,120 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 351 transitions. [2022-02-21 03:09:58,120 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:09:58,120 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 351 transitions. [2022-02-21 03:09:58,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-21 03:09:58,120 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:09:58,120 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:09:58,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:09:58,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:09:58,337 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-02-21 03:09:58,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:09:58,337 INFO L85 PathProgramCache]: Analyzing trace with hash 132146510, now seen corresponding path program 1 times [2022-02-21 03:09:58,337 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:09:58,337 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519395505] [2022-02-21 03:09:58,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:58,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:09:58,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:58,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:09:58,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:58,391 INFO L290 TraceCheckUtils]: 0: Hoare triple {11295#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {11263#true} is VALID [2022-02-21 03:09:58,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {11263#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {11263#true} is VALID [2022-02-21 03:09:58,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {11263#true} #res := ~__retres4~0; {11263#true} is VALID [2022-02-21 03:09:58,392 INFO L290 TraceCheckUtils]: 3: Hoare triple {11263#true} assume true; {11263#true} is VALID [2022-02-21 03:09:58,392 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {11263#true} {11263#true} #394#return; {11263#true} is VALID [2022-02-21 03:09:58,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:09:58,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:58,454 INFO L290 TraceCheckUtils]: 0: Hoare triple {11295#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:09:58,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !(0 == ~m % 4294967296); {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:09:58,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~m % 4294967296 < 16777216; {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:09:58,455 INFO L290 TraceCheckUtils]: 3: Hoare triple {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !false; {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:09:58,455 INFO L290 TraceCheckUtils]: 4: Hoare triple {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !(~e <= -128); {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:09:58,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~e - 1 <= 2147483647; {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:09:58,456 INFO L290 TraceCheckUtils]: 6: Hoare triple {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {11297#(or (and (<= base2flt_~m 2) (not (<= (+ (div base2flt_~m 4294967296) 1) 0))) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:09:58,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {11297#(or (and (<= base2flt_~m 2) (not (<= (+ (div base2flt_~m 4294967296) 1) 0))) (not (= |base2flt_#in~m| 1)))} assume !(~m % 4294967296 < 16777216); {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:09:58,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:09:58,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:09:58,458 INFO L290 TraceCheckUtils]: 10: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:09:58,458 INFO L290 TraceCheckUtils]: 11: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) <= 2147483647; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:09:58,458 INFO L290 TraceCheckUtils]: 12: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) >= -2147483648; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:09:58,458 INFO L290 TraceCheckUtils]: 13: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:09:58,459 INFO L290 TraceCheckUtils]: 14: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:09:58,459 INFO L290 TraceCheckUtils]: 15: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) <= 2147483647; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:09:58,459 INFO L290 TraceCheckUtils]: 16: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) >= -2147483648; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:09:58,459 INFO L290 TraceCheckUtils]: 17: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:09:58,460 INFO L290 TraceCheckUtils]: 18: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:09:58,460 INFO L290 TraceCheckUtils]: 19: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:09:58,460 INFO L290 TraceCheckUtils]: 20: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_77 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_77; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:09:58,460 INFO L290 TraceCheckUtils]: 21: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} ~__retres4~0 := ~res~0; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:09:58,461 INFO L290 TraceCheckUtils]: 22: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} #res := ~__retres4~0; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:09:58,461 INFO L290 TraceCheckUtils]: 23: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume true; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:09:58,461 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {11298#(not (= |base2flt_#in~m| 1))} {11263#true} #396#return; {11264#false} is VALID [2022-02-21 03:09:58,462 INFO L290 TraceCheckUtils]: 0: Hoare triple {11263#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); {11263#true} is VALID [2022-02-21 03:09:58,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {11263#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {11263#true} is VALID [2022-02-21 03:09:58,462 INFO L272 TraceCheckUtils]: 2: Hoare triple {11263#true} call main_#t~ret22#1 := base2flt(0, 0); {11295#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:09:58,462 INFO L290 TraceCheckUtils]: 3: Hoare triple {11295#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {11263#true} is VALID [2022-02-21 03:09:58,462 INFO L290 TraceCheckUtils]: 4: Hoare triple {11263#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {11263#true} is VALID [2022-02-21 03:09:58,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {11263#true} #res := ~__retres4~0; {11263#true} is VALID [2022-02-21 03:09:58,463 INFO L290 TraceCheckUtils]: 6: Hoare triple {11263#true} assume true; {11263#true} is VALID [2022-02-21 03:09:58,463 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11263#true} {11263#true} #394#return; {11263#true} is VALID [2022-02-21 03:09:58,463 INFO L290 TraceCheckUtils]: 8: Hoare triple {11263#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {11263#true} is VALID [2022-02-21 03:09:58,463 INFO L272 TraceCheckUtils]: 9: Hoare triple {11263#true} call main_#t~ret23#1 := base2flt(1, 0); {11295#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:09:58,464 INFO L290 TraceCheckUtils]: 10: Hoare triple {11295#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:09:58,464 INFO L290 TraceCheckUtils]: 11: Hoare triple {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !(0 == ~m % 4294967296); {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:09:58,464 INFO L290 TraceCheckUtils]: 12: Hoare triple {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~m % 4294967296 < 16777216; {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:09:58,464 INFO L290 TraceCheckUtils]: 13: Hoare triple {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !false; {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:09:58,465 INFO L290 TraceCheckUtils]: 14: Hoare triple {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !(~e <= -128); {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:09:58,465 INFO L290 TraceCheckUtils]: 15: Hoare triple {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~e - 1 <= 2147483647; {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:09:58,465 INFO L290 TraceCheckUtils]: 16: Hoare triple {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {11297#(or (and (<= base2flt_~m 2) (not (<= (+ (div base2flt_~m 4294967296) 1) 0))) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:09:58,466 INFO L290 TraceCheckUtils]: 17: Hoare triple {11297#(or (and (<= base2flt_~m 2) (not (<= (+ (div base2flt_~m 4294967296) 1) 0))) (not (= |base2flt_#in~m| 1)))} assume !(~m % 4294967296 < 16777216); {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:09:58,466 INFO L290 TraceCheckUtils]: 18: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:09:58,466 INFO L290 TraceCheckUtils]: 19: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:09:58,466 INFO L290 TraceCheckUtils]: 20: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:09:58,467 INFO L290 TraceCheckUtils]: 21: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) <= 2147483647; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:09:58,467 INFO L290 TraceCheckUtils]: 22: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) >= -2147483648; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:09:58,467 INFO L290 TraceCheckUtils]: 23: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:09:58,467 INFO L290 TraceCheckUtils]: 24: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:09:58,468 INFO L290 TraceCheckUtils]: 25: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) <= 2147483647; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:09:58,468 INFO L290 TraceCheckUtils]: 26: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) >= -2147483648; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:09:58,468 INFO L290 TraceCheckUtils]: 27: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:09:58,468 INFO L290 TraceCheckUtils]: 28: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:09:58,469 INFO L290 TraceCheckUtils]: 29: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:09:58,469 INFO L290 TraceCheckUtils]: 30: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_77 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_77; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:09:58,469 INFO L290 TraceCheckUtils]: 31: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} ~__retres4~0 := ~res~0; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:09:58,469 INFO L290 TraceCheckUtils]: 32: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} #res := ~__retres4~0; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:09:58,470 INFO L290 TraceCheckUtils]: 33: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume true; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:09:58,470 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {11298#(not (= |base2flt_#in~m| 1))} {11263#true} #396#return; {11264#false} is VALID [2022-02-21 03:09:58,470 INFO L290 TraceCheckUtils]: 35: Hoare triple {11264#false} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {11264#false} is VALID [2022-02-21 03:09:58,470 INFO L272 TraceCheckUtils]: 36: Hoare triple {11264#false} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {11264#false} is VALID [2022-02-21 03:09:58,471 INFO L290 TraceCheckUtils]: 37: Hoare triple {11264#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {11264#false} is VALID [2022-02-21 03:09:58,471 INFO L290 TraceCheckUtils]: 38: Hoare triple {11264#false} assume !(0 == ~m % 4294967296); {11264#false} is VALID [2022-02-21 03:09:58,471 INFO L290 TraceCheckUtils]: 39: Hoare triple {11264#false} assume !(~m % 4294967296 < 16777216); {11264#false} is VALID [2022-02-21 03:09:58,471 INFO L290 TraceCheckUtils]: 40: Hoare triple {11264#false} assume !false; {11264#false} is VALID [2022-02-21 03:09:58,471 INFO L290 TraceCheckUtils]: 41: Hoare triple {11264#false} assume !(~m % 4294967296 >= 33554432); {11264#false} is VALID [2022-02-21 03:09:58,471 INFO L290 TraceCheckUtils]: 42: Hoare triple {11264#false} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {11264#false} is VALID [2022-02-21 03:09:58,471 INFO L290 TraceCheckUtils]: 43: Hoare triple {11264#false} assume 128 + ~e <= 2147483647; {11264#false} is VALID [2022-02-21 03:09:58,471 INFO L290 TraceCheckUtils]: 44: Hoare triple {11264#false} assume 128 + ~e >= -2147483648; {11264#false} is VALID [2022-02-21 03:09:58,471 INFO L290 TraceCheckUtils]: 45: Hoare triple {11264#false} assume !(16777216 * (128 + ~e) <= 2147483647); {11264#false} is VALID [2022-02-21 03:09:58,472 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:09:58,472 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:09:58,472 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519395505] [2022-02-21 03:09:58,472 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519395505] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:09:58,472 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:09:58,472 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-21 03:09:58,473 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351138600] [2022-02-21 03:09:58,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:09:58,474 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2022-02-21 03:09:58,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:09:58,474 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:09:58,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:58,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:09:58,498 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:09:58,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:09:58,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:09:58,499 INFO L87 Difference]: Start difference. First operand 270 states and 351 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:09:59,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:59,236 INFO L93 Difference]: Finished difference Result 875 states and 1119 transitions. [2022-02-21 03:09:59,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 03:09:59,236 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2022-02-21 03:09:59,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:09:59,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:09:59,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 499 transitions. [2022-02-21 03:09:59,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:09:59,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 499 transitions. [2022-02-21 03:09:59,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 499 transitions. [2022-02-21 03:09:59,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 499 edges. 499 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:59,587 INFO L225 Difference]: With dead ends: 875 [2022-02-21 03:09:59,588 INFO L226 Difference]: Without dead ends: 648 [2022-02-21 03:09:59,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-02-21 03:09:59,589 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 336 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:09:59,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 438 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:09:59,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2022-02-21 03:09:59,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 270. [2022-02-21 03:09:59,664 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:09:59,664 INFO L82 GeneralOperation]: Start isEquivalent. First operand 648 states. Second operand has 270 states, 238 states have (on average 1.4369747899159664) internal successors, (342), 261 states have internal predecessors, (342), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:09:59,665 INFO L74 IsIncluded]: Start isIncluded. First operand 648 states. Second operand has 270 states, 238 states have (on average 1.4369747899159664) internal successors, (342), 261 states have internal predecessors, (342), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:09:59,665 INFO L87 Difference]: Start difference. First operand 648 states. Second operand has 270 states, 238 states have (on average 1.4369747899159664) internal successors, (342), 261 states have internal predecessors, (342), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:09:59,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:59,688 INFO L93 Difference]: Finished difference Result 648 states and 821 transitions. [2022-02-21 03:09:59,688 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 821 transitions. [2022-02-21 03:09:59,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:59,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:59,690 INFO L74 IsIncluded]: Start isIncluded. First operand has 270 states, 238 states have (on average 1.4369747899159664) internal successors, (342), 261 states have internal predecessors, (342), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 648 states. [2022-02-21 03:09:59,690 INFO L87 Difference]: Start difference. First operand has 270 states, 238 states have (on average 1.4369747899159664) internal successors, (342), 261 states have internal predecessors, (342), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 648 states. [2022-02-21 03:09:59,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:59,705 INFO L93 Difference]: Finished difference Result 648 states and 821 transitions. [2022-02-21 03:09:59,705 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 821 transitions. [2022-02-21 03:09:59,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:59,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:59,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:09:59,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:09:59,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 238 states have (on average 1.4369747899159664) internal successors, (342), 261 states have internal predecessors, (342), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:09:59,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 350 transitions. [2022-02-21 03:09:59,711 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 350 transitions. Word has length 46 [2022-02-21 03:09:59,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:09:59,711 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 350 transitions. [2022-02-21 03:09:59,711 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:09:59,712 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 350 transitions. [2022-02-21 03:09:59,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-21 03:09:59,713 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:09:59,713 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:09:59,713 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-21 03:09:59,714 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-02-21 03:09:59,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:09:59,714 INFO L85 PathProgramCache]: Analyzing trace with hash 594216172, now seen corresponding path program 1 times [2022-02-21 03:09:59,714 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:09:59,714 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645090134] [2022-02-21 03:09:59,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:59,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:09:59,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:59,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:09:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:59,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {13898#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {13863#true} is VALID [2022-02-21 03:09:59,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {13863#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {13863#true} is VALID [2022-02-21 03:09:59,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {13863#true} #res := ~__retres4~0; {13863#true} is VALID [2022-02-21 03:09:59,759 INFO L290 TraceCheckUtils]: 3: Hoare triple {13863#true} assume true; {13863#true} is VALID [2022-02-21 03:09:59,759 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {13863#true} {13863#true} #394#return; {13863#true} is VALID [2022-02-21 03:09:59,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:09:59,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:59,828 INFO L290 TraceCheckUtils]: 0: Hoare triple {13898#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:09:59,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !(0 == ~m % 4294967296); {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:09:59,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~m % 4294967296 < 16777216; {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:09:59,829 INFO L290 TraceCheckUtils]: 3: Hoare triple {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !false; {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:09:59,829 INFO L290 TraceCheckUtils]: 4: Hoare triple {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !(~e <= -128); {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:09:59,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~e - 1 <= 2147483647; {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:09:59,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {13900#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:09:59,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {13900#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume ~m % 4294967296 < 16777216; {13900#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:09:59,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {13900#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume !false; {13900#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:09:59,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {13900#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume !(~e <= -128); {13900#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:09:59,831 INFO L290 TraceCheckUtils]: 10: Hoare triple {13900#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume ~e - 1 <= 2147483647; {13900#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:09:59,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {13900#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {13901#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:09:59,832 INFO L290 TraceCheckUtils]: 12: Hoare triple {13901#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~m % 4294967296 < 16777216; {13901#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:09:59,832 INFO L290 TraceCheckUtils]: 13: Hoare triple {13901#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume !false; {13901#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:09:59,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {13901#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume !(~e <= -128); {13901#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:09:59,833 INFO L290 TraceCheckUtils]: 15: Hoare triple {13901#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~e - 1 <= 2147483647; {13901#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:09:59,834 INFO L290 TraceCheckUtils]: 16: Hoare triple {13901#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {13902#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} is VALID [2022-02-21 03:09:59,834 INFO L290 TraceCheckUtils]: 17: Hoare triple {13902#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} assume ~m % 4294967296 < 16777216; {13902#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} is VALID [2022-02-21 03:09:59,834 INFO L290 TraceCheckUtils]: 18: Hoare triple {13902#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} assume !false; {13902#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} is VALID [2022-02-21 03:09:59,834 INFO L290 TraceCheckUtils]: 19: Hoare triple {13902#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} assume !(~e <= -128); {13902#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} is VALID [2022-02-21 03:09:59,835 INFO L290 TraceCheckUtils]: 20: Hoare triple {13902#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} assume ~e - 1 <= 2147483647; {13902#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} is VALID [2022-02-21 03:09:59,835 INFO L290 TraceCheckUtils]: 21: Hoare triple {13902#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {13903#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:09:59,835 INFO L290 TraceCheckUtils]: 22: Hoare triple {13903#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} assume ~m % 4294967296 < 16777216; {13903#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:09:59,836 INFO L290 TraceCheckUtils]: 23: Hoare triple {13903#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} assume !false; {13903#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:09:59,836 INFO L290 TraceCheckUtils]: 24: Hoare triple {13903#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} assume ~e <= -128;~__retres4~0 := 0; {13904#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:09:59,836 INFO L290 TraceCheckUtils]: 25: Hoare triple {13904#(not (= |base2flt_#in~e| 0))} #res := ~__retres4~0; {13904#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:09:59,837 INFO L290 TraceCheckUtils]: 26: Hoare triple {13904#(not (= |base2flt_#in~e| 0))} assume true; {13904#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:09:59,837 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {13904#(not (= |base2flt_#in~e| 0))} {13863#true} #396#return; {13864#false} is VALID [2022-02-21 03:09:59,837 INFO L290 TraceCheckUtils]: 0: Hoare triple {13863#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); {13863#true} is VALID [2022-02-21 03:09:59,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {13863#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {13863#true} is VALID [2022-02-21 03:09:59,838 INFO L272 TraceCheckUtils]: 2: Hoare triple {13863#true} call main_#t~ret22#1 := base2flt(0, 0); {13898#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:09:59,838 INFO L290 TraceCheckUtils]: 3: Hoare triple {13898#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {13863#true} is VALID [2022-02-21 03:09:59,838 INFO L290 TraceCheckUtils]: 4: Hoare triple {13863#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {13863#true} is VALID [2022-02-21 03:09:59,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {13863#true} #res := ~__retres4~0; {13863#true} is VALID [2022-02-21 03:09:59,838 INFO L290 TraceCheckUtils]: 6: Hoare triple {13863#true} assume true; {13863#true} is VALID [2022-02-21 03:09:59,838 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13863#true} {13863#true} #394#return; {13863#true} is VALID [2022-02-21 03:09:59,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {13863#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {13863#true} is VALID [2022-02-21 03:09:59,839 INFO L272 TraceCheckUtils]: 9: Hoare triple {13863#true} call main_#t~ret23#1 := base2flt(1, 0); {13898#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:09:59,839 INFO L290 TraceCheckUtils]: 10: Hoare triple {13898#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:09:59,839 INFO L290 TraceCheckUtils]: 11: Hoare triple {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !(0 == ~m % 4294967296); {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:09:59,840 INFO L290 TraceCheckUtils]: 12: Hoare triple {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~m % 4294967296 < 16777216; {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:09:59,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !false; {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:09:59,840 INFO L290 TraceCheckUtils]: 14: Hoare triple {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !(~e <= -128); {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:09:59,841 INFO L290 TraceCheckUtils]: 15: Hoare triple {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~e - 1 <= 2147483647; {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:09:59,841 INFO L290 TraceCheckUtils]: 16: Hoare triple {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {13900#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:09:59,842 INFO L290 TraceCheckUtils]: 17: Hoare triple {13900#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume ~m % 4294967296 < 16777216; {13900#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:09:59,842 INFO L290 TraceCheckUtils]: 18: Hoare triple {13900#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume !false; {13900#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:09:59,842 INFO L290 TraceCheckUtils]: 19: Hoare triple {13900#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume !(~e <= -128); {13900#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:09:59,842 INFO L290 TraceCheckUtils]: 20: Hoare triple {13900#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume ~e - 1 <= 2147483647; {13900#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:09:59,843 INFO L290 TraceCheckUtils]: 21: Hoare triple {13900#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {13901#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:09:59,843 INFO L290 TraceCheckUtils]: 22: Hoare triple {13901#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~m % 4294967296 < 16777216; {13901#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:09:59,843 INFO L290 TraceCheckUtils]: 23: Hoare triple {13901#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume !false; {13901#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:09:59,844 INFO L290 TraceCheckUtils]: 24: Hoare triple {13901#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume !(~e <= -128); {13901#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:09:59,844 INFO L290 TraceCheckUtils]: 25: Hoare triple {13901#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~e - 1 <= 2147483647; {13901#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:09:59,845 INFO L290 TraceCheckUtils]: 26: Hoare triple {13901#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {13902#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} is VALID [2022-02-21 03:09:59,845 INFO L290 TraceCheckUtils]: 27: Hoare triple {13902#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} assume ~m % 4294967296 < 16777216; {13902#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} is VALID [2022-02-21 03:09:59,845 INFO L290 TraceCheckUtils]: 28: Hoare triple {13902#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} assume !false; {13902#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} is VALID [2022-02-21 03:09:59,845 INFO L290 TraceCheckUtils]: 29: Hoare triple {13902#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} assume !(~e <= -128); {13902#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} is VALID [2022-02-21 03:09:59,846 INFO L290 TraceCheckUtils]: 30: Hoare triple {13902#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} assume ~e - 1 <= 2147483647; {13902#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} is VALID [2022-02-21 03:09:59,846 INFO L290 TraceCheckUtils]: 31: Hoare triple {13902#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {13903#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:09:59,846 INFO L290 TraceCheckUtils]: 32: Hoare triple {13903#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} assume ~m % 4294967296 < 16777216; {13903#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:09:59,847 INFO L290 TraceCheckUtils]: 33: Hoare triple {13903#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} assume !false; {13903#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:09:59,847 INFO L290 TraceCheckUtils]: 34: Hoare triple {13903#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} assume ~e <= -128;~__retres4~0 := 0; {13904#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:09:59,847 INFO L290 TraceCheckUtils]: 35: Hoare triple {13904#(not (= |base2flt_#in~e| 0))} #res := ~__retres4~0; {13904#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:09:59,848 INFO L290 TraceCheckUtils]: 36: Hoare triple {13904#(not (= |base2flt_#in~e| 0))} assume true; {13904#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:09:59,848 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {13904#(not (= |base2flt_#in~e| 0))} {13863#true} #396#return; {13864#false} is VALID [2022-02-21 03:09:59,848 INFO L290 TraceCheckUtils]: 38: Hoare triple {13864#false} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {13864#false} is VALID [2022-02-21 03:09:59,848 INFO L272 TraceCheckUtils]: 39: Hoare triple {13864#false} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {13864#false} is VALID [2022-02-21 03:09:59,848 INFO L290 TraceCheckUtils]: 40: Hoare triple {13864#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {13864#false} is VALID [2022-02-21 03:09:59,848 INFO L290 TraceCheckUtils]: 41: Hoare triple {13864#false} assume !(0 == ~m % 4294967296); {13864#false} is VALID [2022-02-21 03:09:59,849 INFO L290 TraceCheckUtils]: 42: Hoare triple {13864#false} assume !(~m % 4294967296 < 16777216); {13864#false} is VALID [2022-02-21 03:09:59,849 INFO L290 TraceCheckUtils]: 43: Hoare triple {13864#false} assume !false; {13864#false} is VALID [2022-02-21 03:09:59,849 INFO L290 TraceCheckUtils]: 44: Hoare triple {13864#false} assume !(~m % 4294967296 >= 33554432); {13864#false} is VALID [2022-02-21 03:09:59,849 INFO L290 TraceCheckUtils]: 45: Hoare triple {13864#false} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {13864#false} is VALID [2022-02-21 03:09:59,849 INFO L290 TraceCheckUtils]: 46: Hoare triple {13864#false} assume 128 + ~e <= 2147483647; {13864#false} is VALID [2022-02-21 03:09:59,849 INFO L290 TraceCheckUtils]: 47: Hoare triple {13864#false} assume 128 + ~e >= -2147483648; {13864#false} is VALID [2022-02-21 03:09:59,849 INFO L290 TraceCheckUtils]: 48: Hoare triple {13864#false} assume !(16777216 * (128 + ~e) <= 2147483647); {13864#false} is VALID [2022-02-21 03:09:59,849 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:09:59,850 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:09:59,850 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645090134] [2022-02-21 03:09:59,850 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645090134] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:09:59,850 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370097537] [2022-02-21 03:09:59,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:59,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:09:59,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:09:59,851 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:09:59,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-21 03:09:59,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:59,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:09:59,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:59,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:00,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {13863#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); {13863#true} is VALID [2022-02-21 03:10:00,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {13863#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {13863#true} is VALID [2022-02-21 03:10:00,137 INFO L272 TraceCheckUtils]: 2: Hoare triple {13863#true} call main_#t~ret22#1 := base2flt(0, 0); {13863#true} is VALID [2022-02-21 03:10:00,137 INFO L290 TraceCheckUtils]: 3: Hoare triple {13863#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {13863#true} is VALID [2022-02-21 03:10:00,137 INFO L290 TraceCheckUtils]: 4: Hoare triple {13863#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {13863#true} is VALID [2022-02-21 03:10:00,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {13863#true} #res := ~__retres4~0; {13863#true} is VALID [2022-02-21 03:10:00,137 INFO L290 TraceCheckUtils]: 6: Hoare triple {13863#true} assume true; {13863#true} is VALID [2022-02-21 03:10:00,137 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13863#true} {13863#true} #394#return; {13863#true} is VALID [2022-02-21 03:10:00,137 INFO L290 TraceCheckUtils]: 8: Hoare triple {13863#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {13863#true} is VALID [2022-02-21 03:10:00,137 INFO L272 TraceCheckUtils]: 9: Hoare triple {13863#true} call main_#t~ret23#1 := base2flt(1, 0); {13863#true} is VALID [2022-02-21 03:10:00,138 INFO L290 TraceCheckUtils]: 10: Hoare triple {13863#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {13938#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:00,138 INFO L290 TraceCheckUtils]: 11: Hoare triple {13938#(<= |base2flt_#in~e| base2flt_~e)} assume !(0 == ~m % 4294967296); {13938#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:00,138 INFO L290 TraceCheckUtils]: 12: Hoare triple {13938#(<= |base2flt_#in~e| base2flt_~e)} assume ~m % 4294967296 < 16777216; {13938#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:00,139 INFO L290 TraceCheckUtils]: 13: Hoare triple {13938#(<= |base2flt_#in~e| base2flt_~e)} assume !false; {13938#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:00,139 INFO L290 TraceCheckUtils]: 14: Hoare triple {13938#(<= |base2flt_#in~e| base2flt_~e)} assume !(~e <= -128); {13938#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:00,139 INFO L290 TraceCheckUtils]: 15: Hoare triple {13938#(<= |base2flt_#in~e| base2flt_~e)} assume ~e - 1 <= 2147483647; {13938#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:00,140 INFO L290 TraceCheckUtils]: 16: Hoare triple {13938#(<= |base2flt_#in~e| base2flt_~e)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {13957#(<= |base2flt_#in~e| (+ base2flt_~e 1))} is VALID [2022-02-21 03:10:00,140 INFO L290 TraceCheckUtils]: 17: Hoare triple {13957#(<= |base2flt_#in~e| (+ base2flt_~e 1))} assume ~m % 4294967296 < 16777216; {13957#(<= |base2flt_#in~e| (+ base2flt_~e 1))} is VALID [2022-02-21 03:10:00,140 INFO L290 TraceCheckUtils]: 18: Hoare triple {13957#(<= |base2flt_#in~e| (+ base2flt_~e 1))} assume !false; {13957#(<= |base2flt_#in~e| (+ base2flt_~e 1))} is VALID [2022-02-21 03:10:00,141 INFO L290 TraceCheckUtils]: 19: Hoare triple {13957#(<= |base2flt_#in~e| (+ base2flt_~e 1))} assume !(~e <= -128); {13957#(<= |base2flt_#in~e| (+ base2flt_~e 1))} is VALID [2022-02-21 03:10:00,141 INFO L290 TraceCheckUtils]: 20: Hoare triple {13957#(<= |base2flt_#in~e| (+ base2flt_~e 1))} assume ~e - 1 <= 2147483647; {13957#(<= |base2flt_#in~e| (+ base2flt_~e 1))} is VALID [2022-02-21 03:10:00,142 INFO L290 TraceCheckUtils]: 21: Hoare triple {13957#(<= |base2flt_#in~e| (+ base2flt_~e 1))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {13973#(<= |base2flt_#in~e| (+ 2 base2flt_~e))} is VALID [2022-02-21 03:10:00,142 INFO L290 TraceCheckUtils]: 22: Hoare triple {13973#(<= |base2flt_#in~e| (+ 2 base2flt_~e))} assume ~m % 4294967296 < 16777216; {13973#(<= |base2flt_#in~e| (+ 2 base2flt_~e))} is VALID [2022-02-21 03:10:00,142 INFO L290 TraceCheckUtils]: 23: Hoare triple {13973#(<= |base2flt_#in~e| (+ 2 base2flt_~e))} assume !false; {13973#(<= |base2flt_#in~e| (+ 2 base2flt_~e))} is VALID [2022-02-21 03:10:00,142 INFO L290 TraceCheckUtils]: 24: Hoare triple {13973#(<= |base2flt_#in~e| (+ 2 base2flt_~e))} assume !(~e <= -128); {13973#(<= |base2flt_#in~e| (+ 2 base2flt_~e))} is VALID [2022-02-21 03:10:00,143 INFO L290 TraceCheckUtils]: 25: Hoare triple {13973#(<= |base2flt_#in~e| (+ 2 base2flt_~e))} assume ~e - 1 <= 2147483647; {13973#(<= |base2flt_#in~e| (+ 2 base2flt_~e))} is VALID [2022-02-21 03:10:00,143 INFO L290 TraceCheckUtils]: 26: Hoare triple {13973#(<= |base2flt_#in~e| (+ 2 base2flt_~e))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {13989#(<= |base2flt_#in~e| (+ 3 base2flt_~e))} is VALID [2022-02-21 03:10:00,143 INFO L290 TraceCheckUtils]: 27: Hoare triple {13989#(<= |base2flt_#in~e| (+ 3 base2flt_~e))} assume ~m % 4294967296 < 16777216; {13989#(<= |base2flt_#in~e| (+ 3 base2flt_~e))} is VALID [2022-02-21 03:10:00,144 INFO L290 TraceCheckUtils]: 28: Hoare triple {13989#(<= |base2flt_#in~e| (+ 3 base2flt_~e))} assume !false; {13989#(<= |base2flt_#in~e| (+ 3 base2flt_~e))} is VALID [2022-02-21 03:10:00,144 INFO L290 TraceCheckUtils]: 29: Hoare triple {13989#(<= |base2flt_#in~e| (+ 3 base2flt_~e))} assume !(~e <= -128); {13989#(<= |base2flt_#in~e| (+ 3 base2flt_~e))} is VALID [2022-02-21 03:10:00,144 INFO L290 TraceCheckUtils]: 30: Hoare triple {13989#(<= |base2flt_#in~e| (+ 3 base2flt_~e))} assume ~e - 1 <= 2147483647; {13989#(<= |base2flt_#in~e| (+ 3 base2flt_~e))} is VALID [2022-02-21 03:10:00,145 INFO L290 TraceCheckUtils]: 31: Hoare triple {13989#(<= |base2flt_#in~e| (+ 3 base2flt_~e))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {14005#(<= |base2flt_#in~e| (+ base2flt_~e 4))} is VALID [2022-02-21 03:10:00,145 INFO L290 TraceCheckUtils]: 32: Hoare triple {14005#(<= |base2flt_#in~e| (+ base2flt_~e 4))} assume ~m % 4294967296 < 16777216; {14005#(<= |base2flt_#in~e| (+ base2flt_~e 4))} is VALID [2022-02-21 03:10:00,146 INFO L290 TraceCheckUtils]: 33: Hoare triple {14005#(<= |base2flt_#in~e| (+ base2flt_~e 4))} assume !false; {14005#(<= |base2flt_#in~e| (+ base2flt_~e 4))} is VALID [2022-02-21 03:10:00,146 INFO L290 TraceCheckUtils]: 34: Hoare triple {14005#(<= |base2flt_#in~e| (+ base2flt_~e 4))} assume ~e <= -128;~__retres4~0 := 0; {14015#(<= (+ |base2flt_#in~e| 124) 0)} is VALID [2022-02-21 03:10:00,146 INFO L290 TraceCheckUtils]: 35: Hoare triple {14015#(<= (+ |base2flt_#in~e| 124) 0)} #res := ~__retres4~0; {14015#(<= (+ |base2flt_#in~e| 124) 0)} is VALID [2022-02-21 03:10:00,147 INFO L290 TraceCheckUtils]: 36: Hoare triple {14015#(<= (+ |base2flt_#in~e| 124) 0)} assume true; {14015#(<= (+ |base2flt_#in~e| 124) 0)} is VALID [2022-02-21 03:10:00,147 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {14015#(<= (+ |base2flt_#in~e| 124) 0)} {13863#true} #396#return; {13864#false} is VALID [2022-02-21 03:10:00,147 INFO L290 TraceCheckUtils]: 38: Hoare triple {13864#false} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {13864#false} is VALID [2022-02-21 03:10:00,148 INFO L272 TraceCheckUtils]: 39: Hoare triple {13864#false} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {13864#false} is VALID [2022-02-21 03:10:00,148 INFO L290 TraceCheckUtils]: 40: Hoare triple {13864#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {13864#false} is VALID [2022-02-21 03:10:00,148 INFO L290 TraceCheckUtils]: 41: Hoare triple {13864#false} assume !(0 == ~m % 4294967296); {13864#false} is VALID [2022-02-21 03:10:00,148 INFO L290 TraceCheckUtils]: 42: Hoare triple {13864#false} assume !(~m % 4294967296 < 16777216); {13864#false} is VALID [2022-02-21 03:10:00,148 INFO L290 TraceCheckUtils]: 43: Hoare triple {13864#false} assume !false; {13864#false} is VALID [2022-02-21 03:10:00,148 INFO L290 TraceCheckUtils]: 44: Hoare triple {13864#false} assume !(~m % 4294967296 >= 33554432); {13864#false} is VALID [2022-02-21 03:10:00,148 INFO L290 TraceCheckUtils]: 45: Hoare triple {13864#false} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {13864#false} is VALID [2022-02-21 03:10:00,148 INFO L290 TraceCheckUtils]: 46: Hoare triple {13864#false} assume 128 + ~e <= 2147483647; {13864#false} is VALID [2022-02-21 03:10:00,148 INFO L290 TraceCheckUtils]: 47: Hoare triple {13864#false} assume 128 + ~e >= -2147483648; {13864#false} is VALID [2022-02-21 03:10:00,148 INFO L290 TraceCheckUtils]: 48: Hoare triple {13864#false} assume !(16777216 * (128 + ~e) <= 2147483647); {13864#false} is VALID [2022-02-21 03:10:00,149 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:10:00,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:10:00,572 INFO L290 TraceCheckUtils]: 48: Hoare triple {13864#false} assume !(16777216 * (128 + ~e) <= 2147483647); {13864#false} is VALID [2022-02-21 03:10:00,573 INFO L290 TraceCheckUtils]: 47: Hoare triple {13864#false} assume 128 + ~e >= -2147483648; {13864#false} is VALID [2022-02-21 03:10:00,573 INFO L290 TraceCheckUtils]: 46: Hoare triple {13864#false} assume 128 + ~e <= 2147483647; {13864#false} is VALID [2022-02-21 03:10:00,573 INFO L290 TraceCheckUtils]: 45: Hoare triple {13864#false} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {13864#false} is VALID [2022-02-21 03:10:00,573 INFO L290 TraceCheckUtils]: 44: Hoare triple {13864#false} assume !(~m % 4294967296 >= 33554432); {13864#false} is VALID [2022-02-21 03:10:00,573 INFO L290 TraceCheckUtils]: 43: Hoare triple {13864#false} assume !false; {13864#false} is VALID [2022-02-21 03:10:00,573 INFO L290 TraceCheckUtils]: 42: Hoare triple {13864#false} assume !(~m % 4294967296 < 16777216); {13864#false} is VALID [2022-02-21 03:10:00,573 INFO L290 TraceCheckUtils]: 41: Hoare triple {13864#false} assume !(0 == ~m % 4294967296); {13864#false} is VALID [2022-02-21 03:10:00,573 INFO L290 TraceCheckUtils]: 40: Hoare triple {13864#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {13864#false} is VALID [2022-02-21 03:10:00,573 INFO L272 TraceCheckUtils]: 39: Hoare triple {13864#false} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {13864#false} is VALID [2022-02-21 03:10:00,573 INFO L290 TraceCheckUtils]: 38: Hoare triple {13864#false} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {13864#false} is VALID [2022-02-21 03:10:00,574 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {14094#(not (<= 0 |base2flt_#in~e|))} {13863#true} #396#return; {13864#false} is VALID [2022-02-21 03:10:00,574 INFO L290 TraceCheckUtils]: 36: Hoare triple {14094#(not (<= 0 |base2flt_#in~e|))} assume true; {14094#(not (<= 0 |base2flt_#in~e|))} is VALID [2022-02-21 03:10:00,575 INFO L290 TraceCheckUtils]: 35: Hoare triple {14094#(not (<= 0 |base2flt_#in~e|))} #res := ~__retres4~0; {14094#(not (<= 0 |base2flt_#in~e|))} is VALID [2022-02-21 03:10:00,575 INFO L290 TraceCheckUtils]: 34: Hoare triple {14104#(or (not (<= (+ 128 base2flt_~e) 0)) (not (<= 0 |base2flt_#in~e|)))} assume ~e <= -128;~__retres4~0 := 0; {14094#(not (<= 0 |base2flt_#in~e|))} is VALID [2022-02-21 03:10:00,576 INFO L290 TraceCheckUtils]: 33: Hoare triple {14104#(or (not (<= (+ 128 base2flt_~e) 0)) (not (<= 0 |base2flt_#in~e|)))} assume !false; {14104#(or (not (<= (+ 128 base2flt_~e) 0)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:00,576 INFO L290 TraceCheckUtils]: 32: Hoare triple {14104#(or (not (<= (+ 128 base2flt_~e) 0)) (not (<= 0 |base2flt_#in~e|)))} assume ~m % 4294967296 < 16777216; {14104#(or (not (<= (+ 128 base2flt_~e) 0)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:00,577 INFO L290 TraceCheckUtils]: 31: Hoare triple {14114#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {14104#(or (not (<= (+ 128 base2flt_~e) 0)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:00,577 INFO L290 TraceCheckUtils]: 30: Hoare triple {14114#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 <= 2147483647; {14114#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:00,577 INFO L290 TraceCheckUtils]: 29: Hoare triple {14114#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} assume !(~e <= -128); {14114#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:00,578 INFO L290 TraceCheckUtils]: 28: Hoare triple {14114#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} assume !false; {14114#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:00,578 INFO L290 TraceCheckUtils]: 27: Hoare triple {14114#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} assume ~m % 4294967296 < 16777216; {14114#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:00,578 INFO L290 TraceCheckUtils]: 26: Hoare triple {14130#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {14114#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:00,579 INFO L290 TraceCheckUtils]: 25: Hoare triple {14130#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 <= 2147483647; {14130#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:00,579 INFO L290 TraceCheckUtils]: 24: Hoare triple {14130#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume !(~e <= -128); {14130#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:00,579 INFO L290 TraceCheckUtils]: 23: Hoare triple {14130#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume !false; {14130#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:00,580 INFO L290 TraceCheckUtils]: 22: Hoare triple {14130#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume ~m % 4294967296 < 16777216; {14130#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:00,580 INFO L290 TraceCheckUtils]: 21: Hoare triple {14146#(or (< 0 (+ 125 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {14130#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:00,580 INFO L290 TraceCheckUtils]: 20: Hoare triple {14146#(or (< 0 (+ 125 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 <= 2147483647; {14146#(or (< 0 (+ 125 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:00,581 INFO L290 TraceCheckUtils]: 19: Hoare triple {14146#(or (< 0 (+ 125 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume !(~e <= -128); {14146#(or (< 0 (+ 125 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:00,581 INFO L290 TraceCheckUtils]: 18: Hoare triple {14146#(or (< 0 (+ 125 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume !false; {14146#(or (< 0 (+ 125 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:00,581 INFO L290 TraceCheckUtils]: 17: Hoare triple {14146#(or (< 0 (+ 125 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume ~m % 4294967296 < 16777216; {14146#(or (< 0 (+ 125 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:00,582 INFO L290 TraceCheckUtils]: 16: Hoare triple {14162#(or (< 0 (+ base2flt_~e 124)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {14146#(or (< 0 (+ 125 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:00,582 INFO L290 TraceCheckUtils]: 15: Hoare triple {14162#(or (< 0 (+ base2flt_~e 124)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 <= 2147483647; {14162#(or (< 0 (+ base2flt_~e 124)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:00,582 INFO L290 TraceCheckUtils]: 14: Hoare triple {14162#(or (< 0 (+ base2flt_~e 124)) (not (<= 0 |base2flt_#in~e|)))} assume !(~e <= -128); {14162#(or (< 0 (+ base2flt_~e 124)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:00,583 INFO L290 TraceCheckUtils]: 13: Hoare triple {14162#(or (< 0 (+ base2flt_~e 124)) (not (<= 0 |base2flt_#in~e|)))} assume !false; {14162#(or (< 0 (+ base2flt_~e 124)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:00,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {14162#(or (< 0 (+ base2flt_~e 124)) (not (<= 0 |base2flt_#in~e|)))} assume ~m % 4294967296 < 16777216; {14162#(or (< 0 (+ base2flt_~e 124)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:00,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {14162#(or (< 0 (+ base2flt_~e 124)) (not (<= 0 |base2flt_#in~e|)))} assume !(0 == ~m % 4294967296); {14162#(or (< 0 (+ base2flt_~e 124)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:00,584 INFO L290 TraceCheckUtils]: 10: Hoare triple {13863#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14162#(or (< 0 (+ base2flt_~e 124)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:00,584 INFO L272 TraceCheckUtils]: 9: Hoare triple {13863#true} call main_#t~ret23#1 := base2flt(1, 0); {13863#true} is VALID [2022-02-21 03:10:00,584 INFO L290 TraceCheckUtils]: 8: Hoare triple {13863#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {13863#true} is VALID [2022-02-21 03:10:00,584 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13863#true} {13863#true} #394#return; {13863#true} is VALID [2022-02-21 03:10:00,584 INFO L290 TraceCheckUtils]: 6: Hoare triple {13863#true} assume true; {13863#true} is VALID [2022-02-21 03:10:00,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {13863#true} #res := ~__retres4~0; {13863#true} is VALID [2022-02-21 03:10:00,584 INFO L290 TraceCheckUtils]: 4: Hoare triple {13863#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {13863#true} is VALID [2022-02-21 03:10:00,585 INFO L290 TraceCheckUtils]: 3: Hoare triple {13863#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {13863#true} is VALID [2022-02-21 03:10:00,585 INFO L272 TraceCheckUtils]: 2: Hoare triple {13863#true} call main_#t~ret22#1 := base2flt(0, 0); {13863#true} is VALID [2022-02-21 03:10:00,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {13863#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {13863#true} is VALID [2022-02-21 03:10:00,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {13863#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); {13863#true} is VALID [2022-02-21 03:10:00,585 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:10:00,585 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370097537] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:10:00,585 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:10:00,586 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2022-02-21 03:10:00,586 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230600207] [2022-02-21 03:10:00,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:10:00,586 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.714285714285714) internal successors, (99), 20 states have internal predecessors, (99), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 49 [2022-02-21 03:10:00,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:00,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 4.714285714285714) internal successors, (99), 20 states have internal predecessors, (99), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:10:00,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:00,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-02-21 03:10:00,659 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:00,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-21 03:10:00,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2022-02-21 03:10:00,660 INFO L87 Difference]: Start difference. First operand 270 states and 350 transitions. Second operand has 21 states, 21 states have (on average 4.714285714285714) internal successors, (99), 20 states have internal predecessors, (99), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:10:04,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:04,059 INFO L93 Difference]: Finished difference Result 2122 states and 2748 transitions. [2022-02-21 03:10:04,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-02-21 03:10:04,060 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.714285714285714) internal successors, (99), 20 states have internal predecessors, (99), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 49 [2022-02-21 03:10:04,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:04,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 4.714285714285714) internal successors, (99), 20 states have internal predecessors, (99), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:10:04,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 1102 transitions. [2022-02-21 03:10:04,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 4.714285714285714) internal successors, (99), 20 states have internal predecessors, (99), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:10:04,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 1102 transitions. [2022-02-21 03:10:04,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 53 states and 1102 transitions. [2022-02-21 03:10:04,871 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1102 edges. 1102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:04,986 INFO L225 Difference]: With dead ends: 2122 [2022-02-21 03:10:04,986 INFO L226 Difference]: Without dead ends: 1915 [2022-02-21 03:10:04,987 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1061 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1137, Invalid=2403, Unknown=0, NotChecked=0, Total=3540 [2022-02-21 03:10:04,987 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 2098 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 387 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2098 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 387 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:04,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2098 Valid, 939 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [387 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-21 03:10:04,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1915 states. [2022-02-21 03:10:05,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1915 to 300. [2022-02-21 03:10:05,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:05,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1915 states. Second operand has 300 states, 268 states have (on average 1.4104477611940298) internal successors, (378), 291 states have internal predecessors, (378), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:10:05,108 INFO L74 IsIncluded]: Start isIncluded. First operand 1915 states. Second operand has 300 states, 268 states have (on average 1.4104477611940298) internal successors, (378), 291 states have internal predecessors, (378), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:10:05,109 INFO L87 Difference]: Start difference. First operand 1915 states. Second operand has 300 states, 268 states have (on average 1.4104477611940298) internal successors, (378), 291 states have internal predecessors, (378), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:10:05,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:05,213 INFO L93 Difference]: Finished difference Result 1915 states and 2435 transitions. [2022-02-21 03:10:05,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 2435 transitions. [2022-02-21 03:10:05,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:05,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:05,216 INFO L74 IsIncluded]: Start isIncluded. First operand has 300 states, 268 states have (on average 1.4104477611940298) internal successors, (378), 291 states have internal predecessors, (378), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 1915 states. [2022-02-21 03:10:05,217 INFO L87 Difference]: Start difference. First operand has 300 states, 268 states have (on average 1.4104477611940298) internal successors, (378), 291 states have internal predecessors, (378), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 1915 states. [2022-02-21 03:10:05,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:05,313 INFO L93 Difference]: Finished difference Result 1915 states and 2435 transitions. [2022-02-21 03:10:05,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 2435 transitions. [2022-02-21 03:10:05,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:05,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:05,316 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:05,316 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:05,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 268 states have (on average 1.4104477611940298) internal successors, (378), 291 states have internal predecessors, (378), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:10:05,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 386 transitions. [2022-02-21 03:10:05,321 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 386 transitions. Word has length 49 [2022-02-21 03:10:05,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:05,321 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 386 transitions. [2022-02-21 03:10:05,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.714285714285714) internal successors, (99), 20 states have internal predecessors, (99), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:10:05,322 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 386 transitions. [2022-02-21 03:10:05,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-21 03:10:05,322 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:05,322 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:05,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:10:05,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:05,536 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-02-21 03:10:05,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:05,536 INFO L85 PathProgramCache]: Analyzing trace with hash 567559826, now seen corresponding path program 1 times [2022-02-21 03:10:05,536 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:05,536 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715902893] [2022-02-21 03:10:05,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:05,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:05,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:05,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:05,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:05,577 INFO L290 TraceCheckUtils]: 0: Hoare triple {20835#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20798#true} is VALID [2022-02-21 03:10:05,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {20798#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {20798#true} is VALID [2022-02-21 03:10:05,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {20798#true} #res := ~__retres4~0; {20798#true} is VALID [2022-02-21 03:10:05,578 INFO L290 TraceCheckUtils]: 3: Hoare triple {20798#true} assume true; {20798#true} is VALID [2022-02-21 03:10:05,578 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {20798#true} {20798#true} #394#return; {20798#true} is VALID [2022-02-21 03:10:05,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:05,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:05,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {20835#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:05,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !(0 == ~m % 4294967296); {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:05,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~m % 4294967296 < 16777216; {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:05,637 INFO L290 TraceCheckUtils]: 3: Hoare triple {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !false; {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:05,637 INFO L290 TraceCheckUtils]: 4: Hoare triple {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !(~e <= -128); {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:05,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~e - 1 <= 2147483647; {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:05,638 INFO L290 TraceCheckUtils]: 6: Hoare triple {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {20837#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:05,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {20837#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {20837#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:05,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {20837#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {20837#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:05,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {20837#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {20837#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:05,640 INFO L290 TraceCheckUtils]: 10: Hoare triple {20837#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {20837#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:05,640 INFO L290 TraceCheckUtils]: 11: Hoare triple {20837#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {20838#(or (and (<= base2flt_~m 4) (not (<= (+ (div base2flt_~m 4294967296) 1) 0))) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:05,641 INFO L290 TraceCheckUtils]: 12: Hoare triple {20838#(or (and (<= base2flt_~m 4) (not (<= (+ (div base2flt_~m 4294967296) 1) 0))) (not (= |base2flt_#in~m| 1)))} assume !(~m % 4294967296 < 16777216); {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:05,641 INFO L290 TraceCheckUtils]: 13: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:05,641 INFO L290 TraceCheckUtils]: 14: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:05,642 INFO L290 TraceCheckUtils]: 15: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:05,642 INFO L290 TraceCheckUtils]: 16: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) <= 2147483647; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:05,642 INFO L290 TraceCheckUtils]: 17: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) >= -2147483648; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:05,642 INFO L290 TraceCheckUtils]: 18: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:05,643 INFO L290 TraceCheckUtils]: 19: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:05,643 INFO L290 TraceCheckUtils]: 20: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) <= 2147483647; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:05,643 INFO L290 TraceCheckUtils]: 21: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) >= -2147483648; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:05,643 INFO L290 TraceCheckUtils]: 22: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:05,644 INFO L290 TraceCheckUtils]: 23: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:05,644 INFO L290 TraceCheckUtils]: 24: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:05,644 INFO L290 TraceCheckUtils]: 25: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_77 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_77; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:05,644 INFO L290 TraceCheckUtils]: 26: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} ~__retres4~0 := ~res~0; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:05,645 INFO L290 TraceCheckUtils]: 27: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} #res := ~__retres4~0; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:05,645 INFO L290 TraceCheckUtils]: 28: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume true; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:05,645 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {20839#(not (= |base2flt_#in~m| 1))} {20798#true} #396#return; {20799#false} is VALID [2022-02-21 03:10:05,646 INFO L290 TraceCheckUtils]: 0: Hoare triple {20798#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); {20798#true} is VALID [2022-02-21 03:10:05,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {20798#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {20798#true} is VALID [2022-02-21 03:10:05,646 INFO L272 TraceCheckUtils]: 2: Hoare triple {20798#true} call main_#t~ret22#1 := base2flt(0, 0); {20835#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:05,646 INFO L290 TraceCheckUtils]: 3: Hoare triple {20835#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20798#true} is VALID [2022-02-21 03:10:05,646 INFO L290 TraceCheckUtils]: 4: Hoare triple {20798#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {20798#true} is VALID [2022-02-21 03:10:05,647 INFO L290 TraceCheckUtils]: 5: Hoare triple {20798#true} #res := ~__retres4~0; {20798#true} is VALID [2022-02-21 03:10:05,647 INFO L290 TraceCheckUtils]: 6: Hoare triple {20798#true} assume true; {20798#true} is VALID [2022-02-21 03:10:05,647 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {20798#true} {20798#true} #394#return; {20798#true} is VALID [2022-02-21 03:10:05,647 INFO L290 TraceCheckUtils]: 8: Hoare triple {20798#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {20798#true} is VALID [2022-02-21 03:10:05,647 INFO L272 TraceCheckUtils]: 9: Hoare triple {20798#true} call main_#t~ret23#1 := base2flt(1, 0); {20835#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:05,648 INFO L290 TraceCheckUtils]: 10: Hoare triple {20835#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:05,648 INFO L290 TraceCheckUtils]: 11: Hoare triple {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !(0 == ~m % 4294967296); {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:05,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~m % 4294967296 < 16777216; {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:05,648 INFO L290 TraceCheckUtils]: 13: Hoare triple {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !false; {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:05,649 INFO L290 TraceCheckUtils]: 14: Hoare triple {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !(~e <= -128); {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:05,649 INFO L290 TraceCheckUtils]: 15: Hoare triple {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~e - 1 <= 2147483647; {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:05,649 INFO L290 TraceCheckUtils]: 16: Hoare triple {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {20837#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:05,650 INFO L290 TraceCheckUtils]: 17: Hoare triple {20837#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {20837#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:05,650 INFO L290 TraceCheckUtils]: 18: Hoare triple {20837#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {20837#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:05,651 INFO L290 TraceCheckUtils]: 19: Hoare triple {20837#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {20837#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:05,651 INFO L290 TraceCheckUtils]: 20: Hoare triple {20837#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {20837#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:05,652 INFO L290 TraceCheckUtils]: 21: Hoare triple {20837#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {20838#(or (and (<= base2flt_~m 4) (not (<= (+ (div base2flt_~m 4294967296) 1) 0))) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:05,652 INFO L290 TraceCheckUtils]: 22: Hoare triple {20838#(or (and (<= base2flt_~m 4) (not (<= (+ (div base2flt_~m 4294967296) 1) 0))) (not (= |base2flt_#in~m| 1)))} assume !(~m % 4294967296 < 16777216); {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:05,652 INFO L290 TraceCheckUtils]: 23: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:05,653 INFO L290 TraceCheckUtils]: 24: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:05,653 INFO L290 TraceCheckUtils]: 25: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:05,653 INFO L290 TraceCheckUtils]: 26: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) <= 2147483647; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:05,653 INFO L290 TraceCheckUtils]: 27: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) >= -2147483648; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:05,654 INFO L290 TraceCheckUtils]: 28: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:05,654 INFO L290 TraceCheckUtils]: 29: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:05,654 INFO L290 TraceCheckUtils]: 30: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) <= 2147483647; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:05,654 INFO L290 TraceCheckUtils]: 31: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) >= -2147483648; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:05,654 INFO L290 TraceCheckUtils]: 32: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:05,655 INFO L290 TraceCheckUtils]: 33: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:05,655 INFO L290 TraceCheckUtils]: 34: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:05,655 INFO L290 TraceCheckUtils]: 35: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_77 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_77; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:05,655 INFO L290 TraceCheckUtils]: 36: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} ~__retres4~0 := ~res~0; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:05,656 INFO L290 TraceCheckUtils]: 37: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} #res := ~__retres4~0; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:05,656 INFO L290 TraceCheckUtils]: 38: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume true; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:05,656 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {20839#(not (= |base2flt_#in~m| 1))} {20798#true} #396#return; {20799#false} is VALID [2022-02-21 03:10:05,656 INFO L290 TraceCheckUtils]: 40: Hoare triple {20799#false} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {20799#false} is VALID [2022-02-21 03:10:05,657 INFO L272 TraceCheckUtils]: 41: Hoare triple {20799#false} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {20799#false} is VALID [2022-02-21 03:10:05,657 INFO L290 TraceCheckUtils]: 42: Hoare triple {20799#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20799#false} is VALID [2022-02-21 03:10:05,657 INFO L290 TraceCheckUtils]: 43: Hoare triple {20799#false} assume !(0 == ~m % 4294967296); {20799#false} is VALID [2022-02-21 03:10:05,657 INFO L290 TraceCheckUtils]: 44: Hoare triple {20799#false} assume !(~m % 4294967296 < 16777216); {20799#false} is VALID [2022-02-21 03:10:05,657 INFO L290 TraceCheckUtils]: 45: Hoare triple {20799#false} assume !false; {20799#false} is VALID [2022-02-21 03:10:05,657 INFO L290 TraceCheckUtils]: 46: Hoare triple {20799#false} assume !(~m % 4294967296 >= 33554432); {20799#false} is VALID [2022-02-21 03:10:05,657 INFO L290 TraceCheckUtils]: 47: Hoare triple {20799#false} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {20799#false} is VALID [2022-02-21 03:10:05,657 INFO L290 TraceCheckUtils]: 48: Hoare triple {20799#false} assume 128 + ~e <= 2147483647; {20799#false} is VALID [2022-02-21 03:10:05,657 INFO L290 TraceCheckUtils]: 49: Hoare triple {20799#false} assume 128 + ~e >= -2147483648; {20799#false} is VALID [2022-02-21 03:10:05,658 INFO L290 TraceCheckUtils]: 50: Hoare triple {20799#false} assume !(16777216 * (128 + ~e) <= 2147483647); {20799#false} is VALID [2022-02-21 03:10:05,658 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:10:05,659 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:05,659 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715902893] [2022-02-21 03:10:05,659 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715902893] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:05,659 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97220413] [2022-02-21 03:10:05,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:05,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:05,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:05,660 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:10:05,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-21 03:10:05,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:05,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-21 03:10:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:05,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:05,895 INFO L290 TraceCheckUtils]: 0: Hoare triple {20798#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); {20798#true} is VALID [2022-02-21 03:10:05,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {20798#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {20798#true} is VALID [2022-02-21 03:10:05,895 INFO L272 TraceCheckUtils]: 2: Hoare triple {20798#true} call main_#t~ret22#1 := base2flt(0, 0); {20798#true} is VALID [2022-02-21 03:10:05,895 INFO L290 TraceCheckUtils]: 3: Hoare triple {20798#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20798#true} is VALID [2022-02-21 03:10:05,895 INFO L290 TraceCheckUtils]: 4: Hoare triple {20798#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {20798#true} is VALID [2022-02-21 03:10:05,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {20798#true} #res := ~__retres4~0; {20798#true} is VALID [2022-02-21 03:10:05,896 INFO L290 TraceCheckUtils]: 6: Hoare triple {20798#true} assume true; {20798#true} is VALID [2022-02-21 03:10:05,896 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {20798#true} {20798#true} #394#return; {20798#true} is VALID [2022-02-21 03:10:05,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {20798#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {20798#true} is VALID [2022-02-21 03:10:05,896 INFO L272 TraceCheckUtils]: 9: Hoare triple {20798#true} call main_#t~ret23#1 := base2flt(1, 0); {20798#true} is VALID [2022-02-21 03:10:05,896 INFO L290 TraceCheckUtils]: 10: Hoare triple {20798#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20873#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:05,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {20873#(= base2flt_~m |base2flt_#in~m|)} assume !(0 == ~m % 4294967296); {20873#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:05,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {20873#(= base2flt_~m |base2flt_#in~m|)} assume ~m % 4294967296 < 16777216; {20873#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:05,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {20873#(= base2flt_~m |base2flt_#in~m|)} assume !false; {20873#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:05,898 INFO L290 TraceCheckUtils]: 14: Hoare triple {20873#(= base2flt_~m |base2flt_#in~m|)} assume !(~e <= -128); {20873#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:05,898 INFO L290 TraceCheckUtils]: 15: Hoare triple {20873#(= base2flt_~m |base2flt_#in~m|)} assume ~e - 1 <= 2147483647; {20873#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:05,898 INFO L290 TraceCheckUtils]: 16: Hoare triple {20873#(= base2flt_~m |base2flt_#in~m|)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {20892#(= (* 2 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:05,899 INFO L290 TraceCheckUtils]: 17: Hoare triple {20892#(= (* 2 |base2flt_#in~m|) base2flt_~m)} assume ~m % 4294967296 < 16777216; {20892#(= (* 2 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:05,899 INFO L290 TraceCheckUtils]: 18: Hoare triple {20892#(= (* 2 |base2flt_#in~m|) base2flt_~m)} assume !false; {20892#(= (* 2 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:05,900 INFO L290 TraceCheckUtils]: 19: Hoare triple {20892#(= (* 2 |base2flt_#in~m|) base2flt_~m)} assume !(~e <= -128); {20892#(= (* 2 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:05,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {20892#(= (* 2 |base2flt_#in~m|) base2flt_~m)} assume ~e - 1 <= 2147483647; {20892#(= (* 2 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:05,901 INFO L290 TraceCheckUtils]: 21: Hoare triple {20892#(= (* 2 |base2flt_#in~m|) base2flt_~m)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {20908#(= (* |base2flt_#in~m| 4) base2flt_~m)} is VALID [2022-02-21 03:10:05,901 INFO L290 TraceCheckUtils]: 22: Hoare triple {20908#(= (* |base2flt_#in~m| 4) base2flt_~m)} assume !(~m % 4294967296 < 16777216); {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} is VALID [2022-02-21 03:10:05,902 INFO L290 TraceCheckUtils]: 23: Hoare triple {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} is VALID [2022-02-21 03:10:05,902 INFO L290 TraceCheckUtils]: 24: Hoare triple {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} assume 128 + ~e <= 2147483647; {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} is VALID [2022-02-21 03:10:05,903 INFO L290 TraceCheckUtils]: 25: Hoare triple {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} assume 128 + ~e >= -2147483648; {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} is VALID [2022-02-21 03:10:05,903 INFO L290 TraceCheckUtils]: 26: Hoare triple {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} assume 16777216 * (128 + ~e) <= 2147483647; {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} is VALID [2022-02-21 03:10:05,903 INFO L290 TraceCheckUtils]: 27: Hoare triple {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} assume 16777216 * (128 + ~e) >= -2147483648; {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} is VALID [2022-02-21 03:10:05,904 INFO L290 TraceCheckUtils]: 28: Hoare triple {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} assume 128 + ~e <= 2147483647; {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} is VALID [2022-02-21 03:10:05,904 INFO L290 TraceCheckUtils]: 29: Hoare triple {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} assume 128 + ~e >= -2147483648; {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} is VALID [2022-02-21 03:10:05,904 INFO L290 TraceCheckUtils]: 30: Hoare triple {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} assume 16777216 * (128 + ~e) <= 2147483647; {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} is VALID [2022-02-21 03:10:05,905 INFO L290 TraceCheckUtils]: 31: Hoare triple {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} assume 16777216 * (128 + ~e) >= -2147483648; {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} is VALID [2022-02-21 03:10:05,905 INFO L290 TraceCheckUtils]: 32: Hoare triple {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} is VALID [2022-02-21 03:10:05,905 INFO L290 TraceCheckUtils]: 33: Hoare triple {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} is VALID [2022-02-21 03:10:05,905 INFO L290 TraceCheckUtils]: 34: Hoare triple {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} is VALID [2022-02-21 03:10:05,906 INFO L290 TraceCheckUtils]: 35: Hoare triple {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_77 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_77; {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} is VALID [2022-02-21 03:10:05,906 INFO L290 TraceCheckUtils]: 36: Hoare triple {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} ~__retres4~0 := ~res~0; {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} is VALID [2022-02-21 03:10:05,906 INFO L290 TraceCheckUtils]: 37: Hoare triple {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} #res := ~__retres4~0; {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} is VALID [2022-02-21 03:10:05,907 INFO L290 TraceCheckUtils]: 38: Hoare triple {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} assume true; {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} is VALID [2022-02-21 03:10:05,907 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} {20798#true} #396#return; {20799#false} is VALID [2022-02-21 03:10:05,907 INFO L290 TraceCheckUtils]: 40: Hoare triple {20799#false} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {20799#false} is VALID [2022-02-21 03:10:05,908 INFO L272 TraceCheckUtils]: 41: Hoare triple {20799#false} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {20799#false} is VALID [2022-02-21 03:10:05,908 INFO L290 TraceCheckUtils]: 42: Hoare triple {20799#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20799#false} is VALID [2022-02-21 03:10:05,908 INFO L290 TraceCheckUtils]: 43: Hoare triple {20799#false} assume !(0 == ~m % 4294967296); {20799#false} is VALID [2022-02-21 03:10:05,908 INFO L290 TraceCheckUtils]: 44: Hoare triple {20799#false} assume !(~m % 4294967296 < 16777216); {20799#false} is VALID [2022-02-21 03:10:05,908 INFO L290 TraceCheckUtils]: 45: Hoare triple {20799#false} assume !false; {20799#false} is VALID [2022-02-21 03:10:05,908 INFO L290 TraceCheckUtils]: 46: Hoare triple {20799#false} assume !(~m % 4294967296 >= 33554432); {20799#false} is VALID [2022-02-21 03:10:05,908 INFO L290 TraceCheckUtils]: 47: Hoare triple {20799#false} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {20799#false} is VALID [2022-02-21 03:10:05,908 INFO L290 TraceCheckUtils]: 48: Hoare triple {20799#false} assume 128 + ~e <= 2147483647; {20799#false} is VALID [2022-02-21 03:10:05,908 INFO L290 TraceCheckUtils]: 49: Hoare triple {20799#false} assume 128 + ~e >= -2147483648; {20799#false} is VALID [2022-02-21 03:10:05,908 INFO L290 TraceCheckUtils]: 50: Hoare triple {20799#false} assume !(16777216 * (128 + ~e) <= 2147483647); {20799#false} is VALID [2022-02-21 03:10:05,909 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:10:05,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:10:06,154 INFO L290 TraceCheckUtils]: 50: Hoare triple {20799#false} assume !(16777216 * (128 + ~e) <= 2147483647); {20799#false} is VALID [2022-02-21 03:10:06,155 INFO L290 TraceCheckUtils]: 49: Hoare triple {20799#false} assume 128 + ~e >= -2147483648; {20799#false} is VALID [2022-02-21 03:10:06,155 INFO L290 TraceCheckUtils]: 48: Hoare triple {20799#false} assume 128 + ~e <= 2147483647; {20799#false} is VALID [2022-02-21 03:10:06,155 INFO L290 TraceCheckUtils]: 47: Hoare triple {20799#false} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {20799#false} is VALID [2022-02-21 03:10:06,155 INFO L290 TraceCheckUtils]: 46: Hoare triple {20799#false} assume !(~m % 4294967296 >= 33554432); {20799#false} is VALID [2022-02-21 03:10:06,155 INFO L290 TraceCheckUtils]: 45: Hoare triple {20799#false} assume !false; {20799#false} is VALID [2022-02-21 03:10:06,155 INFO L290 TraceCheckUtils]: 44: Hoare triple {20799#false} assume !(~m % 4294967296 < 16777216); {20799#false} is VALID [2022-02-21 03:10:06,155 INFO L290 TraceCheckUtils]: 43: Hoare triple {20799#false} assume !(0 == ~m % 4294967296); {20799#false} is VALID [2022-02-21 03:10:06,155 INFO L290 TraceCheckUtils]: 42: Hoare triple {20799#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20799#false} is VALID [2022-02-21 03:10:06,155 INFO L272 TraceCheckUtils]: 41: Hoare triple {20799#false} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {20799#false} is VALID [2022-02-21 03:10:06,155 INFO L290 TraceCheckUtils]: 40: Hoare triple {20799#false} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {20799#false} is VALID [2022-02-21 03:10:06,156 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {20839#(not (= |base2flt_#in~m| 1))} {20798#true} #396#return; {20799#false} is VALID [2022-02-21 03:10:06,156 INFO L290 TraceCheckUtils]: 38: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume true; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:06,156 INFO L290 TraceCheckUtils]: 37: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} #res := ~__retres4~0; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:06,157 INFO L290 TraceCheckUtils]: 36: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} ~__retres4~0 := ~res~0; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:06,157 INFO L290 TraceCheckUtils]: 35: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_77 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_77; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:06,157 INFO L290 TraceCheckUtils]: 34: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:06,157 INFO L290 TraceCheckUtils]: 33: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:06,158 INFO L290 TraceCheckUtils]: 32: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:06,158 INFO L290 TraceCheckUtils]: 31: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) >= -2147483648; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:06,158 INFO L290 TraceCheckUtils]: 30: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) <= 2147483647; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:06,159 INFO L290 TraceCheckUtils]: 29: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:06,159 INFO L290 TraceCheckUtils]: 28: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:06,159 INFO L290 TraceCheckUtils]: 27: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) >= -2147483648; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:06,159 INFO L290 TraceCheckUtils]: 26: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) <= 2147483647; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:06,160 INFO L290 TraceCheckUtils]: 25: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:06,160 INFO L290 TraceCheckUtils]: 24: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:06,160 INFO L290 TraceCheckUtils]: 23: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:06,161 INFO L290 TraceCheckUtils]: 22: Hoare triple {21084#(or (< (mod base2flt_~m 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !(~m % 4294967296 < 16777216); {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:06,162 INFO L290 TraceCheckUtils]: 21: Hoare triple {21088#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {21084#(or (< (mod base2flt_~m 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:06,162 INFO L290 TraceCheckUtils]: 20: Hoare triple {21088#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {21088#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:06,163 INFO L290 TraceCheckUtils]: 19: Hoare triple {21088#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {21088#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:06,163 INFO L290 TraceCheckUtils]: 18: Hoare triple {21088#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !false; {21088#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:06,163 INFO L290 TraceCheckUtils]: 17: Hoare triple {21088#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {21088#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:06,164 INFO L290 TraceCheckUtils]: 16: Hoare triple {21104#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {21088#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:06,165 INFO L290 TraceCheckUtils]: 15: Hoare triple {21104#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {21104#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:06,165 INFO L290 TraceCheckUtils]: 14: Hoare triple {21104#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {21104#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:06,165 INFO L290 TraceCheckUtils]: 13: Hoare triple {21104#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !false; {21104#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:06,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {21104#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {21104#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:06,166 INFO L290 TraceCheckUtils]: 11: Hoare triple {21104#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !(0 == ~m % 4294967296); {21104#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:06,166 INFO L290 TraceCheckUtils]: 10: Hoare triple {20798#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {21104#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:06,166 INFO L272 TraceCheckUtils]: 9: Hoare triple {20798#true} call main_#t~ret23#1 := base2flt(1, 0); {20798#true} is VALID [2022-02-21 03:10:06,166 INFO L290 TraceCheckUtils]: 8: Hoare triple {20798#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {20798#true} is VALID [2022-02-21 03:10:06,166 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {20798#true} {20798#true} #394#return; {20798#true} is VALID [2022-02-21 03:10:06,166 INFO L290 TraceCheckUtils]: 6: Hoare triple {20798#true} assume true; {20798#true} is VALID [2022-02-21 03:10:06,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {20798#true} #res := ~__retres4~0; {20798#true} is VALID [2022-02-21 03:10:06,166 INFO L290 TraceCheckUtils]: 4: Hoare triple {20798#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {20798#true} is VALID [2022-02-21 03:10:06,167 INFO L290 TraceCheckUtils]: 3: Hoare triple {20798#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20798#true} is VALID [2022-02-21 03:10:06,167 INFO L272 TraceCheckUtils]: 2: Hoare triple {20798#true} call main_#t~ret22#1 := base2flt(0, 0); {20798#true} is VALID [2022-02-21 03:10:06,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {20798#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {20798#true} is VALID [2022-02-21 03:10:06,167 INFO L290 TraceCheckUtils]: 0: Hoare triple {20798#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); {20798#true} is VALID [2022-02-21 03:10:06,167 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:10:06,167 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97220413] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:10:06,167 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:10:06,167 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-02-21 03:10:06,167 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290173245] [2022-02-21 03:10:06,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:10:06,168 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 13 states have internal predecessors, (89), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2022-02-21 03:10:06,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:06,168 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 13 states have internal predecessors, (89), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:06,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:06,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-21 03:10:06,235 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:06,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-21 03:10:06,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-02-21 03:10:06,235 INFO L87 Difference]: Start difference. First operand 300 states and 386 transitions. Second operand has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 13 states have internal predecessors, (89), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:09,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:09,148 INFO L93 Difference]: Finished difference Result 1225 states and 1545 transitions. [2022-02-21 03:10:09,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-02-21 03:10:09,148 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 13 states have internal predecessors, (89), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2022-02-21 03:10:09,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:09,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 13 states have internal predecessors, (89), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:09,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 670 transitions. [2022-02-21 03:10:09,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 13 states have internal predecessors, (89), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:09,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 670 transitions. [2022-02-21 03:10:09,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 670 transitions. [2022-02-21 03:10:09,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 670 edges. 670 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:09,639 INFO L225 Difference]: With dead ends: 1225 [2022-02-21 03:10:09,640 INFO L226 Difference]: Without dead ends: 942 [2022-02-21 03:10:09,640 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=345, Invalid=845, Unknown=0, NotChecked=0, Total=1190 [2022-02-21 03:10:09,641 INFO L933 BasicCegarLoop]: 187 mSDtfsCounter, 761 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:09,641 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [761 Valid, 1060 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-21 03:10:09,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2022-02-21 03:10:09,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 364. [2022-02-21 03:10:09,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:09,822 INFO L82 GeneralOperation]: Start isEquivalent. First operand 942 states. Second operand has 364 states, 332 states have (on average 1.4006024096385543) internal successors, (465), 355 states have internal predecessors, (465), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:10:09,823 INFO L74 IsIncluded]: Start isIncluded. First operand 942 states. Second operand has 364 states, 332 states have (on average 1.4006024096385543) internal successors, (465), 355 states have internal predecessors, (465), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:10:09,824 INFO L87 Difference]: Start difference. First operand 942 states. Second operand has 364 states, 332 states have (on average 1.4006024096385543) internal successors, (465), 355 states have internal predecessors, (465), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:10:09,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:09,850 INFO L93 Difference]: Finished difference Result 942 states and 1159 transitions. [2022-02-21 03:10:09,850 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1159 transitions. [2022-02-21 03:10:09,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:09,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:09,852 INFO L74 IsIncluded]: Start isIncluded. First operand has 364 states, 332 states have (on average 1.4006024096385543) internal successors, (465), 355 states have internal predecessors, (465), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 942 states. [2022-02-21 03:10:09,852 INFO L87 Difference]: Start difference. First operand has 364 states, 332 states have (on average 1.4006024096385543) internal successors, (465), 355 states have internal predecessors, (465), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 942 states. [2022-02-21 03:10:09,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:09,878 INFO L93 Difference]: Finished difference Result 942 states and 1159 transitions. [2022-02-21 03:10:09,878 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1159 transitions. [2022-02-21 03:10:09,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:09,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:09,880 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:09,880 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:09,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 332 states have (on average 1.4006024096385543) internal successors, (465), 355 states have internal predecessors, (465), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:10:09,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 473 transitions. [2022-02-21 03:10:09,888 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 473 transitions. Word has length 51 [2022-02-21 03:10:09,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:09,888 INFO L470 AbstractCegarLoop]: Abstraction has 364 states and 473 transitions. [2022-02-21 03:10:09,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 13 states have internal predecessors, (89), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:09,888 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 473 transitions. [2022-02-21 03:10:09,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-02-21 03:10:09,889 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:09,889 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:09,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:10:10,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-02-21 03:10:10,103 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-02-21 03:10:10,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:10,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1383845486, now seen corresponding path program 2 times [2022-02-21 03:10:10,104 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:10,104 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561968190] [2022-02-21 03:10:10,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:10,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:10,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:10,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:10,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:10,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {24914#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {24857#true} is VALID [2022-02-21 03:10:10,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {24857#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {24857#true} is VALID [2022-02-21 03:10:10,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {24857#true} #res := ~__retres4~0; {24857#true} is VALID [2022-02-21 03:10:10,170 INFO L290 TraceCheckUtils]: 3: Hoare triple {24857#true} assume true; {24857#true} is VALID [2022-02-21 03:10:10,170 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {24857#true} {24857#true} #394#return; {24857#true} is VALID [2022-02-21 03:10:10,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:10,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:10,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {24914#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:10,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !(0 == ~m % 4294967296); {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:10,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~m % 4294967296 < 16777216; {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:10,310 INFO L290 TraceCheckUtils]: 3: Hoare triple {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !false; {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:10,310 INFO L290 TraceCheckUtils]: 4: Hoare triple {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !(~e <= -128); {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:10,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~e - 1 <= 2147483647; {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:10,311 INFO L290 TraceCheckUtils]: 6: Hoare triple {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {24916#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {24916#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {24916#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {24916#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {24916#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {24916#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {24916#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,313 INFO L290 TraceCheckUtils]: 10: Hoare triple {24916#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {24916#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,314 INFO L290 TraceCheckUtils]: 11: Hoare triple {24916#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {24917#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,314 INFO L290 TraceCheckUtils]: 12: Hoare triple {24917#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {24917#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,314 INFO L290 TraceCheckUtils]: 13: Hoare triple {24917#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume !false; {24917#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {24917#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {24917#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,315 INFO L290 TraceCheckUtils]: 15: Hoare triple {24917#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {24917#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,316 INFO L290 TraceCheckUtils]: 16: Hoare triple {24917#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {24918#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,316 INFO L290 TraceCheckUtils]: 17: Hoare triple {24918#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {24918#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,317 INFO L290 TraceCheckUtils]: 18: Hoare triple {24918#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume !false; {24918#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,317 INFO L290 TraceCheckUtils]: 19: Hoare triple {24918#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {24918#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,317 INFO L290 TraceCheckUtils]: 20: Hoare triple {24918#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {24918#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,318 INFO L290 TraceCheckUtils]: 21: Hoare triple {24918#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {24919#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,318 INFO L290 TraceCheckUtils]: 22: Hoare triple {24919#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {24919#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,319 INFO L290 TraceCheckUtils]: 23: Hoare triple {24919#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {24919#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,319 INFO L290 TraceCheckUtils]: 24: Hoare triple {24919#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {24919#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,319 INFO L290 TraceCheckUtils]: 25: Hoare triple {24919#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {24919#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,320 INFO L290 TraceCheckUtils]: 26: Hoare triple {24919#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {24920#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,321 INFO L290 TraceCheckUtils]: 27: Hoare triple {24920#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {24920#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,321 INFO L290 TraceCheckUtils]: 28: Hoare triple {24920#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {24920#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,321 INFO L290 TraceCheckUtils]: 29: Hoare triple {24920#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {24920#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,322 INFO L290 TraceCheckUtils]: 30: Hoare triple {24920#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {24920#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,322 INFO L290 TraceCheckUtils]: 31: Hoare triple {24920#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {24921#(or (and (not (<= (+ (div base2flt_~m 4294967296) 1) 0)) (<= base2flt_~m 64)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,323 INFO L290 TraceCheckUtils]: 32: Hoare triple {24921#(or (and (not (<= (+ (div base2flt_~m 4294967296) 1) 0)) (<= base2flt_~m 64)) (not (= |base2flt_#in~m| 1)))} assume !(~m % 4294967296 < 16777216); {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:10,324 INFO L290 TraceCheckUtils]: 33: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:10,324 INFO L290 TraceCheckUtils]: 34: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:10,324 INFO L290 TraceCheckUtils]: 35: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:10,324 INFO L290 TraceCheckUtils]: 36: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) <= 2147483647; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:10,325 INFO L290 TraceCheckUtils]: 37: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) >= -2147483648; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:10,325 INFO L290 TraceCheckUtils]: 38: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:10,325 INFO L290 TraceCheckUtils]: 39: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:10,326 INFO L290 TraceCheckUtils]: 40: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) <= 2147483647; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:10,326 INFO L290 TraceCheckUtils]: 41: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) >= -2147483648; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:10,326 INFO L290 TraceCheckUtils]: 42: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:10,326 INFO L290 TraceCheckUtils]: 43: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:10,327 INFO L290 TraceCheckUtils]: 44: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:10,327 INFO L290 TraceCheckUtils]: 45: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_77 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_77; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:10,327 INFO L290 TraceCheckUtils]: 46: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} ~__retres4~0 := ~res~0; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:10,328 INFO L290 TraceCheckUtils]: 47: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} #res := ~__retres4~0; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:10,328 INFO L290 TraceCheckUtils]: 48: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume true; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:10,328 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {24922#(not (= |base2flt_#in~m| 1))} {24857#true} #396#return; {24858#false} is VALID [2022-02-21 03:10:10,329 INFO L290 TraceCheckUtils]: 0: Hoare triple {24857#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); {24857#true} is VALID [2022-02-21 03:10:10,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {24857#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {24857#true} is VALID [2022-02-21 03:10:10,329 INFO L272 TraceCheckUtils]: 2: Hoare triple {24857#true} call main_#t~ret22#1 := base2flt(0, 0); {24914#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:10,330 INFO L290 TraceCheckUtils]: 3: Hoare triple {24914#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {24857#true} is VALID [2022-02-21 03:10:10,330 INFO L290 TraceCheckUtils]: 4: Hoare triple {24857#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {24857#true} is VALID [2022-02-21 03:10:10,330 INFO L290 TraceCheckUtils]: 5: Hoare triple {24857#true} #res := ~__retres4~0; {24857#true} is VALID [2022-02-21 03:10:10,330 INFO L290 TraceCheckUtils]: 6: Hoare triple {24857#true} assume true; {24857#true} is VALID [2022-02-21 03:10:10,330 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {24857#true} {24857#true} #394#return; {24857#true} is VALID [2022-02-21 03:10:10,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {24857#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {24857#true} is VALID [2022-02-21 03:10:10,331 INFO L272 TraceCheckUtils]: 9: Hoare triple {24857#true} call main_#t~ret23#1 := base2flt(1, 0); {24914#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:10,331 INFO L290 TraceCheckUtils]: 10: Hoare triple {24914#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:10,331 INFO L290 TraceCheckUtils]: 11: Hoare triple {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !(0 == ~m % 4294967296); {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:10,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~m % 4294967296 < 16777216; {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:10,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !false; {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:10,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !(~e <= -128); {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:10,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~e - 1 <= 2147483647; {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:10,333 INFO L290 TraceCheckUtils]: 16: Hoare triple {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {24916#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,334 INFO L290 TraceCheckUtils]: 17: Hoare triple {24916#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {24916#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,334 INFO L290 TraceCheckUtils]: 18: Hoare triple {24916#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {24916#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,334 INFO L290 TraceCheckUtils]: 19: Hoare triple {24916#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {24916#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,335 INFO L290 TraceCheckUtils]: 20: Hoare triple {24916#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {24916#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,335 INFO L290 TraceCheckUtils]: 21: Hoare triple {24916#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {24917#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,336 INFO L290 TraceCheckUtils]: 22: Hoare triple {24917#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {24917#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,336 INFO L290 TraceCheckUtils]: 23: Hoare triple {24917#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume !false; {24917#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,337 INFO L290 TraceCheckUtils]: 24: Hoare triple {24917#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {24917#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,337 INFO L290 TraceCheckUtils]: 25: Hoare triple {24917#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {24917#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,338 INFO L290 TraceCheckUtils]: 26: Hoare triple {24917#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {24918#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,338 INFO L290 TraceCheckUtils]: 27: Hoare triple {24918#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {24918#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,339 INFO L290 TraceCheckUtils]: 28: Hoare triple {24918#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume !false; {24918#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,339 INFO L290 TraceCheckUtils]: 29: Hoare triple {24918#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {24918#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,339 INFO L290 TraceCheckUtils]: 30: Hoare triple {24918#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {24918#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,340 INFO L290 TraceCheckUtils]: 31: Hoare triple {24918#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {24919#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,340 INFO L290 TraceCheckUtils]: 32: Hoare triple {24919#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {24919#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,341 INFO L290 TraceCheckUtils]: 33: Hoare triple {24919#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {24919#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,341 INFO L290 TraceCheckUtils]: 34: Hoare triple {24919#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {24919#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,342 INFO L290 TraceCheckUtils]: 35: Hoare triple {24919#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {24919#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,342 INFO L290 TraceCheckUtils]: 36: Hoare triple {24919#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {24920#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,343 INFO L290 TraceCheckUtils]: 37: Hoare triple {24920#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {24920#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,343 INFO L290 TraceCheckUtils]: 38: Hoare triple {24920#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {24920#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,344 INFO L290 TraceCheckUtils]: 39: Hoare triple {24920#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {24920#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,344 INFO L290 TraceCheckUtils]: 40: Hoare triple {24920#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {24920#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,345 INFO L290 TraceCheckUtils]: 41: Hoare triple {24920#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {24921#(or (and (not (<= (+ (div base2flt_~m 4294967296) 1) 0)) (<= base2flt_~m 64)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:10,345 INFO L290 TraceCheckUtils]: 42: Hoare triple {24921#(or (and (not (<= (+ (div base2flt_~m 4294967296) 1) 0)) (<= base2flt_~m 64)) (not (= |base2flt_#in~m| 1)))} assume !(~m % 4294967296 < 16777216); {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:10,346 INFO L290 TraceCheckUtils]: 43: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:10,346 INFO L290 TraceCheckUtils]: 44: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:10,346 INFO L290 TraceCheckUtils]: 45: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:10,347 INFO L290 TraceCheckUtils]: 46: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) <= 2147483647; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:10,347 INFO L290 TraceCheckUtils]: 47: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) >= -2147483648; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:10,347 INFO L290 TraceCheckUtils]: 48: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:10,347 INFO L290 TraceCheckUtils]: 49: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:10,348 INFO L290 TraceCheckUtils]: 50: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) <= 2147483647; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:10,348 INFO L290 TraceCheckUtils]: 51: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) >= -2147483648; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:10,348 INFO L290 TraceCheckUtils]: 52: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:10,349 INFO L290 TraceCheckUtils]: 53: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:10,349 INFO L290 TraceCheckUtils]: 54: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:10,349 INFO L290 TraceCheckUtils]: 55: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_77 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_77; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:10,349 INFO L290 TraceCheckUtils]: 56: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} ~__retres4~0 := ~res~0; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:10,350 INFO L290 TraceCheckUtils]: 57: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} #res := ~__retres4~0; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:10,350 INFO L290 TraceCheckUtils]: 58: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume true; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:10,350 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {24922#(not (= |base2flt_#in~m| 1))} {24857#true} #396#return; {24858#false} is VALID [2022-02-21 03:10:10,351 INFO L290 TraceCheckUtils]: 60: Hoare triple {24858#false} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {24858#false} is VALID [2022-02-21 03:10:10,351 INFO L272 TraceCheckUtils]: 61: Hoare triple {24858#false} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {24858#false} is VALID [2022-02-21 03:10:10,351 INFO L290 TraceCheckUtils]: 62: Hoare triple {24858#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {24858#false} is VALID [2022-02-21 03:10:10,351 INFO L290 TraceCheckUtils]: 63: Hoare triple {24858#false} assume !(0 == ~m % 4294967296); {24858#false} is VALID [2022-02-21 03:10:10,351 INFO L290 TraceCheckUtils]: 64: Hoare triple {24858#false} assume !(~m % 4294967296 < 16777216); {24858#false} is VALID [2022-02-21 03:10:10,351 INFO L290 TraceCheckUtils]: 65: Hoare triple {24858#false} assume !false; {24858#false} is VALID [2022-02-21 03:10:10,351 INFO L290 TraceCheckUtils]: 66: Hoare triple {24858#false} assume !(~m % 4294967296 >= 33554432); {24858#false} is VALID [2022-02-21 03:10:10,351 INFO L290 TraceCheckUtils]: 67: Hoare triple {24858#false} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {24858#false} is VALID [2022-02-21 03:10:10,351 INFO L290 TraceCheckUtils]: 68: Hoare triple {24858#false} assume 128 + ~e <= 2147483647; {24858#false} is VALID [2022-02-21 03:10:10,352 INFO L290 TraceCheckUtils]: 69: Hoare triple {24858#false} assume 128 + ~e >= -2147483648; {24858#false} is VALID [2022-02-21 03:10:10,352 INFO L290 TraceCheckUtils]: 70: Hoare triple {24858#false} assume !(16777216 * (128 + ~e) <= 2147483647); {24858#false} is VALID [2022-02-21 03:10:10,352 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 13 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:10:10,352 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:10,352 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561968190] [2022-02-21 03:10:10,352 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561968190] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:10,352 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756070005] [2022-02-21 03:10:10,353 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:10:10,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:10,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:10,368 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:10:10,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-21 03:10:10,439 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:10:10,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:10:10,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-21 03:10:10,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:10,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:10,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {24857#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); {24857#true} is VALID [2022-02-21 03:10:10,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {24857#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {24857#true} is VALID [2022-02-21 03:10:10,734 INFO L272 TraceCheckUtils]: 2: Hoare triple {24857#true} call main_#t~ret22#1 := base2flt(0, 0); {24857#true} is VALID [2022-02-21 03:10:10,735 INFO L290 TraceCheckUtils]: 3: Hoare triple {24857#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {24857#true} is VALID [2022-02-21 03:10:10,735 INFO L290 TraceCheckUtils]: 4: Hoare triple {24857#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {24857#true} is VALID [2022-02-21 03:10:10,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {24857#true} #res := ~__retres4~0; {24857#true} is VALID [2022-02-21 03:10:10,735 INFO L290 TraceCheckUtils]: 6: Hoare triple {24857#true} assume true; {24857#true} is VALID [2022-02-21 03:10:10,735 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {24857#true} {24857#true} #394#return; {24857#true} is VALID [2022-02-21 03:10:10,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {24857#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {24857#true} is VALID [2022-02-21 03:10:10,735 INFO L272 TraceCheckUtils]: 9: Hoare triple {24857#true} call main_#t~ret23#1 := base2flt(1, 0); {24857#true} is VALID [2022-02-21 03:10:10,736 INFO L290 TraceCheckUtils]: 10: Hoare triple {24857#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {24956#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:10,736 INFO L290 TraceCheckUtils]: 11: Hoare triple {24956#(= base2flt_~m |base2flt_#in~m|)} assume !(0 == ~m % 4294967296); {24956#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:10,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {24956#(= base2flt_~m |base2flt_#in~m|)} assume ~m % 4294967296 < 16777216; {24956#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:10,737 INFO L290 TraceCheckUtils]: 13: Hoare triple {24956#(= base2flt_~m |base2flt_#in~m|)} assume !false; {24956#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:10,737 INFO L290 TraceCheckUtils]: 14: Hoare triple {24956#(= base2flt_~m |base2flt_#in~m|)} assume !(~e <= -128); {24956#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:10,737 INFO L290 TraceCheckUtils]: 15: Hoare triple {24956#(= base2flt_~m |base2flt_#in~m|)} assume ~e - 1 <= 2147483647; {24956#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:10,738 INFO L290 TraceCheckUtils]: 16: Hoare triple {24956#(= base2flt_~m |base2flt_#in~m|)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {24975#(= (* 2 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:10,738 INFO L290 TraceCheckUtils]: 17: Hoare triple {24975#(= (* 2 |base2flt_#in~m|) base2flt_~m)} assume ~m % 4294967296 < 16777216; {24975#(= (* 2 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:10,738 INFO L290 TraceCheckUtils]: 18: Hoare triple {24975#(= (* 2 |base2flt_#in~m|) base2flt_~m)} assume !false; {24975#(= (* 2 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:10,739 INFO L290 TraceCheckUtils]: 19: Hoare triple {24975#(= (* 2 |base2flt_#in~m|) base2flt_~m)} assume !(~e <= -128); {24975#(= (* 2 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:10,739 INFO L290 TraceCheckUtils]: 20: Hoare triple {24975#(= (* 2 |base2flt_#in~m|) base2flt_~m)} assume ~e - 1 <= 2147483647; {24975#(= (* 2 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:10,740 INFO L290 TraceCheckUtils]: 21: Hoare triple {24975#(= (* 2 |base2flt_#in~m|) base2flt_~m)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {24991#(= (* |base2flt_#in~m| 4) base2flt_~m)} is VALID [2022-02-21 03:10:10,740 INFO L290 TraceCheckUtils]: 22: Hoare triple {24991#(= (* |base2flt_#in~m| 4) base2flt_~m)} assume ~m % 4294967296 < 16777216; {24991#(= (* |base2flt_#in~m| 4) base2flt_~m)} is VALID [2022-02-21 03:10:10,740 INFO L290 TraceCheckUtils]: 23: Hoare triple {24991#(= (* |base2flt_#in~m| 4) base2flt_~m)} assume !false; {24991#(= (* |base2flt_#in~m| 4) base2flt_~m)} is VALID [2022-02-21 03:10:10,741 INFO L290 TraceCheckUtils]: 24: Hoare triple {24991#(= (* |base2flt_#in~m| 4) base2flt_~m)} assume !(~e <= -128); {24991#(= (* |base2flt_#in~m| 4) base2flt_~m)} is VALID [2022-02-21 03:10:10,741 INFO L290 TraceCheckUtils]: 25: Hoare triple {24991#(= (* |base2flt_#in~m| 4) base2flt_~m)} assume ~e - 1 <= 2147483647; {24991#(= (* |base2flt_#in~m| 4) base2flt_~m)} is VALID [2022-02-21 03:10:10,742 INFO L290 TraceCheckUtils]: 26: Hoare triple {24991#(= (* |base2flt_#in~m| 4) base2flt_~m)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {25007#(= (* 8 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:10,742 INFO L290 TraceCheckUtils]: 27: Hoare triple {25007#(= (* 8 |base2flt_#in~m|) base2flt_~m)} assume ~m % 4294967296 < 16777216; {25007#(= (* 8 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:10,742 INFO L290 TraceCheckUtils]: 28: Hoare triple {25007#(= (* 8 |base2flt_#in~m|) base2flt_~m)} assume !false; {25007#(= (* 8 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:10,743 INFO L290 TraceCheckUtils]: 29: Hoare triple {25007#(= (* 8 |base2flt_#in~m|) base2flt_~m)} assume !(~e <= -128); {25007#(= (* 8 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:10,743 INFO L290 TraceCheckUtils]: 30: Hoare triple {25007#(= (* 8 |base2flt_#in~m|) base2flt_~m)} assume ~e - 1 <= 2147483647; {25007#(= (* 8 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:10,743 INFO L290 TraceCheckUtils]: 31: Hoare triple {25007#(= (* 8 |base2flt_#in~m|) base2flt_~m)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {25023#(= (* 16 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:10,744 INFO L290 TraceCheckUtils]: 32: Hoare triple {25023#(= (* 16 |base2flt_#in~m|) base2flt_~m)} assume ~m % 4294967296 < 16777216; {25023#(= (* 16 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:10,744 INFO L290 TraceCheckUtils]: 33: Hoare triple {25023#(= (* 16 |base2flt_#in~m|) base2flt_~m)} assume !false; {25023#(= (* 16 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:10,744 INFO L290 TraceCheckUtils]: 34: Hoare triple {25023#(= (* 16 |base2flt_#in~m|) base2flt_~m)} assume !(~e <= -128); {25023#(= (* 16 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:10,745 INFO L290 TraceCheckUtils]: 35: Hoare triple {25023#(= (* 16 |base2flt_#in~m|) base2flt_~m)} assume ~e - 1 <= 2147483647; {25023#(= (* 16 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:10,745 INFO L290 TraceCheckUtils]: 36: Hoare triple {25023#(= (* 16 |base2flt_#in~m|) base2flt_~m)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {25039#(= (* 32 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:10,745 INFO L290 TraceCheckUtils]: 37: Hoare triple {25039#(= (* 32 |base2flt_#in~m|) base2flt_~m)} assume ~m % 4294967296 < 16777216; {25039#(= (* 32 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:10,746 INFO L290 TraceCheckUtils]: 38: Hoare triple {25039#(= (* 32 |base2flt_#in~m|) base2flt_~m)} assume !false; {25039#(= (* 32 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:10,746 INFO L290 TraceCheckUtils]: 39: Hoare triple {25039#(= (* 32 |base2flt_#in~m|) base2flt_~m)} assume !(~e <= -128); {25039#(= (* 32 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:10,746 INFO L290 TraceCheckUtils]: 40: Hoare triple {25039#(= (* 32 |base2flt_#in~m|) base2flt_~m)} assume ~e - 1 <= 2147483647; {25039#(= (* 32 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:10,747 INFO L290 TraceCheckUtils]: 41: Hoare triple {25039#(= (* 32 |base2flt_#in~m|) base2flt_~m)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {25055#(= (* 64 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:10,751 INFO L290 TraceCheckUtils]: 42: Hoare triple {25055#(= (* 64 |base2flt_#in~m|) base2flt_~m)} assume !(~m % 4294967296 < 16777216); {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} is VALID [2022-02-21 03:10:10,752 INFO L290 TraceCheckUtils]: 43: Hoare triple {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} is VALID [2022-02-21 03:10:10,752 INFO L290 TraceCheckUtils]: 44: Hoare triple {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} assume 128 + ~e <= 2147483647; {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} is VALID [2022-02-21 03:10:10,752 INFO L290 TraceCheckUtils]: 45: Hoare triple {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} assume 128 + ~e >= -2147483648; {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} is VALID [2022-02-21 03:10:10,753 INFO L290 TraceCheckUtils]: 46: Hoare triple {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} assume 16777216 * (128 + ~e) <= 2147483647; {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} is VALID [2022-02-21 03:10:10,753 INFO L290 TraceCheckUtils]: 47: Hoare triple {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} assume 16777216 * (128 + ~e) >= -2147483648; {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} is VALID [2022-02-21 03:10:10,753 INFO L290 TraceCheckUtils]: 48: Hoare triple {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} assume 128 + ~e <= 2147483647; {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} is VALID [2022-02-21 03:10:10,753 INFO L290 TraceCheckUtils]: 49: Hoare triple {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} assume 128 + ~e >= -2147483648; {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} is VALID [2022-02-21 03:10:10,754 INFO L290 TraceCheckUtils]: 50: Hoare triple {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} assume 16777216 * (128 + ~e) <= 2147483647; {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} is VALID [2022-02-21 03:10:10,754 INFO L290 TraceCheckUtils]: 51: Hoare triple {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} assume 16777216 * (128 + ~e) >= -2147483648; {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} is VALID [2022-02-21 03:10:10,754 INFO L290 TraceCheckUtils]: 52: Hoare triple {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} is VALID [2022-02-21 03:10:10,755 INFO L290 TraceCheckUtils]: 53: Hoare triple {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} is VALID [2022-02-21 03:10:10,755 INFO L290 TraceCheckUtils]: 54: Hoare triple {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} is VALID [2022-02-21 03:10:10,755 INFO L290 TraceCheckUtils]: 55: Hoare triple {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_77 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_77; {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} is VALID [2022-02-21 03:10:10,755 INFO L290 TraceCheckUtils]: 56: Hoare triple {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} ~__retres4~0 := ~res~0; {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} is VALID [2022-02-21 03:10:10,756 INFO L290 TraceCheckUtils]: 57: Hoare triple {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} #res := ~__retres4~0; {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} is VALID [2022-02-21 03:10:10,756 INFO L290 TraceCheckUtils]: 58: Hoare triple {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} assume true; {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} is VALID [2022-02-21 03:10:10,757 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} {24857#true} #396#return; {24858#false} is VALID [2022-02-21 03:10:10,757 INFO L290 TraceCheckUtils]: 60: Hoare triple {24858#false} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {24858#false} is VALID [2022-02-21 03:10:10,757 INFO L272 TraceCheckUtils]: 61: Hoare triple {24858#false} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {24858#false} is VALID [2022-02-21 03:10:10,757 INFO L290 TraceCheckUtils]: 62: Hoare triple {24858#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {24858#false} is VALID [2022-02-21 03:10:10,757 INFO L290 TraceCheckUtils]: 63: Hoare triple {24858#false} assume !(0 == ~m % 4294967296); {24858#false} is VALID [2022-02-21 03:10:10,757 INFO L290 TraceCheckUtils]: 64: Hoare triple {24858#false} assume !(~m % 4294967296 < 16777216); {24858#false} is VALID [2022-02-21 03:10:10,757 INFO L290 TraceCheckUtils]: 65: Hoare triple {24858#false} assume !false; {24858#false} is VALID [2022-02-21 03:10:10,757 INFO L290 TraceCheckUtils]: 66: Hoare triple {24858#false} assume !(~m % 4294967296 >= 33554432); {24858#false} is VALID [2022-02-21 03:10:10,758 INFO L290 TraceCheckUtils]: 67: Hoare triple {24858#false} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {24858#false} is VALID [2022-02-21 03:10:10,758 INFO L290 TraceCheckUtils]: 68: Hoare triple {24858#false} assume 128 + ~e <= 2147483647; {24858#false} is VALID [2022-02-21 03:10:10,758 INFO L290 TraceCheckUtils]: 69: Hoare triple {24858#false} assume 128 + ~e >= -2147483648; {24858#false} is VALID [2022-02-21 03:10:10,758 INFO L290 TraceCheckUtils]: 70: Hoare triple {24858#false} assume !(16777216 * (128 + ~e) <= 2147483647); {24858#false} is VALID [2022-02-21 03:10:10,758 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 13 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:10:10,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:10:11,280 INFO L290 TraceCheckUtils]: 70: Hoare triple {24858#false} assume !(16777216 * (128 + ~e) <= 2147483647); {24858#false} is VALID [2022-02-21 03:10:11,280 INFO L290 TraceCheckUtils]: 69: Hoare triple {24858#false} assume 128 + ~e >= -2147483648; {24858#false} is VALID [2022-02-21 03:10:11,280 INFO L290 TraceCheckUtils]: 68: Hoare triple {24858#false} assume 128 + ~e <= 2147483647; {24858#false} is VALID [2022-02-21 03:10:11,280 INFO L290 TraceCheckUtils]: 67: Hoare triple {24858#false} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {24858#false} is VALID [2022-02-21 03:10:11,280 INFO L290 TraceCheckUtils]: 66: Hoare triple {24858#false} assume !(~m % 4294967296 >= 33554432); {24858#false} is VALID [2022-02-21 03:10:11,281 INFO L290 TraceCheckUtils]: 65: Hoare triple {24858#false} assume !false; {24858#false} is VALID [2022-02-21 03:10:11,281 INFO L290 TraceCheckUtils]: 64: Hoare triple {24858#false} assume !(~m % 4294967296 < 16777216); {24858#false} is VALID [2022-02-21 03:10:11,281 INFO L290 TraceCheckUtils]: 63: Hoare triple {24858#false} assume !(0 == ~m % 4294967296); {24858#false} is VALID [2022-02-21 03:10:11,281 INFO L290 TraceCheckUtils]: 62: Hoare triple {24858#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {24858#false} is VALID [2022-02-21 03:10:11,281 INFO L272 TraceCheckUtils]: 61: Hoare triple {24858#false} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {24858#false} is VALID [2022-02-21 03:10:11,281 INFO L290 TraceCheckUtils]: 60: Hoare triple {24858#false} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {24858#false} is VALID [2022-02-21 03:10:11,282 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {24922#(not (= |base2flt_#in~m| 1))} {24857#true} #396#return; {24858#false} is VALID [2022-02-21 03:10:11,282 INFO L290 TraceCheckUtils]: 58: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume true; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:11,282 INFO L290 TraceCheckUtils]: 57: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} #res := ~__retres4~0; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:11,283 INFO L290 TraceCheckUtils]: 56: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} ~__retres4~0 := ~res~0; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:11,283 INFO L290 TraceCheckUtils]: 55: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_77 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_77; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:11,283 INFO L290 TraceCheckUtils]: 54: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:11,284 INFO L290 TraceCheckUtils]: 53: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:11,284 INFO L290 TraceCheckUtils]: 52: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:11,284 INFO L290 TraceCheckUtils]: 51: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) >= -2147483648; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:11,284 INFO L290 TraceCheckUtils]: 50: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) <= 2147483647; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:11,285 INFO L290 TraceCheckUtils]: 49: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:11,285 INFO L290 TraceCheckUtils]: 48: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:11,285 INFO L290 TraceCheckUtils]: 47: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) >= -2147483648; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:11,286 INFO L290 TraceCheckUtils]: 46: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) <= 2147483647; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:11,286 INFO L290 TraceCheckUtils]: 45: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:11,286 INFO L290 TraceCheckUtils]: 44: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:11,286 INFO L290 TraceCheckUtils]: 43: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:11,287 INFO L290 TraceCheckUtils]: 42: Hoare triple {25231#(or (< (mod base2flt_~m 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !(~m % 4294967296 < 16777216); {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:11,288 INFO L290 TraceCheckUtils]: 41: Hoare triple {25235#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {25231#(or (< (mod base2flt_~m 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:11,289 INFO L290 TraceCheckUtils]: 40: Hoare triple {25235#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {25235#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:11,289 INFO L290 TraceCheckUtils]: 39: Hoare triple {25235#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {25235#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:11,289 INFO L290 TraceCheckUtils]: 38: Hoare triple {25235#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !false; {25235#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:11,290 INFO L290 TraceCheckUtils]: 37: Hoare triple {25235#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {25235#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:11,296 INFO L290 TraceCheckUtils]: 36: Hoare triple {25251#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {25235#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:11,297 INFO L290 TraceCheckUtils]: 35: Hoare triple {25251#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {25251#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:11,297 INFO L290 TraceCheckUtils]: 34: Hoare triple {25251#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {25251#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:11,297 INFO L290 TraceCheckUtils]: 33: Hoare triple {25251#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !false; {25251#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:11,298 INFO L290 TraceCheckUtils]: 32: Hoare triple {25251#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {25251#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:11,299 INFO L290 TraceCheckUtils]: 31: Hoare triple {25267#(or (< (mod (* base2flt_~m 8) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {25251#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:11,299 INFO L290 TraceCheckUtils]: 30: Hoare triple {25267#(or (< (mod (* base2flt_~m 8) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {25267#(or (< (mod (* base2flt_~m 8) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:11,299 INFO L290 TraceCheckUtils]: 29: Hoare triple {25267#(or (< (mod (* base2flt_~m 8) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {25267#(or (< (mod (* base2flt_~m 8) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:11,300 INFO L290 TraceCheckUtils]: 28: Hoare triple {25267#(or (< (mod (* base2flt_~m 8) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !false; {25267#(or (< (mod (* base2flt_~m 8) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:11,300 INFO L290 TraceCheckUtils]: 27: Hoare triple {25267#(or (< (mod (* base2flt_~m 8) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {25267#(or (< (mod (* base2flt_~m 8) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:11,303 INFO L290 TraceCheckUtils]: 26: Hoare triple {25283#(or (< (mod (* 16 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {25267#(or (< (mod (* base2flt_~m 8) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:11,303 INFO L290 TraceCheckUtils]: 25: Hoare triple {25283#(or (< (mod (* 16 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {25283#(or (< (mod (* 16 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:11,303 INFO L290 TraceCheckUtils]: 24: Hoare triple {25283#(or (< (mod (* 16 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {25283#(or (< (mod (* 16 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:11,304 INFO L290 TraceCheckUtils]: 23: Hoare triple {25283#(or (< (mod (* 16 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !false; {25283#(or (< (mod (* 16 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:11,304 INFO L290 TraceCheckUtils]: 22: Hoare triple {25283#(or (< (mod (* 16 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {25283#(or (< (mod (* 16 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:11,306 INFO L290 TraceCheckUtils]: 21: Hoare triple {25299#(or (< (mod (* 32 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {25283#(or (< (mod (* 16 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:11,306 INFO L290 TraceCheckUtils]: 20: Hoare triple {25299#(or (< (mod (* 32 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {25299#(or (< (mod (* 32 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:11,306 INFO L290 TraceCheckUtils]: 19: Hoare triple {25299#(or (< (mod (* 32 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {25299#(or (< (mod (* 32 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:11,307 INFO L290 TraceCheckUtils]: 18: Hoare triple {25299#(or (< (mod (* 32 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !false; {25299#(or (< (mod (* 32 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:11,307 INFO L290 TraceCheckUtils]: 17: Hoare triple {25299#(or (< (mod (* 32 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {25299#(or (< (mod (* 32 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:11,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {25315#(or (< (mod (* 64 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {25299#(or (< (mod (* 32 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:11,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {25315#(or (< (mod (* 64 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {25315#(or (< (mod (* 64 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:11,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {25315#(or (< (mod (* 64 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {25315#(or (< (mod (* 64 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:11,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {25315#(or (< (mod (* 64 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !false; {25315#(or (< (mod (* 64 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:11,310 INFO L290 TraceCheckUtils]: 12: Hoare triple {25315#(or (< (mod (* 64 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {25315#(or (< (mod (* 64 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:11,310 INFO L290 TraceCheckUtils]: 11: Hoare triple {25315#(or (< (mod (* 64 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !(0 == ~m % 4294967296); {25315#(or (< (mod (* 64 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:11,310 INFO L290 TraceCheckUtils]: 10: Hoare triple {24857#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {25315#(or (< (mod (* 64 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:11,311 INFO L272 TraceCheckUtils]: 9: Hoare triple {24857#true} call main_#t~ret23#1 := base2flt(1, 0); {24857#true} is VALID [2022-02-21 03:10:11,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {24857#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {24857#true} is VALID [2022-02-21 03:10:11,311 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {24857#true} {24857#true} #394#return; {24857#true} is VALID [2022-02-21 03:10:11,311 INFO L290 TraceCheckUtils]: 6: Hoare triple {24857#true} assume true; {24857#true} is VALID [2022-02-21 03:10:11,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {24857#true} #res := ~__retres4~0; {24857#true} is VALID [2022-02-21 03:10:11,311 INFO L290 TraceCheckUtils]: 4: Hoare triple {24857#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {24857#true} is VALID [2022-02-21 03:10:11,311 INFO L290 TraceCheckUtils]: 3: Hoare triple {24857#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {24857#true} is VALID [2022-02-21 03:10:11,311 INFO L272 TraceCheckUtils]: 2: Hoare triple {24857#true} call main_#t~ret22#1 := base2flt(0, 0); {24857#true} is VALID [2022-02-21 03:10:11,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {24857#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {24857#true} is VALID [2022-02-21 03:10:11,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {24857#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); {24857#true} is VALID [2022-02-21 03:10:11,311 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 13 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:10:11,311 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756070005] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:10:11,311 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:10:11,311 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2022-02-21 03:10:11,312 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438925056] [2022-02-21 03:10:11,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:10:11,312 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.730769230769231) internal successors, (149), 25 states have internal predecessors, (149), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 71 [2022-02-21 03:10:11,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:11,313 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 5.730769230769231) internal successors, (149), 25 states have internal predecessors, (149), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:11,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:11,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-02-21 03:10:11,442 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:11,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-02-21 03:10:11,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-02-21 03:10:11,443 INFO L87 Difference]: Start difference. First operand 364 states and 473 transitions. Second operand has 26 states, 26 states have (on average 5.730769230769231) internal successors, (149), 25 states have internal predecessors, (149), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:32,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:32,666 INFO L93 Difference]: Finished difference Result 1644 states and 2085 transitions. [2022-02-21 03:10:32,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-02-21 03:10:32,666 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.730769230769231) internal successors, (149), 25 states have internal predecessors, (149), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 71 [2022-02-21 03:10:32,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:32,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 5.730769230769231) internal successors, (149), 25 states have internal predecessors, (149), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:32,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 886 transitions. [2022-02-21 03:10:32,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 5.730769230769231) internal successors, (149), 25 states have internal predecessors, (149), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:32,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 886 transitions. [2022-02-21 03:10:32,682 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 886 transitions. [2022-02-21 03:10:33,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 886 edges. 886 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:34,013 INFO L225 Difference]: With dead ends: 1644 [2022-02-21 03:10:34,013 INFO L226 Difference]: Without dead ends: 1254 [2022-02-21 03:10:34,015 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 980 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=996, Invalid=2909, Unknown=1, NotChecked=0, Total=3906 [2022-02-21 03:10:34,015 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 1779 mSDsluCounter, 2278 mSDsCounter, 0 mSdLazyCounter, 1336 mSolverCounterSat, 334 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1779 SdHoareTripleChecker+Valid, 2483 SdHoareTripleChecker+Invalid, 1670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 334 IncrementalHoareTripleChecker+Valid, 1336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:34,015 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1779 Valid, 2483 Invalid, 1670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [334 Valid, 1336 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-02-21 03:10:34,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2022-02-21 03:10:34,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 407. [2022-02-21 03:10:34,255 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:34,256 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1254 states. Second operand has 407 states, 375 states have (on average 1.3946666666666667) internal successors, (523), 398 states have internal predecessors, (523), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:10:34,256 INFO L74 IsIncluded]: Start isIncluded. First operand 1254 states. Second operand has 407 states, 375 states have (on average 1.3946666666666667) internal successors, (523), 398 states have internal predecessors, (523), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:10:34,256 INFO L87 Difference]: Start difference. First operand 1254 states. Second operand has 407 states, 375 states have (on average 1.3946666666666667) internal successors, (523), 398 states have internal predecessors, (523), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:10:34,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:34,297 INFO L93 Difference]: Finished difference Result 1254 states and 1547 transitions. [2022-02-21 03:10:34,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1547 transitions. [2022-02-21 03:10:34,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:34,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:34,299 INFO L74 IsIncluded]: Start isIncluded. First operand has 407 states, 375 states have (on average 1.3946666666666667) internal successors, (523), 398 states have internal predecessors, (523), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 1254 states. [2022-02-21 03:10:34,300 INFO L87 Difference]: Start difference. First operand has 407 states, 375 states have (on average 1.3946666666666667) internal successors, (523), 398 states have internal predecessors, (523), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 1254 states. [2022-02-21 03:10:34,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:34,341 INFO L93 Difference]: Finished difference Result 1254 states and 1547 transitions. [2022-02-21 03:10:34,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1547 transitions. [2022-02-21 03:10:34,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:34,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:34,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:34,343 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:34,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 375 states have (on average 1.3946666666666667) internal successors, (523), 398 states have internal predecessors, (523), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:10:34,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 531 transitions. [2022-02-21 03:10:34,350 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 531 transitions. Word has length 71 [2022-02-21 03:10:34,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:34,350 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 531 transitions. [2022-02-21 03:10:34,350 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.730769230769231) internal successors, (149), 25 states have internal predecessors, (149), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:34,350 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 531 transitions. [2022-02-21 03:10:34,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-21 03:10:34,350 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:34,351 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:34,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:10:34,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-02-21 03:10:34,551 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-02-21 03:10:34,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:34,552 INFO L85 PathProgramCache]: Analyzing trace with hash -2075937428, now seen corresponding path program 2 times [2022-02-21 03:10:34,552 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:34,552 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902433132] [2022-02-21 03:10:34,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:34,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:34,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:34,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:34,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:34,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {30339#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {30274#true} is VALID [2022-02-21 03:10:34,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {30274#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {30274#true} is VALID [2022-02-21 03:10:34,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {30274#true} #res := ~__retres4~0; {30274#true} is VALID [2022-02-21 03:10:34,594 INFO L290 TraceCheckUtils]: 3: Hoare triple {30274#true} assume true; {30274#true} is VALID [2022-02-21 03:10:34,594 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {30274#true} {30274#true} #394#return; {30274#true} is VALID [2022-02-21 03:10:34,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:34,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:34,755 INFO L290 TraceCheckUtils]: 0: Hoare triple {30339#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {30340#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:34,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {30340#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !(0 == ~m % 4294967296); {30340#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:34,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {30340#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~m % 4294967296 < 16777216; {30340#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:34,756 INFO L290 TraceCheckUtils]: 3: Hoare triple {30340#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !false; {30340#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:34,756 INFO L290 TraceCheckUtils]: 4: Hoare triple {30340#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !(~e <= -128); {30340#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:34,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {30340#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~e - 1 <= 2147483647; {30340#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:34,757 INFO L290 TraceCheckUtils]: 6: Hoare triple {30340#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30341#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:34,757 INFO L290 TraceCheckUtils]: 7: Hoare triple {30341#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume ~m % 4294967296 < 16777216; {30341#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:34,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {30341#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume !false; {30341#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:34,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {30341#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume !(~e <= -128); {30341#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:34,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {30341#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume ~e - 1 <= 2147483647; {30341#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:34,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {30341#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30342#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {30342#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~m % 4294967296 < 16777216; {30342#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {30342#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume !false; {30342#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {30342#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume !(~e <= -128); {30342#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {30342#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~e - 1 <= 2147483647; {30342#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,760 INFO L290 TraceCheckUtils]: 16: Hoare triple {30342#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30343#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} is VALID [2022-02-21 03:10:34,761 INFO L290 TraceCheckUtils]: 17: Hoare triple {30343#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} assume ~m % 4294967296 < 16777216; {30343#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} is VALID [2022-02-21 03:10:34,761 INFO L290 TraceCheckUtils]: 18: Hoare triple {30343#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} assume !false; {30343#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} is VALID [2022-02-21 03:10:34,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {30343#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} assume !(~e <= -128); {30343#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} is VALID [2022-02-21 03:10:34,761 INFO L290 TraceCheckUtils]: 20: Hoare triple {30343#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} assume ~e - 1 <= 2147483647; {30343#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} is VALID [2022-02-21 03:10:34,762 INFO L290 TraceCheckUtils]: 21: Hoare triple {30343#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30344#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,762 INFO L290 TraceCheckUtils]: 22: Hoare triple {30344#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} assume ~m % 4294967296 < 16777216; {30344#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,763 INFO L290 TraceCheckUtils]: 23: Hoare triple {30344#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} assume !false; {30344#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,763 INFO L290 TraceCheckUtils]: 24: Hoare triple {30344#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} assume !(~e <= -128); {30344#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,763 INFO L290 TraceCheckUtils]: 25: Hoare triple {30344#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} assume ~e - 1 <= 2147483647; {30344#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,764 INFO L290 TraceCheckUtils]: 26: Hoare triple {30344#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30345#(or (<= 0 (+ 5 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,764 INFO L290 TraceCheckUtils]: 27: Hoare triple {30345#(or (<= 0 (+ 5 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~m % 4294967296 < 16777216; {30345#(or (<= 0 (+ 5 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,764 INFO L290 TraceCheckUtils]: 28: Hoare triple {30345#(or (<= 0 (+ 5 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume !false; {30345#(or (<= 0 (+ 5 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,765 INFO L290 TraceCheckUtils]: 29: Hoare triple {30345#(or (<= 0 (+ 5 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume !(~e <= -128); {30345#(or (<= 0 (+ 5 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,765 INFO L290 TraceCheckUtils]: 30: Hoare triple {30345#(or (<= 0 (+ 5 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~e - 1 <= 2147483647; {30345#(or (<= 0 (+ 5 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,765 INFO L290 TraceCheckUtils]: 31: Hoare triple {30345#(or (<= 0 (+ 5 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30346#(or (<= 0 (+ 6 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,766 INFO L290 TraceCheckUtils]: 32: Hoare triple {30346#(or (<= 0 (+ 6 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~m % 4294967296 < 16777216; {30346#(or (<= 0 (+ 6 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,766 INFO L290 TraceCheckUtils]: 33: Hoare triple {30346#(or (<= 0 (+ 6 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume !false; {30346#(or (<= 0 (+ 6 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,766 INFO L290 TraceCheckUtils]: 34: Hoare triple {30346#(or (<= 0 (+ 6 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume !(~e <= -128); {30346#(or (<= 0 (+ 6 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,766 INFO L290 TraceCheckUtils]: 35: Hoare triple {30346#(or (<= 0 (+ 6 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~e - 1 <= 2147483647; {30346#(or (<= 0 (+ 6 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,767 INFO L290 TraceCheckUtils]: 36: Hoare triple {30346#(or (<= 0 (+ 6 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30347#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 7 base2flt_~e)))} is VALID [2022-02-21 03:10:34,767 INFO L290 TraceCheckUtils]: 37: Hoare triple {30347#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 7 base2flt_~e)))} assume ~m % 4294967296 < 16777216; {30347#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 7 base2flt_~e)))} is VALID [2022-02-21 03:10:34,767 INFO L290 TraceCheckUtils]: 38: Hoare triple {30347#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 7 base2flt_~e)))} assume !false; {30347#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 7 base2flt_~e)))} is VALID [2022-02-21 03:10:34,768 INFO L290 TraceCheckUtils]: 39: Hoare triple {30347#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 7 base2flt_~e)))} assume !(~e <= -128); {30347#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 7 base2flt_~e)))} is VALID [2022-02-21 03:10:34,768 INFO L290 TraceCheckUtils]: 40: Hoare triple {30347#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 7 base2flt_~e)))} assume ~e - 1 <= 2147483647; {30347#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 7 base2flt_~e)))} is VALID [2022-02-21 03:10:34,768 INFO L290 TraceCheckUtils]: 41: Hoare triple {30347#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 7 base2flt_~e)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30348#(or (<= 0 (+ base2flt_~e 8)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,769 INFO L290 TraceCheckUtils]: 42: Hoare triple {30348#(or (<= 0 (+ base2flt_~e 8)) (not (= |base2flt_#in~e| 0)))} assume ~m % 4294967296 < 16777216; {30348#(or (<= 0 (+ base2flt_~e 8)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,769 INFO L290 TraceCheckUtils]: 43: Hoare triple {30348#(or (<= 0 (+ base2flt_~e 8)) (not (= |base2flt_#in~e| 0)))} assume !false; {30348#(or (<= 0 (+ base2flt_~e 8)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,769 INFO L290 TraceCheckUtils]: 44: Hoare triple {30348#(or (<= 0 (+ base2flt_~e 8)) (not (= |base2flt_#in~e| 0)))} assume !(~e <= -128); {30348#(or (<= 0 (+ base2flt_~e 8)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,770 INFO L290 TraceCheckUtils]: 45: Hoare triple {30348#(or (<= 0 (+ base2flt_~e 8)) (not (= |base2flt_#in~e| 0)))} assume ~e - 1 <= 2147483647; {30348#(or (<= 0 (+ base2flt_~e 8)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,770 INFO L290 TraceCheckUtils]: 46: Hoare triple {30348#(or (<= 0 (+ base2flt_~e 8)) (not (= |base2flt_#in~e| 0)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30349#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 9 base2flt_~e)))} is VALID [2022-02-21 03:10:34,770 INFO L290 TraceCheckUtils]: 47: Hoare triple {30349#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 9 base2flt_~e)))} assume ~m % 4294967296 < 16777216; {30349#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 9 base2flt_~e)))} is VALID [2022-02-21 03:10:34,771 INFO L290 TraceCheckUtils]: 48: Hoare triple {30349#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 9 base2flt_~e)))} assume !false; {30349#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 9 base2flt_~e)))} is VALID [2022-02-21 03:10:34,771 INFO L290 TraceCheckUtils]: 49: Hoare triple {30349#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 9 base2flt_~e)))} assume !(~e <= -128); {30349#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 9 base2flt_~e)))} is VALID [2022-02-21 03:10:34,771 INFO L290 TraceCheckUtils]: 50: Hoare triple {30349#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 9 base2flt_~e)))} assume ~e - 1 <= 2147483647; {30349#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 9 base2flt_~e)))} is VALID [2022-02-21 03:10:34,772 INFO L290 TraceCheckUtils]: 51: Hoare triple {30349#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 9 base2flt_~e)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30350#(or (<= 0 (+ base2flt_~e 10)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,772 INFO L290 TraceCheckUtils]: 52: Hoare triple {30350#(or (<= 0 (+ base2flt_~e 10)) (not (= |base2flt_#in~e| 0)))} assume ~m % 4294967296 < 16777216; {30350#(or (<= 0 (+ base2flt_~e 10)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,773 INFO L290 TraceCheckUtils]: 53: Hoare triple {30350#(or (<= 0 (+ base2flt_~e 10)) (not (= |base2flt_#in~e| 0)))} assume !false; {30350#(or (<= 0 (+ base2flt_~e 10)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,773 INFO L290 TraceCheckUtils]: 54: Hoare triple {30350#(or (<= 0 (+ base2flt_~e 10)) (not (= |base2flt_#in~e| 0)))} assume ~e <= -128;~__retres4~0 := 0; {30351#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:10:34,773 INFO L290 TraceCheckUtils]: 55: Hoare triple {30351#(not (= |base2flt_#in~e| 0))} #res := ~__retres4~0; {30351#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:10:34,773 INFO L290 TraceCheckUtils]: 56: Hoare triple {30351#(not (= |base2flt_#in~e| 0))} assume true; {30351#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:10:34,774 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {30351#(not (= |base2flt_#in~e| 0))} {30274#true} #396#return; {30275#false} is VALID [2022-02-21 03:10:34,774 INFO L290 TraceCheckUtils]: 0: Hoare triple {30274#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); {30274#true} is VALID [2022-02-21 03:10:34,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {30274#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {30274#true} is VALID [2022-02-21 03:10:34,775 INFO L272 TraceCheckUtils]: 2: Hoare triple {30274#true} call main_#t~ret22#1 := base2flt(0, 0); {30339#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:34,775 INFO L290 TraceCheckUtils]: 3: Hoare triple {30339#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {30274#true} is VALID [2022-02-21 03:10:34,775 INFO L290 TraceCheckUtils]: 4: Hoare triple {30274#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {30274#true} is VALID [2022-02-21 03:10:34,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {30274#true} #res := ~__retres4~0; {30274#true} is VALID [2022-02-21 03:10:34,775 INFO L290 TraceCheckUtils]: 6: Hoare triple {30274#true} assume true; {30274#true} is VALID [2022-02-21 03:10:34,775 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {30274#true} {30274#true} #394#return; {30274#true} is VALID [2022-02-21 03:10:34,776 INFO L290 TraceCheckUtils]: 8: Hoare triple {30274#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {30274#true} is VALID [2022-02-21 03:10:34,776 INFO L272 TraceCheckUtils]: 9: Hoare triple {30274#true} call main_#t~ret23#1 := base2flt(1, 0); {30339#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:34,776 INFO L290 TraceCheckUtils]: 10: Hoare triple {30339#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {30340#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:34,777 INFO L290 TraceCheckUtils]: 11: Hoare triple {30340#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !(0 == ~m % 4294967296); {30340#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:34,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {30340#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~m % 4294967296 < 16777216; {30340#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:34,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {30340#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !false; {30340#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:34,778 INFO L290 TraceCheckUtils]: 14: Hoare triple {30340#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !(~e <= -128); {30340#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:34,778 INFO L290 TraceCheckUtils]: 15: Hoare triple {30340#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~e - 1 <= 2147483647; {30340#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:34,779 INFO L290 TraceCheckUtils]: 16: Hoare triple {30340#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30341#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:34,779 INFO L290 TraceCheckUtils]: 17: Hoare triple {30341#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume ~m % 4294967296 < 16777216; {30341#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:34,779 INFO L290 TraceCheckUtils]: 18: Hoare triple {30341#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume !false; {30341#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:34,779 INFO L290 TraceCheckUtils]: 19: Hoare triple {30341#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume !(~e <= -128); {30341#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:34,780 INFO L290 TraceCheckUtils]: 20: Hoare triple {30341#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume ~e - 1 <= 2147483647; {30341#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:34,780 INFO L290 TraceCheckUtils]: 21: Hoare triple {30341#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30342#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,781 INFO L290 TraceCheckUtils]: 22: Hoare triple {30342#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~m % 4294967296 < 16777216; {30342#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,781 INFO L290 TraceCheckUtils]: 23: Hoare triple {30342#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume !false; {30342#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,781 INFO L290 TraceCheckUtils]: 24: Hoare triple {30342#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume !(~e <= -128); {30342#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,782 INFO L290 TraceCheckUtils]: 25: Hoare triple {30342#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~e - 1 <= 2147483647; {30342#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,782 INFO L290 TraceCheckUtils]: 26: Hoare triple {30342#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30343#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} is VALID [2022-02-21 03:10:34,783 INFO L290 TraceCheckUtils]: 27: Hoare triple {30343#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} assume ~m % 4294967296 < 16777216; {30343#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} is VALID [2022-02-21 03:10:34,783 INFO L290 TraceCheckUtils]: 28: Hoare triple {30343#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} assume !false; {30343#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} is VALID [2022-02-21 03:10:34,783 INFO L290 TraceCheckUtils]: 29: Hoare triple {30343#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} assume !(~e <= -128); {30343#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} is VALID [2022-02-21 03:10:34,784 INFO L290 TraceCheckUtils]: 30: Hoare triple {30343#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} assume ~e - 1 <= 2147483647; {30343#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} is VALID [2022-02-21 03:10:34,784 INFO L290 TraceCheckUtils]: 31: Hoare triple {30343#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30344#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,784 INFO L290 TraceCheckUtils]: 32: Hoare triple {30344#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} assume ~m % 4294967296 < 16777216; {30344#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,785 INFO L290 TraceCheckUtils]: 33: Hoare triple {30344#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} assume !false; {30344#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,785 INFO L290 TraceCheckUtils]: 34: Hoare triple {30344#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} assume !(~e <= -128); {30344#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,786 INFO L290 TraceCheckUtils]: 35: Hoare triple {30344#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} assume ~e - 1 <= 2147483647; {30344#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,786 INFO L290 TraceCheckUtils]: 36: Hoare triple {30344#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30345#(or (<= 0 (+ 5 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,786 INFO L290 TraceCheckUtils]: 37: Hoare triple {30345#(or (<= 0 (+ 5 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~m % 4294967296 < 16777216; {30345#(or (<= 0 (+ 5 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,787 INFO L290 TraceCheckUtils]: 38: Hoare triple {30345#(or (<= 0 (+ 5 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume !false; {30345#(or (<= 0 (+ 5 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,787 INFO L290 TraceCheckUtils]: 39: Hoare triple {30345#(or (<= 0 (+ 5 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume !(~e <= -128); {30345#(or (<= 0 (+ 5 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,787 INFO L290 TraceCheckUtils]: 40: Hoare triple {30345#(or (<= 0 (+ 5 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~e - 1 <= 2147483647; {30345#(or (<= 0 (+ 5 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,788 INFO L290 TraceCheckUtils]: 41: Hoare triple {30345#(or (<= 0 (+ 5 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30346#(or (<= 0 (+ 6 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,788 INFO L290 TraceCheckUtils]: 42: Hoare triple {30346#(or (<= 0 (+ 6 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~m % 4294967296 < 16777216; {30346#(or (<= 0 (+ 6 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,789 INFO L290 TraceCheckUtils]: 43: Hoare triple {30346#(or (<= 0 (+ 6 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume !false; {30346#(or (<= 0 (+ 6 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,789 INFO L290 TraceCheckUtils]: 44: Hoare triple {30346#(or (<= 0 (+ 6 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume !(~e <= -128); {30346#(or (<= 0 (+ 6 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,789 INFO L290 TraceCheckUtils]: 45: Hoare triple {30346#(or (<= 0 (+ 6 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~e - 1 <= 2147483647; {30346#(or (<= 0 (+ 6 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,790 INFO L290 TraceCheckUtils]: 46: Hoare triple {30346#(or (<= 0 (+ 6 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30347#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 7 base2flt_~e)))} is VALID [2022-02-21 03:10:34,790 INFO L290 TraceCheckUtils]: 47: Hoare triple {30347#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 7 base2flt_~e)))} assume ~m % 4294967296 < 16777216; {30347#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 7 base2flt_~e)))} is VALID [2022-02-21 03:10:34,790 INFO L290 TraceCheckUtils]: 48: Hoare triple {30347#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 7 base2flt_~e)))} assume !false; {30347#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 7 base2flt_~e)))} is VALID [2022-02-21 03:10:34,791 INFO L290 TraceCheckUtils]: 49: Hoare triple {30347#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 7 base2flt_~e)))} assume !(~e <= -128); {30347#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 7 base2flt_~e)))} is VALID [2022-02-21 03:10:34,791 INFO L290 TraceCheckUtils]: 50: Hoare triple {30347#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 7 base2flt_~e)))} assume ~e - 1 <= 2147483647; {30347#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 7 base2flt_~e)))} is VALID [2022-02-21 03:10:34,792 INFO L290 TraceCheckUtils]: 51: Hoare triple {30347#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 7 base2flt_~e)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30348#(or (<= 0 (+ base2flt_~e 8)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,792 INFO L290 TraceCheckUtils]: 52: Hoare triple {30348#(or (<= 0 (+ base2flt_~e 8)) (not (= |base2flt_#in~e| 0)))} assume ~m % 4294967296 < 16777216; {30348#(or (<= 0 (+ base2flt_~e 8)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,792 INFO L290 TraceCheckUtils]: 53: Hoare triple {30348#(or (<= 0 (+ base2flt_~e 8)) (not (= |base2flt_#in~e| 0)))} assume !false; {30348#(or (<= 0 (+ base2flt_~e 8)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,793 INFO L290 TraceCheckUtils]: 54: Hoare triple {30348#(or (<= 0 (+ base2flt_~e 8)) (not (= |base2flt_#in~e| 0)))} assume !(~e <= -128); {30348#(or (<= 0 (+ base2flt_~e 8)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,793 INFO L290 TraceCheckUtils]: 55: Hoare triple {30348#(or (<= 0 (+ base2flt_~e 8)) (not (= |base2flt_#in~e| 0)))} assume ~e - 1 <= 2147483647; {30348#(or (<= 0 (+ base2flt_~e 8)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,794 INFO L290 TraceCheckUtils]: 56: Hoare triple {30348#(or (<= 0 (+ base2flt_~e 8)) (not (= |base2flt_#in~e| 0)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30349#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 9 base2flt_~e)))} is VALID [2022-02-21 03:10:34,794 INFO L290 TraceCheckUtils]: 57: Hoare triple {30349#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 9 base2flt_~e)))} assume ~m % 4294967296 < 16777216; {30349#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 9 base2flt_~e)))} is VALID [2022-02-21 03:10:34,794 INFO L290 TraceCheckUtils]: 58: Hoare triple {30349#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 9 base2flt_~e)))} assume !false; {30349#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 9 base2flt_~e)))} is VALID [2022-02-21 03:10:34,795 INFO L290 TraceCheckUtils]: 59: Hoare triple {30349#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 9 base2flt_~e)))} assume !(~e <= -128); {30349#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 9 base2flt_~e)))} is VALID [2022-02-21 03:10:34,795 INFO L290 TraceCheckUtils]: 60: Hoare triple {30349#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 9 base2flt_~e)))} assume ~e - 1 <= 2147483647; {30349#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 9 base2flt_~e)))} is VALID [2022-02-21 03:10:34,796 INFO L290 TraceCheckUtils]: 61: Hoare triple {30349#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 9 base2flt_~e)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30350#(or (<= 0 (+ base2flt_~e 10)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,796 INFO L290 TraceCheckUtils]: 62: Hoare triple {30350#(or (<= 0 (+ base2flt_~e 10)) (not (= |base2flt_#in~e| 0)))} assume ~m % 4294967296 < 16777216; {30350#(or (<= 0 (+ base2flt_~e 10)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,796 INFO L290 TraceCheckUtils]: 63: Hoare triple {30350#(or (<= 0 (+ base2flt_~e 10)) (not (= |base2flt_#in~e| 0)))} assume !false; {30350#(or (<= 0 (+ base2flt_~e 10)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:34,797 INFO L290 TraceCheckUtils]: 64: Hoare triple {30350#(or (<= 0 (+ base2flt_~e 10)) (not (= |base2flt_#in~e| 0)))} assume ~e <= -128;~__retres4~0 := 0; {30351#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:10:34,797 INFO L290 TraceCheckUtils]: 65: Hoare triple {30351#(not (= |base2flt_#in~e| 0))} #res := ~__retres4~0; {30351#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:10:34,798 INFO L290 TraceCheckUtils]: 66: Hoare triple {30351#(not (= |base2flt_#in~e| 0))} assume true; {30351#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:10:34,798 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {30351#(not (= |base2flt_#in~e| 0))} {30274#true} #396#return; {30275#false} is VALID [2022-02-21 03:10:34,798 INFO L290 TraceCheckUtils]: 68: Hoare triple {30275#false} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {30275#false} is VALID [2022-02-21 03:10:34,798 INFO L272 TraceCheckUtils]: 69: Hoare triple {30275#false} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {30275#false} is VALID [2022-02-21 03:10:34,798 INFO L290 TraceCheckUtils]: 70: Hoare triple {30275#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {30275#false} is VALID [2022-02-21 03:10:34,799 INFO L290 TraceCheckUtils]: 71: Hoare triple {30275#false} assume !(0 == ~m % 4294967296); {30275#false} is VALID [2022-02-21 03:10:34,799 INFO L290 TraceCheckUtils]: 72: Hoare triple {30275#false} assume !(~m % 4294967296 < 16777216); {30275#false} is VALID [2022-02-21 03:10:34,799 INFO L290 TraceCheckUtils]: 73: Hoare triple {30275#false} assume !false; {30275#false} is VALID [2022-02-21 03:10:34,799 INFO L290 TraceCheckUtils]: 74: Hoare triple {30275#false} assume !(~m % 4294967296 >= 33554432); {30275#false} is VALID [2022-02-21 03:10:34,799 INFO L290 TraceCheckUtils]: 75: Hoare triple {30275#false} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {30275#false} is VALID [2022-02-21 03:10:34,799 INFO L290 TraceCheckUtils]: 76: Hoare triple {30275#false} assume 128 + ~e <= 2147483647; {30275#false} is VALID [2022-02-21 03:10:34,799 INFO L290 TraceCheckUtils]: 77: Hoare triple {30275#false} assume 128 + ~e >= -2147483648; {30275#false} is VALID [2022-02-21 03:10:34,799 INFO L290 TraceCheckUtils]: 78: Hoare triple {30275#false} assume !(16777216 * (128 + ~e) <= 2147483647); {30275#false} is VALID [2022-02-21 03:10:34,800 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 9 proven. 245 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:10:34,800 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:34,800 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902433132] [2022-02-21 03:10:34,800 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902433132] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:34,800 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139736236] [2022-02-21 03:10:34,800 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:10:34,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:34,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:34,801 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:10:34,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-21 03:10:34,860 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:10:34,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:10:34,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-21 03:10:34,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:34,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:35,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {30274#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); {30274#true} is VALID [2022-02-21 03:10:35,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {30274#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {30274#true} is VALID [2022-02-21 03:10:35,310 INFO L272 TraceCheckUtils]: 2: Hoare triple {30274#true} call main_#t~ret22#1 := base2flt(0, 0); {30274#true} is VALID [2022-02-21 03:10:35,310 INFO L290 TraceCheckUtils]: 3: Hoare triple {30274#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {30274#true} is VALID [2022-02-21 03:10:35,310 INFO L290 TraceCheckUtils]: 4: Hoare triple {30274#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {30274#true} is VALID [2022-02-21 03:10:35,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {30274#true} #res := ~__retres4~0; {30274#true} is VALID [2022-02-21 03:10:35,311 INFO L290 TraceCheckUtils]: 6: Hoare triple {30274#true} assume true; {30274#true} is VALID [2022-02-21 03:10:35,311 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {30274#true} {30274#true} #394#return; {30274#true} is VALID [2022-02-21 03:10:35,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {30274#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {30274#true} is VALID [2022-02-21 03:10:35,311 INFO L272 TraceCheckUtils]: 9: Hoare triple {30274#true} call main_#t~ret23#1 := base2flt(1, 0); {30274#true} is VALID [2022-02-21 03:10:35,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {30274#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {30385#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:35,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {30385#(<= |base2flt_#in~e| base2flt_~e)} assume !(0 == ~m % 4294967296); {30385#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:35,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {30385#(<= |base2flt_#in~e| base2flt_~e)} assume ~m % 4294967296 < 16777216; {30385#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:35,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {30385#(<= |base2flt_#in~e| base2flt_~e)} assume !false; {30385#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:35,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {30385#(<= |base2flt_#in~e| base2flt_~e)} assume !(~e <= -128); {30385#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:35,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {30385#(<= |base2flt_#in~e| base2flt_~e)} assume ~e - 1 <= 2147483647; {30385#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:35,313 INFO L290 TraceCheckUtils]: 16: Hoare triple {30385#(<= |base2flt_#in~e| base2flt_~e)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30404#(<= |base2flt_#in~e| (+ base2flt_~e 1))} is VALID [2022-02-21 03:10:35,313 INFO L290 TraceCheckUtils]: 17: Hoare triple {30404#(<= |base2flt_#in~e| (+ base2flt_~e 1))} assume ~m % 4294967296 < 16777216; {30404#(<= |base2flt_#in~e| (+ base2flt_~e 1))} is VALID [2022-02-21 03:10:35,313 INFO L290 TraceCheckUtils]: 18: Hoare triple {30404#(<= |base2flt_#in~e| (+ base2flt_~e 1))} assume !false; {30404#(<= |base2flt_#in~e| (+ base2flt_~e 1))} is VALID [2022-02-21 03:10:35,314 INFO L290 TraceCheckUtils]: 19: Hoare triple {30404#(<= |base2flt_#in~e| (+ base2flt_~e 1))} assume !(~e <= -128); {30404#(<= |base2flt_#in~e| (+ base2flt_~e 1))} is VALID [2022-02-21 03:10:35,314 INFO L290 TraceCheckUtils]: 20: Hoare triple {30404#(<= |base2flt_#in~e| (+ base2flt_~e 1))} assume ~e - 1 <= 2147483647; {30404#(<= |base2flt_#in~e| (+ base2flt_~e 1))} is VALID [2022-02-21 03:10:35,314 INFO L290 TraceCheckUtils]: 21: Hoare triple {30404#(<= |base2flt_#in~e| (+ base2flt_~e 1))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30420#(<= |base2flt_#in~e| (+ 2 base2flt_~e))} is VALID [2022-02-21 03:10:35,315 INFO L290 TraceCheckUtils]: 22: Hoare triple {30420#(<= |base2flt_#in~e| (+ 2 base2flt_~e))} assume ~m % 4294967296 < 16777216; {30420#(<= |base2flt_#in~e| (+ 2 base2flt_~e))} is VALID [2022-02-21 03:10:35,315 INFO L290 TraceCheckUtils]: 23: Hoare triple {30420#(<= |base2flt_#in~e| (+ 2 base2flt_~e))} assume !false; {30420#(<= |base2flt_#in~e| (+ 2 base2flt_~e))} is VALID [2022-02-21 03:10:35,315 INFO L290 TraceCheckUtils]: 24: Hoare triple {30420#(<= |base2flt_#in~e| (+ 2 base2flt_~e))} assume !(~e <= -128); {30420#(<= |base2flt_#in~e| (+ 2 base2flt_~e))} is VALID [2022-02-21 03:10:35,315 INFO L290 TraceCheckUtils]: 25: Hoare triple {30420#(<= |base2flt_#in~e| (+ 2 base2flt_~e))} assume ~e - 1 <= 2147483647; {30420#(<= |base2flt_#in~e| (+ 2 base2flt_~e))} is VALID [2022-02-21 03:10:35,340 INFO L290 TraceCheckUtils]: 26: Hoare triple {30420#(<= |base2flt_#in~e| (+ 2 base2flt_~e))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30436#(<= |base2flt_#in~e| (+ 3 base2flt_~e))} is VALID [2022-02-21 03:10:35,340 INFO L290 TraceCheckUtils]: 27: Hoare triple {30436#(<= |base2flt_#in~e| (+ 3 base2flt_~e))} assume ~m % 4294967296 < 16777216; {30436#(<= |base2flt_#in~e| (+ 3 base2flt_~e))} is VALID [2022-02-21 03:10:35,341 INFO L290 TraceCheckUtils]: 28: Hoare triple {30436#(<= |base2flt_#in~e| (+ 3 base2flt_~e))} assume !false; {30436#(<= |base2flt_#in~e| (+ 3 base2flt_~e))} is VALID [2022-02-21 03:10:35,341 INFO L290 TraceCheckUtils]: 29: Hoare triple {30436#(<= |base2flt_#in~e| (+ 3 base2flt_~e))} assume !(~e <= -128); {30436#(<= |base2flt_#in~e| (+ 3 base2flt_~e))} is VALID [2022-02-21 03:10:35,341 INFO L290 TraceCheckUtils]: 30: Hoare triple {30436#(<= |base2flt_#in~e| (+ 3 base2flt_~e))} assume ~e - 1 <= 2147483647; {30436#(<= |base2flt_#in~e| (+ 3 base2flt_~e))} is VALID [2022-02-21 03:10:35,343 INFO L290 TraceCheckUtils]: 31: Hoare triple {30436#(<= |base2flt_#in~e| (+ 3 base2flt_~e))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30452#(<= |base2flt_#in~e| (+ base2flt_~e 4))} is VALID [2022-02-21 03:10:35,343 INFO L290 TraceCheckUtils]: 32: Hoare triple {30452#(<= |base2flt_#in~e| (+ base2flt_~e 4))} assume ~m % 4294967296 < 16777216; {30452#(<= |base2flt_#in~e| (+ base2flt_~e 4))} is VALID [2022-02-21 03:10:35,344 INFO L290 TraceCheckUtils]: 33: Hoare triple {30452#(<= |base2flt_#in~e| (+ base2flt_~e 4))} assume !false; {30452#(<= |base2flt_#in~e| (+ base2flt_~e 4))} is VALID [2022-02-21 03:10:35,344 INFO L290 TraceCheckUtils]: 34: Hoare triple {30452#(<= |base2flt_#in~e| (+ base2flt_~e 4))} assume !(~e <= -128); {30452#(<= |base2flt_#in~e| (+ base2flt_~e 4))} is VALID [2022-02-21 03:10:35,344 INFO L290 TraceCheckUtils]: 35: Hoare triple {30452#(<= |base2flt_#in~e| (+ base2flt_~e 4))} assume ~e - 1 <= 2147483647; {30452#(<= |base2flt_#in~e| (+ base2flt_~e 4))} is VALID [2022-02-21 03:10:35,345 INFO L290 TraceCheckUtils]: 36: Hoare triple {30452#(<= |base2flt_#in~e| (+ base2flt_~e 4))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30468#(<= |base2flt_#in~e| (+ 5 base2flt_~e))} is VALID [2022-02-21 03:10:35,345 INFO L290 TraceCheckUtils]: 37: Hoare triple {30468#(<= |base2flt_#in~e| (+ 5 base2flt_~e))} assume ~m % 4294967296 < 16777216; {30468#(<= |base2flt_#in~e| (+ 5 base2flt_~e))} is VALID [2022-02-21 03:10:35,345 INFO L290 TraceCheckUtils]: 38: Hoare triple {30468#(<= |base2flt_#in~e| (+ 5 base2flt_~e))} assume !false; {30468#(<= |base2flt_#in~e| (+ 5 base2flt_~e))} is VALID [2022-02-21 03:10:35,346 INFO L290 TraceCheckUtils]: 39: Hoare triple {30468#(<= |base2flt_#in~e| (+ 5 base2flt_~e))} assume !(~e <= -128); {30468#(<= |base2flt_#in~e| (+ 5 base2flt_~e))} is VALID [2022-02-21 03:10:35,346 INFO L290 TraceCheckUtils]: 40: Hoare triple {30468#(<= |base2flt_#in~e| (+ 5 base2flt_~e))} assume ~e - 1 <= 2147483647; {30468#(<= |base2flt_#in~e| (+ 5 base2flt_~e))} is VALID [2022-02-21 03:10:35,346 INFO L290 TraceCheckUtils]: 41: Hoare triple {30468#(<= |base2flt_#in~e| (+ 5 base2flt_~e))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30484#(<= |base2flt_#in~e| (+ 6 base2flt_~e))} is VALID [2022-02-21 03:10:35,347 INFO L290 TraceCheckUtils]: 42: Hoare triple {30484#(<= |base2flt_#in~e| (+ 6 base2flt_~e))} assume ~m % 4294967296 < 16777216; {30484#(<= |base2flt_#in~e| (+ 6 base2flt_~e))} is VALID [2022-02-21 03:10:35,347 INFO L290 TraceCheckUtils]: 43: Hoare triple {30484#(<= |base2flt_#in~e| (+ 6 base2flt_~e))} assume !false; {30484#(<= |base2flt_#in~e| (+ 6 base2flt_~e))} is VALID [2022-02-21 03:10:35,347 INFO L290 TraceCheckUtils]: 44: Hoare triple {30484#(<= |base2flt_#in~e| (+ 6 base2flt_~e))} assume !(~e <= -128); {30484#(<= |base2flt_#in~e| (+ 6 base2flt_~e))} is VALID [2022-02-21 03:10:35,348 INFO L290 TraceCheckUtils]: 45: Hoare triple {30484#(<= |base2flt_#in~e| (+ 6 base2flt_~e))} assume ~e - 1 <= 2147483647; {30484#(<= |base2flt_#in~e| (+ 6 base2flt_~e))} is VALID [2022-02-21 03:10:35,348 INFO L290 TraceCheckUtils]: 46: Hoare triple {30484#(<= |base2flt_#in~e| (+ 6 base2flt_~e))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30500#(<= |base2flt_#in~e| (+ 7 base2flt_~e))} is VALID [2022-02-21 03:10:35,348 INFO L290 TraceCheckUtils]: 47: Hoare triple {30500#(<= |base2flt_#in~e| (+ 7 base2flt_~e))} assume ~m % 4294967296 < 16777216; {30500#(<= |base2flt_#in~e| (+ 7 base2flt_~e))} is VALID [2022-02-21 03:10:35,349 INFO L290 TraceCheckUtils]: 48: Hoare triple {30500#(<= |base2flt_#in~e| (+ 7 base2flt_~e))} assume !false; {30500#(<= |base2flt_#in~e| (+ 7 base2flt_~e))} is VALID [2022-02-21 03:10:35,349 INFO L290 TraceCheckUtils]: 49: Hoare triple {30500#(<= |base2flt_#in~e| (+ 7 base2flt_~e))} assume !(~e <= -128); {30500#(<= |base2flt_#in~e| (+ 7 base2flt_~e))} is VALID [2022-02-21 03:10:35,349 INFO L290 TraceCheckUtils]: 50: Hoare triple {30500#(<= |base2flt_#in~e| (+ 7 base2flt_~e))} assume ~e - 1 <= 2147483647; {30500#(<= |base2flt_#in~e| (+ 7 base2flt_~e))} is VALID [2022-02-21 03:10:35,350 INFO L290 TraceCheckUtils]: 51: Hoare triple {30500#(<= |base2flt_#in~e| (+ 7 base2flt_~e))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30516#(<= |base2flt_#in~e| (+ base2flt_~e 8))} is VALID [2022-02-21 03:10:35,350 INFO L290 TraceCheckUtils]: 52: Hoare triple {30516#(<= |base2flt_#in~e| (+ base2flt_~e 8))} assume ~m % 4294967296 < 16777216; {30516#(<= |base2flt_#in~e| (+ base2flt_~e 8))} is VALID [2022-02-21 03:10:35,351 INFO L290 TraceCheckUtils]: 53: Hoare triple {30516#(<= |base2flt_#in~e| (+ base2flt_~e 8))} assume !false; {30516#(<= |base2flt_#in~e| (+ base2flt_~e 8))} is VALID [2022-02-21 03:10:35,351 INFO L290 TraceCheckUtils]: 54: Hoare triple {30516#(<= |base2flt_#in~e| (+ base2flt_~e 8))} assume !(~e <= -128); {30516#(<= |base2flt_#in~e| (+ base2flt_~e 8))} is VALID [2022-02-21 03:10:35,351 INFO L290 TraceCheckUtils]: 55: Hoare triple {30516#(<= |base2flt_#in~e| (+ base2flt_~e 8))} assume ~e - 1 <= 2147483647; {30516#(<= |base2flt_#in~e| (+ base2flt_~e 8))} is VALID [2022-02-21 03:10:35,352 INFO L290 TraceCheckUtils]: 56: Hoare triple {30516#(<= |base2flt_#in~e| (+ base2flt_~e 8))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30532#(<= |base2flt_#in~e| (+ 9 base2flt_~e))} is VALID [2022-02-21 03:10:35,352 INFO L290 TraceCheckUtils]: 57: Hoare triple {30532#(<= |base2flt_#in~e| (+ 9 base2flt_~e))} assume ~m % 4294967296 < 16777216; {30532#(<= |base2flt_#in~e| (+ 9 base2flt_~e))} is VALID [2022-02-21 03:10:35,353 INFO L290 TraceCheckUtils]: 58: Hoare triple {30532#(<= |base2flt_#in~e| (+ 9 base2flt_~e))} assume !false; {30532#(<= |base2flt_#in~e| (+ 9 base2flt_~e))} is VALID [2022-02-21 03:10:35,353 INFO L290 TraceCheckUtils]: 59: Hoare triple {30532#(<= |base2flt_#in~e| (+ 9 base2flt_~e))} assume !(~e <= -128); {30532#(<= |base2flt_#in~e| (+ 9 base2flt_~e))} is VALID [2022-02-21 03:10:35,353 INFO L290 TraceCheckUtils]: 60: Hoare triple {30532#(<= |base2flt_#in~e| (+ 9 base2flt_~e))} assume ~e - 1 <= 2147483647; {30532#(<= |base2flt_#in~e| (+ 9 base2flt_~e))} is VALID [2022-02-21 03:10:35,354 INFO L290 TraceCheckUtils]: 61: Hoare triple {30532#(<= |base2flt_#in~e| (+ 9 base2flt_~e))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30548#(<= |base2flt_#in~e| (+ base2flt_~e 10))} is VALID [2022-02-21 03:10:35,355 INFO L290 TraceCheckUtils]: 62: Hoare triple {30548#(<= |base2flt_#in~e| (+ base2flt_~e 10))} assume ~m % 4294967296 < 16777216; {30548#(<= |base2flt_#in~e| (+ base2flt_~e 10))} is VALID [2022-02-21 03:10:35,355 INFO L290 TraceCheckUtils]: 63: Hoare triple {30548#(<= |base2flt_#in~e| (+ base2flt_~e 10))} assume !false; {30548#(<= |base2flt_#in~e| (+ base2flt_~e 10))} is VALID [2022-02-21 03:10:35,356 INFO L290 TraceCheckUtils]: 64: Hoare triple {30548#(<= |base2flt_#in~e| (+ base2flt_~e 10))} assume ~e <= -128;~__retres4~0 := 0; {30558#(<= (+ 118 |base2flt_#in~e|) 0)} is VALID [2022-02-21 03:10:35,356 INFO L290 TraceCheckUtils]: 65: Hoare triple {30558#(<= (+ 118 |base2flt_#in~e|) 0)} #res := ~__retres4~0; {30558#(<= (+ 118 |base2flt_#in~e|) 0)} is VALID [2022-02-21 03:10:35,356 INFO L290 TraceCheckUtils]: 66: Hoare triple {30558#(<= (+ 118 |base2flt_#in~e|) 0)} assume true; {30558#(<= (+ 118 |base2flt_#in~e|) 0)} is VALID [2022-02-21 03:10:35,357 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {30558#(<= (+ 118 |base2flt_#in~e|) 0)} {30274#true} #396#return; {30275#false} is VALID [2022-02-21 03:10:35,357 INFO L290 TraceCheckUtils]: 68: Hoare triple {30275#false} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {30275#false} is VALID [2022-02-21 03:10:35,357 INFO L272 TraceCheckUtils]: 69: Hoare triple {30275#false} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {30275#false} is VALID [2022-02-21 03:10:35,357 INFO L290 TraceCheckUtils]: 70: Hoare triple {30275#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {30275#false} is VALID [2022-02-21 03:10:35,357 INFO L290 TraceCheckUtils]: 71: Hoare triple {30275#false} assume !(0 == ~m % 4294967296); {30275#false} is VALID [2022-02-21 03:10:35,357 INFO L290 TraceCheckUtils]: 72: Hoare triple {30275#false} assume !(~m % 4294967296 < 16777216); {30275#false} is VALID [2022-02-21 03:10:35,357 INFO L290 TraceCheckUtils]: 73: Hoare triple {30275#false} assume !false; {30275#false} is VALID [2022-02-21 03:10:35,358 INFO L290 TraceCheckUtils]: 74: Hoare triple {30275#false} assume !(~m % 4294967296 >= 33554432); {30275#false} is VALID [2022-02-21 03:10:35,358 INFO L290 TraceCheckUtils]: 75: Hoare triple {30275#false} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {30275#false} is VALID [2022-02-21 03:10:35,358 INFO L290 TraceCheckUtils]: 76: Hoare triple {30275#false} assume 128 + ~e <= 2147483647; {30275#false} is VALID [2022-02-21 03:10:35,358 INFO L290 TraceCheckUtils]: 77: Hoare triple {30275#false} assume 128 + ~e >= -2147483648; {30275#false} is VALID [2022-02-21 03:10:35,358 INFO L290 TraceCheckUtils]: 78: Hoare triple {30275#false} assume !(16777216 * (128 + ~e) <= 2147483647); {30275#false} is VALID [2022-02-21 03:10:35,358 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 9 proven. 245 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:10:35,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:10:36,258 INFO L290 TraceCheckUtils]: 78: Hoare triple {30275#false} assume !(16777216 * (128 + ~e) <= 2147483647); {30275#false} is VALID [2022-02-21 03:10:36,258 INFO L290 TraceCheckUtils]: 77: Hoare triple {30275#false} assume 128 + ~e >= -2147483648; {30275#false} is VALID [2022-02-21 03:10:36,259 INFO L290 TraceCheckUtils]: 76: Hoare triple {30275#false} assume 128 + ~e <= 2147483647; {30275#false} is VALID [2022-02-21 03:10:36,259 INFO L290 TraceCheckUtils]: 75: Hoare triple {30275#false} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {30275#false} is VALID [2022-02-21 03:10:36,259 INFO L290 TraceCheckUtils]: 74: Hoare triple {30275#false} assume !(~m % 4294967296 >= 33554432); {30275#false} is VALID [2022-02-21 03:10:36,259 INFO L290 TraceCheckUtils]: 73: Hoare triple {30275#false} assume !false; {30275#false} is VALID [2022-02-21 03:10:36,259 INFO L290 TraceCheckUtils]: 72: Hoare triple {30275#false} assume !(~m % 4294967296 < 16777216); {30275#false} is VALID [2022-02-21 03:10:36,259 INFO L290 TraceCheckUtils]: 71: Hoare triple {30275#false} assume !(0 == ~m % 4294967296); {30275#false} is VALID [2022-02-21 03:10:36,259 INFO L290 TraceCheckUtils]: 70: Hoare triple {30275#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {30275#false} is VALID [2022-02-21 03:10:36,259 INFO L272 TraceCheckUtils]: 69: Hoare triple {30275#false} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {30275#false} is VALID [2022-02-21 03:10:36,259 INFO L290 TraceCheckUtils]: 68: Hoare triple {30275#false} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {30275#false} is VALID [2022-02-21 03:10:36,263 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {30637#(not (<= 0 |base2flt_#in~e|))} {30274#true} #396#return; {30275#false} is VALID [2022-02-21 03:10:36,264 INFO L290 TraceCheckUtils]: 66: Hoare triple {30637#(not (<= 0 |base2flt_#in~e|))} assume true; {30637#(not (<= 0 |base2flt_#in~e|))} is VALID [2022-02-21 03:10:36,264 INFO L290 TraceCheckUtils]: 65: Hoare triple {30637#(not (<= 0 |base2flt_#in~e|))} #res := ~__retres4~0; {30637#(not (<= 0 |base2flt_#in~e|))} is VALID [2022-02-21 03:10:36,264 INFO L290 TraceCheckUtils]: 64: Hoare triple {30647#(or (not (<= (+ 128 base2flt_~e) 0)) (not (<= 0 |base2flt_#in~e|)))} assume ~e <= -128;~__retres4~0 := 0; {30637#(not (<= 0 |base2flt_#in~e|))} is VALID [2022-02-21 03:10:36,265 INFO L290 TraceCheckUtils]: 63: Hoare triple {30647#(or (not (<= (+ 128 base2flt_~e) 0)) (not (<= 0 |base2flt_#in~e|)))} assume !false; {30647#(or (not (<= (+ 128 base2flt_~e) 0)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,265 INFO L290 TraceCheckUtils]: 62: Hoare triple {30647#(or (not (<= (+ 128 base2flt_~e) 0)) (not (<= 0 |base2flt_#in~e|)))} assume ~m % 4294967296 < 16777216; {30647#(or (not (<= (+ 128 base2flt_~e) 0)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,266 INFO L290 TraceCheckUtils]: 61: Hoare triple {30657#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30647#(or (not (<= (+ 128 base2flt_~e) 0)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,266 INFO L290 TraceCheckUtils]: 60: Hoare triple {30657#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 <= 2147483647; {30657#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,267 INFO L290 TraceCheckUtils]: 59: Hoare triple {30657#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} assume !(~e <= -128); {30657#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,267 INFO L290 TraceCheckUtils]: 58: Hoare triple {30657#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} assume !false; {30657#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,267 INFO L290 TraceCheckUtils]: 57: Hoare triple {30657#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} assume ~m % 4294967296 < 16777216; {30657#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,268 INFO L290 TraceCheckUtils]: 56: Hoare triple {30673#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30657#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,268 INFO L290 TraceCheckUtils]: 55: Hoare triple {30673#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 <= 2147483647; {30673#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,268 INFO L290 TraceCheckUtils]: 54: Hoare triple {30673#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume !(~e <= -128); {30673#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,269 INFO L290 TraceCheckUtils]: 53: Hoare triple {30673#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume !false; {30673#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,269 INFO L290 TraceCheckUtils]: 52: Hoare triple {30673#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume ~m % 4294967296 < 16777216; {30673#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,270 INFO L290 TraceCheckUtils]: 51: Hoare triple {30689#(or (< 0 (+ 125 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30673#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,270 INFO L290 TraceCheckUtils]: 50: Hoare triple {30689#(or (< 0 (+ 125 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 <= 2147483647; {30689#(or (< 0 (+ 125 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,270 INFO L290 TraceCheckUtils]: 49: Hoare triple {30689#(or (< 0 (+ 125 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume !(~e <= -128); {30689#(or (< 0 (+ 125 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,270 INFO L290 TraceCheckUtils]: 48: Hoare triple {30689#(or (< 0 (+ 125 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume !false; {30689#(or (< 0 (+ 125 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,271 INFO L290 TraceCheckUtils]: 47: Hoare triple {30689#(or (< 0 (+ 125 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume ~m % 4294967296 < 16777216; {30689#(or (< 0 (+ 125 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,271 INFO L290 TraceCheckUtils]: 46: Hoare triple {30705#(or (< 0 (+ base2flt_~e 124)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30689#(or (< 0 (+ 125 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,272 INFO L290 TraceCheckUtils]: 45: Hoare triple {30705#(or (< 0 (+ base2flt_~e 124)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 <= 2147483647; {30705#(or (< 0 (+ base2flt_~e 124)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,272 INFO L290 TraceCheckUtils]: 44: Hoare triple {30705#(or (< 0 (+ base2flt_~e 124)) (not (<= 0 |base2flt_#in~e|)))} assume !(~e <= -128); {30705#(or (< 0 (+ base2flt_~e 124)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,272 INFO L290 TraceCheckUtils]: 43: Hoare triple {30705#(or (< 0 (+ base2flt_~e 124)) (not (<= 0 |base2flt_#in~e|)))} assume !false; {30705#(or (< 0 (+ base2flt_~e 124)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,273 INFO L290 TraceCheckUtils]: 42: Hoare triple {30705#(or (< 0 (+ base2flt_~e 124)) (not (<= 0 |base2flt_#in~e|)))} assume ~m % 4294967296 < 16777216; {30705#(or (< 0 (+ base2flt_~e 124)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,273 INFO L290 TraceCheckUtils]: 41: Hoare triple {30721#(or (< 0 (+ 123 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30705#(or (< 0 (+ base2flt_~e 124)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,274 INFO L290 TraceCheckUtils]: 40: Hoare triple {30721#(or (< 0 (+ 123 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 <= 2147483647; {30721#(or (< 0 (+ 123 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,274 INFO L290 TraceCheckUtils]: 39: Hoare triple {30721#(or (< 0 (+ 123 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume !(~e <= -128); {30721#(or (< 0 (+ 123 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,274 INFO L290 TraceCheckUtils]: 38: Hoare triple {30721#(or (< 0 (+ 123 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume !false; {30721#(or (< 0 (+ 123 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,275 INFO L290 TraceCheckUtils]: 37: Hoare triple {30721#(or (< 0 (+ 123 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume ~m % 4294967296 < 16777216; {30721#(or (< 0 (+ 123 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,275 INFO L290 TraceCheckUtils]: 36: Hoare triple {30737#(or (< 0 (+ 122 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30721#(or (< 0 (+ 123 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,276 INFO L290 TraceCheckUtils]: 35: Hoare triple {30737#(or (< 0 (+ 122 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 <= 2147483647; {30737#(or (< 0 (+ 122 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,276 INFO L290 TraceCheckUtils]: 34: Hoare triple {30737#(or (< 0 (+ 122 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume !(~e <= -128); {30737#(or (< 0 (+ 122 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,276 INFO L290 TraceCheckUtils]: 33: Hoare triple {30737#(or (< 0 (+ 122 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume !false; {30737#(or (< 0 (+ 122 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,277 INFO L290 TraceCheckUtils]: 32: Hoare triple {30737#(or (< 0 (+ 122 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume ~m % 4294967296 < 16777216; {30737#(or (< 0 (+ 122 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,277 INFO L290 TraceCheckUtils]: 31: Hoare triple {30753#(or (< 0 (+ base2flt_~e 121)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30737#(or (< 0 (+ 122 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,278 INFO L290 TraceCheckUtils]: 30: Hoare triple {30753#(or (< 0 (+ base2flt_~e 121)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 <= 2147483647; {30753#(or (< 0 (+ base2flt_~e 121)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,278 INFO L290 TraceCheckUtils]: 29: Hoare triple {30753#(or (< 0 (+ base2flt_~e 121)) (not (<= 0 |base2flt_#in~e|)))} assume !(~e <= -128); {30753#(or (< 0 (+ base2flt_~e 121)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,278 INFO L290 TraceCheckUtils]: 28: Hoare triple {30753#(or (< 0 (+ base2flt_~e 121)) (not (<= 0 |base2flt_#in~e|)))} assume !false; {30753#(or (< 0 (+ base2flt_~e 121)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,278 INFO L290 TraceCheckUtils]: 27: Hoare triple {30753#(or (< 0 (+ base2flt_~e 121)) (not (<= 0 |base2flt_#in~e|)))} assume ~m % 4294967296 < 16777216; {30753#(or (< 0 (+ base2flt_~e 121)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,279 INFO L290 TraceCheckUtils]: 26: Hoare triple {30769#(or (< 0 (+ base2flt_~e 120)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30753#(or (< 0 (+ base2flt_~e 121)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,279 INFO L290 TraceCheckUtils]: 25: Hoare triple {30769#(or (< 0 (+ base2flt_~e 120)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 <= 2147483647; {30769#(or (< 0 (+ base2flt_~e 120)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,280 INFO L290 TraceCheckUtils]: 24: Hoare triple {30769#(or (< 0 (+ base2flt_~e 120)) (not (<= 0 |base2flt_#in~e|)))} assume !(~e <= -128); {30769#(or (< 0 (+ base2flt_~e 120)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,280 INFO L290 TraceCheckUtils]: 23: Hoare triple {30769#(or (< 0 (+ base2flt_~e 120)) (not (<= 0 |base2flt_#in~e|)))} assume !false; {30769#(or (< 0 (+ base2flt_~e 120)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,280 INFO L290 TraceCheckUtils]: 22: Hoare triple {30769#(or (< 0 (+ base2flt_~e 120)) (not (<= 0 |base2flt_#in~e|)))} assume ~m % 4294967296 < 16777216; {30769#(or (< 0 (+ base2flt_~e 120)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,281 INFO L290 TraceCheckUtils]: 21: Hoare triple {30785#(or (not (<= 0 |base2flt_#in~e|)) (< 0 (+ 119 base2flt_~e)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30769#(or (< 0 (+ base2flt_~e 120)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,281 INFO L290 TraceCheckUtils]: 20: Hoare triple {30785#(or (not (<= 0 |base2flt_#in~e|)) (< 0 (+ 119 base2flt_~e)))} assume ~e - 1 <= 2147483647; {30785#(or (not (<= 0 |base2flt_#in~e|)) (< 0 (+ 119 base2flt_~e)))} is VALID [2022-02-21 03:10:36,282 INFO L290 TraceCheckUtils]: 19: Hoare triple {30785#(or (not (<= 0 |base2flt_#in~e|)) (< 0 (+ 119 base2flt_~e)))} assume !(~e <= -128); {30785#(or (not (<= 0 |base2flt_#in~e|)) (< 0 (+ 119 base2flt_~e)))} is VALID [2022-02-21 03:10:36,282 INFO L290 TraceCheckUtils]: 18: Hoare triple {30785#(or (not (<= 0 |base2flt_#in~e|)) (< 0 (+ 119 base2flt_~e)))} assume !false; {30785#(or (not (<= 0 |base2flt_#in~e|)) (< 0 (+ 119 base2flt_~e)))} is VALID [2022-02-21 03:10:36,282 INFO L290 TraceCheckUtils]: 17: Hoare triple {30785#(or (not (<= 0 |base2flt_#in~e|)) (< 0 (+ 119 base2flt_~e)))} assume ~m % 4294967296 < 16777216; {30785#(or (not (<= 0 |base2flt_#in~e|)) (< 0 (+ 119 base2flt_~e)))} is VALID [2022-02-21 03:10:36,283 INFO L290 TraceCheckUtils]: 16: Hoare triple {30801#(or (< 0 (+ 118 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30785#(or (not (<= 0 |base2flt_#in~e|)) (< 0 (+ 119 base2flt_~e)))} is VALID [2022-02-21 03:10:36,283 INFO L290 TraceCheckUtils]: 15: Hoare triple {30801#(or (< 0 (+ 118 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 <= 2147483647; {30801#(or (< 0 (+ 118 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,284 INFO L290 TraceCheckUtils]: 14: Hoare triple {30801#(or (< 0 (+ 118 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume !(~e <= -128); {30801#(or (< 0 (+ 118 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,284 INFO L290 TraceCheckUtils]: 13: Hoare triple {30801#(or (< 0 (+ 118 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume !false; {30801#(or (< 0 (+ 118 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {30801#(or (< 0 (+ 118 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume ~m % 4294967296 < 16777216; {30801#(or (< 0 (+ 118 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,285 INFO L290 TraceCheckUtils]: 11: Hoare triple {30801#(or (< 0 (+ 118 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume !(0 == ~m % 4294967296); {30801#(or (< 0 (+ 118 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,285 INFO L290 TraceCheckUtils]: 10: Hoare triple {30274#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {30801#(or (< 0 (+ 118 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:36,285 INFO L272 TraceCheckUtils]: 9: Hoare triple {30274#true} call main_#t~ret23#1 := base2flt(1, 0); {30274#true} is VALID [2022-02-21 03:10:36,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {30274#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {30274#true} is VALID [2022-02-21 03:10:36,285 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {30274#true} {30274#true} #394#return; {30274#true} is VALID [2022-02-21 03:10:36,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {30274#true} assume true; {30274#true} is VALID [2022-02-21 03:10:36,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {30274#true} #res := ~__retres4~0; {30274#true} is VALID [2022-02-21 03:10:36,286 INFO L290 TraceCheckUtils]: 4: Hoare triple {30274#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {30274#true} is VALID [2022-02-21 03:10:36,286 INFO L290 TraceCheckUtils]: 3: Hoare triple {30274#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {30274#true} is VALID [2022-02-21 03:10:36,286 INFO L272 TraceCheckUtils]: 2: Hoare triple {30274#true} call main_#t~ret22#1 := base2flt(0, 0); {30274#true} is VALID [2022-02-21 03:10:36,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {30274#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {30274#true} is VALID [2022-02-21 03:10:36,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {30274#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); {30274#true} is VALID [2022-02-21 03:10:36,287 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 9 proven. 245 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:10:36,287 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139736236] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:10:36,287 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:10:36,287 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 39 [2022-02-21 03:10:36,287 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083472443] [2022-02-21 03:10:36,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:10:36,288 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 4.846153846153846) internal successors, (189), 38 states have internal predecessors, (189), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 79 [2022-02-21 03:10:36,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:36,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 39 states, 39 states have (on average 4.846153846153846) internal successors, (189), 38 states have internal predecessors, (189), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:10:36,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:36,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-02-21 03:10:36,459 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:36,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-02-21 03:10:36,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=492, Invalid=990, Unknown=0, NotChecked=0, Total=1482 [2022-02-21 03:10:36,460 INFO L87 Difference]: Start difference. First operand 407 states and 531 transitions. Second operand has 39 states, 39 states have (on average 4.846153846153846) internal successors, (189), 38 states have internal predecessors, (189), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:10:44,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:44,730 INFO L93 Difference]: Finished difference Result 3609 states and 4686 transitions. [2022-02-21 03:10:44,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-02-21 03:10:44,731 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 4.846153846153846) internal successors, (189), 38 states have internal predecessors, (189), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 79 [2022-02-21 03:10:44,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:44,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 4.846153846153846) internal successors, (189), 38 states have internal predecessors, (189), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:10:44,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 1875 transitions. [2022-02-21 03:10:44,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 4.846153846153846) internal successors, (189), 38 states have internal predecessors, (189), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:10:44,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 1875 transitions. [2022-02-21 03:10:44,762 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 99 states and 1875 transitions. [2022-02-21 03:10:46,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1875 edges. 1875 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:46,549 INFO L225 Difference]: With dead ends: 3609 [2022-02-21 03:10:46,549 INFO L226 Difference]: Without dead ends: 3303 [2022-02-21 03:10:46,552 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3860 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3962, Invalid=8470, Unknown=0, NotChecked=0, Total=12432 [2022-02-21 03:10:46,552 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 3669 mSDsluCounter, 1316 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 927 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3669 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 1859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 927 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:46,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3669 Valid, 1441 Invalid, 1859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [927 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-21 03:10:46,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3303 states. [2022-02-21 03:10:46,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3303 to 464. [2022-02-21 03:10:46,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:46,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3303 states. Second operand has 464 states, 432 states have (on average 1.3634259259259258) internal successors, (589), 455 states have internal predecessors, (589), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:10:46,882 INFO L74 IsIncluded]: Start isIncluded. First operand 3303 states. Second operand has 464 states, 432 states have (on average 1.3634259259259258) internal successors, (589), 455 states have internal predecessors, (589), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:10:46,883 INFO L87 Difference]: Start difference. First operand 3303 states. Second operand has 464 states, 432 states have (on average 1.3634259259259258) internal successors, (589), 455 states have internal predecessors, (589), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:10:47,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:47,187 INFO L93 Difference]: Finished difference Result 3303 states and 4209 transitions. [2022-02-21 03:10:47,187 INFO L276 IsEmpty]: Start isEmpty. Operand 3303 states and 4209 transitions. [2022-02-21 03:10:47,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:47,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:47,191 INFO L74 IsIncluded]: Start isIncluded. First operand has 464 states, 432 states have (on average 1.3634259259259258) internal successors, (589), 455 states have internal predecessors, (589), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 3303 states. [2022-02-21 03:10:47,192 INFO L87 Difference]: Start difference. First operand has 464 states, 432 states have (on average 1.3634259259259258) internal successors, (589), 455 states have internal predecessors, (589), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 3303 states. [2022-02-21 03:10:47,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:47,485 INFO L93 Difference]: Finished difference Result 3303 states and 4209 transitions. [2022-02-21 03:10:47,485 INFO L276 IsEmpty]: Start isEmpty. Operand 3303 states and 4209 transitions. [2022-02-21 03:10:47,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:47,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:47,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:47,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:47,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 432 states have (on average 1.3634259259259258) internal successors, (589), 455 states have internal predecessors, (589), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:10:47,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 597 transitions. [2022-02-21 03:10:47,496 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 597 transitions. Word has length 79 [2022-02-21 03:10:47,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:47,496 INFO L470 AbstractCegarLoop]: Abstraction has 464 states and 597 transitions. [2022-02-21 03:10:47,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 4.846153846153846) internal successors, (189), 38 states have internal predecessors, (189), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:10:47,496 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 597 transitions. [2022-02-21 03:10:47,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-02-21 03:10:47,497 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:47,497 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:47,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:10:47,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-02-21 03:10:47,698 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-02-21 03:10:47,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:47,698 INFO L85 PathProgramCache]: Analyzing trace with hash -314996846, now seen corresponding path program 3 times [2022-02-21 03:10:47,698 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:47,698 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892565105] [2022-02-21 03:10:47,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:47,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:47,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:47,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:47,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:47,771 INFO L290 TraceCheckUtils]: 0: Hoare triple {42226#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {42129#true} is VALID [2022-02-21 03:10:47,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {42129#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {42129#true} is VALID [2022-02-21 03:10:47,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {42129#true} #res := ~__retres4~0; {42129#true} is VALID [2022-02-21 03:10:47,771 INFO L290 TraceCheckUtils]: 3: Hoare triple {42129#true} assume true; {42129#true} is VALID [2022-02-21 03:10:47,771 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {42129#true} {42129#true} #394#return; {42129#true} is VALID [2022-02-21 03:10:47,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:47,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:48,099 INFO L290 TraceCheckUtils]: 0: Hoare triple {42226#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {42227#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:48,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {42227#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !(0 == ~m % 4294967296); {42227#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:48,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {42227#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~m % 4294967296 < 16777216; {42227#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:48,100 INFO L290 TraceCheckUtils]: 3: Hoare triple {42227#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !false; {42227#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:48,102 INFO L290 TraceCheckUtils]: 4: Hoare triple {42227#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !(~e <= -128); {42227#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:48,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {42227#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~e - 1 <= 2147483647; {42227#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:48,103 INFO L290 TraceCheckUtils]: 6: Hoare triple {42227#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {42228#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {42228#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {42228#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,104 INFO L290 TraceCheckUtils]: 8: Hoare triple {42228#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {42228#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,105 INFO L290 TraceCheckUtils]: 9: Hoare triple {42228#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {42228#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,105 INFO L290 TraceCheckUtils]: 10: Hoare triple {42228#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {42228#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,106 INFO L290 TraceCheckUtils]: 11: Hoare triple {42228#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {42229#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,106 INFO L290 TraceCheckUtils]: 12: Hoare triple {42229#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {42229#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,107 INFO L290 TraceCheckUtils]: 13: Hoare triple {42229#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume !false; {42229#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,107 INFO L290 TraceCheckUtils]: 14: Hoare triple {42229#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {42229#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,108 INFO L290 TraceCheckUtils]: 15: Hoare triple {42229#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {42229#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,108 INFO L290 TraceCheckUtils]: 16: Hoare triple {42229#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {42230#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,109 INFO L290 TraceCheckUtils]: 17: Hoare triple {42230#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {42230#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,109 INFO L290 TraceCheckUtils]: 18: Hoare triple {42230#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume !false; {42230#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,109 INFO L290 TraceCheckUtils]: 19: Hoare triple {42230#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {42230#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,109 INFO L290 TraceCheckUtils]: 20: Hoare triple {42230#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {42230#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,110 INFO L290 TraceCheckUtils]: 21: Hoare triple {42230#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {42231#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,111 INFO L290 TraceCheckUtils]: 22: Hoare triple {42231#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {42231#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,111 INFO L290 TraceCheckUtils]: 23: Hoare triple {42231#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {42231#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,111 INFO L290 TraceCheckUtils]: 24: Hoare triple {42231#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {42231#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,112 INFO L290 TraceCheckUtils]: 25: Hoare triple {42231#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {42231#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,112 INFO L290 TraceCheckUtils]: 26: Hoare triple {42231#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {42232#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,113 INFO L290 TraceCheckUtils]: 27: Hoare triple {42232#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {42232#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,113 INFO L290 TraceCheckUtils]: 28: Hoare triple {42232#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {42232#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,114 INFO L290 TraceCheckUtils]: 29: Hoare triple {42232#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {42232#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,114 INFO L290 TraceCheckUtils]: 30: Hoare triple {42232#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {42232#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,115 INFO L290 TraceCheckUtils]: 31: Hoare triple {42232#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {42233#(or (and (<= 64 base2flt_~m) (<= base2flt_~m 64)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,115 INFO L290 TraceCheckUtils]: 32: Hoare triple {42233#(or (and (<= 64 base2flt_~m) (<= base2flt_~m 64)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {42233#(or (and (<= 64 base2flt_~m) (<= base2flt_~m 64)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,116 INFO L290 TraceCheckUtils]: 33: Hoare triple {42233#(or (and (<= 64 base2flt_~m) (<= base2flt_~m 64)) (not (= |base2flt_#in~m| 1)))} assume !false; {42233#(or (and (<= 64 base2flt_~m) (<= base2flt_~m 64)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,116 INFO L290 TraceCheckUtils]: 34: Hoare triple {42233#(or (and (<= 64 base2flt_~m) (<= base2flt_~m 64)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {42233#(or (and (<= 64 base2flt_~m) (<= base2flt_~m 64)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,116 INFO L290 TraceCheckUtils]: 35: Hoare triple {42233#(or (and (<= 64 base2flt_~m) (<= base2flt_~m 64)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {42233#(or (and (<= 64 base2flt_~m) (<= base2flt_~m 64)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,117 INFO L290 TraceCheckUtils]: 36: Hoare triple {42233#(or (and (<= 64 base2flt_~m) (<= base2flt_~m 64)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {42234#(or (and (<= 128 base2flt_~m) (<= base2flt_~m 128)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,117 INFO L290 TraceCheckUtils]: 37: Hoare triple {42234#(or (and (<= 128 base2flt_~m) (<= base2flt_~m 128)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {42234#(or (and (<= 128 base2flt_~m) (<= base2flt_~m 128)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,118 INFO L290 TraceCheckUtils]: 38: Hoare triple {42234#(or (and (<= 128 base2flt_~m) (<= base2flt_~m 128)) (not (= |base2flt_#in~m| 1)))} assume !false; {42234#(or (and (<= 128 base2flt_~m) (<= base2flt_~m 128)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,118 INFO L290 TraceCheckUtils]: 39: Hoare triple {42234#(or (and (<= 128 base2flt_~m) (<= base2flt_~m 128)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {42234#(or (and (<= 128 base2flt_~m) (<= base2flt_~m 128)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,119 INFO L290 TraceCheckUtils]: 40: Hoare triple {42234#(or (and (<= 128 base2flt_~m) (<= base2flt_~m 128)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {42234#(or (and (<= 128 base2flt_~m) (<= base2flt_~m 128)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,119 INFO L290 TraceCheckUtils]: 41: Hoare triple {42234#(or (and (<= 128 base2flt_~m) (<= base2flt_~m 128)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {42235#(or (and (<= base2flt_~m 256) (<= 256 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,120 INFO L290 TraceCheckUtils]: 42: Hoare triple {42235#(or (and (<= base2flt_~m 256) (<= 256 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {42235#(or (and (<= base2flt_~m 256) (<= 256 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,120 INFO L290 TraceCheckUtils]: 43: Hoare triple {42235#(or (and (<= base2flt_~m 256) (<= 256 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {42235#(or (and (<= base2flt_~m 256) (<= 256 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,120 INFO L290 TraceCheckUtils]: 44: Hoare triple {42235#(or (and (<= base2flt_~m 256) (<= 256 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {42235#(or (and (<= base2flt_~m 256) (<= 256 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,120 INFO L290 TraceCheckUtils]: 45: Hoare triple {42235#(or (and (<= base2flt_~m 256) (<= 256 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {42235#(or (and (<= base2flt_~m 256) (<= 256 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,121 INFO L290 TraceCheckUtils]: 46: Hoare triple {42235#(or (and (<= base2flt_~m 256) (<= 256 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {42236#(or (and (<= base2flt_~m 512) (<= 512 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,122 INFO L290 TraceCheckUtils]: 47: Hoare triple {42236#(or (and (<= base2flt_~m 512) (<= 512 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {42236#(or (and (<= base2flt_~m 512) (<= 512 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,122 INFO L290 TraceCheckUtils]: 48: Hoare triple {42236#(or (and (<= base2flt_~m 512) (<= 512 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {42236#(or (and (<= base2flt_~m 512) (<= 512 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,123 INFO L290 TraceCheckUtils]: 49: Hoare triple {42236#(or (and (<= base2flt_~m 512) (<= 512 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {42236#(or (and (<= base2flt_~m 512) (<= 512 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,123 INFO L290 TraceCheckUtils]: 50: Hoare triple {42236#(or (and (<= base2flt_~m 512) (<= 512 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {42236#(or (and (<= base2flt_~m 512) (<= 512 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,124 INFO L290 TraceCheckUtils]: 51: Hoare triple {42236#(or (and (<= base2flt_~m 512) (<= 512 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {42237#(or (and (<= base2flt_~m 1024) (<= 1024 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,124 INFO L290 TraceCheckUtils]: 52: Hoare triple {42237#(or (and (<= base2flt_~m 1024) (<= 1024 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {42237#(or (and (<= base2flt_~m 1024) (<= 1024 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,125 INFO L290 TraceCheckUtils]: 53: Hoare triple {42237#(or (and (<= base2flt_~m 1024) (<= 1024 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {42237#(or (and (<= base2flt_~m 1024) (<= 1024 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,125 INFO L290 TraceCheckUtils]: 54: Hoare triple {42237#(or (and (<= base2flt_~m 1024) (<= 1024 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {42237#(or (and (<= base2flt_~m 1024) (<= 1024 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,125 INFO L290 TraceCheckUtils]: 55: Hoare triple {42237#(or (and (<= base2flt_~m 1024) (<= 1024 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {42237#(or (and (<= base2flt_~m 1024) (<= 1024 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,126 INFO L290 TraceCheckUtils]: 56: Hoare triple {42237#(or (and (<= base2flt_~m 1024) (<= 1024 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {42238#(or (and (<= base2flt_~m 2048) (<= 2048 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,127 INFO L290 TraceCheckUtils]: 57: Hoare triple {42238#(or (and (<= base2flt_~m 2048) (<= 2048 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {42238#(or (and (<= base2flt_~m 2048) (<= 2048 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,127 INFO L290 TraceCheckUtils]: 58: Hoare triple {42238#(or (and (<= base2flt_~m 2048) (<= 2048 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {42238#(or (and (<= base2flt_~m 2048) (<= 2048 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,127 INFO L290 TraceCheckUtils]: 59: Hoare triple {42238#(or (and (<= base2flt_~m 2048) (<= 2048 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {42238#(or (and (<= base2flt_~m 2048) (<= 2048 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,128 INFO L290 TraceCheckUtils]: 60: Hoare triple {42238#(or (and (<= base2flt_~m 2048) (<= 2048 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {42238#(or (and (<= base2flt_~m 2048) (<= 2048 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,129 INFO L290 TraceCheckUtils]: 61: Hoare triple {42238#(or (and (<= base2flt_~m 2048) (<= 2048 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {42239#(or (and (<= base2flt_~m 4096) (<= 4096 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,129 INFO L290 TraceCheckUtils]: 62: Hoare triple {42239#(or (and (<= base2flt_~m 4096) (<= 4096 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {42239#(or (and (<= base2flt_~m 4096) (<= 4096 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,129 INFO L290 TraceCheckUtils]: 63: Hoare triple {42239#(or (and (<= base2flt_~m 4096) (<= 4096 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {42239#(or (and (<= base2flt_~m 4096) (<= 4096 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,129 INFO L290 TraceCheckUtils]: 64: Hoare triple {42239#(or (and (<= base2flt_~m 4096) (<= 4096 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {42239#(or (and (<= base2flt_~m 4096) (<= 4096 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,130 INFO L290 TraceCheckUtils]: 65: Hoare triple {42239#(or (and (<= base2flt_~m 4096) (<= 4096 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {42239#(or (and (<= base2flt_~m 4096) (<= 4096 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,130 INFO L290 TraceCheckUtils]: 66: Hoare triple {42239#(or (and (<= base2flt_~m 4096) (<= 4096 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {42240#(or (and (<= base2flt_~m 8192) (<= 8192 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,130 INFO L290 TraceCheckUtils]: 67: Hoare triple {42240#(or (and (<= base2flt_~m 8192) (<= 8192 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {42240#(or (and (<= base2flt_~m 8192) (<= 8192 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,131 INFO L290 TraceCheckUtils]: 68: Hoare triple {42240#(or (and (<= base2flt_~m 8192) (<= 8192 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {42240#(or (and (<= base2flt_~m 8192) (<= 8192 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,131 INFO L290 TraceCheckUtils]: 69: Hoare triple {42240#(or (and (<= base2flt_~m 8192) (<= 8192 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {42240#(or (and (<= base2flt_~m 8192) (<= 8192 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,131 INFO L290 TraceCheckUtils]: 70: Hoare triple {42240#(or (and (<= base2flt_~m 8192) (<= 8192 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {42240#(or (and (<= base2flt_~m 8192) (<= 8192 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,132 INFO L290 TraceCheckUtils]: 71: Hoare triple {42240#(or (and (<= base2flt_~m 8192) (<= 8192 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {42241#(or (and (not (<= (+ (div base2flt_~m 4294967296) 1) 0)) (<= base2flt_~m 16384)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,134 INFO L290 TraceCheckUtils]: 72: Hoare triple {42241#(or (and (not (<= (+ (div base2flt_~m 4294967296) 1) 0)) (<= base2flt_~m 16384)) (not (= |base2flt_#in~m| 1)))} assume !(~m % 4294967296 < 16777216); {42242#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:48,134 INFO L290 TraceCheckUtils]: 73: Hoare triple {42242#(not (= |base2flt_#in~m| 1))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {42242#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:48,134 INFO L290 TraceCheckUtils]: 74: Hoare triple {42242#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {42242#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:48,134 INFO L290 TraceCheckUtils]: 75: Hoare triple {42242#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {42242#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:48,135 INFO L290 TraceCheckUtils]: 76: Hoare triple {42242#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) <= 2147483647; {42242#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:48,135 INFO L290 TraceCheckUtils]: 77: Hoare triple {42242#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) >= -2147483648; {42242#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:48,135 INFO L290 TraceCheckUtils]: 78: Hoare triple {42242#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {42242#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:48,135 INFO L290 TraceCheckUtils]: 79: Hoare triple {42242#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {42242#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:48,136 INFO L290 TraceCheckUtils]: 80: Hoare triple {42242#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) <= 2147483647; {42242#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:48,136 INFO L290 TraceCheckUtils]: 81: Hoare triple {42242#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) >= -2147483648; {42242#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:48,136 INFO L290 TraceCheckUtils]: 82: Hoare triple {42242#(not (= |base2flt_#in~m| 1))} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {42242#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:48,136 INFO L290 TraceCheckUtils]: 83: Hoare triple {42242#(not (= |base2flt_#in~m| 1))} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {42242#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:48,137 INFO L290 TraceCheckUtils]: 84: Hoare triple {42242#(not (= |base2flt_#in~m| 1))} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {42242#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:48,137 INFO L290 TraceCheckUtils]: 85: Hoare triple {42242#(not (= |base2flt_#in~m| 1))} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_77 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_77; {42242#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:48,137 INFO L290 TraceCheckUtils]: 86: Hoare triple {42242#(not (= |base2flt_#in~m| 1))} ~__retres4~0 := ~res~0; {42242#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:48,137 INFO L290 TraceCheckUtils]: 87: Hoare triple {42242#(not (= |base2flt_#in~m| 1))} #res := ~__retres4~0; {42242#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:48,138 INFO L290 TraceCheckUtils]: 88: Hoare triple {42242#(not (= |base2flt_#in~m| 1))} assume true; {42242#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:48,138 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {42242#(not (= |base2flt_#in~m| 1))} {42129#true} #396#return; {42130#false} is VALID [2022-02-21 03:10:48,138 INFO L290 TraceCheckUtils]: 0: Hoare triple {42129#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); {42129#true} is VALID [2022-02-21 03:10:48,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {42129#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {42129#true} is VALID [2022-02-21 03:10:48,139 INFO L272 TraceCheckUtils]: 2: Hoare triple {42129#true} call main_#t~ret22#1 := base2flt(0, 0); {42226#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:48,139 INFO L290 TraceCheckUtils]: 3: Hoare triple {42226#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {42129#true} is VALID [2022-02-21 03:10:48,139 INFO L290 TraceCheckUtils]: 4: Hoare triple {42129#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {42129#true} is VALID [2022-02-21 03:10:48,139 INFO L290 TraceCheckUtils]: 5: Hoare triple {42129#true} #res := ~__retres4~0; {42129#true} is VALID [2022-02-21 03:10:48,139 INFO L290 TraceCheckUtils]: 6: Hoare triple {42129#true} assume true; {42129#true} is VALID [2022-02-21 03:10:48,139 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {42129#true} {42129#true} #394#return; {42129#true} is VALID [2022-02-21 03:10:48,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {42129#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {42129#true} is VALID [2022-02-21 03:10:48,140 INFO L272 TraceCheckUtils]: 9: Hoare triple {42129#true} call main_#t~ret23#1 := base2flt(1, 0); {42226#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:48,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {42226#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {42227#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:48,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {42227#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !(0 == ~m % 4294967296); {42227#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:48,140 INFO L290 TraceCheckUtils]: 12: Hoare triple {42227#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~m % 4294967296 < 16777216; {42227#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:48,141 INFO L290 TraceCheckUtils]: 13: Hoare triple {42227#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !false; {42227#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:48,141 INFO L290 TraceCheckUtils]: 14: Hoare triple {42227#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !(~e <= -128); {42227#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:48,141 INFO L290 TraceCheckUtils]: 15: Hoare triple {42227#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~e - 1 <= 2147483647; {42227#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:48,142 INFO L290 TraceCheckUtils]: 16: Hoare triple {42227#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {42228#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,142 INFO L290 TraceCheckUtils]: 17: Hoare triple {42228#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {42228#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,143 INFO L290 TraceCheckUtils]: 18: Hoare triple {42228#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {42228#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,143 INFO L290 TraceCheckUtils]: 19: Hoare triple {42228#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {42228#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {42228#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {42228#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,144 INFO L290 TraceCheckUtils]: 21: Hoare triple {42228#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {42229#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,145 INFO L290 TraceCheckUtils]: 22: Hoare triple {42229#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {42229#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,145 INFO L290 TraceCheckUtils]: 23: Hoare triple {42229#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume !false; {42229#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,145 INFO L290 TraceCheckUtils]: 24: Hoare triple {42229#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {42229#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,146 INFO L290 TraceCheckUtils]: 25: Hoare triple {42229#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {42229#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,146 INFO L290 TraceCheckUtils]: 26: Hoare triple {42229#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {42230#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,146 INFO L290 TraceCheckUtils]: 27: Hoare triple {42230#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {42230#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,147 INFO L290 TraceCheckUtils]: 28: Hoare triple {42230#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume !false; {42230#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,147 INFO L290 TraceCheckUtils]: 29: Hoare triple {42230#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {42230#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,147 INFO L290 TraceCheckUtils]: 30: Hoare triple {42230#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {42230#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,148 INFO L290 TraceCheckUtils]: 31: Hoare triple {42230#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {42231#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,148 INFO L290 TraceCheckUtils]: 32: Hoare triple {42231#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {42231#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,149 INFO L290 TraceCheckUtils]: 33: Hoare triple {42231#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {42231#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,149 INFO L290 TraceCheckUtils]: 34: Hoare triple {42231#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {42231#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,149 INFO L290 TraceCheckUtils]: 35: Hoare triple {42231#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {42231#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,150 INFO L290 TraceCheckUtils]: 36: Hoare triple {42231#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {42232#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,150 INFO L290 TraceCheckUtils]: 37: Hoare triple {42232#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {42232#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,151 INFO L290 TraceCheckUtils]: 38: Hoare triple {42232#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {42232#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,151 INFO L290 TraceCheckUtils]: 39: Hoare triple {42232#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {42232#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,151 INFO L290 TraceCheckUtils]: 40: Hoare triple {42232#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {42232#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,152 INFO L290 TraceCheckUtils]: 41: Hoare triple {42232#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {42233#(or (and (<= 64 base2flt_~m) (<= base2flt_~m 64)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,152 INFO L290 TraceCheckUtils]: 42: Hoare triple {42233#(or (and (<= 64 base2flt_~m) (<= base2flt_~m 64)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {42233#(or (and (<= 64 base2flt_~m) (<= base2flt_~m 64)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,152 INFO L290 TraceCheckUtils]: 43: Hoare triple {42233#(or (and (<= 64 base2flt_~m) (<= base2flt_~m 64)) (not (= |base2flt_#in~m| 1)))} assume !false; {42233#(or (and (<= 64 base2flt_~m) (<= base2flt_~m 64)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,153 INFO L290 TraceCheckUtils]: 44: Hoare triple {42233#(or (and (<= 64 base2flt_~m) (<= base2flt_~m 64)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {42233#(or (and (<= 64 base2flt_~m) (<= base2flt_~m 64)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,153 INFO L290 TraceCheckUtils]: 45: Hoare triple {42233#(or (and (<= 64 base2flt_~m) (<= base2flt_~m 64)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {42233#(or (and (<= 64 base2flt_~m) (<= base2flt_~m 64)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,154 INFO L290 TraceCheckUtils]: 46: Hoare triple {42233#(or (and (<= 64 base2flt_~m) (<= base2flt_~m 64)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {42234#(or (and (<= 128 base2flt_~m) (<= base2flt_~m 128)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,154 INFO L290 TraceCheckUtils]: 47: Hoare triple {42234#(or (and (<= 128 base2flt_~m) (<= base2flt_~m 128)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {42234#(or (and (<= 128 base2flt_~m) (<= base2flt_~m 128)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,154 INFO L290 TraceCheckUtils]: 48: Hoare triple {42234#(or (and (<= 128 base2flt_~m) (<= base2flt_~m 128)) (not (= |base2flt_#in~m| 1)))} assume !false; {42234#(or (and (<= 128 base2flt_~m) (<= base2flt_~m 128)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,155 INFO L290 TraceCheckUtils]: 49: Hoare triple {42234#(or (and (<= 128 base2flt_~m) (<= base2flt_~m 128)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {42234#(or (and (<= 128 base2flt_~m) (<= base2flt_~m 128)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,155 INFO L290 TraceCheckUtils]: 50: Hoare triple {42234#(or (and (<= 128 base2flt_~m) (<= base2flt_~m 128)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {42234#(or (and (<= 128 base2flt_~m) (<= base2flt_~m 128)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,156 INFO L290 TraceCheckUtils]: 51: Hoare triple {42234#(or (and (<= 128 base2flt_~m) (<= base2flt_~m 128)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {42235#(or (and (<= base2flt_~m 256) (<= 256 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,156 INFO L290 TraceCheckUtils]: 52: Hoare triple {42235#(or (and (<= base2flt_~m 256) (<= 256 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {42235#(or (and (<= base2flt_~m 256) (<= 256 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,156 INFO L290 TraceCheckUtils]: 53: Hoare triple {42235#(or (and (<= base2flt_~m 256) (<= 256 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {42235#(or (and (<= base2flt_~m 256) (<= 256 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,157 INFO L290 TraceCheckUtils]: 54: Hoare triple {42235#(or (and (<= base2flt_~m 256) (<= 256 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {42235#(or (and (<= base2flt_~m 256) (<= 256 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,157 INFO L290 TraceCheckUtils]: 55: Hoare triple {42235#(or (and (<= base2flt_~m 256) (<= 256 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {42235#(or (and (<= base2flt_~m 256) (<= 256 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,157 INFO L290 TraceCheckUtils]: 56: Hoare triple {42235#(or (and (<= base2flt_~m 256) (<= 256 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {42236#(or (and (<= base2flt_~m 512) (<= 512 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,158 INFO L290 TraceCheckUtils]: 57: Hoare triple {42236#(or (and (<= base2flt_~m 512) (<= 512 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {42236#(or (and (<= base2flt_~m 512) (<= 512 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,158 INFO L290 TraceCheckUtils]: 58: Hoare triple {42236#(or (and (<= base2flt_~m 512) (<= 512 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {42236#(or (and (<= base2flt_~m 512) (<= 512 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,159 INFO L290 TraceCheckUtils]: 59: Hoare triple {42236#(or (and (<= base2flt_~m 512) (<= 512 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {42236#(or (and (<= base2flt_~m 512) (<= 512 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,159 INFO L290 TraceCheckUtils]: 60: Hoare triple {42236#(or (and (<= base2flt_~m 512) (<= 512 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {42236#(or (and (<= base2flt_~m 512) (<= 512 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,160 INFO L290 TraceCheckUtils]: 61: Hoare triple {42236#(or (and (<= base2flt_~m 512) (<= 512 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {42237#(or (and (<= base2flt_~m 1024) (<= 1024 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,160 INFO L290 TraceCheckUtils]: 62: Hoare triple {42237#(or (and (<= base2flt_~m 1024) (<= 1024 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {42237#(or (and (<= base2flt_~m 1024) (<= 1024 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,160 INFO L290 TraceCheckUtils]: 63: Hoare triple {42237#(or (and (<= base2flt_~m 1024) (<= 1024 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {42237#(or (and (<= base2flt_~m 1024) (<= 1024 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,161 INFO L290 TraceCheckUtils]: 64: Hoare triple {42237#(or (and (<= base2flt_~m 1024) (<= 1024 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {42237#(or (and (<= base2flt_~m 1024) (<= 1024 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,161 INFO L290 TraceCheckUtils]: 65: Hoare triple {42237#(or (and (<= base2flt_~m 1024) (<= 1024 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {42237#(or (and (<= base2flt_~m 1024) (<= 1024 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,162 INFO L290 TraceCheckUtils]: 66: Hoare triple {42237#(or (and (<= base2flt_~m 1024) (<= 1024 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {42238#(or (and (<= base2flt_~m 2048) (<= 2048 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,162 INFO L290 TraceCheckUtils]: 67: Hoare triple {42238#(or (and (<= base2flt_~m 2048) (<= 2048 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {42238#(or (and (<= base2flt_~m 2048) (<= 2048 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,163 INFO L290 TraceCheckUtils]: 68: Hoare triple {42238#(or (and (<= base2flt_~m 2048) (<= 2048 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {42238#(or (and (<= base2flt_~m 2048) (<= 2048 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,163 INFO L290 TraceCheckUtils]: 69: Hoare triple {42238#(or (and (<= base2flt_~m 2048) (<= 2048 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {42238#(or (and (<= base2flt_~m 2048) (<= 2048 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,163 INFO L290 TraceCheckUtils]: 70: Hoare triple {42238#(or (and (<= base2flt_~m 2048) (<= 2048 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {42238#(or (and (<= base2flt_~m 2048) (<= 2048 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,164 INFO L290 TraceCheckUtils]: 71: Hoare triple {42238#(or (and (<= base2flt_~m 2048) (<= 2048 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {42239#(or (and (<= base2flt_~m 4096) (<= 4096 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,164 INFO L290 TraceCheckUtils]: 72: Hoare triple {42239#(or (and (<= base2flt_~m 4096) (<= 4096 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {42239#(or (and (<= base2flt_~m 4096) (<= 4096 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,164 INFO L290 TraceCheckUtils]: 73: Hoare triple {42239#(or (and (<= base2flt_~m 4096) (<= 4096 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {42239#(or (and (<= base2flt_~m 4096) (<= 4096 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,165 INFO L290 TraceCheckUtils]: 74: Hoare triple {42239#(or (and (<= base2flt_~m 4096) (<= 4096 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {42239#(or (and (<= base2flt_~m 4096) (<= 4096 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,165 INFO L290 TraceCheckUtils]: 75: Hoare triple {42239#(or (and (<= base2flt_~m 4096) (<= 4096 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {42239#(or (and (<= base2flt_~m 4096) (<= 4096 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,165 INFO L290 TraceCheckUtils]: 76: Hoare triple {42239#(or (and (<= base2flt_~m 4096) (<= 4096 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {42240#(or (and (<= base2flt_~m 8192) (<= 8192 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,166 INFO L290 TraceCheckUtils]: 77: Hoare triple {42240#(or (and (<= base2flt_~m 8192) (<= 8192 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {42240#(or (and (<= base2flt_~m 8192) (<= 8192 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,166 INFO L290 TraceCheckUtils]: 78: Hoare triple {42240#(or (and (<= base2flt_~m 8192) (<= 8192 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {42240#(or (and (<= base2flt_~m 8192) (<= 8192 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,166 INFO L290 TraceCheckUtils]: 79: Hoare triple {42240#(or (and (<= base2flt_~m 8192) (<= 8192 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {42240#(or (and (<= base2flt_~m 8192) (<= 8192 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,166 INFO L290 TraceCheckUtils]: 80: Hoare triple {42240#(or (and (<= base2flt_~m 8192) (<= 8192 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {42240#(or (and (<= base2flt_~m 8192) (<= 8192 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,167 INFO L290 TraceCheckUtils]: 81: Hoare triple {42240#(or (and (<= base2flt_~m 8192) (<= 8192 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {42241#(or (and (not (<= (+ (div base2flt_~m 4294967296) 1) 0)) (<= base2flt_~m 16384)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:48,168 INFO L290 TraceCheckUtils]: 82: Hoare triple {42241#(or (and (not (<= (+ (div base2flt_~m 4294967296) 1) 0)) (<= base2flt_~m 16384)) (not (= |base2flt_#in~m| 1)))} assume !(~m % 4294967296 < 16777216); {42242#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:48,168 INFO L290 TraceCheckUtils]: 83: Hoare triple {42242#(not (= |base2flt_#in~m| 1))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {42242#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:48,168 INFO L290 TraceCheckUtils]: 84: Hoare triple {42242#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {42242#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:48,168 INFO L290 TraceCheckUtils]: 85: Hoare triple {42242#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {42242#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:48,169 INFO L290 TraceCheckUtils]: 86: Hoare triple {42242#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) <= 2147483647; {42242#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:48,169 INFO L290 TraceCheckUtils]: 87: Hoare triple {42242#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) >= -2147483648; {42242#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:48,169 INFO L290 TraceCheckUtils]: 88: Hoare triple {42242#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {42242#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:48,169 INFO L290 TraceCheckUtils]: 89: Hoare triple {42242#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {42242#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:48,169 INFO L290 TraceCheckUtils]: 90: Hoare triple {42242#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) <= 2147483647; {42242#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:48,170 INFO L290 TraceCheckUtils]: 91: Hoare triple {42242#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) >= -2147483648; {42242#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:48,170 INFO L290 TraceCheckUtils]: 92: Hoare triple {42242#(not (= |base2flt_#in~m| 1))} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {42242#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:48,170 INFO L290 TraceCheckUtils]: 93: Hoare triple {42242#(not (= |base2flt_#in~m| 1))} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {42242#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:48,170 INFO L290 TraceCheckUtils]: 94: Hoare triple {42242#(not (= |base2flt_#in~m| 1))} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {42242#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:48,171 INFO L290 TraceCheckUtils]: 95: Hoare triple {42242#(not (= |base2flt_#in~m| 1))} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_77 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_77; {42242#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:48,171 INFO L290 TraceCheckUtils]: 96: Hoare triple {42242#(not (= |base2flt_#in~m| 1))} ~__retres4~0 := ~res~0; {42242#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:48,171 INFO L290 TraceCheckUtils]: 97: Hoare triple {42242#(not (= |base2flt_#in~m| 1))} #res := ~__retres4~0; {42242#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:48,171 INFO L290 TraceCheckUtils]: 98: Hoare triple {42242#(not (= |base2flt_#in~m| 1))} assume true; {42242#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:48,172 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {42242#(not (= |base2flt_#in~m| 1))} {42129#true} #396#return; {42130#false} is VALID [2022-02-21 03:10:48,172 INFO L290 TraceCheckUtils]: 100: Hoare triple {42130#false} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {42130#false} is VALID [2022-02-21 03:10:48,172 INFO L272 TraceCheckUtils]: 101: Hoare triple {42130#false} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {42130#false} is VALID [2022-02-21 03:10:48,172 INFO L290 TraceCheckUtils]: 102: Hoare triple {42130#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {42130#false} is VALID [2022-02-21 03:10:48,172 INFO L290 TraceCheckUtils]: 103: Hoare triple {42130#false} assume !(0 == ~m % 4294967296); {42130#false} is VALID [2022-02-21 03:10:48,172 INFO L290 TraceCheckUtils]: 104: Hoare triple {42130#false} assume !(~m % 4294967296 < 16777216); {42130#false} is VALID [2022-02-21 03:10:48,172 INFO L290 TraceCheckUtils]: 105: Hoare triple {42130#false} assume !false; {42130#false} is VALID [2022-02-21 03:10:48,172 INFO L290 TraceCheckUtils]: 106: Hoare triple {42130#false} assume !(~m % 4294967296 >= 33554432); {42130#false} is VALID [2022-02-21 03:10:48,172 INFO L290 TraceCheckUtils]: 107: Hoare triple {42130#false} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {42130#false} is VALID [2022-02-21 03:10:48,172 INFO L290 TraceCheckUtils]: 108: Hoare triple {42130#false} assume 128 + ~e <= 2147483647; {42130#false} is VALID [2022-02-21 03:10:48,172 INFO L290 TraceCheckUtils]: 109: Hoare triple {42130#false} assume 128 + ~e >= -2147483648; {42130#false} is VALID [2022-02-21 03:10:48,172 INFO L290 TraceCheckUtils]: 110: Hoare triple {42130#false} assume !(16777216 * (128 + ~e) <= 2147483647); {42130#false} is VALID [2022-02-21 03:10:48,173 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 13 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:10:48,173 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:48,173 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892565105] [2022-02-21 03:10:48,173 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892565105] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:48,173 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620577920] [2022-02-21 03:10:48,175 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:10:48,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:48,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:48,176 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:10:48,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-21 03:10:49,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2022-02-21 03:10:49,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:10:49,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 33 conjunts are in the unsatisfiable core [2022-02-21 03:10:49,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:49,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:50,170 INFO L290 TraceCheckUtils]: 0: Hoare triple {42129#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); {42129#true} is VALID [2022-02-21 03:10:50,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {42129#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {42129#true} is VALID [2022-02-21 03:10:50,170 INFO L272 TraceCheckUtils]: 2: Hoare triple {42129#true} call main_#t~ret22#1 := base2flt(0, 0); {42129#true} is VALID [2022-02-21 03:10:50,170 INFO L290 TraceCheckUtils]: 3: Hoare triple {42129#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {42129#true} is VALID [2022-02-21 03:10:50,170 INFO L290 TraceCheckUtils]: 4: Hoare triple {42129#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {42129#true} is VALID [2022-02-21 03:10:50,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {42129#true} #res := ~__retres4~0; {42129#true} is VALID [2022-02-21 03:10:50,170 INFO L290 TraceCheckUtils]: 6: Hoare triple {42129#true} assume true; {42129#true} is VALID [2022-02-21 03:10:50,170 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {42129#true} {42129#true} #394#return; {42129#true} is VALID [2022-02-21 03:10:50,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {42129#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {42129#true} is VALID [2022-02-21 03:10:50,170 INFO L272 TraceCheckUtils]: 9: Hoare triple {42129#true} call main_#t~ret23#1 := base2flt(1, 0); {42129#true} is VALID [2022-02-21 03:10:50,171 INFO L290 TraceCheckUtils]: 10: Hoare triple {42129#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {42276#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:50,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {42276#(= base2flt_~m |base2flt_#in~m|)} assume !(0 == ~m % 4294967296); {42276#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:50,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {42276#(= base2flt_~m |base2flt_#in~m|)} assume ~m % 4294967296 < 16777216; {42276#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:50,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {42276#(= base2flt_~m |base2flt_#in~m|)} assume !false; {42276#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:50,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {42276#(= base2flt_~m |base2flt_#in~m|)} assume !(~e <= -128); {42276#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:50,172 INFO L290 TraceCheckUtils]: 15: Hoare triple {42276#(= base2flt_~m |base2flt_#in~m|)} assume ~e - 1 <= 2147483647; {42276#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:50,172 INFO L290 TraceCheckUtils]: 16: Hoare triple {42276#(= base2flt_~m |base2flt_#in~m|)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {42295#(= (* 2 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:50,173 INFO L290 TraceCheckUtils]: 17: Hoare triple {42295#(= (* 2 |base2flt_#in~m|) base2flt_~m)} assume ~m % 4294967296 < 16777216; {42295#(= (* 2 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:50,173 INFO L290 TraceCheckUtils]: 18: Hoare triple {42295#(= (* 2 |base2flt_#in~m|) base2flt_~m)} assume !false; {42295#(= (* 2 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:50,173 INFO L290 TraceCheckUtils]: 19: Hoare triple {42295#(= (* 2 |base2flt_#in~m|) base2flt_~m)} assume !(~e <= -128); {42295#(= (* 2 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:50,173 INFO L290 TraceCheckUtils]: 20: Hoare triple {42295#(= (* 2 |base2flt_#in~m|) base2flt_~m)} assume ~e - 1 <= 2147483647; {42295#(= (* 2 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:50,174 INFO L290 TraceCheckUtils]: 21: Hoare triple {42295#(= (* 2 |base2flt_#in~m|) base2flt_~m)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {42311#(= (* |base2flt_#in~m| 4) base2flt_~m)} is VALID [2022-02-21 03:10:50,174 INFO L290 TraceCheckUtils]: 22: Hoare triple {42311#(= (* |base2flt_#in~m| 4) base2flt_~m)} assume ~m % 4294967296 < 16777216; {42311#(= (* |base2flt_#in~m| 4) base2flt_~m)} is VALID [2022-02-21 03:10:50,175 INFO L290 TraceCheckUtils]: 23: Hoare triple {42311#(= (* |base2flt_#in~m| 4) base2flt_~m)} assume !false; {42311#(= (* |base2flt_#in~m| 4) base2flt_~m)} is VALID [2022-02-21 03:10:50,175 INFO L290 TraceCheckUtils]: 24: Hoare triple {42311#(= (* |base2flt_#in~m| 4) base2flt_~m)} assume !(~e <= -128); {42311#(= (* |base2flt_#in~m| 4) base2flt_~m)} is VALID [2022-02-21 03:10:50,175 INFO L290 TraceCheckUtils]: 25: Hoare triple {42311#(= (* |base2flt_#in~m| 4) base2flt_~m)} assume ~e - 1 <= 2147483647; {42311#(= (* |base2flt_#in~m| 4) base2flt_~m)} is VALID [2022-02-21 03:10:50,176 INFO L290 TraceCheckUtils]: 26: Hoare triple {42311#(= (* |base2flt_#in~m| 4) base2flt_~m)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {42327#(= (* 8 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:50,176 INFO L290 TraceCheckUtils]: 27: Hoare triple {42327#(= (* 8 |base2flt_#in~m|) base2flt_~m)} assume ~m % 4294967296 < 16777216; {42327#(= (* 8 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:50,177 INFO L290 TraceCheckUtils]: 28: Hoare triple {42327#(= (* 8 |base2flt_#in~m|) base2flt_~m)} assume !false; {42327#(= (* 8 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:50,177 INFO L290 TraceCheckUtils]: 29: Hoare triple {42327#(= (* 8 |base2flt_#in~m|) base2flt_~m)} assume !(~e <= -128); {42327#(= (* 8 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:50,177 INFO L290 TraceCheckUtils]: 30: Hoare triple {42327#(= (* 8 |base2flt_#in~m|) base2flt_~m)} assume ~e - 1 <= 2147483647; {42327#(= (* 8 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:50,178 INFO L290 TraceCheckUtils]: 31: Hoare triple {42327#(= (* 8 |base2flt_#in~m|) base2flt_~m)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {42343#(= (* 16 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:50,178 INFO L290 TraceCheckUtils]: 32: Hoare triple {42343#(= (* 16 |base2flt_#in~m|) base2flt_~m)} assume ~m % 4294967296 < 16777216; {42343#(= (* 16 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:50,178 INFO L290 TraceCheckUtils]: 33: Hoare triple {42343#(= (* 16 |base2flt_#in~m|) base2flt_~m)} assume !false; {42343#(= (* 16 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:50,178 INFO L290 TraceCheckUtils]: 34: Hoare triple {42343#(= (* 16 |base2flt_#in~m|) base2flt_~m)} assume !(~e <= -128); {42343#(= (* 16 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:50,179 INFO L290 TraceCheckUtils]: 35: Hoare triple {42343#(= (* 16 |base2flt_#in~m|) base2flt_~m)} assume ~e - 1 <= 2147483647; {42343#(= (* 16 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:50,179 INFO L290 TraceCheckUtils]: 36: Hoare triple {42343#(= (* 16 |base2flt_#in~m|) base2flt_~m)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {42359#(= (* 32 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:50,180 INFO L290 TraceCheckUtils]: 37: Hoare triple {42359#(= (* 32 |base2flt_#in~m|) base2flt_~m)} assume ~m % 4294967296 < 16777216; {42359#(= (* 32 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:50,180 INFO L290 TraceCheckUtils]: 38: Hoare triple {42359#(= (* 32 |base2flt_#in~m|) base2flt_~m)} assume !false; {42359#(= (* 32 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:50,180 INFO L290 TraceCheckUtils]: 39: Hoare triple {42359#(= (* 32 |base2flt_#in~m|) base2flt_~m)} assume !(~e <= -128); {42359#(= (* 32 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:50,180 INFO L290 TraceCheckUtils]: 40: Hoare triple {42359#(= (* 32 |base2flt_#in~m|) base2flt_~m)} assume ~e - 1 <= 2147483647; {42359#(= (* 32 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:50,181 INFO L290 TraceCheckUtils]: 41: Hoare triple {42359#(= (* 32 |base2flt_#in~m|) base2flt_~m)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {42375#(= (* 64 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:50,181 INFO L290 TraceCheckUtils]: 42: Hoare triple {42375#(= (* 64 |base2flt_#in~m|) base2flt_~m)} assume ~m % 4294967296 < 16777216; {42375#(= (* 64 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:50,181 INFO L290 TraceCheckUtils]: 43: Hoare triple {42375#(= (* 64 |base2flt_#in~m|) base2flt_~m)} assume !false; {42375#(= (* 64 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:50,182 INFO L290 TraceCheckUtils]: 44: Hoare triple {42375#(= (* 64 |base2flt_#in~m|) base2flt_~m)} assume !(~e <= -128); {42375#(= (* 64 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:50,182 INFO L290 TraceCheckUtils]: 45: Hoare triple {42375#(= (* 64 |base2flt_#in~m|) base2flt_~m)} assume ~e - 1 <= 2147483647; {42375#(= (* 64 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:50,183 INFO L290 TraceCheckUtils]: 46: Hoare triple {42375#(= (* 64 |base2flt_#in~m|) base2flt_~m)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {42391#(= base2flt_~m (* 128 |base2flt_#in~m|))} is VALID [2022-02-21 03:10:50,183 INFO L290 TraceCheckUtils]: 47: Hoare triple {42391#(= base2flt_~m (* 128 |base2flt_#in~m|))} assume ~m % 4294967296 < 16777216; {42391#(= base2flt_~m (* 128 |base2flt_#in~m|))} is VALID [2022-02-21 03:10:50,183 INFO L290 TraceCheckUtils]: 48: Hoare triple {42391#(= base2flt_~m (* 128 |base2flt_#in~m|))} assume !false; {42391#(= base2flt_~m (* 128 |base2flt_#in~m|))} is VALID [2022-02-21 03:10:50,183 INFO L290 TraceCheckUtils]: 49: Hoare triple {42391#(= base2flt_~m (* 128 |base2flt_#in~m|))} assume !(~e <= -128); {42391#(= base2flt_~m (* 128 |base2flt_#in~m|))} is VALID [2022-02-21 03:10:50,184 INFO L290 TraceCheckUtils]: 50: Hoare triple {42391#(= base2flt_~m (* 128 |base2flt_#in~m|))} assume ~e - 1 <= 2147483647; {42391#(= base2flt_~m (* 128 |base2flt_#in~m|))} is VALID [2022-02-21 03:10:50,184 INFO L290 TraceCheckUtils]: 51: Hoare triple {42391#(= base2flt_~m (* 128 |base2flt_#in~m|))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {42407#(= base2flt_~m (* 256 |base2flt_#in~m|))} is VALID [2022-02-21 03:10:50,184 INFO L290 TraceCheckUtils]: 52: Hoare triple {42407#(= base2flt_~m (* 256 |base2flt_#in~m|))} assume ~m % 4294967296 < 16777216; {42407#(= base2flt_~m (* 256 |base2flt_#in~m|))} is VALID [2022-02-21 03:10:50,185 INFO L290 TraceCheckUtils]: 53: Hoare triple {42407#(= base2flt_~m (* 256 |base2flt_#in~m|))} assume !false; {42407#(= base2flt_~m (* 256 |base2flt_#in~m|))} is VALID [2022-02-21 03:10:50,185 INFO L290 TraceCheckUtils]: 54: Hoare triple {42407#(= base2flt_~m (* 256 |base2flt_#in~m|))} assume !(~e <= -128); {42407#(= base2flt_~m (* 256 |base2flt_#in~m|))} is VALID [2022-02-21 03:10:50,185 INFO L290 TraceCheckUtils]: 55: Hoare triple {42407#(= base2flt_~m (* 256 |base2flt_#in~m|))} assume ~e - 1 <= 2147483647; {42407#(= base2flt_~m (* 256 |base2flt_#in~m|))} is VALID [2022-02-21 03:10:50,186 INFO L290 TraceCheckUtils]: 56: Hoare triple {42407#(= base2flt_~m (* 256 |base2flt_#in~m|))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {42423#(= base2flt_~m (* |base2flt_#in~m| 512))} is VALID [2022-02-21 03:10:50,186 INFO L290 TraceCheckUtils]: 57: Hoare triple {42423#(= base2flt_~m (* |base2flt_#in~m| 512))} assume ~m % 4294967296 < 16777216; {42423#(= base2flt_~m (* |base2flt_#in~m| 512))} is VALID [2022-02-21 03:10:50,186 INFO L290 TraceCheckUtils]: 58: Hoare triple {42423#(= base2flt_~m (* |base2flt_#in~m| 512))} assume !false; {42423#(= base2flt_~m (* |base2flt_#in~m| 512))} is VALID [2022-02-21 03:10:50,186 INFO L290 TraceCheckUtils]: 59: Hoare triple {42423#(= base2flt_~m (* |base2flt_#in~m| 512))} assume !(~e <= -128); {42423#(= base2flt_~m (* |base2flt_#in~m| 512))} is VALID [2022-02-21 03:10:50,187 INFO L290 TraceCheckUtils]: 60: Hoare triple {42423#(= base2flt_~m (* |base2flt_#in~m| 512))} assume ~e - 1 <= 2147483647; {42423#(= base2flt_~m (* |base2flt_#in~m| 512))} is VALID [2022-02-21 03:10:50,187 INFO L290 TraceCheckUtils]: 61: Hoare triple {42423#(= base2flt_~m (* |base2flt_#in~m| 512))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {42439#(= (* |base2flt_#in~m| 1024) base2flt_~m)} is VALID [2022-02-21 03:10:50,187 INFO L290 TraceCheckUtils]: 62: Hoare triple {42439#(= (* |base2flt_#in~m| 1024) base2flt_~m)} assume ~m % 4294967296 < 16777216; {42439#(= (* |base2flt_#in~m| 1024) base2flt_~m)} is VALID [2022-02-21 03:10:50,188 INFO L290 TraceCheckUtils]: 63: Hoare triple {42439#(= (* |base2flt_#in~m| 1024) base2flt_~m)} assume !false; {42439#(= (* |base2flt_#in~m| 1024) base2flt_~m)} is VALID [2022-02-21 03:10:50,188 INFO L290 TraceCheckUtils]: 64: Hoare triple {42439#(= (* |base2flt_#in~m| 1024) base2flt_~m)} assume !(~e <= -128); {42439#(= (* |base2flt_#in~m| 1024) base2flt_~m)} is VALID [2022-02-21 03:10:50,188 INFO L290 TraceCheckUtils]: 65: Hoare triple {42439#(= (* |base2flt_#in~m| 1024) base2flt_~m)} assume ~e - 1 <= 2147483647; {42439#(= (* |base2flt_#in~m| 1024) base2flt_~m)} is VALID [2022-02-21 03:10:50,189 INFO L290 TraceCheckUtils]: 66: Hoare triple {42439#(= (* |base2flt_#in~m| 1024) base2flt_~m)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {42455#(= base2flt_~m (* 2048 |base2flt_#in~m|))} is VALID [2022-02-21 03:10:50,189 INFO L290 TraceCheckUtils]: 67: Hoare triple {42455#(= base2flt_~m (* 2048 |base2flt_#in~m|))} assume ~m % 4294967296 < 16777216; {42455#(= base2flt_~m (* 2048 |base2flt_#in~m|))} is VALID [2022-02-21 03:10:50,189 INFO L290 TraceCheckUtils]: 68: Hoare triple {42455#(= base2flt_~m (* 2048 |base2flt_#in~m|))} assume !false; {42455#(= base2flt_~m (* 2048 |base2flt_#in~m|))} is VALID [2022-02-21 03:10:50,190 INFO L290 TraceCheckUtils]: 69: Hoare triple {42455#(= base2flt_~m (* 2048 |base2flt_#in~m|))} assume !(~e <= -128); {42455#(= base2flt_~m (* 2048 |base2flt_#in~m|))} is VALID [2022-02-21 03:10:50,190 INFO L290 TraceCheckUtils]: 70: Hoare triple {42455#(= base2flt_~m (* 2048 |base2flt_#in~m|))} assume ~e - 1 <= 2147483647; {42455#(= base2flt_~m (* 2048 |base2flt_#in~m|))} is VALID [2022-02-21 03:10:50,191 INFO L290 TraceCheckUtils]: 71: Hoare triple {42455#(= base2flt_~m (* 2048 |base2flt_#in~m|))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {42471#(= base2flt_~m (* |base2flt_#in~m| 4096))} is VALID [2022-02-21 03:10:50,191 INFO L290 TraceCheckUtils]: 72: Hoare triple {42471#(= base2flt_~m (* |base2flt_#in~m| 4096))} assume ~m % 4294967296 < 16777216; {42471#(= base2flt_~m (* |base2flt_#in~m| 4096))} is VALID [2022-02-21 03:10:50,191 INFO L290 TraceCheckUtils]: 73: Hoare triple {42471#(= base2flt_~m (* |base2flt_#in~m| 4096))} assume !false; {42471#(= base2flt_~m (* |base2flt_#in~m| 4096))} is VALID [2022-02-21 03:10:50,191 INFO L290 TraceCheckUtils]: 74: Hoare triple {42471#(= base2flt_~m (* |base2flt_#in~m| 4096))} assume !(~e <= -128); {42471#(= base2flt_~m (* |base2flt_#in~m| 4096))} is VALID [2022-02-21 03:10:50,192 INFO L290 TraceCheckUtils]: 75: Hoare triple {42471#(= base2flt_~m (* |base2flt_#in~m| 4096))} assume ~e - 1 <= 2147483647; {42471#(= base2flt_~m (* |base2flt_#in~m| 4096))} is VALID [2022-02-21 03:10:50,192 INFO L290 TraceCheckUtils]: 76: Hoare triple {42471#(= base2flt_~m (* |base2flt_#in~m| 4096))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {42487#(= base2flt_~m (* 8192 |base2flt_#in~m|))} is VALID [2022-02-21 03:10:50,192 INFO L290 TraceCheckUtils]: 77: Hoare triple {42487#(= base2flt_~m (* 8192 |base2flt_#in~m|))} assume ~m % 4294967296 < 16777216; {42487#(= base2flt_~m (* 8192 |base2flt_#in~m|))} is VALID [2022-02-21 03:10:50,193 INFO L290 TraceCheckUtils]: 78: Hoare triple {42487#(= base2flt_~m (* 8192 |base2flt_#in~m|))} assume !false; {42487#(= base2flt_~m (* 8192 |base2flt_#in~m|))} is VALID [2022-02-21 03:10:50,193 INFO L290 TraceCheckUtils]: 79: Hoare triple {42487#(= base2flt_~m (* 8192 |base2flt_#in~m|))} assume !(~e <= -128); {42487#(= base2flt_~m (* 8192 |base2flt_#in~m|))} is VALID [2022-02-21 03:10:50,193 INFO L290 TraceCheckUtils]: 80: Hoare triple {42487#(= base2flt_~m (* 8192 |base2flt_#in~m|))} assume ~e - 1 <= 2147483647; {42487#(= base2flt_~m (* 8192 |base2flt_#in~m|))} is VALID [2022-02-21 03:10:50,194 INFO L290 TraceCheckUtils]: 81: Hoare triple {42487#(= base2flt_~m (* 8192 |base2flt_#in~m|))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {42503#(= (* |base2flt_#in~m| 16384) base2flt_~m)} is VALID [2022-02-21 03:10:50,195 INFO L290 TraceCheckUtils]: 82: Hoare triple {42503#(= (* |base2flt_#in~m| 16384) base2flt_~m)} assume !(~m % 4294967296 < 16777216); {42507#(not (< (mod (* |base2flt_#in~m| 16384) 4294967296) 16777216))} is VALID [2022-02-21 03:10:50,196 INFO L290 TraceCheckUtils]: 83: Hoare triple {42507#(not (< (mod (* |base2flt_#in~m| 16384) 4294967296) 16777216))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {42507#(not (< (mod (* |base2flt_#in~m| 16384) 4294967296) 16777216))} is VALID [2022-02-21 03:10:50,196 INFO L290 TraceCheckUtils]: 84: Hoare triple {42507#(not (< (mod (* |base2flt_#in~m| 16384) 4294967296) 16777216))} assume 128 + ~e <= 2147483647; {42507#(not (< (mod (* |base2flt_#in~m| 16384) 4294967296) 16777216))} is VALID [2022-02-21 03:10:50,196 INFO L290 TraceCheckUtils]: 85: Hoare triple {42507#(not (< (mod (* |base2flt_#in~m| 16384) 4294967296) 16777216))} assume 128 + ~e >= -2147483648; {42507#(not (< (mod (* |base2flt_#in~m| 16384) 4294967296) 16777216))} is VALID [2022-02-21 03:10:50,196 INFO L290 TraceCheckUtils]: 86: Hoare triple {42507#(not (< (mod (* |base2flt_#in~m| 16384) 4294967296) 16777216))} assume 16777216 * (128 + ~e) <= 2147483647; {42507#(not (< (mod (* |base2flt_#in~m| 16384) 4294967296) 16777216))} is VALID [2022-02-21 03:10:50,197 INFO L290 TraceCheckUtils]: 87: Hoare triple {42507#(not (< (mod (* |base2flt_#in~m| 16384) 4294967296) 16777216))} assume 16777216 * (128 + ~e) >= -2147483648; {42507#(not (< (mod (* |base2flt_#in~m| 16384) 4294967296) 16777216))} is VALID [2022-02-21 03:10:50,197 INFO L290 TraceCheckUtils]: 88: Hoare triple {42507#(not (< (mod (* |base2flt_#in~m| 16384) 4294967296) 16777216))} assume 128 + ~e <= 2147483647; {42507#(not (< (mod (* |base2flt_#in~m| 16384) 4294967296) 16777216))} is VALID [2022-02-21 03:10:50,197 INFO L290 TraceCheckUtils]: 89: Hoare triple {42507#(not (< (mod (* |base2flt_#in~m| 16384) 4294967296) 16777216))} assume 128 + ~e >= -2147483648; {42507#(not (< (mod (* |base2flt_#in~m| 16384) 4294967296) 16777216))} is VALID [2022-02-21 03:10:50,197 INFO L290 TraceCheckUtils]: 90: Hoare triple {42507#(not (< (mod (* |base2flt_#in~m| 16384) 4294967296) 16777216))} assume 16777216 * (128 + ~e) <= 2147483647; {42507#(not (< (mod (* |base2flt_#in~m| 16384) 4294967296) 16777216))} is VALID [2022-02-21 03:10:50,198 INFO L290 TraceCheckUtils]: 91: Hoare triple {42507#(not (< (mod (* |base2flt_#in~m| 16384) 4294967296) 16777216))} assume 16777216 * (128 + ~e) >= -2147483648; {42507#(not (< (mod (* |base2flt_#in~m| 16384) 4294967296) 16777216))} is VALID [2022-02-21 03:10:50,198 INFO L290 TraceCheckUtils]: 92: Hoare triple {42507#(not (< (mod (* |base2flt_#in~m| 16384) 4294967296) 16777216))} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {42507#(not (< (mod (* |base2flt_#in~m| 16384) 4294967296) 16777216))} is VALID [2022-02-21 03:10:50,198 INFO L290 TraceCheckUtils]: 93: Hoare triple {42507#(not (< (mod (* |base2flt_#in~m| 16384) 4294967296) 16777216))} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {42507#(not (< (mod (* |base2flt_#in~m| 16384) 4294967296) 16777216))} is VALID [2022-02-21 03:10:50,198 INFO L290 TraceCheckUtils]: 94: Hoare triple {42507#(not (< (mod (* |base2flt_#in~m| 16384) 4294967296) 16777216))} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {42507#(not (< (mod (* |base2flt_#in~m| 16384) 4294967296) 16777216))} is VALID [2022-02-21 03:10:50,199 INFO L290 TraceCheckUtils]: 95: Hoare triple {42507#(not (< (mod (* |base2flt_#in~m| 16384) 4294967296) 16777216))} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_77 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_77; {42507#(not (< (mod (* |base2flt_#in~m| 16384) 4294967296) 16777216))} is VALID [2022-02-21 03:10:50,199 INFO L290 TraceCheckUtils]: 96: Hoare triple {42507#(not (< (mod (* |base2flt_#in~m| 16384) 4294967296) 16777216))} ~__retres4~0 := ~res~0; {42507#(not (< (mod (* |base2flt_#in~m| 16384) 4294967296) 16777216))} is VALID [2022-02-21 03:10:50,199 INFO L290 TraceCheckUtils]: 97: Hoare triple {42507#(not (< (mod (* |base2flt_#in~m| 16384) 4294967296) 16777216))} #res := ~__retres4~0; {42507#(not (< (mod (* |base2flt_#in~m| 16384) 4294967296) 16777216))} is VALID [2022-02-21 03:10:50,199 INFO L290 TraceCheckUtils]: 98: Hoare triple {42507#(not (< (mod (* |base2flt_#in~m| 16384) 4294967296) 16777216))} assume true; {42507#(not (< (mod (* |base2flt_#in~m| 16384) 4294967296) 16777216))} is VALID [2022-02-21 03:10:50,200 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {42507#(not (< (mod (* |base2flt_#in~m| 16384) 4294967296) 16777216))} {42129#true} #396#return; {42130#false} is VALID [2022-02-21 03:10:50,200 INFO L290 TraceCheckUtils]: 100: Hoare triple {42130#false} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {42130#false} is VALID [2022-02-21 03:10:50,200 INFO L272 TraceCheckUtils]: 101: Hoare triple {42130#false} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {42130#false} is VALID [2022-02-21 03:10:50,200 INFO L290 TraceCheckUtils]: 102: Hoare triple {42130#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {42130#false} is VALID [2022-02-21 03:10:50,200 INFO L290 TraceCheckUtils]: 103: Hoare triple {42130#false} assume !(0 == ~m % 4294967296); {42130#false} is VALID [2022-02-21 03:10:50,200 INFO L290 TraceCheckUtils]: 104: Hoare triple {42130#false} assume !(~m % 4294967296 < 16777216); {42130#false} is VALID [2022-02-21 03:10:50,200 INFO L290 TraceCheckUtils]: 105: Hoare triple {42130#false} assume !false; {42130#false} is VALID [2022-02-21 03:10:50,200 INFO L290 TraceCheckUtils]: 106: Hoare triple {42130#false} assume !(~m % 4294967296 >= 33554432); {42130#false} is VALID [2022-02-21 03:10:50,200 INFO L290 TraceCheckUtils]: 107: Hoare triple {42130#false} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {42130#false} is VALID [2022-02-21 03:10:50,200 INFO L290 TraceCheckUtils]: 108: Hoare triple {42130#false} assume 128 + ~e <= 2147483647; {42130#false} is VALID [2022-02-21 03:10:50,200 INFO L290 TraceCheckUtils]: 109: Hoare triple {42130#false} assume 128 + ~e >= -2147483648; {42130#false} is VALID [2022-02-21 03:10:50,200 INFO L290 TraceCheckUtils]: 110: Hoare triple {42130#false} assume !(16777216 * (128 + ~e) <= 2147483647); {42130#false} is VALID [2022-02-21 03:10:50,201 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 13 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:10:50,201 INFO L328 TraceCheckSpWp]: Computing backward predicates...