./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_5a.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_5a.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 f6c91769726962c1478685c30d57ac239987d5f8a5f6832d1d60b9c031f35855 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:10:13,574 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:10:13,576 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:10:13,605 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:10:13,605 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:10:13,606 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:10:13,608 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:10:13,612 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:10:13,615 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:10:13,616 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:10:13,617 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:10:13,619 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:10:13,619 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:10:13,623 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:10:13,625 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:10:13,626 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:10:13,628 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:10:13,629 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:10:13,630 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:10:13,633 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:10:13,636 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:10:13,637 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:10:13,639 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:10:13,639 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:10:13,644 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:10:13,647 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:10:13,647 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:10:13,648 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:10:13,649 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:10:13,650 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:10:13,650 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:10:13,651 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:10:13,652 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:10:13,653 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:10:13,655 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:10:13,655 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:10:13,656 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:10:13,656 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:10:13,656 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:10:13,657 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:10:13,657 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:10:13,658 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:10:13,687 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:10:13,690 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:10:13,691 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:10:13,691 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:10:13,692 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:10:13,692 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:10:13,693 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:10:13,693 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:10:13,693 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:10:13,693 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:10:13,694 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:10:13,694 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:10:13,694 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:10:13,695 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:10:13,695 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:10:13,695 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:10:13,695 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:10:13,695 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:10:13,695 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:10:13,696 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:10:13,696 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:10:13,696 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:10:13,696 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:10:13,696 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:10:13,697 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:10:13,697 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:10:13,697 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:10:13,697 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:10:13,697 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:10:13,698 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:10:13,698 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:10:13,698 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:10:13,698 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:10:13,698 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 -> f6c91769726962c1478685c30d57ac239987d5f8a5f6832d1d60b9c031f35855 [2022-02-21 03:10:13,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:10:13,958 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:10:13,959 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:10:13,960 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:10:13,962 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:10:13,963 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c [2022-02-21 03:10:14,013 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d690ffd6b/3fe8282c45504fcc9b35c0f30777d456/FLAGbdc8e8112 [2022-02-21 03:10:14,417 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:10:14,418 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c [2022-02-21 03:10:14,424 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d690ffd6b/3fe8282c45504fcc9b35c0f30777d456/FLAGbdc8e8112 [2022-02-21 03:10:14,816 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d690ffd6b/3fe8282c45504fcc9b35c0f30777d456 [2022-02-21 03:10:14,818 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:10:14,820 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:10:14,822 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:10:14,823 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:10:14,825 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:10:14,826 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:10:14" (1/1) ... [2022-02-21 03:10:14,827 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3690cbe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:14, skipping insertion in model container [2022-02-21 03:10:14,828 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:10:14" (1/1) ... [2022-02-21 03:10:14,833 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:10:14,872 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:10:15,003 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_5a.c.cil.c[728,741] [2022-02-21 03:10:15,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:10:15,091 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:10:15,101 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_5a.c.cil.c[728,741] [2022-02-21 03:10:15,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:10:15,146 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:10:15,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:15 WrapperNode [2022-02-21 03:10:15,146 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:10:15,147 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:10:15,147 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:10:15,148 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:10:15,158 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:10:15" (1/1) ... [2022-02-21 03:10:15,180 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:10:15" (1/1) ... [2022-02-21 03:10:15,214 INFO L137 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 188 [2022-02-21 03:10:15,214 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:10:15,215 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:10:15,215 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:10:15,215 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:10:15,222 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:15" (1/1) ... [2022-02-21 03:10:15,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:15" (1/1) ... [2022-02-21 03:10:15,224 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:15" (1/1) ... [2022-02-21 03:10:15,224 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:15" (1/1) ... [2022-02-21 03:10:15,230 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:15" (1/1) ... [2022-02-21 03:10:15,251 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:15" (1/1) ... [2022-02-21 03:10:15,252 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:15" (1/1) ... [2022-02-21 03:10:15,254 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:10:15,255 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:10:15,255 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:10:15,255 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:10:15,256 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:15" (1/1) ... [2022-02-21 03:10:15,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:10:15,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:15,296 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:10:15,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:10:15,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:10:15,342 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-02-21 03:10:15,342 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-02-21 03:10:15,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:10:15,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:10:15,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-21 03:10:15,343 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-21 03:10:15,323 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:10:15,433 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:10:15,435 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:10:15,939 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:10:15,959 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:10:15,961 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:10:15,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:10:15 BoogieIcfgContainer [2022-02-21 03:10:15,964 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:10:15,966 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:10:15,967 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:10:15,970 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:10:15,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:10:14" (1/3) ... [2022-02-21 03:10:15,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66e3d0c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:10:15, skipping insertion in model container [2022-02-21 03:10:15,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:15" (2/3) ... [2022-02-21 03:10:15,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66e3d0c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:10:15, skipping insertion in model container [2022-02-21 03:10:15,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:10:15" (3/3) ... [2022-02-21 03:10:15,973 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_5a.c.cil.c [2022-02-21 03:10:15,978 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:10:15,978 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-02-21 03:10:16,031 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:10:16,039 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:10:16,040 INFO L340 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-02-21 03:10:16,068 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 94 states have (on average 1.7765957446808511) internal successors, (167), 113 states have internal predecessors, (167), 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:10:16,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-21 03:10:16,073 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:16,073 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:16,074 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-02-21 03:10:16,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:16,079 INFO L85 PathProgramCache]: Analyzing trace with hash 839293121, now seen corresponding path program 1 times [2022-02-21 03:10:16,087 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:16,087 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342968159] [2022-02-21 03:10:16,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:16,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:16,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:16,229 INFO L290 TraceCheckUtils]: 0: Hoare triple {123#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(22, 2);call #Ultimate.allocInit(12, 3); {123#true} is VALID [2022-02-21 03:10:16,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {123#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_~sb~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_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {123#true} is VALID [2022-02-21 03:10:16,230 INFO L272 TraceCheckUtils]: 2: Hoare triple {123#true} call main_#t~ret22#1 := base2flt(0, 0); {123#true} is VALID [2022-02-21 03:10:16,231 INFO L290 TraceCheckUtils]: 3: Hoare triple {123#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {123#true} is VALID [2022-02-21 03:10:16,231 INFO L290 TraceCheckUtils]: 4: Hoare triple {123#true} assume !(0 == ~m % 4294967296); {123#true} is VALID [2022-02-21 03:10:16,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {123#true} assume !(~m % 4294967296 < 16777216); {123#true} is VALID [2022-02-21 03:10:16,232 INFO L290 TraceCheckUtils]: 6: Hoare triple {123#true} assume !true; {124#false} is VALID [2022-02-21 03:10:16,233 INFO L290 TraceCheckUtils]: 7: Hoare triple {124#false} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {124#false} is VALID [2022-02-21 03:10:16,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {124#false} assume !(128 + ~e <= 2147483647); {124#false} is VALID [2022-02-21 03:10:16,234 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:10:16,235 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:16,235 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342968159] [2022-02-21 03:10:16,235 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342968159] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:16,236 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:10:16,236 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:10:16,239 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923523351] [2022-02-21 03:10:16,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:16,244 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:10:16,246 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:16,249 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:10:16,260 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:10:16,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-21 03:10:16,260 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:16,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 03:10:16,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 03:10:16,290 INFO L87 Difference]: Start difference. First operand has 120 states, 94 states have (on average 1.7765957446808511) internal successors, (167), 113 states have internal predecessors, (167), 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:10:16,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:16,481 INFO L93 Difference]: Finished difference Result 235 states and 355 transitions. [2022-02-21 03:10:16,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 03:10:16,481 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:10:16,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:16,483 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:10:16,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 355 transitions. [2022-02-21 03:10:16,499 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:10:16,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 355 transitions. [2022-02-21 03:10:16,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 355 transitions. [2022-02-21 03:10:16,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 355 edges. 355 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:16,832 INFO L225 Difference]: With dead ends: 235 [2022-02-21 03:10:16,832 INFO L226 Difference]: Without dead ends: 91 [2022-02-21 03:10:16,835 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:10:16,838 INFO L933 BasicCegarLoop]: 160 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, 160 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:10:16,839 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:10:16,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-02-21 03:10:16,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-02-21 03:10:16,870 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:16,871 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 91 states, 70 states have (on average 1.542857142857143) internal successors, (108), 85 states have internal predecessors, (108), 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:10:16,872 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 91 states, 70 states have (on average 1.542857142857143) internal successors, (108), 85 states have internal predecessors, (108), 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:10:16,872 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 91 states, 70 states have (on average 1.542857142857143) internal successors, (108), 85 states have internal predecessors, (108), 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:10:16,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:16,878 INFO L93 Difference]: Finished difference Result 91 states and 116 transitions. [2022-02-21 03:10:16,879 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 116 transitions. [2022-02-21 03:10:16,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:16,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:16,881 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 70 states have (on average 1.542857142857143) internal successors, (108), 85 states have internal predecessors, (108), 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 91 states. [2022-02-21 03:10:16,882 INFO L87 Difference]: Start difference. First operand has 91 states, 70 states have (on average 1.542857142857143) internal successors, (108), 85 states have internal predecessors, (108), 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 91 states. [2022-02-21 03:10:16,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:16,886 INFO L93 Difference]: Finished difference Result 91 states and 116 transitions. [2022-02-21 03:10:16,886 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 116 transitions. [2022-02-21 03:10:16,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:16,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:16,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:16,889 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:16,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 70 states have (on average 1.542857142857143) internal successors, (108), 85 states have internal predecessors, (108), 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:10:16,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 116 transitions. [2022-02-21 03:10:16,894 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 116 transitions. Word has length 9 [2022-02-21 03:10:16,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:16,895 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 116 transitions. [2022-02-21 03:10:16,895 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:10:16,895 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 116 transitions. [2022-02-21 03:10:16,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-21 03:10:16,896 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:16,896 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:16,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:10:16,897 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-02-21 03:10:16,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:16,897 INFO L85 PathProgramCache]: Analyzing trace with hash 838351773, now seen corresponding path program 1 times [2022-02-21 03:10:16,898 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:16,898 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783552373] [2022-02-21 03:10:16,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:16,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:16,945 INFO L290 TraceCheckUtils]: 0: Hoare triple {671#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(22, 2);call #Ultimate.allocInit(12, 3); {671#true} is VALID [2022-02-21 03:10:16,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {671#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_~sb~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_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {671#true} is VALID [2022-02-21 03:10:16,946 INFO L272 TraceCheckUtils]: 2: Hoare triple {671#true} call main_#t~ret22#1 := base2flt(0, 0); {673#(= |base2flt_#in~e| 0)} is VALID [2022-02-21 03:10:16,947 INFO L290 TraceCheckUtils]: 3: Hoare triple {673#(= |base2flt_#in~e| 0)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {674#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:16,947 INFO L290 TraceCheckUtils]: 4: Hoare triple {674#(= base2flt_~e 0)} assume !(0 == ~m % 4294967296); {674#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:16,948 INFO L290 TraceCheckUtils]: 5: Hoare triple {674#(= base2flt_~e 0)} assume ~m % 4294967296 < 16777216; {674#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:16,948 INFO L290 TraceCheckUtils]: 6: Hoare triple {674#(= base2flt_~e 0)} assume !false; {674#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:16,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {674#(= base2flt_~e 0)} assume !(~e <= -128); {674#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:16,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {674#(= base2flt_~e 0)} assume !(~e - 1 <= 2147483647); {672#false} is VALID [2022-02-21 03:10:16,950 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:10:16,950 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:16,950 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783552373] [2022-02-21 03:10:16,950 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783552373] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:16,951 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:10:16,951 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:10:16,951 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199163937] [2022-02-21 03:10:16,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:16,952 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:10:16,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:16,953 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:10:16,960 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:10:16,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:10:16,961 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:16,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:10:16,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:10:16,962 INFO L87 Difference]: Start difference. First operand 91 states and 116 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:10:17,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:17,312 INFO L93 Difference]: Finished difference Result 241 states and 325 transitions. [2022-02-21 03:10:17,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:10:17,313 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:10:17,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:17,313 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:10:17,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 325 transitions. [2022-02-21 03:10:17,319 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:10:17,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 325 transitions. [2022-02-21 03:10:17,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 325 transitions. [2022-02-21 03:10:17,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 325 edges. 325 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:17,576 INFO L225 Difference]: With dead ends: 241 [2022-02-21 03:10:17,577 INFO L226 Difference]: Without dead ends: 153 [2022-02-21 03:10:17,577 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:10:17,585 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 106 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:17,586 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 292 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:10:17,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-02-21 03:10:17,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 140. [2022-02-21 03:10:17,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:17,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand has 140 states, 118 states have (on average 1.5508474576271187) internal successors, (183), 133 states have internal predecessors, (183), 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:10:17,604 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand has 140 states, 118 states have (on average 1.5508474576271187) internal successors, (183), 133 states have internal predecessors, (183), 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:10:17,604 INFO L87 Difference]: Start difference. First operand 153 states. Second operand has 140 states, 118 states have (on average 1.5508474576271187) internal successors, (183), 133 states have internal predecessors, (183), 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:10:17,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:17,611 INFO L93 Difference]: Finished difference Result 153 states and 198 transitions. [2022-02-21 03:10:17,611 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 198 transitions. [2022-02-21 03:10:17,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:17,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:17,620 INFO L74 IsIncluded]: Start isIncluded. First operand has 140 states, 118 states have (on average 1.5508474576271187) internal successors, (183), 133 states have internal predecessors, (183), 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 153 states. [2022-02-21 03:10:17,620 INFO L87 Difference]: Start difference. First operand has 140 states, 118 states have (on average 1.5508474576271187) internal successors, (183), 133 states have internal predecessors, (183), 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 153 states. [2022-02-21 03:10:17,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:17,628 INFO L93 Difference]: Finished difference Result 153 states and 198 transitions. [2022-02-21 03:10:17,628 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 198 transitions. [2022-02-21 03:10:17,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:17,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:17,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:17,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:17,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 118 states have (on average 1.5508474576271187) internal successors, (183), 133 states have internal predecessors, (183), 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:10:17,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 191 transitions. [2022-02-21 03:10:17,635 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 191 transitions. Word has length 9 [2022-02-21 03:10:17,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:17,636 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 191 transitions. [2022-02-21 03:10:17,636 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:10:17,647 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 191 transitions. [2022-02-21 03:10:17,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-21 03:10:17,647 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:17,648 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:17,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 03:10:17,648 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-02-21 03:10:17,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:17,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1105067146, now seen corresponding path program 1 times [2022-02-21 03:10:17,649 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:17,650 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585527650] [2022-02-21 03:10:17,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:17,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:17,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {1409#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(22, 2);call #Ultimate.allocInit(12, 3); {1409#true} is VALID [2022-02-21 03:10:17,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {1409#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_~sb~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_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {1409#true} is VALID [2022-02-21 03:10:17,698 INFO L272 TraceCheckUtils]: 2: Hoare triple {1409#true} call main_#t~ret22#1 := base2flt(0, 0); {1411#(= |base2flt_#in~e| 0)} is VALID [2022-02-21 03:10:17,699 INFO L290 TraceCheckUtils]: 3: Hoare triple {1411#(= |base2flt_#in~e| 0)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {1412#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:17,699 INFO L290 TraceCheckUtils]: 4: Hoare triple {1412#(= base2flt_~e 0)} assume !(0 == ~m % 4294967296); {1412#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:17,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {1412#(= base2flt_~e 0)} assume ~m % 4294967296 < 16777216; {1412#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:17,700 INFO L290 TraceCheckUtils]: 6: Hoare triple {1412#(= base2flt_~e 0)} assume !false; {1412#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:17,700 INFO L290 TraceCheckUtils]: 7: Hoare triple {1412#(= base2flt_~e 0)} assume !(~e <= -128); {1412#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:17,701 INFO L290 TraceCheckUtils]: 8: Hoare triple {1412#(= base2flt_~e 0)} assume ~e - 1 <= 2147483647; {1412#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:17,702 INFO L290 TraceCheckUtils]: 9: Hoare triple {1412#(= base2flt_~e 0)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {1413#(<= (+ base2flt_~e 1) 0)} is VALID [2022-02-21 03:10:17,702 INFO L290 TraceCheckUtils]: 10: Hoare triple {1413#(<= (+ base2flt_~e 1) 0)} assume !(~m % 4294967296 < 16777216); {1413#(<= (+ base2flt_~e 1) 0)} is VALID [2022-02-21 03:10:17,703 INFO L290 TraceCheckUtils]: 11: Hoare triple {1413#(<= (+ base2flt_~e 1) 0)} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {1413#(<= (+ base2flt_~e 1) 0)} is VALID [2022-02-21 03:10:17,703 INFO L290 TraceCheckUtils]: 12: Hoare triple {1413#(<= (+ base2flt_~e 1) 0)} assume !(128 + ~e <= 2147483647); {1410#false} is VALID [2022-02-21 03:10:17,703 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:10:17,704 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:17,704 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585527650] [2022-02-21 03:10:17,704 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585527650] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:17,704 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:10:17,704 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:10:17,705 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805675706] [2022-02-21 03:10:17,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:17,705 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 13 [2022-02-21 03:10:17,705 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:17,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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:10:17,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:17,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:10:17,716 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:17,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:10:17,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:10:17,716 INFO L87 Difference]: Start difference. First operand 140 states and 191 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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:10:18,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:18,125 INFO L93 Difference]: Finished difference Result 175 states and 232 transitions. [2022-02-21 03:10:18,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:10:18,125 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 13 [2022-02-21 03:10:18,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:18,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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:10:18,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 232 transitions. [2022-02-21 03:10:18,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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:10:18,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 232 transitions. [2022-02-21 03:10:18,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 232 transitions. [2022-02-21 03:10:18,324 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 232 edges. 232 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:18,328 INFO L225 Difference]: With dead ends: 175 [2022-02-21 03:10:18,328 INFO L226 Difference]: Without dead ends: 172 [2022-02-21 03:10:18,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:10:18,330 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 161 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:18,330 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 392 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:10:18,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-02-21 03:10:18,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 147. [2022-02-21 03:10:18,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:18,341 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand has 147 states, 125 states have (on average 1.552) internal successors, (194), 140 states have internal predecessors, (194), 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:10:18,342 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand has 147 states, 125 states have (on average 1.552) internal successors, (194), 140 states have internal predecessors, (194), 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:10:18,342 INFO L87 Difference]: Start difference. First operand 172 states. Second operand has 147 states, 125 states have (on average 1.552) internal successors, (194), 140 states have internal predecessors, (194), 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:10:18,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:18,348 INFO L93 Difference]: Finished difference Result 172 states and 229 transitions. [2022-02-21 03:10:18,348 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 229 transitions. [2022-02-21 03:10:18,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:18,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:18,349 INFO L74 IsIncluded]: Start isIncluded. First operand has 147 states, 125 states have (on average 1.552) internal successors, (194), 140 states have internal predecessors, (194), 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 172 states. [2022-02-21 03:10:18,350 INFO L87 Difference]: Start difference. First operand has 147 states, 125 states have (on average 1.552) internal successors, (194), 140 states have internal predecessors, (194), 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 172 states. [2022-02-21 03:10:18,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:18,355 INFO L93 Difference]: Finished difference Result 172 states and 229 transitions. [2022-02-21 03:10:18,355 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 229 transitions. [2022-02-21 03:10:18,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:18,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:18,356 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:18,356 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:18,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 125 states have (on average 1.552) internal successors, (194), 140 states have internal predecessors, (194), 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:10:18,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 202 transitions. [2022-02-21 03:10:18,361 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 202 transitions. Word has length 13 [2022-02-21 03:10:18,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:18,362 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 202 transitions. [2022-02-21 03:10:18,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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:10:18,362 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 202 transitions. [2022-02-21 03:10:18,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-21 03:10:18,362 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:18,363 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:18,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 03:10:18,363 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-02-21 03:10:18,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:18,364 INFO L85 PathProgramCache]: Analyzing trace with hash 102656963, now seen corresponding path program 1 times [2022-02-21 03:10:18,364 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:18,364 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202935298] [2022-02-21 03:10:18,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:18,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:18,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:18,406 INFO L290 TraceCheckUtils]: 0: Hoare triple {2125#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(22, 2);call #Ultimate.allocInit(12, 3); {2125#true} is VALID [2022-02-21 03:10:18,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {2125#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_~sb~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_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {2125#true} is VALID [2022-02-21 03:10:18,408 INFO L272 TraceCheckUtils]: 2: Hoare triple {2125#true} call main_#t~ret22#1 := base2flt(0, 0); {2127#(= |base2flt_#in~e| 0)} is VALID [2022-02-21 03:10:18,408 INFO L290 TraceCheckUtils]: 3: Hoare triple {2127#(= |base2flt_#in~e| 0)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {2128#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:18,408 INFO L290 TraceCheckUtils]: 4: Hoare triple {2128#(= base2flt_~e 0)} assume !(0 == ~m % 4294967296); {2128#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:18,409 INFO L290 TraceCheckUtils]: 5: Hoare triple {2128#(= base2flt_~e 0)} assume ~m % 4294967296 < 16777216; {2128#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:18,409 INFO L290 TraceCheckUtils]: 6: Hoare triple {2128#(= base2flt_~e 0)} assume !false; {2128#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:18,410 INFO L290 TraceCheckUtils]: 7: Hoare triple {2128#(= base2flt_~e 0)} assume !(~e <= -128); {2128#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:18,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {2128#(= base2flt_~e 0)} assume ~e - 1 <= 2147483647; {2128#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:18,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {2128#(= base2flt_~e 0)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {2129#(<= 0 (+ base2flt_~e 1))} is VALID [2022-02-21 03:10:18,411 INFO L290 TraceCheckUtils]: 10: Hoare triple {2129#(<= 0 (+ base2flt_~e 1))} assume !(~m % 4294967296 < 16777216); {2129#(<= 0 (+ base2flt_~e 1))} is VALID [2022-02-21 03:10:18,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {2129#(<= 0 (+ base2flt_~e 1))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {2129#(<= 0 (+ base2flt_~e 1))} is VALID [2022-02-21 03:10:18,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {2129#(<= 0 (+ base2flt_~e 1))} assume 128 + ~e <= 2147483647; {2129#(<= 0 (+ base2flt_~e 1))} is VALID [2022-02-21 03:10:18,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {2129#(<= 0 (+ base2flt_~e 1))} assume !(128 + ~e >= -2147483648); {2126#false} is VALID [2022-02-21 03:10:18,413 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:10:18,413 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:18,413 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202935298] [2022-02-21 03:10:18,414 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202935298] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:18,414 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:10:18,414 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:10:18,414 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789044213] [2022-02-21 03:10:18,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:18,415 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 14 [2022-02-21 03:10:18,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:18,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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:10:18,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:18,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:10:18,426 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:18,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:10:18,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:10:18,427 INFO L87 Difference]: Start difference. First operand 147 states and 202 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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:10:18,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:18,816 INFO L93 Difference]: Finished difference Result 326 states and 448 transitions. [2022-02-21 03:10:18,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:10:18,816 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 14 [2022-02-21 03:10:18,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:18,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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:10:18,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 350 transitions. [2022-02-21 03:10:18,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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:10:18,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 350 transitions. [2022-02-21 03:10:18,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 350 transitions. [2022-02-21 03:10:19,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 350 edges. 350 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:19,090 INFO L225 Difference]: With dead ends: 326 [2022-02-21 03:10:19,091 INFO L226 Difference]: Without dead ends: 182 [2022-02-21 03:10:19,091 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:10:19,092 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 165 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:19,093 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 383 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:10:19,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-02-21 03:10:19,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 151. [2022-02-21 03:10:19,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:19,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand has 151 states, 129 states have (on average 1.5271317829457365) internal successors, (197), 144 states have internal predecessors, (197), 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:10:19,108 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand has 151 states, 129 states have (on average 1.5271317829457365) internal successors, (197), 144 states have internal predecessors, (197), 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:10:19,109 INFO L87 Difference]: Start difference. First operand 182 states. Second operand has 151 states, 129 states have (on average 1.5271317829457365) internal successors, (197), 144 states have internal predecessors, (197), 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:10:19,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:19,114 INFO L93 Difference]: Finished difference Result 182 states and 239 transitions. [2022-02-21 03:10:19,115 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 239 transitions. [2022-02-21 03:10:19,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:19,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:19,116 INFO L74 IsIncluded]: Start isIncluded. First operand has 151 states, 129 states have (on average 1.5271317829457365) internal successors, (197), 144 states have internal predecessors, (197), 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 182 states. [2022-02-21 03:10:19,117 INFO L87 Difference]: Start difference. First operand has 151 states, 129 states have (on average 1.5271317829457365) internal successors, (197), 144 states have internal predecessors, (197), 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 182 states. [2022-02-21 03:10:19,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:19,122 INFO L93 Difference]: Finished difference Result 182 states and 239 transitions. [2022-02-21 03:10:19,122 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 239 transitions. [2022-02-21 03:10:19,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:19,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:19,123 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:19,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:19,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 129 states have (on average 1.5271317829457365) internal successors, (197), 144 states have internal predecessors, (197), 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:10:19,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 205 transitions. [2022-02-21 03:10:19,128 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 205 transitions. Word has length 14 [2022-02-21 03:10:19,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:19,129 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 205 transitions. [2022-02-21 03:10:19,129 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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:10:19,129 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 205 transitions. [2022-02-21 03:10:19,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-21 03:10:19,130 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:19,130 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:19,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 03:10:19,130 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-02-21 03:10:19,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:19,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1563632331, now seen corresponding path program 1 times [2022-02-21 03:10:19,131 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:19,131 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598795037] [2022-02-21 03:10:19,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:19,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:19,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:19,161 INFO L290 TraceCheckUtils]: 0: Hoare triple {3036#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(22, 2);call #Ultimate.allocInit(12, 3); {3036#true} is VALID [2022-02-21 03:10:19,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {3036#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_~sb~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_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {3036#true} is VALID [2022-02-21 03:10:19,161 INFO L272 TraceCheckUtils]: 2: Hoare triple {3036#true} call main_#t~ret22#1 := base2flt(0, 0); {3036#true} is VALID [2022-02-21 03:10:19,162 INFO L290 TraceCheckUtils]: 3: Hoare triple {3036#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {3036#true} is VALID [2022-02-21 03:10:19,162 INFO L290 TraceCheckUtils]: 4: Hoare triple {3036#true} assume !(0 == ~m % 4294967296); {3036#true} is VALID [2022-02-21 03:10:19,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {3036#true} assume !(~m % 4294967296 < 16777216); {3036#true} is VALID [2022-02-21 03:10:19,162 INFO L290 TraceCheckUtils]: 6: Hoare triple {3036#true} assume !false; {3036#true} is VALID [2022-02-21 03:10:19,163 INFO L290 TraceCheckUtils]: 7: Hoare triple {3036#true} assume ~m % 4294967296 >= 33554432; {3036#true} is VALID [2022-02-21 03:10:19,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {3036#true} assume !(~e >= 127); {3036#true} is VALID [2022-02-21 03:10:19,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {3036#true} assume 1 + ~e <= 2147483647; {3036#true} is VALID [2022-02-21 03:10:19,163 INFO L290 TraceCheckUtils]: 10: Hoare triple {3036#true} assume 1 + ~e >= -2147483648;~e := 1 + ~e;~m := ~m / 2; {3036#true} is VALID [2022-02-21 03:10:19,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {3036#true} assume !false; {3036#true} is VALID [2022-02-21 03:10:19,164 INFO L290 TraceCheckUtils]: 12: Hoare triple {3036#true} assume ~m % 4294967296 >= 33554432; {3036#true} is VALID [2022-02-21 03:10:19,164 INFO L290 TraceCheckUtils]: 13: Hoare triple {3036#true} assume !(~e >= 127); {3038#(<= base2flt_~e 126)} is VALID [2022-02-21 03:10:19,165 INFO L290 TraceCheckUtils]: 14: Hoare triple {3038#(<= base2flt_~e 126)} assume !(1 + ~e <= 2147483647); {3037#false} is VALID [2022-02-21 03:10:19,165 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-21 03:10:19,165 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:19,166 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598795037] [2022-02-21 03:10:19,166 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598795037] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:19,166 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:10:19,166 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:10:19,166 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921829121] [2022-02-21 03:10:19,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:19,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 15 [2022-02-21 03:10:19,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:19,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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:10:19,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:19,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:10:19,176 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:19,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:10:19,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:10:19,177 INFO L87 Difference]: Start difference. First operand 151 states and 205 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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:10:19,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:19,320 INFO L93 Difference]: Finished difference Result 159 states and 215 transitions. [2022-02-21 03:10:19,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:10:19,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 15 [2022-02-21 03:10:19,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:19,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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:10:19,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2022-02-21 03:10:19,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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:10:19,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2022-02-21 03:10:19,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 123 transitions. [2022-02-21 03:10:19,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:19,427 INFO L225 Difference]: With dead ends: 159 [2022-02-21 03:10:19,427 INFO L226 Difference]: Without dead ends: 158 [2022-02-21 03:10:19,428 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:10:19,429 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 5 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:19,429 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 210 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:10:19,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-02-21 03:10:19,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 149. [2022-02-21 03:10:19,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:19,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand has 149 states, 128 states have (on average 1.515625) internal successors, (194), 142 states have internal predecessors, (194), 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:10:19,451 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand has 149 states, 128 states have (on average 1.515625) internal successors, (194), 142 states have internal predecessors, (194), 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:10:19,451 INFO L87 Difference]: Start difference. First operand 158 states. Second operand has 149 states, 128 states have (on average 1.515625) internal successors, (194), 142 states have internal predecessors, (194), 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:10:19,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:19,468 INFO L93 Difference]: Finished difference Result 158 states and 213 transitions. [2022-02-21 03:10:19,468 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 213 transitions. [2022-02-21 03:10:19,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:19,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:19,470 INFO L74 IsIncluded]: Start isIncluded. First operand has 149 states, 128 states have (on average 1.515625) internal successors, (194), 142 states have internal predecessors, (194), 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 158 states. [2022-02-21 03:10:19,470 INFO L87 Difference]: Start difference. First operand has 149 states, 128 states have (on average 1.515625) internal successors, (194), 142 states have internal predecessors, (194), 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 158 states. [2022-02-21 03:10:19,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:19,475 INFO L93 Difference]: Finished difference Result 158 states and 213 transitions. [2022-02-21 03:10:19,475 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 213 transitions. [2022-02-21 03:10:19,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:19,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:19,476 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:19,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:19,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 128 states have (on average 1.515625) internal successors, (194), 142 states have internal predecessors, (194), 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:10:19,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 202 transitions. [2022-02-21 03:10:19,480 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 202 transitions. Word has length 15 [2022-02-21 03:10:19,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:19,480 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 202 transitions. [2022-02-21 03:10:19,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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:10:19,481 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 202 transitions. [2022-02-21 03:10:19,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-21 03:10:19,481 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:19,481 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:19,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-21 03:10:19,482 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-02-21 03:10:19,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:19,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1563634591, now seen corresponding path program 1 times [2022-02-21 03:10:19,482 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:19,483 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988278624] [2022-02-21 03:10:19,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:19,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:19,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:19,547 INFO L290 TraceCheckUtils]: 0: Hoare triple {3705#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(22, 2);call #Ultimate.allocInit(12, 3); {3705#true} is VALID [2022-02-21 03:10:19,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {3705#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_~sb~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_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {3705#true} is VALID [2022-02-21 03:10:19,548 INFO L272 TraceCheckUtils]: 2: Hoare triple {3705#true} call main_#t~ret22#1 := base2flt(0, 0); {3707#(= |base2flt_#in~e| 0)} is VALID [2022-02-21 03:10:19,548 INFO L290 TraceCheckUtils]: 3: Hoare triple {3707#(= |base2flt_#in~e| 0)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {3708#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:19,549 INFO L290 TraceCheckUtils]: 4: Hoare triple {3708#(= base2flt_~e 0)} assume !(0 == ~m % 4294967296); {3708#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:19,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {3708#(= base2flt_~e 0)} assume !(~m % 4294967296 < 16777216); {3708#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:19,550 INFO L290 TraceCheckUtils]: 6: Hoare triple {3708#(= base2flt_~e 0)} assume !false; {3708#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:19,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {3708#(= base2flt_~e 0)} assume ~m % 4294967296 >= 33554432; {3708#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:19,550 INFO L290 TraceCheckUtils]: 8: Hoare triple {3708#(= base2flt_~e 0)} assume !(~e >= 127); {3708#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:19,551 INFO L290 TraceCheckUtils]: 9: Hoare triple {3708#(= base2flt_~e 0)} assume 1 + ~e <= 2147483647; {3708#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:19,551 INFO L290 TraceCheckUtils]: 10: Hoare triple {3708#(= base2flt_~e 0)} assume 1 + ~e >= -2147483648;~e := 1 + ~e;~m := ~m / 2; {3709#(<= base2flt_~e 1)} is VALID [2022-02-21 03:10:19,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {3709#(<= base2flt_~e 1)} assume !false; {3709#(<= base2flt_~e 1)} is VALID [2022-02-21 03:10:19,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {3709#(<= base2flt_~e 1)} assume !(~m % 4294967296 >= 33554432); {3709#(<= base2flt_~e 1)} is VALID [2022-02-21 03:10:19,553 INFO L290 TraceCheckUtils]: 13: Hoare triple {3709#(<= base2flt_~e 1)} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {3709#(<= base2flt_~e 1)} is VALID [2022-02-21 03:10:19,554 INFO L290 TraceCheckUtils]: 14: Hoare triple {3709#(<= base2flt_~e 1)} assume !(128 + ~e <= 2147483647); {3706#false} is VALID [2022-02-21 03:10:19,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:19,554 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:19,554 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988278624] [2022-02-21 03:10:19,555 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988278624] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:19,555 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653749129] [2022-02-21 03:10:19,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:19,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:19,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:19,567 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:10:19,595 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:10:19,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:19,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:10:19,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:19,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:19,778 INFO L290 TraceCheckUtils]: 0: Hoare triple {3705#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(22, 2);call #Ultimate.allocInit(12, 3); {3705#true} is VALID [2022-02-21 03:10:19,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {3705#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_~sb~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_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {3705#true} is VALID [2022-02-21 03:10:19,778 INFO L272 TraceCheckUtils]: 2: Hoare triple {3705#true} call main_#t~ret22#1 := base2flt(0, 0); {3705#true} is VALID [2022-02-21 03:10:19,778 INFO L290 TraceCheckUtils]: 3: Hoare triple {3705#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {3705#true} is VALID [2022-02-21 03:10:19,779 INFO L290 TraceCheckUtils]: 4: Hoare triple {3705#true} assume !(0 == ~m % 4294967296); {3705#true} is VALID [2022-02-21 03:10:19,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {3705#true} assume !(~m % 4294967296 < 16777216); {3705#true} is VALID [2022-02-21 03:10:19,779 INFO L290 TraceCheckUtils]: 6: Hoare triple {3705#true} assume !false; {3705#true} is VALID [2022-02-21 03:10:19,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {3705#true} assume ~m % 4294967296 >= 33554432; {3705#true} is VALID [2022-02-21 03:10:19,780 INFO L290 TraceCheckUtils]: 8: Hoare triple {3705#true} assume !(~e >= 127); {3737#(not (<= 127 base2flt_~e))} is VALID [2022-02-21 03:10:19,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {3737#(not (<= 127 base2flt_~e))} assume 1 + ~e <= 2147483647; {3737#(not (<= 127 base2flt_~e))} is VALID [2022-02-21 03:10:19,785 INFO L290 TraceCheckUtils]: 10: Hoare triple {3737#(not (<= 127 base2flt_~e))} assume 1 + ~e >= -2147483648;~e := 1 + ~e;~m := ~m / 2; {3744#(< base2flt_~e 128)} is VALID [2022-02-21 03:10:19,785 INFO L290 TraceCheckUtils]: 11: Hoare triple {3744#(< base2flt_~e 128)} assume !false; {3744#(< base2flt_~e 128)} is VALID [2022-02-21 03:10:19,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {3744#(< base2flt_~e 128)} assume !(~m % 4294967296 >= 33554432); {3744#(< base2flt_~e 128)} is VALID [2022-02-21 03:10:19,786 INFO L290 TraceCheckUtils]: 13: Hoare triple {3744#(< base2flt_~e 128)} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {3744#(< base2flt_~e 128)} is VALID [2022-02-21 03:10:19,787 INFO L290 TraceCheckUtils]: 14: Hoare triple {3744#(< base2flt_~e 128)} assume !(128 + ~e <= 2147483647); {3706#false} is VALID [2022-02-21 03:10:19,787 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:10:19,787 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:10:19,787 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653749129] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:19,787 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:10:19,788 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-02-21 03:10:19,788 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231535326] [2022-02-21 03:10:19,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:19,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 15 [2022-02-21 03:10:19,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:19,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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:10:19,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:19,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:10:19,802 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:19,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:10:19,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:10:19,803 INFO L87 Difference]: Start difference. First operand 149 states and 202 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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:10:20,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:20,072 INFO L93 Difference]: Finished difference Result 187 states and 257 transitions. [2022-02-21 03:10:20,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:10:20,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 15 [2022-02-21 03:10:20,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:20,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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:10:20,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2022-02-21 03:10:20,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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:10:20,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2022-02-21 03:10:20,076 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 158 transitions. [2022-02-21 03:10:20,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:20,228 INFO L225 Difference]: With dead ends: 187 [2022-02-21 03:10:20,229 INFO L226 Difference]: Without dead ends: 185 [2022-02-21 03:10:20,229 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:10:20,230 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 27 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:20,234 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 241 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:10:20,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-02-21 03:10:20,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 151. [2022-02-21 03:10:20,257 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:20,257 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand has 151 states, 130 states have (on average 1.5076923076923077) internal successors, (196), 144 states have internal predecessors, (196), 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:10:20,258 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand has 151 states, 130 states have (on average 1.5076923076923077) internal successors, (196), 144 states have internal predecessors, (196), 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:10:20,259 INFO L87 Difference]: Start difference. First operand 185 states. Second operand has 151 states, 130 states have (on average 1.5076923076923077) internal successors, (196), 144 states have internal predecessors, (196), 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:10:20,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:20,265 INFO L93 Difference]: Finished difference Result 185 states and 253 transitions. [2022-02-21 03:10:20,265 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 253 transitions. [2022-02-21 03:10:20,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:20,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:20,266 INFO L74 IsIncluded]: Start isIncluded. First operand has 151 states, 130 states have (on average 1.5076923076923077) internal successors, (196), 144 states have internal predecessors, (196), 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 185 states. [2022-02-21 03:10:20,267 INFO L87 Difference]: Start difference. First operand has 151 states, 130 states have (on average 1.5076923076923077) internal successors, (196), 144 states have internal predecessors, (196), 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 185 states. [2022-02-21 03:10:20,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:20,272 INFO L93 Difference]: Finished difference Result 185 states and 253 transitions. [2022-02-21 03:10:20,272 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 253 transitions. [2022-02-21 03:10:20,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:20,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:20,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:20,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:20,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 130 states have (on average 1.5076923076923077) internal successors, (196), 144 states have internal predecessors, (196), 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:10:20,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 204 transitions. [2022-02-21 03:10:20,277 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 204 transitions. Word has length 15 [2022-02-21 03:10:20,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:20,277 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 204 transitions. [2022-02-21 03:10:20,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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:10:20,278 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 204 transitions. [2022-02-21 03:10:20,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-21 03:10:20,278 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:20,278 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:20,309 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:10:20,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-02-21 03:10:20,492 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-02-21 03:10:20,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:20,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1393735601, now seen corresponding path program 1 times [2022-02-21 03:10:20,492 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:20,492 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986254610] [2022-02-21 03:10:20,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:20,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:20,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:20,530 INFO L290 TraceCheckUtils]: 0: Hoare triple {4509#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(22, 2);call #Ultimate.allocInit(12, 3); {4509#true} is VALID [2022-02-21 03:10:20,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {4509#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_~sb~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_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {4509#true} is VALID [2022-02-21 03:10:20,531 INFO L272 TraceCheckUtils]: 2: Hoare triple {4509#true} call main_#t~ret22#1 := base2flt(0, 0); {4509#true} is VALID [2022-02-21 03:10:20,531 INFO L290 TraceCheckUtils]: 3: Hoare triple {4509#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {4509#true} is VALID [2022-02-21 03:10:20,531 INFO L290 TraceCheckUtils]: 4: Hoare triple {4509#true} assume !(0 == ~m % 4294967296); {4509#true} is VALID [2022-02-21 03:10:20,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {4509#true} assume ~m % 4294967296 < 16777216; {4509#true} is VALID [2022-02-21 03:10:20,532 INFO L290 TraceCheckUtils]: 6: Hoare triple {4509#true} assume !false; {4509#true} is VALID [2022-02-21 03:10:20,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {4509#true} assume !(~e <= -128); {4509#true} is VALID [2022-02-21 03:10:20,532 INFO L290 TraceCheckUtils]: 8: Hoare triple {4509#true} assume ~e - 1 <= 2147483647; {4509#true} is VALID [2022-02-21 03:10:20,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {4509#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {4509#true} is VALID [2022-02-21 03:10:20,533 INFO L290 TraceCheckUtils]: 10: Hoare triple {4509#true} assume ~m % 4294967296 < 16777216; {4509#true} is VALID [2022-02-21 03:10:20,533 INFO L290 TraceCheckUtils]: 11: Hoare triple {4509#true} assume !false; {4509#true} is VALID [2022-02-21 03:10:20,533 INFO L290 TraceCheckUtils]: 12: Hoare triple {4509#true} assume !(~e <= -128); {4511#(<= 0 (+ base2flt_~e 127))} is VALID [2022-02-21 03:10:20,534 INFO L290 TraceCheckUtils]: 13: Hoare triple {4511#(<= 0 (+ base2flt_~e 127))} assume ~e - 1 <= 2147483647; {4511#(<= 0 (+ base2flt_~e 127))} is VALID [2022-02-21 03:10:20,534 INFO L290 TraceCheckUtils]: 14: Hoare triple {4511#(<= 0 (+ base2flt_~e 127))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {4512#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:20,535 INFO L290 TraceCheckUtils]: 15: Hoare triple {4512#(<= 0 (+ 128 base2flt_~e))} assume !(~m % 4294967296 < 16777216); {4512#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:20,535 INFO L290 TraceCheckUtils]: 16: Hoare triple {4512#(<= 0 (+ 128 base2flt_~e))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {4512#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:20,536 INFO L290 TraceCheckUtils]: 17: Hoare triple {4512#(<= 0 (+ 128 base2flt_~e))} assume 128 + ~e <= 2147483647; {4512#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:20,536 INFO L290 TraceCheckUtils]: 18: Hoare triple {4512#(<= 0 (+ 128 base2flt_~e))} assume !(128 + ~e >= -2147483648); {4510#false} is VALID [2022-02-21 03:10:20,537 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:10:20,537 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:20,541 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986254610] [2022-02-21 03:10:20,541 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986254610] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:20,541 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:10:20,541 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:10:20,542 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887361768] [2022-02-21 03:10:20,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:20,542 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, (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 19 [2022-02-21 03:10:20,543 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:20,543 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, (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:10:20,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:20,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:10:20,555 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:20,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:10:20,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:10:20,556 INFO L87 Difference]: Start difference. First operand 151 states and 204 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, (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:10:20,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:20,856 INFO L93 Difference]: Finished difference Result 193 states and 266 transitions. [2022-02-21 03:10:20,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:10:20,856 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, (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 19 [2022-02-21 03:10:20,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:20,856 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, (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:10:20,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2022-02-21 03:10:20,858 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, (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:10:20,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2022-02-21 03:10:20,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 155 transitions. [2022-02-21 03:10:20,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:20,984 INFO L225 Difference]: With dead ends: 193 [2022-02-21 03:10:20,984 INFO L226 Difference]: Without dead ends: 190 [2022-02-21 03:10:20,984 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:10:20,985 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 27 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:20,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 313 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:10:20,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-02-21 03:10:21,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 156. [2022-02-21 03:10:21,010 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:21,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 190 states. Second operand has 156 states, 136 states have (on average 1.5) internal successors, (204), 149 states have internal predecessors, (204), 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:10:21,012 INFO L74 IsIncluded]: Start isIncluded. First operand 190 states. Second operand has 156 states, 136 states have (on average 1.5) internal successors, (204), 149 states have internal predecessors, (204), 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:10:21,012 INFO L87 Difference]: Start difference. First operand 190 states. Second operand has 156 states, 136 states have (on average 1.5) internal successors, (204), 149 states have internal predecessors, (204), 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:10:21,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:21,018 INFO L93 Difference]: Finished difference Result 190 states and 260 transitions. [2022-02-21 03:10:21,018 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 260 transitions. [2022-02-21 03:10:21,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:21,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:21,019 INFO L74 IsIncluded]: Start isIncluded. First operand has 156 states, 136 states have (on average 1.5) internal successors, (204), 149 states have internal predecessors, (204), 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 190 states. [2022-02-21 03:10:21,020 INFO L87 Difference]: Start difference. First operand has 156 states, 136 states have (on average 1.5) internal successors, (204), 149 states have internal predecessors, (204), 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 190 states. [2022-02-21 03:10:21,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:21,025 INFO L93 Difference]: Finished difference Result 190 states and 260 transitions. [2022-02-21 03:10:21,025 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 260 transitions. [2022-02-21 03:10:21,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:21,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:21,027 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:21,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:21,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 136 states have (on average 1.5) internal successors, (204), 149 states have internal predecessors, (204), 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:10:21,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 212 transitions. [2022-02-21 03:10:21,032 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 212 transitions. Word has length 19 [2022-02-21 03:10:21,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:21,032 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 212 transitions. [2022-02-21 03:10:21,032 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, (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:10:21,032 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 212 transitions. [2022-02-21 03:10:21,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-21 03:10:21,033 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:21,033 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:21,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-21 03:10:21,034 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-02-21 03:10:21,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:21,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1984698145, now seen corresponding path program 1 times [2022-02-21 03:10:21,034 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:21,035 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310074765] [2022-02-21 03:10:21,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:21,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:21,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:21,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:21,123 INFO L290 TraceCheckUtils]: 0: Hoare triple {5307#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5292#true} is VALID [2022-02-21 03:10:21,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {5292#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {5292#true} is VALID [2022-02-21 03:10:21,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {5292#true} #res := ~__retres4~0; {5292#true} is VALID [2022-02-21 03:10:21,124 INFO L290 TraceCheckUtils]: 3: Hoare triple {5292#true} assume true; {5292#true} is VALID [2022-02-21 03:10:21,125 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5292#true} {5294#(<= |ULTIMATE.start_main_~ea~2#1| 127)} #370#return; {5294#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:10:21,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:21,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:21,147 INFO L290 TraceCheckUtils]: 0: Hoare triple {5307#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5292#true} is VALID [2022-02-21 03:10:21,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {5292#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {5292#true} is VALID [2022-02-21 03:10:21,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {5292#true} #res := ~__retres4~0; {5292#true} is VALID [2022-02-21 03:10:21,148 INFO L290 TraceCheckUtils]: 3: Hoare triple {5292#true} assume true; {5292#true} is VALID [2022-02-21 03:10:21,149 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5292#true} {5294#(<= |ULTIMATE.start_main_~ea~2#1| 127)} #372#return; {5294#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:10:21,150 INFO L290 TraceCheckUtils]: 0: Hoare triple {5292#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(22, 2);call #Ultimate.allocInit(12, 3); {5292#true} is VALID [2022-02-21 03:10:21,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {5292#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_~sb~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_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {5294#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:10:21,152 INFO L272 TraceCheckUtils]: 2: Hoare triple {5294#(<= |ULTIMATE.start_main_~ea~2#1| 127)} call main_#t~ret22#1 := base2flt(0, 0); {5307#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:21,153 INFO L290 TraceCheckUtils]: 3: Hoare triple {5307#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5292#true} is VALID [2022-02-21 03:10:21,155 INFO L290 TraceCheckUtils]: 4: Hoare triple {5292#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {5292#true} is VALID [2022-02-21 03:10:21,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {5292#true} #res := ~__retres4~0; {5292#true} is VALID [2022-02-21 03:10:21,155 INFO L290 TraceCheckUtils]: 6: Hoare triple {5292#true} assume true; {5292#true} is VALID [2022-02-21 03:10:21,156 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5292#true} {5294#(<= |ULTIMATE.start_main_~ea~2#1| 127)} #370#return; {5294#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:10:21,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {5294#(<= |ULTIMATE.start_main_~ea~2#1| 127)} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {5294#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:10:21,157 INFO L272 TraceCheckUtils]: 9: Hoare triple {5294#(<= |ULTIMATE.start_main_~ea~2#1| 127)} call main_#t~ret23#1 := base2flt(1, 0); {5307#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:21,157 INFO L290 TraceCheckUtils]: 10: Hoare triple {5307#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5292#true} is VALID [2022-02-21 03:10:21,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {5292#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {5292#true} is VALID [2022-02-21 03:10:21,158 INFO L290 TraceCheckUtils]: 12: Hoare triple {5292#true} #res := ~__retres4~0; {5292#true} is VALID [2022-02-21 03:10:21,158 INFO L290 TraceCheckUtils]: 13: Hoare triple {5292#true} assume true; {5292#true} is VALID [2022-02-21 03:10:21,159 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {5292#true} {5294#(<= |ULTIMATE.start_main_~ea~2#1| 127)} #372#return; {5294#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:10:21,159 INFO L290 TraceCheckUtils]: 15: Hoare triple {5294#(<= |ULTIMATE.start_main_~ea~2#1| 127)} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {5294#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:10:21,160 INFO L272 TraceCheckUtils]: 16: Hoare triple {5294#(<= |ULTIMATE.start_main_~ea~2#1| 127)} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {5305#(<= |base2flt_#in~e| 127)} is VALID [2022-02-21 03:10:21,160 INFO L290 TraceCheckUtils]: 17: Hoare triple {5305#(<= |base2flt_#in~e| 127)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5306#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:21,161 INFO L290 TraceCheckUtils]: 18: Hoare triple {5306#(<= base2flt_~e 127)} assume !(0 == ~m % 4294967296); {5306#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:21,161 INFO L290 TraceCheckUtils]: 19: Hoare triple {5306#(<= base2flt_~e 127)} assume ~m % 4294967296 < 16777216; {5306#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:21,162 INFO L290 TraceCheckUtils]: 20: Hoare triple {5306#(<= base2flt_~e 127)} assume !false; {5306#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:21,162 INFO L290 TraceCheckUtils]: 21: Hoare triple {5306#(<= base2flt_~e 127)} assume !(~e <= -128); {5306#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:21,162 INFO L290 TraceCheckUtils]: 22: Hoare triple {5306#(<= base2flt_~e 127)} assume !(~e - 1 <= 2147483647); {5293#false} is VALID [2022-02-21 03:10:21,163 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-21 03:10:21,163 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:21,163 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310074765] [2022-02-21 03:10:21,163 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310074765] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:21,163 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800384997] [2022-02-21 03:10:21,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:21,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:21,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:21,165 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:10:21,166 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:10:21,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:21,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:10:21,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:21,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:21,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {5292#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(22, 2);call #Ultimate.allocInit(12, 3); {5292#true} is VALID [2022-02-21 03:10:21,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {5292#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_~sb~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_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {5294#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:10:21,336 INFO L272 TraceCheckUtils]: 2: Hoare triple {5294#(<= |ULTIMATE.start_main_~ea~2#1| 127)} call main_#t~ret22#1 := base2flt(0, 0); {5292#true} is VALID [2022-02-21 03:10:21,336 INFO L290 TraceCheckUtils]: 3: Hoare triple {5292#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5292#true} is VALID [2022-02-21 03:10:21,336 INFO L290 TraceCheckUtils]: 4: Hoare triple {5292#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {5292#true} is VALID [2022-02-21 03:10:21,337 INFO L290 TraceCheckUtils]: 5: Hoare triple {5292#true} #res := ~__retres4~0; {5292#true} is VALID [2022-02-21 03:10:21,337 INFO L290 TraceCheckUtils]: 6: Hoare triple {5292#true} assume true; {5292#true} is VALID [2022-02-21 03:10:21,338 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5292#true} {5294#(<= |ULTIMATE.start_main_~ea~2#1| 127)} #370#return; {5294#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:10:21,338 INFO L290 TraceCheckUtils]: 8: Hoare triple {5294#(<= |ULTIMATE.start_main_~ea~2#1| 127)} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {5294#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:10:21,338 INFO L272 TraceCheckUtils]: 9: Hoare triple {5294#(<= |ULTIMATE.start_main_~ea~2#1| 127)} call main_#t~ret23#1 := base2flt(1, 0); {5292#true} is VALID [2022-02-21 03:10:21,338 INFO L290 TraceCheckUtils]: 10: Hoare triple {5292#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5292#true} is VALID [2022-02-21 03:10:21,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {5292#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {5292#true} is VALID [2022-02-21 03:10:21,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {5292#true} #res := ~__retres4~0; {5292#true} is VALID [2022-02-21 03:10:21,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {5292#true} assume true; {5292#true} is VALID [2022-02-21 03:10:21,340 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {5292#true} {5294#(<= |ULTIMATE.start_main_~ea~2#1| 127)} #372#return; {5294#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:10:21,340 INFO L290 TraceCheckUtils]: 15: Hoare triple {5294#(<= |ULTIMATE.start_main_~ea~2#1| 127)} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {5294#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:10:21,341 INFO L272 TraceCheckUtils]: 16: Hoare triple {5294#(<= |ULTIMATE.start_main_~ea~2#1| 127)} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {5305#(<= |base2flt_#in~e| 127)} is VALID [2022-02-21 03:10:21,341 INFO L290 TraceCheckUtils]: 17: Hoare triple {5305#(<= |base2flt_#in~e| 127)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5306#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:21,342 INFO L290 TraceCheckUtils]: 18: Hoare triple {5306#(<= base2flt_~e 127)} assume !(0 == ~m % 4294967296); {5306#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:21,342 INFO L290 TraceCheckUtils]: 19: Hoare triple {5306#(<= base2flt_~e 127)} assume ~m % 4294967296 < 16777216; {5306#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:21,342 INFO L290 TraceCheckUtils]: 20: Hoare triple {5306#(<= base2flt_~e 127)} assume !false; {5306#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:21,343 INFO L290 TraceCheckUtils]: 21: Hoare triple {5306#(<= base2flt_~e 127)} assume !(~e <= -128); {5306#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:21,346 INFO L290 TraceCheckUtils]: 22: Hoare triple {5306#(<= base2flt_~e 127)} assume !(~e - 1 <= 2147483647); {5293#false} is VALID [2022-02-21 03:10:21,347 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-21 03:10:21,347 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:10:21,347 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800384997] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:21,347 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:10:21,347 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-02-21 03:10:21,348 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417501310] [2022-02-21 03:10:21,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:21,348 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 23 [2022-02-21 03:10:21,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:21,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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:10:21,367 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:10:21,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:10:21,367 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:21,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:10:21,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:10:21,368 INFO L87 Difference]: Start difference. First operand 156 states and 212 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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:10:21,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:21,704 INFO L93 Difference]: Finished difference Result 238 states and 331 transitions. [2022-02-21 03:10:21,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:10:21,705 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 23 [2022-02-21 03:10:21,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:21,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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:10:21,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 199 transitions. [2022-02-21 03:10:21,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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:10:21,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 199 transitions. [2022-02-21 03:10:21,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 199 transitions. [2022-02-21 03:10:21,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:21,884 INFO L225 Difference]: With dead ends: 238 [2022-02-21 03:10:21,884 INFO L226 Difference]: Without dead ends: 235 [2022-02-21 03:10:21,885 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 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:10:21,885 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 169 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:21,886 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 310 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:10:21,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-02-21 03:10:21,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 193. [2022-02-21 03:10:21,930 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:21,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 235 states. Second operand has 193 states, 172 states have (on average 1.5174418604651163) internal successors, (261), 185 states have internal predecessors, (261), 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:10:21,936 INFO L74 IsIncluded]: Start isIncluded. First operand 235 states. Second operand has 193 states, 172 states have (on average 1.5174418604651163) internal successors, (261), 185 states have internal predecessors, (261), 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:10:21,938 INFO L87 Difference]: Start difference. First operand 235 states. Second operand has 193 states, 172 states have (on average 1.5174418604651163) internal successors, (261), 185 states have internal predecessors, (261), 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:10:21,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:21,944 INFO L93 Difference]: Finished difference Result 235 states and 326 transitions. [2022-02-21 03:10:21,944 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 326 transitions. [2022-02-21 03:10:21,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:21,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:21,945 INFO L74 IsIncluded]: Start isIncluded. First operand has 193 states, 172 states have (on average 1.5174418604651163) internal successors, (261), 185 states have internal predecessors, (261), 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 235 states. [2022-02-21 03:10:21,946 INFO L87 Difference]: Start difference. First operand has 193 states, 172 states have (on average 1.5174418604651163) internal successors, (261), 185 states have internal predecessors, (261), 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 235 states. [2022-02-21 03:10:21,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:21,951 INFO L93 Difference]: Finished difference Result 235 states and 326 transitions. [2022-02-21 03:10:21,951 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 326 transitions. [2022-02-21 03:10:21,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:21,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:21,952 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:21,952 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:21,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 172 states have (on average 1.5174418604651163) internal successors, (261), 185 states have internal predecessors, (261), 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:10:21,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 269 transitions. [2022-02-21 03:10:21,957 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 269 transitions. Word has length 23 [2022-02-21 03:10:21,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:21,957 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 269 transitions. [2022-02-21 03:10:21,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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:10:21,958 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 269 transitions. [2022-02-21 03:10:21,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-21 03:10:21,958 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:21,958 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] [2022-02-21 03:10:21,987 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:10:22,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-02-21 03:10:22,182 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-02-21 03:10:22,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:22,183 INFO L85 PathProgramCache]: Analyzing trace with hash 558011975, now seen corresponding path program 1 times [2022-02-21 03:10:22,183 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:22,183 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721507521] [2022-02-21 03:10:22,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:22,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:22,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:22,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:22,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:22,240 INFO L290 TraceCheckUtils]: 0: Hoare triple {6355#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {6340#true} is VALID [2022-02-21 03:10:22,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {6340#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {6340#true} is VALID [2022-02-21 03:10:22,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {6340#true} #res := ~__retres4~0; {6340#true} is VALID [2022-02-21 03:10:22,241 INFO L290 TraceCheckUtils]: 3: Hoare triple {6340#true} assume true; {6340#true} is VALID [2022-02-21 03:10:22,241 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6340#true} {6342#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} #370#return; {6342#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:22,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:22,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:22,247 INFO L290 TraceCheckUtils]: 0: Hoare triple {6355#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {6340#true} is VALID [2022-02-21 03:10:22,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {6340#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {6340#true} is VALID [2022-02-21 03:10:22,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {6340#true} #res := ~__retres4~0; {6340#true} is VALID [2022-02-21 03:10:22,247 INFO L290 TraceCheckUtils]: 3: Hoare triple {6340#true} assume true; {6340#true} is VALID [2022-02-21 03:10:22,248 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6340#true} {6342#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} #372#return; {6342#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:22,248 INFO L290 TraceCheckUtils]: 0: Hoare triple {6340#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(22, 2);call #Ultimate.allocInit(12, 3); {6340#true} is VALID [2022-02-21 03:10:22,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {6340#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_~sb~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_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {6342#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:22,249 INFO L272 TraceCheckUtils]: 2: Hoare triple {6342#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret22#1 := base2flt(0, 0); {6355#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:22,250 INFO L290 TraceCheckUtils]: 3: Hoare triple {6355#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {6340#true} is VALID [2022-02-21 03:10:22,250 INFO L290 TraceCheckUtils]: 4: Hoare triple {6340#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {6340#true} is VALID [2022-02-21 03:10:22,250 INFO L290 TraceCheckUtils]: 5: Hoare triple {6340#true} #res := ~__retres4~0; {6340#true} is VALID [2022-02-21 03:10:22,250 INFO L290 TraceCheckUtils]: 6: Hoare triple {6340#true} assume true; {6340#true} is VALID [2022-02-21 03:10:22,251 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6340#true} {6342#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} #370#return; {6342#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:22,251 INFO L290 TraceCheckUtils]: 8: Hoare triple {6342#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {6342#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:22,252 INFO L272 TraceCheckUtils]: 9: Hoare triple {6342#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret23#1 := base2flt(1, 0); {6355#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:22,252 INFO L290 TraceCheckUtils]: 10: Hoare triple {6355#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {6340#true} is VALID [2022-02-21 03:10:22,253 INFO L290 TraceCheckUtils]: 11: Hoare triple {6340#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {6340#true} is VALID [2022-02-21 03:10:22,253 INFO L290 TraceCheckUtils]: 12: Hoare triple {6340#true} #res := ~__retres4~0; {6340#true} is VALID [2022-02-21 03:10:22,253 INFO L290 TraceCheckUtils]: 13: Hoare triple {6340#true} assume true; {6340#true} is VALID [2022-02-21 03:10:22,254 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {6340#true} {6342#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} #372#return; {6342#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:22,254 INFO L290 TraceCheckUtils]: 15: Hoare triple {6342#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {6342#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:22,255 INFO L272 TraceCheckUtils]: 16: Hoare triple {6342#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {6353#(<= 0 (+ 128 |base2flt_#in~e|))} is VALID [2022-02-21 03:10:22,257 INFO L290 TraceCheckUtils]: 17: Hoare triple {6353#(<= 0 (+ 128 |base2flt_#in~e|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {6354#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:22,258 INFO L290 TraceCheckUtils]: 18: Hoare triple {6354#(<= 0 (+ 128 base2flt_~e))} assume !(0 == ~m % 4294967296); {6354#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:22,258 INFO L290 TraceCheckUtils]: 19: Hoare triple {6354#(<= 0 (+ 128 base2flt_~e))} assume !(~m % 4294967296 < 16777216); {6354#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:22,259 INFO L290 TraceCheckUtils]: 20: Hoare triple {6354#(<= 0 (+ 128 base2flt_~e))} assume !false; {6354#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:22,259 INFO L290 TraceCheckUtils]: 21: Hoare triple {6354#(<= 0 (+ 128 base2flt_~e))} assume ~m % 4294967296 >= 33554432; {6354#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:22,259 INFO L290 TraceCheckUtils]: 22: Hoare triple {6354#(<= 0 (+ 128 base2flt_~e))} assume !(~e >= 127); {6354#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:22,260 INFO L290 TraceCheckUtils]: 23: Hoare triple {6354#(<= 0 (+ 128 base2flt_~e))} assume 1 + ~e <= 2147483647; {6354#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:22,260 INFO L290 TraceCheckUtils]: 24: Hoare triple {6354#(<= 0 (+ 128 base2flt_~e))} assume !(1 + ~e >= -2147483648); {6341#false} is VALID [2022-02-21 03:10:22,261 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-21 03:10:22,261 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:22,261 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721507521] [2022-02-21 03:10:22,261 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721507521] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:22,261 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300627434] [2022-02-21 03:10:22,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:22,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:22,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:22,263 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:10:22,292 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:10:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:22,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:10:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:22,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:22,434 INFO L290 TraceCheckUtils]: 0: Hoare triple {6340#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(22, 2);call #Ultimate.allocInit(12, 3); {6340#true} is VALID [2022-02-21 03:10:22,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {6340#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_~sb~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_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {6342#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:22,438 INFO L272 TraceCheckUtils]: 2: Hoare triple {6342#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret22#1 := base2flt(0, 0); {6340#true} is VALID [2022-02-21 03:10:22,439 INFO L290 TraceCheckUtils]: 3: Hoare triple {6340#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {6340#true} is VALID [2022-02-21 03:10:22,439 INFO L290 TraceCheckUtils]: 4: Hoare triple {6340#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {6340#true} is VALID [2022-02-21 03:10:22,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {6340#true} #res := ~__retres4~0; {6340#true} is VALID [2022-02-21 03:10:22,439 INFO L290 TraceCheckUtils]: 6: Hoare triple {6340#true} assume true; {6340#true} is VALID [2022-02-21 03:10:22,440 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6340#true} {6342#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} #370#return; {6342#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:22,440 INFO L290 TraceCheckUtils]: 8: Hoare triple {6342#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {6342#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:22,441 INFO L272 TraceCheckUtils]: 9: Hoare triple {6342#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret23#1 := base2flt(1, 0); {6340#true} is VALID [2022-02-21 03:10:22,441 INFO L290 TraceCheckUtils]: 10: Hoare triple {6340#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {6340#true} is VALID [2022-02-21 03:10:22,441 INFO L290 TraceCheckUtils]: 11: Hoare triple {6340#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {6340#true} is VALID [2022-02-21 03:10:22,441 INFO L290 TraceCheckUtils]: 12: Hoare triple {6340#true} #res := ~__retres4~0; {6340#true} is VALID [2022-02-21 03:10:22,441 INFO L290 TraceCheckUtils]: 13: Hoare triple {6340#true} assume true; {6340#true} is VALID [2022-02-21 03:10:22,442 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {6340#true} {6342#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} #372#return; {6342#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:22,443 INFO L290 TraceCheckUtils]: 15: Hoare triple {6342#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {6342#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:22,443 INFO L272 TraceCheckUtils]: 16: Hoare triple {6342#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {6353#(<= 0 (+ 128 |base2flt_#in~e|))} is VALID [2022-02-21 03:10:22,444 INFO L290 TraceCheckUtils]: 17: Hoare triple {6353#(<= 0 (+ 128 |base2flt_#in~e|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {6354#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:22,444 INFO L290 TraceCheckUtils]: 18: Hoare triple {6354#(<= 0 (+ 128 base2flt_~e))} assume !(0 == ~m % 4294967296); {6354#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:22,445 INFO L290 TraceCheckUtils]: 19: Hoare triple {6354#(<= 0 (+ 128 base2flt_~e))} assume !(~m % 4294967296 < 16777216); {6354#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:22,445 INFO L290 TraceCheckUtils]: 20: Hoare triple {6354#(<= 0 (+ 128 base2flt_~e))} assume !false; {6354#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:22,445 INFO L290 TraceCheckUtils]: 21: Hoare triple {6354#(<= 0 (+ 128 base2flt_~e))} assume ~m % 4294967296 >= 33554432; {6354#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:22,446 INFO L290 TraceCheckUtils]: 22: Hoare triple {6354#(<= 0 (+ 128 base2flt_~e))} assume !(~e >= 127); {6354#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:22,446 INFO L290 TraceCheckUtils]: 23: Hoare triple {6354#(<= 0 (+ 128 base2flt_~e))} assume 1 + ~e <= 2147483647; {6354#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:22,447 INFO L290 TraceCheckUtils]: 24: Hoare triple {6354#(<= 0 (+ 128 base2flt_~e))} assume !(1 + ~e >= -2147483648); {6341#false} is VALID [2022-02-21 03:10:22,447 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-21 03:10:22,447 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:10:22,447 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300627434] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:22,448 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:10:22,448 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-02-21 03:10:22,448 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807636903] [2022-02-21 03:10:22,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:22,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 25 [2022-02-21 03:10:22,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:22,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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:10:22,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:22,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:10:22,464 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:22,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:10:22,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:10:22,465 INFO L87 Difference]: Start difference. First operand 193 states and 269 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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:10:22,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:22,885 INFO L93 Difference]: Finished difference Result 226 states and 310 transitions. [2022-02-21 03:10:22,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:10:22,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 25 [2022-02-21 03:10:22,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:22,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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:10:22,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 192 transitions. [2022-02-21 03:10:22,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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:10:22,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 192 transitions. [2022-02-21 03:10:22,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 192 transitions. [2022-02-21 03:10:23,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:23,039 INFO L225 Difference]: With dead ends: 226 [2022-02-21 03:10:23,039 INFO L226 Difference]: Without dead ends: 223 [2022-02-21 03:10:23,040 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 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:10:23,040 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 149 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:23,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 320 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:10:23,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-02-21 03:10:23,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 185. [2022-02-21 03:10:23,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:23,084 INFO L82 GeneralOperation]: Start isEquivalent. First operand 223 states. Second operand has 185 states, 164 states have (on average 1.5) internal successors, (246), 177 states have internal predecessors, (246), 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:10:23,085 INFO L74 IsIncluded]: Start isIncluded. First operand 223 states. Second operand has 185 states, 164 states have (on average 1.5) internal successors, (246), 177 states have internal predecessors, (246), 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:10:23,085 INFO L87 Difference]: Start difference. First operand 223 states. Second operand has 185 states, 164 states have (on average 1.5) internal successors, (246), 177 states have internal predecessors, (246), 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:10:23,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:23,090 INFO L93 Difference]: Finished difference Result 223 states and 307 transitions. [2022-02-21 03:10:23,090 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 307 transitions. [2022-02-21 03:10:23,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:23,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:23,091 INFO L74 IsIncluded]: Start isIncluded. First operand has 185 states, 164 states have (on average 1.5) internal successors, (246), 177 states have internal predecessors, (246), 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 223 states. [2022-02-21 03:10:23,091 INFO L87 Difference]: Start difference. First operand has 185 states, 164 states have (on average 1.5) internal successors, (246), 177 states have internal predecessors, (246), 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 223 states. [2022-02-21 03:10:23,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:23,096 INFO L93 Difference]: Finished difference Result 223 states and 307 transitions. [2022-02-21 03:10:23,096 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 307 transitions. [2022-02-21 03:10:23,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:23,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:23,097 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:23,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:23,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 164 states have (on average 1.5) internal successors, (246), 177 states have internal predecessors, (246), 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:10:23,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 254 transitions. [2022-02-21 03:10:23,101 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 254 transitions. Word has length 25 [2022-02-21 03:10:23,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:23,101 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 254 transitions. [2022-02-21 03:10:23,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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:10:23,101 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 254 transitions. [2022-02-21 03:10:23,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-21 03:10:23,102 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:23,102 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:23,132 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:10:23,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:23,324 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-02-21 03:10:23,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:23,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1892329959, now seen corresponding path program 1 times [2022-02-21 03:10:23,324 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:23,324 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423264552] [2022-02-21 03:10:23,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:23,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:23,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:23,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:23,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:23,403 INFO L290 TraceCheckUtils]: 0: Hoare triple {7368#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {7348#true} is VALID [2022-02-21 03:10:23,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {7348#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {7348#true} is VALID [2022-02-21 03:10:23,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {7348#true} #res := ~__retres4~0; {7348#true} is VALID [2022-02-21 03:10:23,404 INFO L290 TraceCheckUtils]: 3: Hoare triple {7348#true} assume true; {7348#true} is VALID [2022-02-21 03:10:23,404 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {7348#true} {7350#(<= |ULTIMATE.start_main_~eb~2#1| 127)} #370#return; {7350#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:10:23,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:23,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:23,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {7368#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {7348#true} is VALID [2022-02-21 03:10:23,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {7348#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {7348#true} is VALID [2022-02-21 03:10:23,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {7348#true} #res := ~__retres4~0; {7348#true} is VALID [2022-02-21 03:10:23,412 INFO L290 TraceCheckUtils]: 3: Hoare triple {7348#true} assume true; {7348#true} is VALID [2022-02-21 03:10:23,413 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {7348#true} {7350#(<= |ULTIMATE.start_main_~eb~2#1| 127)} #372#return; {7350#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:10:23,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-21 03:10:23,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:23,421 INFO L290 TraceCheckUtils]: 0: Hoare triple {7368#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {7348#true} is VALID [2022-02-21 03:10:23,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {7348#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {7348#true} is VALID [2022-02-21 03:10:23,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {7348#true} #res := ~__retres4~0; {7348#true} is VALID [2022-02-21 03:10:23,422 INFO L290 TraceCheckUtils]: 3: Hoare triple {7348#true} assume true; {7348#true} is VALID [2022-02-21 03:10:23,423 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {7348#true} {7350#(<= |ULTIMATE.start_main_~eb~2#1| 127)} #374#return; {7350#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:10:23,423 INFO L290 TraceCheckUtils]: 0: Hoare triple {7348#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(22, 2);call #Ultimate.allocInit(12, 3); {7348#true} is VALID [2022-02-21 03:10:23,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {7348#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_~sb~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_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {7350#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:10:23,424 INFO L272 TraceCheckUtils]: 2: Hoare triple {7350#(<= |ULTIMATE.start_main_~eb~2#1| 127)} call main_#t~ret22#1 := base2flt(0, 0); {7368#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:23,424 INFO L290 TraceCheckUtils]: 3: Hoare triple {7368#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {7348#true} is VALID [2022-02-21 03:10:23,424 INFO L290 TraceCheckUtils]: 4: Hoare triple {7348#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {7348#true} is VALID [2022-02-21 03:10:23,425 INFO L290 TraceCheckUtils]: 5: Hoare triple {7348#true} #res := ~__retres4~0; {7348#true} is VALID [2022-02-21 03:10:23,425 INFO L290 TraceCheckUtils]: 6: Hoare triple {7348#true} assume true; {7348#true} is VALID [2022-02-21 03:10:23,425 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7348#true} {7350#(<= |ULTIMATE.start_main_~eb~2#1| 127)} #370#return; {7350#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:10:23,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {7350#(<= |ULTIMATE.start_main_~eb~2#1| 127)} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {7350#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:10:23,429 INFO L272 TraceCheckUtils]: 9: Hoare triple {7350#(<= |ULTIMATE.start_main_~eb~2#1| 127)} call main_#t~ret23#1 := base2flt(1, 0); {7368#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:23,429 INFO L290 TraceCheckUtils]: 10: Hoare triple {7368#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {7348#true} is VALID [2022-02-21 03:10:23,431 INFO L290 TraceCheckUtils]: 11: Hoare triple {7348#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {7348#true} is VALID [2022-02-21 03:10:23,431 INFO L290 TraceCheckUtils]: 12: Hoare triple {7348#true} #res := ~__retres4~0; {7348#true} is VALID [2022-02-21 03:10:23,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {7348#true} assume true; {7348#true} is VALID [2022-02-21 03:10:23,433 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {7348#true} {7350#(<= |ULTIMATE.start_main_~eb~2#1| 127)} #372#return; {7350#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:10:23,435 INFO L290 TraceCheckUtils]: 15: Hoare triple {7350#(<= |ULTIMATE.start_main_~eb~2#1| 127)} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {7350#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:10:23,436 INFO L272 TraceCheckUtils]: 16: Hoare triple {7350#(<= |ULTIMATE.start_main_~eb~2#1| 127)} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {7368#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:23,437 INFO L290 TraceCheckUtils]: 17: Hoare triple {7368#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {7348#true} is VALID [2022-02-21 03:10:23,437 INFO L290 TraceCheckUtils]: 18: Hoare triple {7348#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {7348#true} is VALID [2022-02-21 03:10:23,437 INFO L290 TraceCheckUtils]: 19: Hoare triple {7348#true} #res := ~__retres4~0; {7348#true} is VALID [2022-02-21 03:10:23,437 INFO L290 TraceCheckUtils]: 20: Hoare triple {7348#true} assume true; {7348#true} is VALID [2022-02-21 03:10:23,438 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7348#true} {7350#(<= |ULTIMATE.start_main_~eb~2#1| 127)} #374#return; {7350#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:10:23,438 INFO L290 TraceCheckUtils]: 22: Hoare triple {7350#(<= |ULTIMATE.start_main_~eb~2#1| 127)} main_~a~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {7350#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:10:23,439 INFO L272 TraceCheckUtils]: 23: Hoare triple {7350#(<= |ULTIMATE.start_main_~eb~2#1| 127)} call main_#t~ret25#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {7366#(<= |base2flt_#in~e| 127)} is VALID [2022-02-21 03:10:23,439 INFO L290 TraceCheckUtils]: 24: Hoare triple {7366#(<= |base2flt_#in~e| 127)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {7367#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:23,440 INFO L290 TraceCheckUtils]: 25: Hoare triple {7367#(<= base2flt_~e 127)} assume !(0 == ~m % 4294967296); {7367#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:23,440 INFO L290 TraceCheckUtils]: 26: Hoare triple {7367#(<= base2flt_~e 127)} assume ~m % 4294967296 < 16777216; {7367#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:23,440 INFO L290 TraceCheckUtils]: 27: Hoare triple {7367#(<= base2flt_~e 127)} assume !false; {7367#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:23,441 INFO L290 TraceCheckUtils]: 28: Hoare triple {7367#(<= base2flt_~e 127)} assume !(~e <= -128); {7367#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:23,441 INFO L290 TraceCheckUtils]: 29: Hoare triple {7367#(<= base2flt_~e 127)} assume !(~e - 1 <= 2147483647); {7349#false} is VALID [2022-02-21 03:10:23,442 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-21 03:10:23,442 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:23,443 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423264552] [2022-02-21 03:10:23,443 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423264552] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:23,443 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809206464] [2022-02-21 03:10:23,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:23,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:23,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:23,448 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:10:23,450 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:10:23,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:23,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:10:23,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:23,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:23,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {7348#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(22, 2);call #Ultimate.allocInit(12, 3); {7348#true} is VALID [2022-02-21 03:10:23,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {7348#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_~sb~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_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {7350#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:10:23,629 INFO L272 TraceCheckUtils]: 2: Hoare triple {7350#(<= |ULTIMATE.start_main_~eb~2#1| 127)} call main_#t~ret22#1 := base2flt(0, 0); {7348#true} is VALID [2022-02-21 03:10:23,629 INFO L290 TraceCheckUtils]: 3: Hoare triple {7348#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {7348#true} is VALID [2022-02-21 03:10:23,629 INFO L290 TraceCheckUtils]: 4: Hoare triple {7348#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {7348#true} is VALID [2022-02-21 03:10:23,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {7348#true} #res := ~__retres4~0; {7348#true} is VALID [2022-02-21 03:10:23,630 INFO L290 TraceCheckUtils]: 6: Hoare triple {7348#true} assume true; {7348#true} is VALID [2022-02-21 03:10:23,631 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7348#true} {7350#(<= |ULTIMATE.start_main_~eb~2#1| 127)} #370#return; {7350#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:10:23,631 INFO L290 TraceCheckUtils]: 8: Hoare triple {7350#(<= |ULTIMATE.start_main_~eb~2#1| 127)} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {7350#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:10:23,631 INFO L272 TraceCheckUtils]: 9: Hoare triple {7350#(<= |ULTIMATE.start_main_~eb~2#1| 127)} call main_#t~ret23#1 := base2flt(1, 0); {7348#true} is VALID [2022-02-21 03:10:23,631 INFO L290 TraceCheckUtils]: 10: Hoare triple {7348#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {7348#true} is VALID [2022-02-21 03:10:23,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {7348#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {7348#true} is VALID [2022-02-21 03:10:23,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {7348#true} #res := ~__retres4~0; {7348#true} is VALID [2022-02-21 03:10:23,632 INFO L290 TraceCheckUtils]: 13: Hoare triple {7348#true} assume true; {7348#true} is VALID [2022-02-21 03:10:23,633 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {7348#true} {7350#(<= |ULTIMATE.start_main_~eb~2#1| 127)} #372#return; {7350#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:10:23,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {7350#(<= |ULTIMATE.start_main_~eb~2#1| 127)} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {7350#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:10:23,633 INFO L272 TraceCheckUtils]: 16: Hoare triple {7350#(<= |ULTIMATE.start_main_~eb~2#1| 127)} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {7348#true} is VALID [2022-02-21 03:10:23,633 INFO L290 TraceCheckUtils]: 17: Hoare triple {7348#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {7348#true} is VALID [2022-02-21 03:10:23,633 INFO L290 TraceCheckUtils]: 18: Hoare triple {7348#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {7348#true} is VALID [2022-02-21 03:10:23,633 INFO L290 TraceCheckUtils]: 19: Hoare triple {7348#true} #res := ~__retres4~0; {7348#true} is VALID [2022-02-21 03:10:23,633 INFO L290 TraceCheckUtils]: 20: Hoare triple {7348#true} assume true; {7348#true} is VALID [2022-02-21 03:10:23,634 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7348#true} {7350#(<= |ULTIMATE.start_main_~eb~2#1| 127)} #374#return; {7350#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:10:23,634 INFO L290 TraceCheckUtils]: 22: Hoare triple {7350#(<= |ULTIMATE.start_main_~eb~2#1| 127)} main_~a~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {7350#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:10:23,635 INFO L272 TraceCheckUtils]: 23: Hoare triple {7350#(<= |ULTIMATE.start_main_~eb~2#1| 127)} call main_#t~ret25#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {7366#(<= |base2flt_#in~e| 127)} is VALID [2022-02-21 03:10:23,635 INFO L290 TraceCheckUtils]: 24: Hoare triple {7366#(<= |base2flt_#in~e| 127)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {7367#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:23,636 INFO L290 TraceCheckUtils]: 25: Hoare triple {7367#(<= base2flt_~e 127)} assume !(0 == ~m % 4294967296); {7367#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:23,636 INFO L290 TraceCheckUtils]: 26: Hoare triple {7367#(<= base2flt_~e 127)} assume ~m % 4294967296 < 16777216; {7367#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:23,636 INFO L290 TraceCheckUtils]: 27: Hoare triple {7367#(<= base2flt_~e 127)} assume !false; {7367#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:23,636 INFO L290 TraceCheckUtils]: 28: Hoare triple {7367#(<= base2flt_~e 127)} assume !(~e <= -128); {7367#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:23,637 INFO L290 TraceCheckUtils]: 29: Hoare triple {7367#(<= base2flt_~e 127)} assume !(~e - 1 <= 2147483647); {7349#false} is VALID [2022-02-21 03:10:23,637 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-21 03:10:23,637 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:10:23,638 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809206464] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:23,638 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:10:23,638 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-02-21 03:10:23,638 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271777468] [2022-02-21 03:10:23,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:23,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2022-02-21 03:10:23,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:23,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:23,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:23,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:10:23,655 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:23,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:10:23,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:10:23,656 INFO L87 Difference]: Start difference. First operand 185 states and 254 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:24,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:24,058 INFO L93 Difference]: Finished difference Result 215 states and 296 transitions. [2022-02-21 03:10:24,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:10:24,059 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2022-02-21 03:10:24,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:24,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:24,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 193 transitions. [2022-02-21 03:10:24,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:24,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 193 transitions. [2022-02-21 03:10:24,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 193 transitions. [2022-02-21 03:10:24,211 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:24,214 INFO L225 Difference]: With dead ends: 215 [2022-02-21 03:10:24,215 INFO L226 Difference]: Without dead ends: 212 [2022-02-21 03:10:24,215 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 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:10:24,215 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 167 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:24,216 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 299 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:10:24,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-02-21 03:10:24,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 173. [2022-02-21 03:10:24,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:24,273 INFO L82 GeneralOperation]: Start isEquivalent. First operand 212 states. Second operand has 173 states, 155 states have (on average 1.4580645161290322) internal successors, (226), 165 states have internal predecessors, (226), 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:10:24,274 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand has 173 states, 155 states have (on average 1.4580645161290322) internal successors, (226), 165 states have internal predecessors, (226), 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:10:24,275 INFO L87 Difference]: Start difference. First operand 212 states. Second operand has 173 states, 155 states have (on average 1.4580645161290322) internal successors, (226), 165 states have internal predecessors, (226), 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:10:24,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:24,279 INFO L93 Difference]: Finished difference Result 212 states and 291 transitions. [2022-02-21 03:10:24,280 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 291 transitions. [2022-02-21 03:10:24,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:24,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:24,281 INFO L74 IsIncluded]: Start isIncluded. First operand has 173 states, 155 states have (on average 1.4580645161290322) internal successors, (226), 165 states have internal predecessors, (226), 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 212 states. [2022-02-21 03:10:24,281 INFO L87 Difference]: Start difference. First operand has 173 states, 155 states have (on average 1.4580645161290322) internal successors, (226), 165 states have internal predecessors, (226), 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 212 states. [2022-02-21 03:10:24,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:24,286 INFO L93 Difference]: Finished difference Result 212 states and 291 transitions. [2022-02-21 03:10:24,286 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 291 transitions. [2022-02-21 03:10:24,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:24,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:24,287 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:24,287 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:24,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 155 states have (on average 1.4580645161290322) internal successors, (226), 165 states have internal predecessors, (226), 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:10:24,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 234 transitions. [2022-02-21 03:10:24,292 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 234 transitions. Word has length 30 [2022-02-21 03:10:24,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:24,292 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 234 transitions. [2022-02-21 03:10:24,292 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:24,292 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 234 transitions. [2022-02-21 03:10:24,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-21 03:10:24,295 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:24,295 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:24,324 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:10:24,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:24,519 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-02-21 03:10:24,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:24,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1649593009, now seen corresponding path program 1 times [2022-02-21 03:10:24,520 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:24,520 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021851822] [2022-02-21 03:10:24,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:24,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:24,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:24,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:24,573 INFO L290 TraceCheckUtils]: 0: Hoare triple {8347#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8327#true} is VALID [2022-02-21 03:10:24,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {8327#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {8327#true} is VALID [2022-02-21 03:10:24,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {8327#true} #res := ~__retres4~0; {8327#true} is VALID [2022-02-21 03:10:24,575 INFO L290 TraceCheckUtils]: 3: Hoare triple {8327#true} assume true; {8327#true} is VALID [2022-02-21 03:10:24,575 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {8327#true} {8329#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} #370#return; {8329#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:10:24,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:24,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:24,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {8347#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8327#true} is VALID [2022-02-21 03:10:24,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {8327#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {8327#true} is VALID [2022-02-21 03:10:24,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {8327#true} #res := ~__retres4~0; {8327#true} is VALID [2022-02-21 03:10:24,583 INFO L290 TraceCheckUtils]: 3: Hoare triple {8327#true} assume true; {8327#true} is VALID [2022-02-21 03:10:24,584 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {8327#true} {8329#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} #372#return; {8329#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:10:24,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-21 03:10:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:24,589 INFO L290 TraceCheckUtils]: 0: Hoare triple {8347#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8327#true} is VALID [2022-02-21 03:10:24,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {8327#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {8327#true} is VALID [2022-02-21 03:10:24,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {8327#true} #res := ~__retres4~0; {8327#true} is VALID [2022-02-21 03:10:24,590 INFO L290 TraceCheckUtils]: 3: Hoare triple {8327#true} assume true; {8327#true} is VALID [2022-02-21 03:10:24,591 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {8327#true} {8329#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} #374#return; {8329#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:10:24,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {8327#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(22, 2);call #Ultimate.allocInit(12, 3); {8327#true} is VALID [2022-02-21 03:10:24,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {8327#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_~sb~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_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {8329#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:10:24,592 INFO L272 TraceCheckUtils]: 2: Hoare triple {8329#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} call main_#t~ret22#1 := base2flt(0, 0); {8347#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:24,592 INFO L290 TraceCheckUtils]: 3: Hoare triple {8347#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8327#true} is VALID [2022-02-21 03:10:24,592 INFO L290 TraceCheckUtils]: 4: Hoare triple {8327#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {8327#true} is VALID [2022-02-21 03:10:24,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {8327#true} #res := ~__retres4~0; {8327#true} is VALID [2022-02-21 03:10:24,593 INFO L290 TraceCheckUtils]: 6: Hoare triple {8327#true} assume true; {8327#true} is VALID [2022-02-21 03:10:24,593 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {8327#true} {8329#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} #370#return; {8329#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:10:24,594 INFO L290 TraceCheckUtils]: 8: Hoare triple {8329#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {8329#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:10:24,594 INFO L272 TraceCheckUtils]: 9: Hoare triple {8329#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} call main_#t~ret23#1 := base2flt(1, 0); {8347#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:24,595 INFO L290 TraceCheckUtils]: 10: Hoare triple {8347#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8327#true} is VALID [2022-02-21 03:10:24,595 INFO L290 TraceCheckUtils]: 11: Hoare triple {8327#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {8327#true} is VALID [2022-02-21 03:10:24,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {8327#true} #res := ~__retres4~0; {8327#true} is VALID [2022-02-21 03:10:24,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {8327#true} assume true; {8327#true} is VALID [2022-02-21 03:10:24,596 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {8327#true} {8329#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} #372#return; {8329#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:10:24,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {8329#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {8329#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:10:24,597 INFO L272 TraceCheckUtils]: 16: Hoare triple {8329#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {8347#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:24,597 INFO L290 TraceCheckUtils]: 17: Hoare triple {8347#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8327#true} is VALID [2022-02-21 03:10:24,597 INFO L290 TraceCheckUtils]: 18: Hoare triple {8327#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {8327#true} is VALID [2022-02-21 03:10:24,597 INFO L290 TraceCheckUtils]: 19: Hoare triple {8327#true} #res := ~__retres4~0; {8327#true} is VALID [2022-02-21 03:10:24,598 INFO L290 TraceCheckUtils]: 20: Hoare triple {8327#true} assume true; {8327#true} is VALID [2022-02-21 03:10:24,598 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8327#true} {8329#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} #374#return; {8329#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:10:24,599 INFO L290 TraceCheckUtils]: 22: Hoare triple {8329#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} main_~a~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {8329#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:10:24,599 INFO L272 TraceCheckUtils]: 23: Hoare triple {8329#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} call main_#t~ret25#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {8345#(<= 0 (+ 128 |base2flt_#in~e|))} is VALID [2022-02-21 03:10:24,600 INFO L290 TraceCheckUtils]: 24: Hoare triple {8345#(<= 0 (+ 128 |base2flt_#in~e|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8346#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:24,600 INFO L290 TraceCheckUtils]: 25: Hoare triple {8346#(<= 0 (+ 128 base2flt_~e))} assume !(0 == ~m % 4294967296); {8346#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:24,601 INFO L290 TraceCheckUtils]: 26: Hoare triple {8346#(<= 0 (+ 128 base2flt_~e))} assume !(~m % 4294967296 < 16777216); {8346#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:24,601 INFO L290 TraceCheckUtils]: 27: Hoare triple {8346#(<= 0 (+ 128 base2flt_~e))} assume !false; {8346#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:24,602 INFO L290 TraceCheckUtils]: 28: Hoare triple {8346#(<= 0 (+ 128 base2flt_~e))} assume ~m % 4294967296 >= 33554432; {8346#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:24,602 INFO L290 TraceCheckUtils]: 29: Hoare triple {8346#(<= 0 (+ 128 base2flt_~e))} assume !(~e >= 127); {8346#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:24,602 INFO L290 TraceCheckUtils]: 30: Hoare triple {8346#(<= 0 (+ 128 base2flt_~e))} assume 1 + ~e <= 2147483647; {8346#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:24,603 INFO L290 TraceCheckUtils]: 31: Hoare triple {8346#(<= 0 (+ 128 base2flt_~e))} assume !(1 + ~e >= -2147483648); {8328#false} is VALID [2022-02-21 03:10:24,603 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-21 03:10:24,603 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:24,604 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021851822] [2022-02-21 03:10:24,604 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021851822] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:24,604 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647862676] [2022-02-21 03:10:24,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:24,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:24,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:24,606 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:10:24,635 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:10:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:24,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:10:24,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:24,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:24,819 INFO L290 TraceCheckUtils]: 0: Hoare triple {8327#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(22, 2);call #Ultimate.allocInit(12, 3); {8327#true} is VALID [2022-02-21 03:10:24,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {8327#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_~sb~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_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {8329#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:10:24,819 INFO L272 TraceCheckUtils]: 2: Hoare triple {8329#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} call main_#t~ret22#1 := base2flt(0, 0); {8327#true} is VALID [2022-02-21 03:10:24,820 INFO L290 TraceCheckUtils]: 3: Hoare triple {8327#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8327#true} is VALID [2022-02-21 03:10:24,820 INFO L290 TraceCheckUtils]: 4: Hoare triple {8327#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {8327#true} is VALID [2022-02-21 03:10:24,820 INFO L290 TraceCheckUtils]: 5: Hoare triple {8327#true} #res := ~__retres4~0; {8327#true} is VALID [2022-02-21 03:10:24,820 INFO L290 TraceCheckUtils]: 6: Hoare triple {8327#true} assume true; {8327#true} is VALID [2022-02-21 03:10:24,821 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {8327#true} {8329#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} #370#return; {8329#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:10:24,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {8329#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {8329#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:10:24,821 INFO L272 TraceCheckUtils]: 9: Hoare triple {8329#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} call main_#t~ret23#1 := base2flt(1, 0); {8327#true} is VALID [2022-02-21 03:10:24,822 INFO L290 TraceCheckUtils]: 10: Hoare triple {8327#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8327#true} is VALID [2022-02-21 03:10:24,822 INFO L290 TraceCheckUtils]: 11: Hoare triple {8327#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {8327#true} is VALID [2022-02-21 03:10:24,822 INFO L290 TraceCheckUtils]: 12: Hoare triple {8327#true} #res := ~__retres4~0; {8327#true} is VALID [2022-02-21 03:10:24,822 INFO L290 TraceCheckUtils]: 13: Hoare triple {8327#true} assume true; {8327#true} is VALID [2022-02-21 03:10:24,823 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {8327#true} {8329#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} #372#return; {8329#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:10:24,824 INFO L290 TraceCheckUtils]: 15: Hoare triple {8329#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {8329#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:10:24,824 INFO L272 TraceCheckUtils]: 16: Hoare triple {8329#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {8327#true} is VALID [2022-02-21 03:10:24,824 INFO L290 TraceCheckUtils]: 17: Hoare triple {8327#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8327#true} is VALID [2022-02-21 03:10:24,824 INFO L290 TraceCheckUtils]: 18: Hoare triple {8327#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {8327#true} is VALID [2022-02-21 03:10:24,824 INFO L290 TraceCheckUtils]: 19: Hoare triple {8327#true} #res := ~__retres4~0; {8327#true} is VALID [2022-02-21 03:10:24,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {8327#true} assume true; {8327#true} is VALID [2022-02-21 03:10:24,825 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8327#true} {8329#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} #374#return; {8329#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:10:24,826 INFO L290 TraceCheckUtils]: 22: Hoare triple {8329#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} main_~a~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {8329#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:10:24,826 INFO L272 TraceCheckUtils]: 23: Hoare triple {8329#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} call main_#t~ret25#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {8345#(<= 0 (+ 128 |base2flt_#in~e|))} is VALID [2022-02-21 03:10:24,827 INFO L290 TraceCheckUtils]: 24: Hoare triple {8345#(<= 0 (+ 128 |base2flt_#in~e|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8346#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:24,827 INFO L290 TraceCheckUtils]: 25: Hoare triple {8346#(<= 0 (+ 128 base2flt_~e))} assume !(0 == ~m % 4294967296); {8346#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:24,828 INFO L290 TraceCheckUtils]: 26: Hoare triple {8346#(<= 0 (+ 128 base2flt_~e))} assume !(~m % 4294967296 < 16777216); {8346#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:24,828 INFO L290 TraceCheckUtils]: 27: Hoare triple {8346#(<= 0 (+ 128 base2flt_~e))} assume !false; {8346#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:24,829 INFO L290 TraceCheckUtils]: 28: Hoare triple {8346#(<= 0 (+ 128 base2flt_~e))} assume ~m % 4294967296 >= 33554432; {8346#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:24,829 INFO L290 TraceCheckUtils]: 29: Hoare triple {8346#(<= 0 (+ 128 base2flt_~e))} assume !(~e >= 127); {8346#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:24,832 INFO L290 TraceCheckUtils]: 30: Hoare triple {8346#(<= 0 (+ 128 base2flt_~e))} assume 1 + ~e <= 2147483647; {8346#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:24,832 INFO L290 TraceCheckUtils]: 31: Hoare triple {8346#(<= 0 (+ 128 base2flt_~e))} assume !(1 + ~e >= -2147483648); {8328#false} is VALID [2022-02-21 03:10:24,833 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-21 03:10:24,833 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:10:24,833 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647862676] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:24,833 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:10:24,833 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-02-21 03:10:24,834 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016006672] [2022-02-21 03:10:24,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:24,834 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2022-02-21 03:10:24,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:24,835 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:24,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:24,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:10:24,860 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:24,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:10:24,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:10:24,861 INFO L87 Difference]: Start difference. First operand 173 states and 234 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:25,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:25,266 INFO L93 Difference]: Finished difference Result 203 states and 275 transitions. [2022-02-21 03:10:25,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:10:25,266 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2022-02-21 03:10:25,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:25,267 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:25,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 186 transitions. [2022-02-21 03:10:25,269 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:25,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 186 transitions. [2022-02-21 03:10:25,270 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 186 transitions. [2022-02-21 03:10:25,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:25,424 INFO L225 Difference]: With dead ends: 203 [2022-02-21 03:10:25,424 INFO L226 Difference]: Without dead ends: 200 [2022-02-21 03:10:25,424 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 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:10:25,425 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 147 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:25,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 305 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:10:25,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-02-21 03:10:25,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 162. [2022-02-21 03:10:25,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:25,484 INFO L82 GeneralOperation]: Start isEquivalent. First operand 200 states. Second operand has 162 states, 147 states have (on average 1.435374149659864) internal successors, (211), 154 states have internal predecessors, (211), 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:10:25,484 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand has 162 states, 147 states have (on average 1.435374149659864) internal successors, (211), 154 states have internal predecessors, (211), 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:10:25,485 INFO L87 Difference]: Start difference. First operand 200 states. Second operand has 162 states, 147 states have (on average 1.435374149659864) internal successors, (211), 154 states have internal predecessors, (211), 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:10:25,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:25,489 INFO L93 Difference]: Finished difference Result 200 states and 272 transitions. [2022-02-21 03:10:25,489 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 272 transitions. [2022-02-21 03:10:25,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:25,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:25,490 INFO L74 IsIncluded]: Start isIncluded. First operand has 162 states, 147 states have (on average 1.435374149659864) internal successors, (211), 154 states have internal predecessors, (211), 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 200 states. [2022-02-21 03:10:25,491 INFO L87 Difference]: Start difference. First operand has 162 states, 147 states have (on average 1.435374149659864) internal successors, (211), 154 states have internal predecessors, (211), 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 200 states. [2022-02-21 03:10:25,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:25,495 INFO L93 Difference]: Finished difference Result 200 states and 272 transitions. [2022-02-21 03:10:25,495 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 272 transitions. [2022-02-21 03:10:25,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:25,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:25,496 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:25,496 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:25,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 147 states have (on average 1.435374149659864) internal successors, (211), 154 states have internal predecessors, (211), 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:10:25,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 219 transitions. [2022-02-21 03:10:25,499 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 219 transitions. Word has length 32 [2022-02-21 03:10:25,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:25,499 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 219 transitions. [2022-02-21 03:10:25,500 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:25,500 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 219 transitions. [2022-02-21 03:10:25,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-21 03:10:25,500 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:25,500 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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:25,530 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:10:25,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-02-21 03:10:25,728 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-02-21 03:10:25,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:25,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1309482490, now seen corresponding path program 1 times [2022-02-21 03:10:25,728 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:25,728 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200231282] [2022-02-21 03:10:25,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:25,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:25,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:25,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:25,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:25,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {9285#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9263#true} is VALID [2022-02-21 03:10:25,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {9263#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {9263#true} is VALID [2022-02-21 03:10:25,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {9263#true} #res := ~__retres4~0; {9263#true} is VALID [2022-02-21 03:10:25,767 INFO L290 TraceCheckUtils]: 3: Hoare triple {9263#true} assume true; {9263#true} is VALID [2022-02-21 03:10:25,767 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {9263#true} {9263#true} #370#return; {9263#true} is VALID [2022-02-21 03:10:25,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:25,793 INFO L290 TraceCheckUtils]: 0: Hoare triple {9285#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9286#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:25,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {9286#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {9287#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:25,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {9287#(not (= |base2flt_#in~m| 1))} #res := ~__retres4~0; {9287#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:25,795 INFO L290 TraceCheckUtils]: 3: Hoare triple {9287#(not (= |base2flt_#in~m| 1))} assume true; {9287#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:25,795 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {9287#(not (= |base2flt_#in~m| 1))} {9263#true} #372#return; {9264#false} is VALID [2022-02-21 03:10:25,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-21 03:10:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:25,806 INFO L290 TraceCheckUtils]: 0: Hoare triple {9285#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9263#true} is VALID [2022-02-21 03:10:25,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {9263#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {9263#true} is VALID [2022-02-21 03:10:25,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {9263#true} #res := ~__retres4~0; {9263#true} is VALID [2022-02-21 03:10:25,806 INFO L290 TraceCheckUtils]: 3: Hoare triple {9263#true} assume true; {9263#true} is VALID [2022-02-21 03:10:25,806 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {9263#true} {9264#false} #374#return; {9264#false} is VALID [2022-02-21 03:10:25,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-21 03:10:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:25,811 INFO L290 TraceCheckUtils]: 0: Hoare triple {9285#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9263#true} is VALID [2022-02-21 03:10:25,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {9263#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {9263#true} is VALID [2022-02-21 03:10:25,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {9263#true} #res := ~__retres4~0; {9263#true} is VALID [2022-02-21 03:10:25,811 INFO L290 TraceCheckUtils]: 3: Hoare triple {9263#true} assume true; {9263#true} is VALID [2022-02-21 03:10:25,811 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {9263#true} {9264#false} #376#return; {9264#false} is VALID [2022-02-21 03:10:25,811 INFO L290 TraceCheckUtils]: 0: Hoare triple {9263#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(22, 2);call #Ultimate.allocInit(12, 3); {9263#true} is VALID [2022-02-21 03:10:25,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {9263#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_~sb~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_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {9263#true} is VALID [2022-02-21 03:10:25,812 INFO L272 TraceCheckUtils]: 2: Hoare triple {9263#true} call main_#t~ret22#1 := base2flt(0, 0); {9285#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:25,812 INFO L290 TraceCheckUtils]: 3: Hoare triple {9285#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9263#true} is VALID [2022-02-21 03:10:25,812 INFO L290 TraceCheckUtils]: 4: Hoare triple {9263#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {9263#true} is VALID [2022-02-21 03:10:25,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {9263#true} #res := ~__retres4~0; {9263#true} is VALID [2022-02-21 03:10:25,812 INFO L290 TraceCheckUtils]: 6: Hoare triple {9263#true} assume true; {9263#true} is VALID [2022-02-21 03:10:25,813 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {9263#true} {9263#true} #370#return; {9263#true} is VALID [2022-02-21 03:10:25,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {9263#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {9263#true} is VALID [2022-02-21 03:10:25,813 INFO L272 TraceCheckUtils]: 9: Hoare triple {9263#true} call main_#t~ret23#1 := base2flt(1, 0); {9285#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:25,814 INFO L290 TraceCheckUtils]: 10: Hoare triple {9285#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9286#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:25,814 INFO L290 TraceCheckUtils]: 11: Hoare triple {9286#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {9287#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:25,815 INFO L290 TraceCheckUtils]: 12: Hoare triple {9287#(not (= |base2flt_#in~m| 1))} #res := ~__retres4~0; {9287#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:25,815 INFO L290 TraceCheckUtils]: 13: Hoare triple {9287#(not (= |base2flt_#in~m| 1))} assume true; {9287#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:25,816 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {9287#(not (= |base2flt_#in~m| 1))} {9263#true} #372#return; {9264#false} is VALID [2022-02-21 03:10:25,816 INFO L290 TraceCheckUtils]: 15: Hoare triple {9264#false} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {9264#false} is VALID [2022-02-21 03:10:25,816 INFO L272 TraceCheckUtils]: 16: Hoare triple {9264#false} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {9285#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:25,816 INFO L290 TraceCheckUtils]: 17: Hoare triple {9285#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9263#true} is VALID [2022-02-21 03:10:25,816 INFO L290 TraceCheckUtils]: 18: Hoare triple {9263#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {9263#true} is VALID [2022-02-21 03:10:25,816 INFO L290 TraceCheckUtils]: 19: Hoare triple {9263#true} #res := ~__retres4~0; {9263#true} is VALID [2022-02-21 03:10:25,816 INFO L290 TraceCheckUtils]: 20: Hoare triple {9263#true} assume true; {9263#true} is VALID [2022-02-21 03:10:25,816 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {9263#true} {9264#false} #374#return; {9264#false} is VALID [2022-02-21 03:10:25,816 INFO L290 TraceCheckUtils]: 22: Hoare triple {9264#false} main_~a~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {9264#false} is VALID [2022-02-21 03:10:25,817 INFO L272 TraceCheckUtils]: 23: Hoare triple {9264#false} call main_#t~ret25#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {9285#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:25,817 INFO L290 TraceCheckUtils]: 24: Hoare triple {9285#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9263#true} is VALID [2022-02-21 03:10:25,817 INFO L290 TraceCheckUtils]: 25: Hoare triple {9263#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {9263#true} is VALID [2022-02-21 03:10:25,817 INFO L290 TraceCheckUtils]: 26: Hoare triple {9263#true} #res := ~__retres4~0; {9263#true} is VALID [2022-02-21 03:10:25,817 INFO L290 TraceCheckUtils]: 27: Hoare triple {9263#true} assume true; {9263#true} is VALID [2022-02-21 03:10:25,817 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {9263#true} {9264#false} #376#return; {9264#false} is VALID [2022-02-21 03:10:25,818 INFO L290 TraceCheckUtils]: 29: Hoare triple {9264#false} main_~b~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {9264#false} is VALID [2022-02-21 03:10:25,819 INFO L290 TraceCheckUtils]: 30: Hoare triple {9264#false} assume main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sb~0#1 := -1; {9264#false} is VALID [2022-02-21 03:10:25,819 INFO L290 TraceCheckUtils]: 31: Hoare triple {9264#false} assume { :begin_inline_mulflt } true;mulflt_#in~a#1, mulflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mulflt_#res#1;havoc mulflt_#t~nondet12#1, mulflt_#t~nondet13#1, mulflt_#t~nondet14#1, mulflt_#t~nondet15#1, mulflt_#t~nondet16#1, mulflt_#t~nondet17#1, mulflt_~a#1, mulflt_~b#1, mulflt_~res~2#1, mulflt_~ma~1#1, mulflt_~mb~1#1, mulflt_~accu~0#1, mulflt_~ea~1#1, mulflt_~eb~1#1, mulflt_~tmp~1#1, mulflt_~__retres10~1#1;mulflt_~a#1 := mulflt_#in~a#1;mulflt_~b#1 := mulflt_#in~b#1;havoc mulflt_~res~2#1;havoc mulflt_~ma~1#1;havoc mulflt_~mb~1#1;havoc mulflt_~accu~0#1;havoc mulflt_~ea~1#1;havoc mulflt_~eb~1#1;havoc mulflt_~tmp~1#1;havoc mulflt_~__retres10~1#1; {9264#false} is VALID [2022-02-21 03:10:25,819 INFO L290 TraceCheckUtils]: 32: Hoare triple {9264#false} assume mulflt_~a#1 % 4294967296 < mulflt_~b#1 % 4294967296;mulflt_~tmp~1#1 := mulflt_~a#1;mulflt_~a#1 := mulflt_~b#1;mulflt_~b#1 := mulflt_~tmp~1#1; {9264#false} is VALID [2022-02-21 03:10:25,819 INFO L290 TraceCheckUtils]: 33: Hoare triple {9264#false} assume !(0 == mulflt_~b#1 % 4294967296); {9264#false} is VALID [2022-02-21 03:10:25,819 INFO L290 TraceCheckUtils]: 34: Hoare triple {9264#false} assume 0 == mulflt_~a#1;mulflt_~ma~1#1 := 0; {9264#false} is VALID [2022-02-21 03:10:25,823 INFO L290 TraceCheckUtils]: 35: Hoare triple {9264#false} assume (if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {9264#false} is VALID [2022-02-21 03:10:25,824 INFO L290 TraceCheckUtils]: 36: Hoare triple {9264#false} assume !((if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {9264#false} is VALID [2022-02-21 03:10:25,824 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-02-21 03:10:25,824 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:25,825 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200231282] [2022-02-21 03:10:25,825 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200231282] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:25,825 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807721593] [2022-02-21 03:10:25,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:25,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:25,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:25,828 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:10:25,851 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:10:25,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:25,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-21 03:10:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:25,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:26,086 INFO L290 TraceCheckUtils]: 0: Hoare triple {9263#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(22, 2);call #Ultimate.allocInit(12, 3); {9263#true} is VALID [2022-02-21 03:10:26,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {9263#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_~sb~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_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {9263#true} is VALID [2022-02-21 03:10:26,086 INFO L272 TraceCheckUtils]: 2: Hoare triple {9263#true} call main_#t~ret22#1 := base2flt(0, 0); {9263#true} is VALID [2022-02-21 03:10:26,088 INFO L290 TraceCheckUtils]: 3: Hoare triple {9263#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9300#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:26,088 INFO L290 TraceCheckUtils]: 4: Hoare triple {9300#(= base2flt_~m |base2flt_#in~m|)} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {9304#(<= (mod |base2flt_#in~m| 4294967296) 0)} is VALID [2022-02-21 03:10:26,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {9304#(<= (mod |base2flt_#in~m| 4294967296) 0)} #res := ~__retres4~0; {9304#(<= (mod |base2flt_#in~m| 4294967296) 0)} is VALID [2022-02-21 03:10:26,089 INFO L290 TraceCheckUtils]: 6: Hoare triple {9304#(<= (mod |base2flt_#in~m| 4294967296) 0)} assume true; {9304#(<= (mod |base2flt_#in~m| 4294967296) 0)} is VALID [2022-02-21 03:10:26,089 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {9304#(<= (mod |base2flt_#in~m| 4294967296) 0)} {9263#true} #370#return; {9263#true} is VALID [2022-02-21 03:10:26,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {9263#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {9263#true} is VALID [2022-02-21 03:10:26,089 INFO L272 TraceCheckUtils]: 9: Hoare triple {9263#true} call main_#t~ret23#1 := base2flt(1, 0); {9263#true} is VALID [2022-02-21 03:10:26,090 INFO L290 TraceCheckUtils]: 10: Hoare triple {9263#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9263#true} is VALID [2022-02-21 03:10:26,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {9263#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {9263#true} is VALID [2022-02-21 03:10:26,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {9263#true} #res := ~__retres4~0; {9263#true} is VALID [2022-02-21 03:10:26,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {9263#true} assume true; {9263#true} is VALID [2022-02-21 03:10:26,090 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {9263#true} {9263#true} #372#return; {9263#true} is VALID [2022-02-21 03:10:26,090 INFO L290 TraceCheckUtils]: 15: Hoare triple {9263#true} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {9263#true} is VALID [2022-02-21 03:10:26,090 INFO L272 TraceCheckUtils]: 16: Hoare triple {9263#true} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {9263#true} is VALID [2022-02-21 03:10:26,090 INFO L290 TraceCheckUtils]: 17: Hoare triple {9263#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9263#true} is VALID [2022-02-21 03:10:26,091 INFO L290 TraceCheckUtils]: 18: Hoare triple {9263#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {9347#(= base2flt_~__retres4~0 0)} is VALID [2022-02-21 03:10:26,092 INFO L290 TraceCheckUtils]: 19: Hoare triple {9347#(= base2flt_~__retres4~0 0)} #res := ~__retres4~0; {9351#(= |base2flt_#res| 0)} is VALID [2022-02-21 03:10:26,092 INFO L290 TraceCheckUtils]: 20: Hoare triple {9351#(= |base2flt_#res| 0)} assume true; {9351#(= |base2flt_#res| 0)} is VALID [2022-02-21 03:10:26,093 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {9351#(= |base2flt_#res| 0)} {9263#true} #374#return; {9358#(= |ULTIMATE.start_main_#t~ret24#1| 0)} is VALID [2022-02-21 03:10:26,093 INFO L290 TraceCheckUtils]: 22: Hoare triple {9358#(= |ULTIMATE.start_main_#t~ret24#1| 0)} main_~a~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {9362#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:26,094 INFO L272 TraceCheckUtils]: 23: Hoare triple {9362#(= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret25#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {9263#true} is VALID [2022-02-21 03:10:26,094 INFO L290 TraceCheckUtils]: 24: Hoare triple {9263#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9263#true} is VALID [2022-02-21 03:10:26,094 INFO L290 TraceCheckUtils]: 25: Hoare triple {9263#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {9263#true} is VALID [2022-02-21 03:10:26,094 INFO L290 TraceCheckUtils]: 26: Hoare triple {9263#true} #res := ~__retres4~0; {9263#true} is VALID [2022-02-21 03:10:26,094 INFO L290 TraceCheckUtils]: 27: Hoare triple {9263#true} assume true; {9263#true} is VALID [2022-02-21 03:10:26,095 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {9263#true} {9362#(= |ULTIMATE.start_main_~a~0#1| 0)} #376#return; {9362#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:26,095 INFO L290 TraceCheckUtils]: 29: Hoare triple {9362#(= |ULTIMATE.start_main_~a~0#1| 0)} main_~b~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {9362#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:26,096 INFO L290 TraceCheckUtils]: 30: Hoare triple {9362#(= |ULTIMATE.start_main_~a~0#1| 0)} assume main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sb~0#1 := -1; {9362#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:26,096 INFO L290 TraceCheckUtils]: 31: Hoare triple {9362#(= |ULTIMATE.start_main_~a~0#1| 0)} assume { :begin_inline_mulflt } true;mulflt_#in~a#1, mulflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mulflt_#res#1;havoc mulflt_#t~nondet12#1, mulflt_#t~nondet13#1, mulflt_#t~nondet14#1, mulflt_#t~nondet15#1, mulflt_#t~nondet16#1, mulflt_#t~nondet17#1, mulflt_~a#1, mulflt_~b#1, mulflt_~res~2#1, mulflt_~ma~1#1, mulflt_~mb~1#1, mulflt_~accu~0#1, mulflt_~ea~1#1, mulflt_~eb~1#1, mulflt_~tmp~1#1, mulflt_~__retres10~1#1;mulflt_~a#1 := mulflt_#in~a#1;mulflt_~b#1 := mulflt_#in~b#1;havoc mulflt_~res~2#1;havoc mulflt_~ma~1#1;havoc mulflt_~mb~1#1;havoc mulflt_~accu~0#1;havoc mulflt_~ea~1#1;havoc mulflt_~eb~1#1;havoc mulflt_~tmp~1#1;havoc mulflt_~__retres10~1#1; {9390#(= |ULTIMATE.start_mulflt_~a#1| 0)} is VALID [2022-02-21 03:10:26,097 INFO L290 TraceCheckUtils]: 32: Hoare triple {9390#(= |ULTIMATE.start_mulflt_~a#1| 0)} assume mulflt_~a#1 % 4294967296 < mulflt_~b#1 % 4294967296;mulflt_~tmp~1#1 := mulflt_~a#1;mulflt_~a#1 := mulflt_~b#1;mulflt_~b#1 := mulflt_~tmp~1#1; {9394#(= |ULTIMATE.start_mulflt_~b#1| 0)} is VALID [2022-02-21 03:10:26,097 INFO L290 TraceCheckUtils]: 33: Hoare triple {9394#(= |ULTIMATE.start_mulflt_~b#1| 0)} assume !(0 == mulflt_~b#1 % 4294967296); {9264#false} is VALID [2022-02-21 03:10:26,097 INFO L290 TraceCheckUtils]: 34: Hoare triple {9264#false} assume 0 == mulflt_~a#1;mulflt_~ma~1#1 := 0; {9264#false} is VALID [2022-02-21 03:10:26,097 INFO L290 TraceCheckUtils]: 35: Hoare triple {9264#false} assume (if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {9264#false} is VALID [2022-02-21 03:10:26,097 INFO L290 TraceCheckUtils]: 36: Hoare triple {9264#false} assume !((if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {9264#false} is VALID [2022-02-21 03:10:26,098 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-21 03:10:26,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:10:26,366 INFO L290 TraceCheckUtils]: 36: Hoare triple {9264#false} assume !((if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {9264#false} is VALID [2022-02-21 03:10:26,366 INFO L290 TraceCheckUtils]: 35: Hoare triple {9264#false} assume (if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {9264#false} is VALID [2022-02-21 03:10:26,366 INFO L290 TraceCheckUtils]: 34: Hoare triple {9264#false} assume 0 == mulflt_~a#1;mulflt_~ma~1#1 := 0; {9264#false} is VALID [2022-02-21 03:10:26,367 INFO L290 TraceCheckUtils]: 33: Hoare triple {9416#(= (mod |ULTIMATE.start_mulflt_~b#1| 4294967296) 0)} assume !(0 == mulflt_~b#1 % 4294967296); {9264#false} is VALID [2022-02-21 03:10:26,367 INFO L290 TraceCheckUtils]: 32: Hoare triple {9420#(= (mod |ULTIMATE.start_mulflt_~a#1| 4294967296) 0)} assume mulflt_~a#1 % 4294967296 < mulflt_~b#1 % 4294967296;mulflt_~tmp~1#1 := mulflt_~a#1;mulflt_~a#1 := mulflt_~b#1;mulflt_~b#1 := mulflt_~tmp~1#1; {9416#(= (mod |ULTIMATE.start_mulflt_~b#1| 4294967296) 0)} is VALID [2022-02-21 03:10:26,369 INFO L290 TraceCheckUtils]: 31: Hoare triple {9424#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} assume { :begin_inline_mulflt } true;mulflt_#in~a#1, mulflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mulflt_#res#1;havoc mulflt_#t~nondet12#1, mulflt_#t~nondet13#1, mulflt_#t~nondet14#1, mulflt_#t~nondet15#1, mulflt_#t~nondet16#1, mulflt_#t~nondet17#1, mulflt_~a#1, mulflt_~b#1, mulflt_~res~2#1, mulflt_~ma~1#1, mulflt_~mb~1#1, mulflt_~accu~0#1, mulflt_~ea~1#1, mulflt_~eb~1#1, mulflt_~tmp~1#1, mulflt_~__retres10~1#1;mulflt_~a#1 := mulflt_#in~a#1;mulflt_~b#1 := mulflt_#in~b#1;havoc mulflt_~res~2#1;havoc mulflt_~ma~1#1;havoc mulflt_~mb~1#1;havoc mulflt_~accu~0#1;havoc mulflt_~ea~1#1;havoc mulflt_~eb~1#1;havoc mulflt_~tmp~1#1;havoc mulflt_~__retres10~1#1; {9420#(= (mod |ULTIMATE.start_mulflt_~a#1| 4294967296) 0)} is VALID [2022-02-21 03:10:26,369 INFO L290 TraceCheckUtils]: 30: Hoare triple {9424#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} assume main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sb~0#1 := -1; {9424#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:26,369 INFO L290 TraceCheckUtils]: 29: Hoare triple {9424#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} main_~b~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {9424#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:26,370 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {9263#true} {9424#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} #376#return; {9424#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:26,370 INFO L290 TraceCheckUtils]: 27: Hoare triple {9263#true} assume true; {9263#true} is VALID [2022-02-21 03:10:26,370 INFO L290 TraceCheckUtils]: 26: Hoare triple {9263#true} #res := ~__retres4~0; {9263#true} is VALID [2022-02-21 03:10:26,370 INFO L290 TraceCheckUtils]: 25: Hoare triple {9263#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {9263#true} is VALID [2022-02-21 03:10:26,371 INFO L290 TraceCheckUtils]: 24: Hoare triple {9263#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9263#true} is VALID [2022-02-21 03:10:26,371 INFO L272 TraceCheckUtils]: 23: Hoare triple {9424#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} call main_#t~ret25#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {9263#true} is VALID [2022-02-21 03:10:26,371 INFO L290 TraceCheckUtils]: 22: Hoare triple {9452#(= (mod |ULTIMATE.start_main_#t~ret24#1| 4294967296) 0)} main_~a~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {9424#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:26,372 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {9459#(= (mod |base2flt_#res| 4294967296) 0)} {9263#true} #374#return; {9452#(= (mod |ULTIMATE.start_main_#t~ret24#1| 4294967296) 0)} is VALID [2022-02-21 03:10:26,372 INFO L290 TraceCheckUtils]: 20: Hoare triple {9459#(= (mod |base2flt_#res| 4294967296) 0)} assume true; {9459#(= (mod |base2flt_#res| 4294967296) 0)} is VALID [2022-02-21 03:10:26,373 INFO L290 TraceCheckUtils]: 19: Hoare triple {9466#(= (mod base2flt_~__retres4~0 4294967296) 0)} #res := ~__retres4~0; {9459#(= (mod |base2flt_#res| 4294967296) 0)} is VALID [2022-02-21 03:10:26,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {9263#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {9466#(= (mod base2flt_~__retres4~0 4294967296) 0)} is VALID [2022-02-21 03:10:26,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {9263#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9263#true} is VALID [2022-02-21 03:10:26,374 INFO L272 TraceCheckUtils]: 16: Hoare triple {9263#true} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {9263#true} is VALID [2022-02-21 03:10:26,374 INFO L290 TraceCheckUtils]: 15: Hoare triple {9263#true} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {9263#true} is VALID [2022-02-21 03:10:26,374 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {9263#true} {9263#true} #372#return; {9263#true} is VALID [2022-02-21 03:10:26,374 INFO L290 TraceCheckUtils]: 13: Hoare triple {9263#true} assume true; {9263#true} is VALID [2022-02-21 03:10:26,374 INFO L290 TraceCheckUtils]: 12: Hoare triple {9263#true} #res := ~__retres4~0; {9263#true} is VALID [2022-02-21 03:10:26,374 INFO L290 TraceCheckUtils]: 11: Hoare triple {9263#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {9263#true} is VALID [2022-02-21 03:10:26,374 INFO L290 TraceCheckUtils]: 10: Hoare triple {9263#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9263#true} is VALID [2022-02-21 03:10:26,374 INFO L272 TraceCheckUtils]: 9: Hoare triple {9263#true} call main_#t~ret23#1 := base2flt(1, 0); {9263#true} is VALID [2022-02-21 03:10:26,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {9263#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {9263#true} is VALID [2022-02-21 03:10:26,375 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {9263#true} {9263#true} #370#return; {9263#true} is VALID [2022-02-21 03:10:26,375 INFO L290 TraceCheckUtils]: 6: Hoare triple {9263#true} assume true; {9263#true} is VALID [2022-02-21 03:10:26,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {9263#true} #res := ~__retres4~0; {9263#true} is VALID [2022-02-21 03:10:26,375 INFO L290 TraceCheckUtils]: 4: Hoare triple {9263#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {9263#true} is VALID [2022-02-21 03:10:26,375 INFO L290 TraceCheckUtils]: 3: Hoare triple {9263#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9263#true} is VALID [2022-02-21 03:10:26,375 INFO L272 TraceCheckUtils]: 2: Hoare triple {9263#true} call main_#t~ret22#1 := base2flt(0, 0); {9263#true} is VALID [2022-02-21 03:10:26,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {9263#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_~sb~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_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {9263#true} is VALID [2022-02-21 03:10:26,375 INFO L290 TraceCheckUtils]: 0: Hoare triple {9263#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(22, 2);call #Ultimate.allocInit(12, 3); {9263#true} is VALID [2022-02-21 03:10:26,376 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-02-21 03:10:26,376 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807721593] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:10:26,376 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:10:26,376 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 8] total 19 [2022-02-21 03:10:26,376 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357298467] [2022-02-21 03:10:26,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:10:26,377 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 16 states have internal predecessors, (45), 4 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) Word has length 37 [2022-02-21 03:10:26,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:26,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 16 states have internal predecessors, (45), 4 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2022-02-21 03:10:26,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:26,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-21 03:10:26,435 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:26,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-21 03:10:26,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2022-02-21 03:10:26,436 INFO L87 Difference]: Start difference. First operand 162 states and 219 transitions. Second operand has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 16 states have internal predecessors, (45), 4 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2022-02-21 03:10:28,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:28,820 INFO L93 Difference]: Finished difference Result 723 states and 944 transitions. [2022-02-21 03:10:28,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-21 03:10:28,821 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 16 states have internal predecessors, (45), 4 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) Word has length 37 [2022-02-21 03:10:28,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:28,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 16 states have internal predecessors, (45), 4 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2022-02-21 03:10:28,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 495 transitions. [2022-02-21 03:10:28,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 16 states have internal predecessors, (45), 4 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2022-02-21 03:10:28,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 495 transitions. [2022-02-21 03:10:28,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 495 transitions. [2022-02-21 03:10:29,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 495 edges. 495 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:29,224 INFO L225 Difference]: With dead ends: 723 [2022-02-21 03:10:29,224 INFO L226 Difference]: Without dead ends: 475 [2022-02-21 03:10:29,225 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=1255, Unknown=0, NotChecked=0, Total=1482 [2022-02-21 03:10:29,226 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 400 mSDsluCounter, 1236 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:29,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [400 Valid, 1329 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-21 03:10:29,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2022-02-21 03:10:29,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 185. [2022-02-21 03:10:29,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:29,295 INFO L82 GeneralOperation]: Start isEquivalent. First operand 475 states. Second operand has 185 states, 169 states have (on average 1.3905325443786982) internal successors, (235), 176 states have internal predecessors, (235), 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:29,295 INFO L74 IsIncluded]: Start isIncluded. First operand 475 states. Second operand has 185 states, 169 states have (on average 1.3905325443786982) internal successors, (235), 176 states have internal predecessors, (235), 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:29,296 INFO L87 Difference]: Start difference. First operand 475 states. Second operand has 185 states, 169 states have (on average 1.3905325443786982) internal successors, (235), 176 states have internal predecessors, (235), 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:29,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:29,315 INFO L93 Difference]: Finished difference Result 475 states and 587 transitions. [2022-02-21 03:10:29,315 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 587 transitions. [2022-02-21 03:10:29,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:29,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:29,316 INFO L74 IsIncluded]: Start isIncluded. First operand has 185 states, 169 states have (on average 1.3905325443786982) internal successors, (235), 176 states have internal predecessors, (235), 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 475 states. [2022-02-21 03:10:29,317 INFO L87 Difference]: Start difference. First operand has 185 states, 169 states have (on average 1.3905325443786982) internal successors, (235), 176 states have internal predecessors, (235), 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 475 states. [2022-02-21 03:10:29,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:29,336 INFO L93 Difference]: Finished difference Result 475 states and 587 transitions. [2022-02-21 03:10:29,336 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 587 transitions. [2022-02-21 03:10:29,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:29,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:29,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:29,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:29,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 169 states have (on average 1.3905325443786982) internal successors, (235), 176 states have internal predecessors, (235), 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:29,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 243 transitions. [2022-02-21 03:10:29,343 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 243 transitions. Word has length 37 [2022-02-21 03:10:29,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:29,343 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 243 transitions. [2022-02-21 03:10:29,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 16 states have internal predecessors, (45), 4 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2022-02-21 03:10:29,344 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 243 transitions. [2022-02-21 03:10:29,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-21 03:10:29,345 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:29,345 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2022-02-21 03:10:29,369 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:10:29,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:29,560 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-02-21 03:10:29,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:29,560 INFO L85 PathProgramCache]: Analyzing trace with hash 776524844, now seen corresponding path program 1 times [2022-02-21 03:10:29,560 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:29,560 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103872879] [2022-02-21 03:10:29,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:29,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:29,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:29,632 INFO L290 TraceCheckUtils]: 0: Hoare triple {11592#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {11549#true} is VALID [2022-02-21 03:10:29,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {11549#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {11549#true} is VALID [2022-02-21 03:10:29,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {11549#true} #res := ~__retres4~0; {11549#true} is VALID [2022-02-21 03:10:29,632 INFO L290 TraceCheckUtils]: 3: Hoare triple {11549#true} assume true; {11549#true} is VALID [2022-02-21 03:10:29,632 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {11549#true} {11549#true} #370#return; {11549#true} is VALID [2022-02-21 03:10:29,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:29,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:29,640 INFO L290 TraceCheckUtils]: 0: Hoare triple {11592#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {11549#true} is VALID [2022-02-21 03:10:29,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {11549#true} assume !(0 == ~m % 4294967296); {11549#true} is VALID [2022-02-21 03:10:29,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {11549#true} assume ~m % 4294967296 < 16777216; {11549#true} is VALID [2022-02-21 03:10:29,641 INFO L290 TraceCheckUtils]: 3: Hoare triple {11549#true} assume !false; {11549#true} is VALID [2022-02-21 03:10:29,641 INFO L290 TraceCheckUtils]: 4: Hoare triple {11549#true} assume !(~e <= -128); {11549#true} is VALID [2022-02-21 03:10:29,641 INFO L290 TraceCheckUtils]: 5: Hoare triple {11549#true} assume ~e - 1 <= 2147483647; {11549#true} is VALID [2022-02-21 03:10:29,641 INFO L290 TraceCheckUtils]: 6: Hoare triple {11549#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {11549#true} is VALID [2022-02-21 03:10:29,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {11549#true} assume ~m % 4294967296 < 16777216; {11549#true} is VALID [2022-02-21 03:10:29,642 INFO L290 TraceCheckUtils]: 8: Hoare triple {11549#true} assume !false; {11549#true} is VALID [2022-02-21 03:10:29,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {11549#true} assume !(~e <= -128); {11549#true} is VALID [2022-02-21 03:10:29,642 INFO L290 TraceCheckUtils]: 10: Hoare triple {11549#true} assume ~e - 1 <= 2147483647; {11549#true} is VALID [2022-02-21 03:10:29,642 INFO L290 TraceCheckUtils]: 11: Hoare triple {11549#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {11549#true} is VALID [2022-02-21 03:10:29,642 INFO L290 TraceCheckUtils]: 12: Hoare triple {11549#true} assume ~m % 4294967296 < 16777216; {11549#true} is VALID [2022-02-21 03:10:29,642 INFO L290 TraceCheckUtils]: 13: Hoare triple {11549#true} assume !false; {11549#true} is VALID [2022-02-21 03:10:29,643 INFO L290 TraceCheckUtils]: 14: Hoare triple {11549#true} assume ~e <= -128;~__retres4~0 := 0; {11549#true} is VALID [2022-02-21 03:10:29,643 INFO L290 TraceCheckUtils]: 15: Hoare triple {11549#true} #res := ~__retres4~0; {11549#true} is VALID [2022-02-21 03:10:29,643 INFO L290 TraceCheckUtils]: 16: Hoare triple {11549#true} assume true; {11549#true} is VALID [2022-02-21 03:10:29,643 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {11549#true} {11549#true} #372#return; {11549#true} is VALID [2022-02-21 03:10:29,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-02-21 03:10:29,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:29,651 INFO L290 TraceCheckUtils]: 0: Hoare triple {11592#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {11549#true} is VALID [2022-02-21 03:10:29,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {11549#true} assume !(0 == ~m % 4294967296); {11549#true} is VALID [2022-02-21 03:10:29,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {11549#true} assume !(~m % 4294967296 < 16777216); {11549#true} is VALID [2022-02-21 03:10:29,651 INFO L290 TraceCheckUtils]: 3: Hoare triple {11549#true} assume !false; {11549#true} is VALID [2022-02-21 03:10:29,652 INFO L290 TraceCheckUtils]: 4: Hoare triple {11549#true} assume ~m % 4294967296 >= 33554432; {11549#true} is VALID [2022-02-21 03:10:29,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {11549#true} assume ~e >= 127;~__retres4~0 := 4294967295; {11549#true} is VALID [2022-02-21 03:10:29,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {11549#true} #res := ~__retres4~0; {11549#true} is VALID [2022-02-21 03:10:29,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {11549#true} assume true; {11549#true} is VALID [2022-02-21 03:10:29,652 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {11549#true} {11549#true} #374#return; {11549#true} is VALID [2022-02-21 03:10:29,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-21 03:10:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:29,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {11592#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {11549#true} is VALID [2022-02-21 03:10:29,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {11549#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {11593#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:29,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {11593#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {11594#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:29,689 INFO L290 TraceCheckUtils]: 3: Hoare triple {11594#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {11594#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:29,690 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {11594#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {11549#true} #376#return; {11588#(= |ULTIMATE.start_main_#t~ret25#1| 0)} is VALID [2022-02-21 03:10:29,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {11549#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(22, 2);call #Ultimate.allocInit(12, 3); {11549#true} is VALID [2022-02-21 03:10:29,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {11549#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_~sb~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_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {11549#true} is VALID [2022-02-21 03:10:29,690 INFO L272 TraceCheckUtils]: 2: Hoare triple {11549#true} call main_#t~ret22#1 := base2flt(0, 0); {11592#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:29,691 INFO L290 TraceCheckUtils]: 3: Hoare triple {11592#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {11549#true} is VALID [2022-02-21 03:10:29,691 INFO L290 TraceCheckUtils]: 4: Hoare triple {11549#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {11549#true} is VALID [2022-02-21 03:10:29,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {11549#true} #res := ~__retres4~0; {11549#true} is VALID [2022-02-21 03:10:29,691 INFO L290 TraceCheckUtils]: 6: Hoare triple {11549#true} assume true; {11549#true} is VALID [2022-02-21 03:10:29,691 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11549#true} {11549#true} #370#return; {11549#true} is VALID [2022-02-21 03:10:29,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {11549#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {11549#true} is VALID [2022-02-21 03:10:29,692 INFO L272 TraceCheckUtils]: 9: Hoare triple {11549#true} call main_#t~ret23#1 := base2flt(1, 0); {11592#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:29,692 INFO L290 TraceCheckUtils]: 10: Hoare triple {11592#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {11549#true} is VALID [2022-02-21 03:10:29,692 INFO L290 TraceCheckUtils]: 11: Hoare triple {11549#true} assume !(0 == ~m % 4294967296); {11549#true} is VALID [2022-02-21 03:10:29,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {11549#true} assume ~m % 4294967296 < 16777216; {11549#true} is VALID [2022-02-21 03:10:29,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {11549#true} assume !false; {11549#true} is VALID [2022-02-21 03:10:29,692 INFO L290 TraceCheckUtils]: 14: Hoare triple {11549#true} assume !(~e <= -128); {11549#true} is VALID [2022-02-21 03:10:29,692 INFO L290 TraceCheckUtils]: 15: Hoare triple {11549#true} assume ~e - 1 <= 2147483647; {11549#true} is VALID [2022-02-21 03:10:29,692 INFO L290 TraceCheckUtils]: 16: Hoare triple {11549#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {11549#true} is VALID [2022-02-21 03:10:29,692 INFO L290 TraceCheckUtils]: 17: Hoare triple {11549#true} assume ~m % 4294967296 < 16777216; {11549#true} is VALID [2022-02-21 03:10:29,692 INFO L290 TraceCheckUtils]: 18: Hoare triple {11549#true} assume !false; {11549#true} is VALID [2022-02-21 03:10:29,692 INFO L290 TraceCheckUtils]: 19: Hoare triple {11549#true} assume !(~e <= -128); {11549#true} is VALID [2022-02-21 03:10:29,692 INFO L290 TraceCheckUtils]: 20: Hoare triple {11549#true} assume ~e - 1 <= 2147483647; {11549#true} is VALID [2022-02-21 03:10:29,692 INFO L290 TraceCheckUtils]: 21: Hoare triple {11549#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {11549#true} is VALID [2022-02-21 03:10:29,692 INFO L290 TraceCheckUtils]: 22: Hoare triple {11549#true} assume ~m % 4294967296 < 16777216; {11549#true} is VALID [2022-02-21 03:10:29,693 INFO L290 TraceCheckUtils]: 23: Hoare triple {11549#true} assume !false; {11549#true} is VALID [2022-02-21 03:10:29,693 INFO L290 TraceCheckUtils]: 24: Hoare triple {11549#true} assume ~e <= -128;~__retres4~0 := 0; {11549#true} is VALID [2022-02-21 03:10:29,693 INFO L290 TraceCheckUtils]: 25: Hoare triple {11549#true} #res := ~__retres4~0; {11549#true} is VALID [2022-02-21 03:10:29,693 INFO L290 TraceCheckUtils]: 26: Hoare triple {11549#true} assume true; {11549#true} is VALID [2022-02-21 03:10:29,693 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {11549#true} {11549#true} #372#return; {11549#true} is VALID [2022-02-21 03:10:29,693 INFO L290 TraceCheckUtils]: 28: Hoare triple {11549#true} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {11549#true} is VALID [2022-02-21 03:10:29,693 INFO L272 TraceCheckUtils]: 29: Hoare triple {11549#true} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {11592#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:29,694 INFO L290 TraceCheckUtils]: 30: Hoare triple {11592#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {11549#true} is VALID [2022-02-21 03:10:29,694 INFO L290 TraceCheckUtils]: 31: Hoare triple {11549#true} assume !(0 == ~m % 4294967296); {11549#true} is VALID [2022-02-21 03:10:29,694 INFO L290 TraceCheckUtils]: 32: Hoare triple {11549#true} assume !(~m % 4294967296 < 16777216); {11549#true} is VALID [2022-02-21 03:10:29,694 INFO L290 TraceCheckUtils]: 33: Hoare triple {11549#true} assume !false; {11549#true} is VALID [2022-02-21 03:10:29,694 INFO L290 TraceCheckUtils]: 34: Hoare triple {11549#true} assume ~m % 4294967296 >= 33554432; {11549#true} is VALID [2022-02-21 03:10:29,694 INFO L290 TraceCheckUtils]: 35: Hoare triple {11549#true} assume ~e >= 127;~__retres4~0 := 4294967295; {11549#true} is VALID [2022-02-21 03:10:29,694 INFO L290 TraceCheckUtils]: 36: Hoare triple {11549#true} #res := ~__retres4~0; {11549#true} is VALID [2022-02-21 03:10:29,694 INFO L290 TraceCheckUtils]: 37: Hoare triple {11549#true} assume true; {11549#true} is VALID [2022-02-21 03:10:29,694 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {11549#true} {11549#true} #374#return; {11549#true} is VALID [2022-02-21 03:10:29,694 INFO L290 TraceCheckUtils]: 39: Hoare triple {11549#true} main_~a~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {11549#true} is VALID [2022-02-21 03:10:29,695 INFO L272 TraceCheckUtils]: 40: Hoare triple {11549#true} call main_#t~ret25#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {11592#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:29,695 INFO L290 TraceCheckUtils]: 41: Hoare triple {11592#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {11549#true} is VALID [2022-02-21 03:10:29,695 INFO L290 TraceCheckUtils]: 42: Hoare triple {11549#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {11593#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:29,695 INFO L290 TraceCheckUtils]: 43: Hoare triple {11593#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {11594#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:29,696 INFO L290 TraceCheckUtils]: 44: Hoare triple {11594#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {11594#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:29,697 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {11594#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {11549#true} #376#return; {11588#(= |ULTIMATE.start_main_#t~ret25#1| 0)} is VALID [2022-02-21 03:10:29,697 INFO L290 TraceCheckUtils]: 46: Hoare triple {11588#(= |ULTIMATE.start_main_#t~ret25#1| 0)} main_~b~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {11589#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-21 03:10:29,697 INFO L290 TraceCheckUtils]: 47: Hoare triple {11589#(= |ULTIMATE.start_main_~b~0#1| 0)} assume main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sb~0#1 := -1; {11589#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-21 03:10:29,698 INFO L290 TraceCheckUtils]: 48: Hoare triple {11589#(= |ULTIMATE.start_main_~b~0#1| 0)} assume { :begin_inline_mulflt } true;mulflt_#in~a#1, mulflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mulflt_#res#1;havoc mulflt_#t~nondet12#1, mulflt_#t~nondet13#1, mulflt_#t~nondet14#1, mulflt_#t~nondet15#1, mulflt_#t~nondet16#1, mulflt_#t~nondet17#1, mulflt_~a#1, mulflt_~b#1, mulflt_~res~2#1, mulflt_~ma~1#1, mulflt_~mb~1#1, mulflt_~accu~0#1, mulflt_~ea~1#1, mulflt_~eb~1#1, mulflt_~tmp~1#1, mulflt_~__retres10~1#1;mulflt_~a#1 := mulflt_#in~a#1;mulflt_~b#1 := mulflt_#in~b#1;havoc mulflt_~res~2#1;havoc mulflt_~ma~1#1;havoc mulflt_~mb~1#1;havoc mulflt_~accu~0#1;havoc mulflt_~ea~1#1;havoc mulflt_~eb~1#1;havoc mulflt_~tmp~1#1;havoc mulflt_~__retres10~1#1; {11590#(= |ULTIMATE.start_mulflt_~b#1| 0)} is VALID [2022-02-21 03:10:29,698 INFO L290 TraceCheckUtils]: 49: Hoare triple {11590#(= |ULTIMATE.start_mulflt_~b#1| 0)} assume mulflt_~a#1 % 4294967296 < mulflt_~b#1 % 4294967296;mulflt_~tmp~1#1 := mulflt_~a#1;mulflt_~a#1 := mulflt_~b#1;mulflt_~b#1 := mulflt_~tmp~1#1; {11591#(= |ULTIMATE.start_mulflt_~a#1| 0)} is VALID [2022-02-21 03:10:29,698 INFO L290 TraceCheckUtils]: 50: Hoare triple {11591#(= |ULTIMATE.start_mulflt_~a#1| 0)} assume !(0 == mulflt_~b#1 % 4294967296); {11591#(= |ULTIMATE.start_mulflt_~a#1| 0)} is VALID [2022-02-21 03:10:29,698 INFO L290 TraceCheckUtils]: 51: Hoare triple {11591#(= |ULTIMATE.start_mulflt_~a#1| 0)} assume !(0 == mulflt_~a#1); {11550#false} is VALID [2022-02-21 03:10:29,699 INFO L290 TraceCheckUtils]: 52: Hoare triple {11550#false} assume !false; {11550#false} is VALID [2022-02-21 03:10:29,699 INFO L290 TraceCheckUtils]: 53: Hoare triple {11550#false} assume !false; {11550#false} is VALID [2022-02-21 03:10:29,699 INFO L290 TraceCheckUtils]: 54: Hoare triple {11550#false} assume !(mulflt_~a#1 >= 0);mulflt_~ma~1#1 := mulflt_#t~nondet12#1;havoc mulflt_#t~nondet12#1; {11550#false} is VALID [2022-02-21 03:10:29,699 INFO L290 TraceCheckUtils]: 55: Hoare triple {11550#false} assume (if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {11550#false} is VALID [2022-02-21 03:10:29,699 INFO L290 TraceCheckUtils]: 56: Hoare triple {11550#false} assume !((if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {11550#false} is VALID [2022-02-21 03:10:29,699 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-02-21 03:10:29,699 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:29,699 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103872879] [2022-02-21 03:10:29,699 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103872879] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:29,699 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:10:29,700 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-21 03:10:29,700 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453675047] [2022-02-21 03:10:29,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:29,700 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 57 [2022-02-21 03:10:29,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:29,701 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:10:29,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:29,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-21 03:10:29,738 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:29,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-21 03:10:29,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-21 03:10:29,739 INFO L87 Difference]: Start difference. First operand 185 states and 243 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:10:30,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:30,391 INFO L93 Difference]: Finished difference Result 370 states and 452 transitions. [2022-02-21 03:10:30,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 03:10:30,392 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 57 [2022-02-21 03:10:30,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:30,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:10:30,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 268 transitions. [2022-02-21 03:10:30,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:10:30,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 268 transitions. [2022-02-21 03:10:30,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 268 transitions. [2022-02-21 03:10:30,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 268 edges. 268 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:30,607 INFO L225 Difference]: With dead ends: 370 [2022-02-21 03:10:30,607 INFO L226 Difference]: Without dead ends: 314 [2022-02-21 03:10:30,607 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-02-21 03:10:30,609 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 152 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:30,609 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 729 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:10:30,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2022-02-21 03:10:30,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 185. [2022-02-21 03:10:30,701 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:30,703 INFO L82 GeneralOperation]: Start isEquivalent. First operand 314 states. Second operand has 185 states, 169 states have (on average 1.378698224852071) internal successors, (233), 176 states have internal predecessors, (233), 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:30,703 INFO L74 IsIncluded]: Start isIncluded. First operand 314 states. Second operand has 185 states, 169 states have (on average 1.378698224852071) internal successors, (233), 176 states have internal predecessors, (233), 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:30,704 INFO L87 Difference]: Start difference. First operand 314 states. Second operand has 185 states, 169 states have (on average 1.378698224852071) internal successors, (233), 176 states have internal predecessors, (233), 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:30,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:30,711 INFO L93 Difference]: Finished difference Result 314 states and 385 transitions. [2022-02-21 03:10:30,711 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 385 transitions. [2022-02-21 03:10:30,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:30,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:30,712 INFO L74 IsIncluded]: Start isIncluded. First operand has 185 states, 169 states have (on average 1.378698224852071) internal successors, (233), 176 states have internal predecessors, (233), 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 314 states. [2022-02-21 03:10:30,712 INFO L87 Difference]: Start difference. First operand has 185 states, 169 states have (on average 1.378698224852071) internal successors, (233), 176 states have internal predecessors, (233), 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 314 states. [2022-02-21 03:10:30,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:30,719 INFO L93 Difference]: Finished difference Result 314 states and 385 transitions. [2022-02-21 03:10:30,719 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 385 transitions. [2022-02-21 03:10:30,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:30,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:30,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:30,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:30,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 169 states have (on average 1.378698224852071) internal successors, (233), 176 states have internal predecessors, (233), 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:30,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 241 transitions. [2022-02-21 03:10:30,738 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 241 transitions. Word has length 57 [2022-02-21 03:10:30,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:30,739 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 241 transitions. [2022-02-21 03:10:30,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:10:30,740 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 241 transitions. [2022-02-21 03:10:30,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-21 03:10:30,741 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:30,741 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 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] [2022-02-21 03:10:30,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-21 03:10:30,742 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-02-21 03:10:30,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:30,742 INFO L85 PathProgramCache]: Analyzing trace with hash -828181155, now seen corresponding path program 2 times [2022-02-21 03:10:30,742 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:30,743 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365388528] [2022-02-21 03:10:30,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:30,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:30,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:30,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:30,787 INFO L290 TraceCheckUtils]: 0: Hoare triple {12890#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12847#true} is VALID [2022-02-21 03:10:30,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {12847#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {12847#true} is VALID [2022-02-21 03:10:30,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {12847#true} #res := ~__retres4~0; {12847#true} is VALID [2022-02-21 03:10:30,788 INFO L290 TraceCheckUtils]: 3: Hoare triple {12847#true} assume true; {12847#true} is VALID [2022-02-21 03:10:30,788 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {12847#true} {12847#true} #370#return; {12847#true} is VALID [2022-02-21 03:10:30,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:30,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:30,840 INFO L290 TraceCheckUtils]: 0: Hoare triple {12890#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12891#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:30,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {12891#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !(0 == ~m % 4294967296); {12891#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:30,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {12891#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~m % 4294967296 < 16777216; {12891#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:30,842 INFO L290 TraceCheckUtils]: 3: Hoare triple {12891#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !false; {12891#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:30,842 INFO L290 TraceCheckUtils]: 4: Hoare triple {12891#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !(~e <= -128); {12891#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:30,842 INFO L290 TraceCheckUtils]: 5: Hoare triple {12891#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~e - 1 <= 2147483647; {12891#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:30,843 INFO L290 TraceCheckUtils]: 6: Hoare triple {12891#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {12892#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:30,843 INFO L290 TraceCheckUtils]: 7: Hoare triple {12892#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume ~m % 4294967296 < 16777216; {12892#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:30,844 INFO L290 TraceCheckUtils]: 8: Hoare triple {12892#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume !false; {12892#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:30,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {12892#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume !(~e <= -128); {12892#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:30,845 INFO L290 TraceCheckUtils]: 10: Hoare triple {12892#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume ~e - 1 <= 2147483647; {12892#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:30,845 INFO L290 TraceCheckUtils]: 11: Hoare triple {12892#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {12893#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:30,846 INFO L290 TraceCheckUtils]: 12: Hoare triple {12893#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~m % 4294967296 < 16777216; {12893#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:30,846 INFO L290 TraceCheckUtils]: 13: Hoare triple {12893#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume !false; {12893#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:30,847 INFO L290 TraceCheckUtils]: 14: Hoare triple {12893#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~e <= -128;~__retres4~0 := 0; {12894#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:10:30,847 INFO L290 TraceCheckUtils]: 15: Hoare triple {12894#(not (= |base2flt_#in~e| 0))} #res := ~__retres4~0; {12894#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:10:30,847 INFO L290 TraceCheckUtils]: 16: Hoare triple {12894#(not (= |base2flt_#in~e| 0))} assume true; {12894#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:10:30,848 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {12894#(not (= |base2flt_#in~e| 0))} {12847#true} #372#return; {12848#false} is VALID [2022-02-21 03:10:30,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-02-21 03:10:30,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:30,861 INFO L290 TraceCheckUtils]: 0: Hoare triple {12890#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12847#true} is VALID [2022-02-21 03:10:30,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {12847#true} assume !(0 == ~m % 4294967296); {12847#true} is VALID [2022-02-21 03:10:30,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {12847#true} assume !(~m % 4294967296 < 16777216); {12847#true} is VALID [2022-02-21 03:10:30,862 INFO L290 TraceCheckUtils]: 3: Hoare triple {12847#true} assume !false; {12847#true} is VALID [2022-02-21 03:10:30,862 INFO L290 TraceCheckUtils]: 4: Hoare triple {12847#true} assume ~m % 4294967296 >= 33554432; {12847#true} is VALID [2022-02-21 03:10:30,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {12847#true} assume ~e >= 127;~__retres4~0 := 4294967295; {12847#true} is VALID [2022-02-21 03:10:30,862 INFO L290 TraceCheckUtils]: 6: Hoare triple {12847#true} #res := ~__retres4~0; {12847#true} is VALID [2022-02-21 03:10:30,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {12847#true} assume true; {12847#true} is VALID [2022-02-21 03:10:30,862 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {12847#true} {12848#false} #374#return; {12848#false} is VALID [2022-02-21 03:10:30,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-21 03:10:30,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:30,867 INFO L290 TraceCheckUtils]: 0: Hoare triple {12890#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12847#true} is VALID [2022-02-21 03:10:30,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {12847#true} assume !(0 == ~m % 4294967296); {12847#true} is VALID [2022-02-21 03:10:30,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {12847#true} assume !(~m % 4294967296 < 16777216); {12847#true} is VALID [2022-02-21 03:10:30,868 INFO L290 TraceCheckUtils]: 3: Hoare triple {12847#true} assume !false; {12847#true} is VALID [2022-02-21 03:10:30,868 INFO L290 TraceCheckUtils]: 4: Hoare triple {12847#true} assume ~m % 4294967296 >= 33554432; {12847#true} is VALID [2022-02-21 03:10:30,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {12847#true} assume ~e >= 127;~__retres4~0 := 4294967295; {12847#true} is VALID [2022-02-21 03:10:30,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {12847#true} #res := ~__retres4~0; {12847#true} is VALID [2022-02-21 03:10:30,868 INFO L290 TraceCheckUtils]: 7: Hoare triple {12847#true} assume true; {12847#true} is VALID [2022-02-21 03:10:30,869 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {12847#true} {12848#false} #376#return; {12848#false} is VALID [2022-02-21 03:10:30,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {12847#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(22, 2);call #Ultimate.allocInit(12, 3); {12847#true} is VALID [2022-02-21 03:10:30,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {12847#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_~sb~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_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {12847#true} is VALID [2022-02-21 03:10:30,870 INFO L272 TraceCheckUtils]: 2: Hoare triple {12847#true} call main_#t~ret22#1 := base2flt(0, 0); {12890#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:30,870 INFO L290 TraceCheckUtils]: 3: Hoare triple {12890#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12847#true} is VALID [2022-02-21 03:10:30,870 INFO L290 TraceCheckUtils]: 4: Hoare triple {12847#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {12847#true} is VALID [2022-02-21 03:10:30,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {12847#true} #res := ~__retres4~0; {12847#true} is VALID [2022-02-21 03:10:30,870 INFO L290 TraceCheckUtils]: 6: Hoare triple {12847#true} assume true; {12847#true} is VALID [2022-02-21 03:10:30,874 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {12847#true} {12847#true} #370#return; {12847#true} is VALID [2022-02-21 03:10:30,874 INFO L290 TraceCheckUtils]: 8: Hoare triple {12847#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {12847#true} is VALID [2022-02-21 03:10:30,875 INFO L272 TraceCheckUtils]: 9: Hoare triple {12847#true} call main_#t~ret23#1 := base2flt(1, 0); {12890#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:30,875 INFO L290 TraceCheckUtils]: 10: Hoare triple {12890#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12891#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:30,875 INFO L290 TraceCheckUtils]: 11: Hoare triple {12891#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !(0 == ~m % 4294967296); {12891#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:30,876 INFO L290 TraceCheckUtils]: 12: Hoare triple {12891#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~m % 4294967296 < 16777216; {12891#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:30,876 INFO L290 TraceCheckUtils]: 13: Hoare triple {12891#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !false; {12891#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:30,877 INFO L290 TraceCheckUtils]: 14: Hoare triple {12891#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !(~e <= -128); {12891#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:30,877 INFO L290 TraceCheckUtils]: 15: Hoare triple {12891#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~e - 1 <= 2147483647; {12891#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:30,878 INFO L290 TraceCheckUtils]: 16: Hoare triple {12891#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {12892#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:30,878 INFO L290 TraceCheckUtils]: 17: Hoare triple {12892#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume ~m % 4294967296 < 16777216; {12892#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:30,878 INFO L290 TraceCheckUtils]: 18: Hoare triple {12892#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume !false; {12892#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:30,879 INFO L290 TraceCheckUtils]: 19: Hoare triple {12892#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume !(~e <= -128); {12892#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:30,879 INFO L290 TraceCheckUtils]: 20: Hoare triple {12892#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume ~e - 1 <= 2147483647; {12892#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:30,880 INFO L290 TraceCheckUtils]: 21: Hoare triple {12892#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {12893#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:30,880 INFO L290 TraceCheckUtils]: 22: Hoare triple {12893#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~m % 4294967296 < 16777216; {12893#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:30,880 INFO L290 TraceCheckUtils]: 23: Hoare triple {12893#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume !false; {12893#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:30,884 INFO L290 TraceCheckUtils]: 24: Hoare triple {12893#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~e <= -128;~__retres4~0 := 0; {12894#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:10:30,884 INFO L290 TraceCheckUtils]: 25: Hoare triple {12894#(not (= |base2flt_#in~e| 0))} #res := ~__retres4~0; {12894#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:10:30,884 INFO L290 TraceCheckUtils]: 26: Hoare triple {12894#(not (= |base2flt_#in~e| 0))} assume true; {12894#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:10:30,885 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {12894#(not (= |base2flt_#in~e| 0))} {12847#true} #372#return; {12848#false} is VALID [2022-02-21 03:10:30,885 INFO L290 TraceCheckUtils]: 28: Hoare triple {12848#false} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {12848#false} is VALID [2022-02-21 03:10:30,885 INFO L272 TraceCheckUtils]: 29: Hoare triple {12848#false} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {12890#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:30,885 INFO L290 TraceCheckUtils]: 30: Hoare triple {12890#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12847#true} is VALID [2022-02-21 03:10:30,886 INFO L290 TraceCheckUtils]: 31: Hoare triple {12847#true} assume !(0 == ~m % 4294967296); {12847#true} is VALID [2022-02-21 03:10:30,886 INFO L290 TraceCheckUtils]: 32: Hoare triple {12847#true} assume !(~m % 4294967296 < 16777216); {12847#true} is VALID [2022-02-21 03:10:30,886 INFO L290 TraceCheckUtils]: 33: Hoare triple {12847#true} assume !false; {12847#true} is VALID [2022-02-21 03:10:30,886 INFO L290 TraceCheckUtils]: 34: Hoare triple {12847#true} assume ~m % 4294967296 >= 33554432; {12847#true} is VALID [2022-02-21 03:10:30,886 INFO L290 TraceCheckUtils]: 35: Hoare triple {12847#true} assume ~e >= 127;~__retres4~0 := 4294967295; {12847#true} is VALID [2022-02-21 03:10:30,886 INFO L290 TraceCheckUtils]: 36: Hoare triple {12847#true} #res := ~__retres4~0; {12847#true} is VALID [2022-02-21 03:10:30,886 INFO L290 TraceCheckUtils]: 37: Hoare triple {12847#true} assume true; {12847#true} is VALID [2022-02-21 03:10:30,887 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {12847#true} {12848#false} #374#return; {12848#false} is VALID [2022-02-21 03:10:30,887 INFO L290 TraceCheckUtils]: 39: Hoare triple {12848#false} main_~a~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {12848#false} is VALID [2022-02-21 03:10:30,887 INFO L272 TraceCheckUtils]: 40: Hoare triple {12848#false} call main_#t~ret25#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {12890#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:30,887 INFO L290 TraceCheckUtils]: 41: Hoare triple {12890#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12847#true} is VALID [2022-02-21 03:10:30,887 INFO L290 TraceCheckUtils]: 42: Hoare triple {12847#true} assume !(0 == ~m % 4294967296); {12847#true} is VALID [2022-02-21 03:10:30,887 INFO L290 TraceCheckUtils]: 43: Hoare triple {12847#true} assume !(~m % 4294967296 < 16777216); {12847#true} is VALID [2022-02-21 03:10:30,887 INFO L290 TraceCheckUtils]: 44: Hoare triple {12847#true} assume !false; {12847#true} is VALID [2022-02-21 03:10:30,888 INFO L290 TraceCheckUtils]: 45: Hoare triple {12847#true} assume ~m % 4294967296 >= 33554432; {12847#true} is VALID [2022-02-21 03:10:30,888 INFO L290 TraceCheckUtils]: 46: Hoare triple {12847#true} assume ~e >= 127;~__retres4~0 := 4294967295; {12847#true} is VALID [2022-02-21 03:10:30,888 INFO L290 TraceCheckUtils]: 47: Hoare triple {12847#true} #res := ~__retres4~0; {12847#true} is VALID [2022-02-21 03:10:30,888 INFO L290 TraceCheckUtils]: 48: Hoare triple {12847#true} assume true; {12847#true} is VALID [2022-02-21 03:10:30,888 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {12847#true} {12848#false} #376#return; {12848#false} is VALID [2022-02-21 03:10:30,888 INFO L290 TraceCheckUtils]: 50: Hoare triple {12848#false} main_~b~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {12848#false} is VALID [2022-02-21 03:10:30,888 INFO L290 TraceCheckUtils]: 51: Hoare triple {12848#false} assume main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sb~0#1 := -1; {12848#false} is VALID [2022-02-21 03:10:30,889 INFO L290 TraceCheckUtils]: 52: Hoare triple {12848#false} assume { :begin_inline_mulflt } true;mulflt_#in~a#1, mulflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mulflt_#res#1;havoc mulflt_#t~nondet12#1, mulflt_#t~nondet13#1, mulflt_#t~nondet14#1, mulflt_#t~nondet15#1, mulflt_#t~nondet16#1, mulflt_#t~nondet17#1, mulflt_~a#1, mulflt_~b#1, mulflt_~res~2#1, mulflt_~ma~1#1, mulflt_~mb~1#1, mulflt_~accu~0#1, mulflt_~ea~1#1, mulflt_~eb~1#1, mulflt_~tmp~1#1, mulflt_~__retres10~1#1;mulflt_~a#1 := mulflt_#in~a#1;mulflt_~b#1 := mulflt_#in~b#1;havoc mulflt_~res~2#1;havoc mulflt_~ma~1#1;havoc mulflt_~mb~1#1;havoc mulflt_~accu~0#1;havoc mulflt_~ea~1#1;havoc mulflt_~eb~1#1;havoc mulflt_~tmp~1#1;havoc mulflt_~__retres10~1#1; {12848#false} is VALID [2022-02-21 03:10:30,889 INFO L290 TraceCheckUtils]: 53: Hoare triple {12848#false} assume mulflt_~a#1 % 4294967296 < mulflt_~b#1 % 4294967296;mulflt_~tmp~1#1 := mulflt_~a#1;mulflt_~a#1 := mulflt_~b#1;mulflt_~b#1 := mulflt_~tmp~1#1; {12848#false} is VALID [2022-02-21 03:10:30,889 INFO L290 TraceCheckUtils]: 54: Hoare triple {12848#false} assume !(0 == mulflt_~b#1 % 4294967296); {12848#false} is VALID [2022-02-21 03:10:30,889 INFO L290 TraceCheckUtils]: 55: Hoare triple {12848#false} assume !(0 == mulflt_~a#1); {12848#false} is VALID [2022-02-21 03:10:30,889 INFO L290 TraceCheckUtils]: 56: Hoare triple {12848#false} assume !false; {12848#false} is VALID [2022-02-21 03:10:30,889 INFO L290 TraceCheckUtils]: 57: Hoare triple {12848#false} assume !false; {12848#false} is VALID [2022-02-21 03:10:30,890 INFO L290 TraceCheckUtils]: 58: Hoare triple {12848#false} assume !(mulflt_~a#1 >= 0);mulflt_~ma~1#1 := mulflt_#t~nondet12#1;havoc mulflt_#t~nondet12#1; {12848#false} is VALID [2022-02-21 03:10:30,890 INFO L290 TraceCheckUtils]: 59: Hoare triple {12848#false} assume (if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {12848#false} is VALID [2022-02-21 03:10:30,890 INFO L290 TraceCheckUtils]: 60: Hoare triple {12848#false} assume !((if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {12848#false} is VALID [2022-02-21 03:10:30,890 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-02-21 03:10:30,890 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:30,891 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365388528] [2022-02-21 03:10:30,891 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365388528] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:30,891 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149315531] [2022-02-21 03:10:30,891 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:10:30,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:30,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:30,893 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:10:30,923 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:10:30,961 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-21 03:10:30,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:10:30,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:10:30,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:30,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:31,197 INFO L290 TraceCheckUtils]: 0: Hoare triple {12847#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(22, 2);call #Ultimate.allocInit(12, 3); {12847#true} is VALID [2022-02-21 03:10:31,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {12847#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_~sb~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_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {12847#true} is VALID [2022-02-21 03:10:31,198 INFO L272 TraceCheckUtils]: 2: Hoare triple {12847#true} call main_#t~ret22#1 := base2flt(0, 0); {12847#true} is VALID [2022-02-21 03:10:31,198 INFO L290 TraceCheckUtils]: 3: Hoare triple {12847#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12847#true} is VALID [2022-02-21 03:10:31,198 INFO L290 TraceCheckUtils]: 4: Hoare triple {12847#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {12847#true} is VALID [2022-02-21 03:10:31,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {12847#true} #res := ~__retres4~0; {12847#true} is VALID [2022-02-21 03:10:31,199 INFO L290 TraceCheckUtils]: 6: Hoare triple {12847#true} assume true; {12847#true} is VALID [2022-02-21 03:10:31,199 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {12847#true} {12847#true} #370#return; {12847#true} is VALID [2022-02-21 03:10:31,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {12847#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {12847#true} is VALID [2022-02-21 03:10:31,199 INFO L272 TraceCheckUtils]: 9: Hoare triple {12847#true} call main_#t~ret23#1 := base2flt(1, 0); {12847#true} is VALID [2022-02-21 03:10:31,199 INFO L290 TraceCheckUtils]: 10: Hoare triple {12847#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12847#true} is VALID [2022-02-21 03:10:31,199 INFO L290 TraceCheckUtils]: 11: Hoare triple {12847#true} assume !(0 == ~m % 4294967296); {12847#true} is VALID [2022-02-21 03:10:31,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {12847#true} assume ~m % 4294967296 < 16777216; {12847#true} is VALID [2022-02-21 03:10:31,199 INFO L290 TraceCheckUtils]: 13: Hoare triple {12847#true} assume !false; {12847#true} is VALID [2022-02-21 03:10:31,199 INFO L290 TraceCheckUtils]: 14: Hoare triple {12847#true} assume !(~e <= -128); {12847#true} is VALID [2022-02-21 03:10:31,199 INFO L290 TraceCheckUtils]: 15: Hoare triple {12847#true} assume ~e - 1 <= 2147483647; {12847#true} is VALID [2022-02-21 03:10:31,199 INFO L290 TraceCheckUtils]: 16: Hoare triple {12847#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {12847#true} is VALID [2022-02-21 03:10:31,199 INFO L290 TraceCheckUtils]: 17: Hoare triple {12847#true} assume ~m % 4294967296 < 16777216; {12847#true} is VALID [2022-02-21 03:10:31,200 INFO L290 TraceCheckUtils]: 18: Hoare triple {12847#true} assume !false; {12847#true} is VALID [2022-02-21 03:10:31,200 INFO L290 TraceCheckUtils]: 19: Hoare triple {12847#true} assume !(~e <= -128); {12847#true} is VALID [2022-02-21 03:10:31,200 INFO L290 TraceCheckUtils]: 20: Hoare triple {12847#true} assume ~e - 1 <= 2147483647; {12847#true} is VALID [2022-02-21 03:10:31,200 INFO L290 TraceCheckUtils]: 21: Hoare triple {12847#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {12847#true} is VALID [2022-02-21 03:10:31,200 INFO L290 TraceCheckUtils]: 22: Hoare triple {12847#true} assume ~m % 4294967296 < 16777216; {12847#true} is VALID [2022-02-21 03:10:31,200 INFO L290 TraceCheckUtils]: 23: Hoare triple {12847#true} assume !false; {12847#true} is VALID [2022-02-21 03:10:31,200 INFO L290 TraceCheckUtils]: 24: Hoare triple {12847#true} assume ~e <= -128;~__retres4~0 := 0; {12847#true} is VALID [2022-02-21 03:10:31,200 INFO L290 TraceCheckUtils]: 25: Hoare triple {12847#true} #res := ~__retres4~0; {12847#true} is VALID [2022-02-21 03:10:31,200 INFO L290 TraceCheckUtils]: 26: Hoare triple {12847#true} assume true; {12847#true} is VALID [2022-02-21 03:10:31,200 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {12847#true} {12847#true} #372#return; {12847#true} is VALID [2022-02-21 03:10:31,201 INFO L290 TraceCheckUtils]: 28: Hoare triple {12847#true} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {12847#true} is VALID [2022-02-21 03:10:31,201 INFO L272 TraceCheckUtils]: 29: Hoare triple {12847#true} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {12847#true} is VALID [2022-02-21 03:10:31,201 INFO L290 TraceCheckUtils]: 30: Hoare triple {12847#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12847#true} is VALID [2022-02-21 03:10:31,201 INFO L290 TraceCheckUtils]: 31: Hoare triple {12847#true} assume !(0 == ~m % 4294967296); {12847#true} is VALID [2022-02-21 03:10:31,201 INFO L290 TraceCheckUtils]: 32: Hoare triple {12847#true} assume !(~m % 4294967296 < 16777216); {12847#true} is VALID [2022-02-21 03:10:31,201 INFO L290 TraceCheckUtils]: 33: Hoare triple {12847#true} assume !false; {12847#true} is VALID [2022-02-21 03:10:31,201 INFO L290 TraceCheckUtils]: 34: Hoare triple {12847#true} assume ~m % 4294967296 >= 33554432; {12847#true} is VALID [2022-02-21 03:10:31,201 INFO L290 TraceCheckUtils]: 35: Hoare triple {12847#true} assume ~e >= 127;~__retres4~0 := 4294967295; {12847#true} is VALID [2022-02-21 03:10:31,201 INFO L290 TraceCheckUtils]: 36: Hoare triple {12847#true} #res := ~__retres4~0; {12847#true} is VALID [2022-02-21 03:10:31,201 INFO L290 TraceCheckUtils]: 37: Hoare triple {12847#true} assume true; {12847#true} is VALID [2022-02-21 03:10:31,201 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {12847#true} {12847#true} #374#return; {12847#true} is VALID [2022-02-21 03:10:31,202 INFO L290 TraceCheckUtils]: 39: Hoare triple {12847#true} main_~a~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {12847#true} is VALID [2022-02-21 03:10:31,202 INFO L272 TraceCheckUtils]: 40: Hoare triple {12847#true} call main_#t~ret25#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {12847#true} is VALID [2022-02-21 03:10:31,202 INFO L290 TraceCheckUtils]: 41: Hoare triple {12847#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12847#true} is VALID [2022-02-21 03:10:31,202 INFO L290 TraceCheckUtils]: 42: Hoare triple {12847#true} assume !(0 == ~m % 4294967296); {12847#true} is VALID [2022-02-21 03:10:31,202 INFO L290 TraceCheckUtils]: 43: Hoare triple {12847#true} assume !(~m % 4294967296 < 16777216); {12847#true} is VALID [2022-02-21 03:10:31,202 INFO L290 TraceCheckUtils]: 44: Hoare triple {12847#true} assume !false; {12847#true} is VALID [2022-02-21 03:10:31,202 INFO L290 TraceCheckUtils]: 45: Hoare triple {12847#true} assume ~m % 4294967296 >= 33554432; {12847#true} is VALID [2022-02-21 03:10:31,218 INFO L290 TraceCheckUtils]: 46: Hoare triple {12847#true} assume ~e >= 127;~__retres4~0 := 4294967295; {13036#(<= 4294967295 base2flt_~__retres4~0)} is VALID [2022-02-21 03:10:31,218 INFO L290 TraceCheckUtils]: 47: Hoare triple {13036#(<= 4294967295 base2flt_~__retres4~0)} #res := ~__retres4~0; {13040#(<= 4294967295 |base2flt_#res|)} is VALID [2022-02-21 03:10:31,219 INFO L290 TraceCheckUtils]: 48: Hoare triple {13040#(<= 4294967295 |base2flt_#res|)} assume true; {13040#(<= 4294967295 |base2flt_#res|)} is VALID [2022-02-21 03:10:31,220 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {13040#(<= 4294967295 |base2flt_#res|)} {12847#true} #376#return; {13047#(<= 4294967295 |ULTIMATE.start_main_#t~ret25#1|)} is VALID [2022-02-21 03:10:31,220 INFO L290 TraceCheckUtils]: 50: Hoare triple {13047#(<= 4294967295 |ULTIMATE.start_main_#t~ret25#1|)} main_~b~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {13051#(<= 4294967295 |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-21 03:10:31,220 INFO L290 TraceCheckUtils]: 51: Hoare triple {13051#(<= 4294967295 |ULTIMATE.start_main_~b~0#1|)} assume main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sb~0#1 := -1; {13051#(<= 4294967295 |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-21 03:10:31,221 INFO L290 TraceCheckUtils]: 52: Hoare triple {13051#(<= 4294967295 |ULTIMATE.start_main_~b~0#1|)} assume { :begin_inline_mulflt } true;mulflt_#in~a#1, mulflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mulflt_#res#1;havoc mulflt_#t~nondet12#1, mulflt_#t~nondet13#1, mulflt_#t~nondet14#1, mulflt_#t~nondet15#1, mulflt_#t~nondet16#1, mulflt_#t~nondet17#1, mulflt_~a#1, mulflt_~b#1, mulflt_~res~2#1, mulflt_~ma~1#1, mulflt_~mb~1#1, mulflt_~accu~0#1, mulflt_~ea~1#1, mulflt_~eb~1#1, mulflt_~tmp~1#1, mulflt_~__retres10~1#1;mulflt_~a#1 := mulflt_#in~a#1;mulflt_~b#1 := mulflt_#in~b#1;havoc mulflt_~res~2#1;havoc mulflt_~ma~1#1;havoc mulflt_~mb~1#1;havoc mulflt_~accu~0#1;havoc mulflt_~ea~1#1;havoc mulflt_~eb~1#1;havoc mulflt_~tmp~1#1;havoc mulflt_~__retres10~1#1; {13058#(<= 4294967295 |ULTIMATE.start_mulflt_~b#1|)} is VALID [2022-02-21 03:10:31,221 INFO L290 TraceCheckUtils]: 53: Hoare triple {13058#(<= 4294967295 |ULTIMATE.start_mulflt_~b#1|)} assume mulflt_~a#1 % 4294967296 < mulflt_~b#1 % 4294967296;mulflt_~tmp~1#1 := mulflt_~a#1;mulflt_~a#1 := mulflt_~b#1;mulflt_~b#1 := mulflt_~tmp~1#1; {13062#(<= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} is VALID [2022-02-21 03:10:31,221 INFO L290 TraceCheckUtils]: 54: Hoare triple {13062#(<= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} assume !(0 == mulflt_~b#1 % 4294967296); {13062#(<= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} is VALID [2022-02-21 03:10:31,222 INFO L290 TraceCheckUtils]: 55: Hoare triple {13062#(<= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} assume !(0 == mulflt_~a#1); {13062#(<= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} is VALID [2022-02-21 03:10:31,222 INFO L290 TraceCheckUtils]: 56: Hoare triple {13062#(<= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} assume !false; {13062#(<= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} is VALID [2022-02-21 03:10:31,222 INFO L290 TraceCheckUtils]: 57: Hoare triple {13062#(<= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} assume !false; {13062#(<= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} is VALID [2022-02-21 03:10:31,223 INFO L290 TraceCheckUtils]: 58: Hoare triple {13062#(<= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} assume !(mulflt_~a#1 >= 0);mulflt_~ma~1#1 := mulflt_#t~nondet12#1;havoc mulflt_#t~nondet12#1; {12848#false} is VALID [2022-02-21 03:10:31,223 INFO L290 TraceCheckUtils]: 59: Hoare triple {12848#false} assume (if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {12848#false} is VALID [2022-02-21 03:10:31,223 INFO L290 TraceCheckUtils]: 60: Hoare triple {12848#false} assume !((if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {12848#false} is VALID [2022-02-21 03:10:31,223 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-02-21 03:10:31,223 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:10:31,223 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149315531] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:31,223 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:10:31,223 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2022-02-21 03:10:31,224 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448343780] [2022-02-21 03:10:31,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:31,224 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 61 [2022-02-21 03:10:31,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:31,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:10:31,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:31,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-21 03:10:31,253 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:31,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 03:10:31,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-02-21 03:10:31,254 INFO L87 Difference]: Start difference. First operand 185 states and 241 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:10:31,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:31,941 INFO L93 Difference]: Finished difference Result 317 states and 389 transitions. [2022-02-21 03:10:31,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 03:10:31,942 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 61 [2022-02-21 03:10:31,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:31,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:10:31,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 246 transitions. [2022-02-21 03:10:31,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:10:31,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 246 transitions. [2022-02-21 03:10:31,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 246 transitions. [2022-02-21 03:10:32,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 246 edges. 246 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:32,152 INFO L225 Difference]: With dead ends: 317 [2022-02-21 03:10:32,152 INFO L226 Difference]: Without dead ends: 279 [2022-02-21 03:10:32,152 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2022-02-21 03:10:32,153 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 173 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:32,153 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 788 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:10:32,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-02-21 03:10:32,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 216. [2022-02-21 03:10:32,244 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:32,245 INFO L82 GeneralOperation]: Start isEquivalent. First operand 279 states. Second operand has 216 states, 199 states have (on average 1.35678391959799) internal successors, (270), 206 states have internal predecessors, (270), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-21 03:10:32,246 INFO L74 IsIncluded]: Start isIncluded. First operand 279 states. Second operand has 216 states, 199 states have (on average 1.35678391959799) internal successors, (270), 206 states have internal predecessors, (270), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-21 03:10:32,246 INFO L87 Difference]: Start difference. First operand 279 states. Second operand has 216 states, 199 states have (on average 1.35678391959799) internal successors, (270), 206 states have internal predecessors, (270), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-21 03:10:32,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:32,252 INFO L93 Difference]: Finished difference Result 279 states and 344 transitions. [2022-02-21 03:10:32,252 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 344 transitions. [2022-02-21 03:10:32,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:32,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:32,253 INFO L74 IsIncluded]: Start isIncluded. First operand has 216 states, 199 states have (on average 1.35678391959799) internal successors, (270), 206 states have internal predecessors, (270), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Second operand 279 states. [2022-02-21 03:10:32,254 INFO L87 Difference]: Start difference. First operand has 216 states, 199 states have (on average 1.35678391959799) internal successors, (270), 206 states have internal predecessors, (270), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Second operand 279 states. [2022-02-21 03:10:32,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:32,259 INFO L93 Difference]: Finished difference Result 279 states and 344 transitions. [2022-02-21 03:10:32,259 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 344 transitions. [2022-02-21 03:10:32,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:32,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:32,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:32,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:32,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 199 states have (on average 1.35678391959799) internal successors, (270), 206 states have internal predecessors, (270), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-21 03:10:32,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 279 transitions. [2022-02-21 03:10:32,266 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 279 transitions. Word has length 61 [2022-02-21 03:10:32,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:32,267 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 279 transitions. [2022-02-21 03:10:32,267 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:10:32,267 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 279 transitions. [2022-02-21 03:10:32,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-21 03:10:32,268 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:32,268 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 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] [2022-02-21 03:10:32,296 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:32,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:32,495 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-02-21 03:10:32,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:32,495 INFO L85 PathProgramCache]: Analyzing trace with hash -828183077, now seen corresponding path program 1 times [2022-02-21 03:10:32,495 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:32,495 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950136818] [2022-02-21 03:10:32,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:32,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:32,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:32,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:32,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:32,530 INFO L290 TraceCheckUtils]: 0: Hoare triple {14280#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14237#true} is VALID [2022-02-21 03:10:32,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {14237#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {14237#true} is VALID [2022-02-21 03:10:32,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {14237#true} #res := ~__retres4~0; {14237#true} is VALID [2022-02-21 03:10:32,531 INFO L290 TraceCheckUtils]: 3: Hoare triple {14237#true} assume true; {14237#true} is VALID [2022-02-21 03:10:32,531 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {14237#true} {14237#true} #370#return; {14237#true} is VALID [2022-02-21 03:10:32,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:32,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:32,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {14280#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14281#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:32,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {14281#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !(0 == ~m % 4294967296); {14281#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:32,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {14281#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~m % 4294967296 < 16777216; {14281#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:32,579 INFO L290 TraceCheckUtils]: 3: Hoare triple {14281#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !false; {14281#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:32,579 INFO L290 TraceCheckUtils]: 4: Hoare triple {14281#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !(~e <= -128); {14281#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:32,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {14281#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~e - 1 <= 2147483647; {14281#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:32,580 INFO L290 TraceCheckUtils]: 6: Hoare triple {14281#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {14282#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:32,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {14282#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume ~m % 4294967296 < 16777216; {14282#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:32,581 INFO L290 TraceCheckUtils]: 8: Hoare triple {14282#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume !false; {14282#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:32,581 INFO L290 TraceCheckUtils]: 9: Hoare triple {14282#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume !(~e <= -128); {14282#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:32,581 INFO L290 TraceCheckUtils]: 10: Hoare triple {14282#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume ~e - 1 <= 2147483647; {14282#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:32,582 INFO L290 TraceCheckUtils]: 11: Hoare triple {14282#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {14283#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:32,582 INFO L290 TraceCheckUtils]: 12: Hoare triple {14283#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~m % 4294967296 < 16777216; {14283#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:32,582 INFO L290 TraceCheckUtils]: 13: Hoare triple {14283#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume !false; {14283#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:32,583 INFO L290 TraceCheckUtils]: 14: Hoare triple {14283#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~e <= -128;~__retres4~0 := 0; {14284#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:10:32,583 INFO L290 TraceCheckUtils]: 15: Hoare triple {14284#(not (= |base2flt_#in~e| 0))} #res := ~__retres4~0; {14284#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:10:32,583 INFO L290 TraceCheckUtils]: 16: Hoare triple {14284#(not (= |base2flt_#in~e| 0))} assume true; {14284#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:10:32,584 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {14284#(not (= |base2flt_#in~e| 0))} {14237#true} #372#return; {14238#false} is VALID [2022-02-21 03:10:32,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-02-21 03:10:32,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:32,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {14280#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14237#true} is VALID [2022-02-21 03:10:32,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {14237#true} assume !(0 == ~m % 4294967296); {14237#true} is VALID [2022-02-21 03:10:32,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {14237#true} assume !(~m % 4294967296 < 16777216); {14237#true} is VALID [2022-02-21 03:10:32,593 INFO L290 TraceCheckUtils]: 3: Hoare triple {14237#true} assume !false; {14237#true} is VALID [2022-02-21 03:10:32,593 INFO L290 TraceCheckUtils]: 4: Hoare triple {14237#true} assume ~m % 4294967296 >= 33554432; {14237#true} is VALID [2022-02-21 03:10:32,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {14237#true} assume ~e >= 127;~__retres4~0 := 4294967295; {14237#true} is VALID [2022-02-21 03:10:32,593 INFO L290 TraceCheckUtils]: 6: Hoare triple {14237#true} #res := ~__retres4~0; {14237#true} is VALID [2022-02-21 03:10:32,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {14237#true} assume true; {14237#true} is VALID [2022-02-21 03:10:32,593 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {14237#true} {14238#false} #374#return; {14238#false} is VALID [2022-02-21 03:10:32,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-21 03:10:32,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:32,599 INFO L290 TraceCheckUtils]: 0: Hoare triple {14280#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14237#true} is VALID [2022-02-21 03:10:32,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {14237#true} assume !(0 == ~m % 4294967296); {14237#true} is VALID [2022-02-21 03:10:32,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {14237#true} assume !(~m % 4294967296 < 16777216); {14237#true} is VALID [2022-02-21 03:10:32,599 INFO L290 TraceCheckUtils]: 3: Hoare triple {14237#true} assume !false; {14237#true} is VALID [2022-02-21 03:10:32,599 INFO L290 TraceCheckUtils]: 4: Hoare triple {14237#true} assume ~m % 4294967296 >= 33554432; {14237#true} is VALID [2022-02-21 03:10:32,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {14237#true} assume ~e >= 127;~__retres4~0 := 4294967295; {14237#true} is VALID [2022-02-21 03:10:32,600 INFO L290 TraceCheckUtils]: 6: Hoare triple {14237#true} #res := ~__retres4~0; {14237#true} is VALID [2022-02-21 03:10:32,600 INFO L290 TraceCheckUtils]: 7: Hoare triple {14237#true} assume true; {14237#true} is VALID [2022-02-21 03:10:32,600 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {14237#true} {14238#false} #376#return; {14238#false} is VALID [2022-02-21 03:10:32,600 INFO L290 TraceCheckUtils]: 0: Hoare triple {14237#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(22, 2);call #Ultimate.allocInit(12, 3); {14237#true} is VALID [2022-02-21 03:10:32,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {14237#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_~sb~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_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {14237#true} is VALID [2022-02-21 03:10:32,601 INFO L272 TraceCheckUtils]: 2: Hoare triple {14237#true} call main_#t~ret22#1 := base2flt(0, 0); {14280#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:32,601 INFO L290 TraceCheckUtils]: 3: Hoare triple {14280#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14237#true} is VALID [2022-02-21 03:10:32,601 INFO L290 TraceCheckUtils]: 4: Hoare triple {14237#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {14237#true} is VALID [2022-02-21 03:10:32,601 INFO L290 TraceCheckUtils]: 5: Hoare triple {14237#true} #res := ~__retres4~0; {14237#true} is VALID [2022-02-21 03:10:32,602 INFO L290 TraceCheckUtils]: 6: Hoare triple {14237#true} assume true; {14237#true} is VALID [2022-02-21 03:10:32,602 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14237#true} {14237#true} #370#return; {14237#true} is VALID [2022-02-21 03:10:32,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {14237#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {14237#true} is VALID [2022-02-21 03:10:32,602 INFO L272 TraceCheckUtils]: 9: Hoare triple {14237#true} call main_#t~ret23#1 := base2flt(1, 0); {14280#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:32,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {14280#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14281#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:32,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {14281#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !(0 == ~m % 4294967296); {14281#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:32,604 INFO L290 TraceCheckUtils]: 12: Hoare triple {14281#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~m % 4294967296 < 16777216; {14281#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:32,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {14281#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !false; {14281#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:32,605 INFO L290 TraceCheckUtils]: 14: Hoare triple {14281#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !(~e <= -128); {14281#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:32,605 INFO L290 TraceCheckUtils]: 15: Hoare triple {14281#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~e - 1 <= 2147483647; {14281#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:32,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {14281#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {14282#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:32,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {14282#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume ~m % 4294967296 < 16777216; {14282#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:32,606 INFO L290 TraceCheckUtils]: 18: Hoare triple {14282#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume !false; {14282#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:32,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {14282#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume !(~e <= -128); {14282#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:32,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {14282#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume ~e - 1 <= 2147483647; {14282#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:32,608 INFO L290 TraceCheckUtils]: 21: Hoare triple {14282#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {14283#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:32,608 INFO L290 TraceCheckUtils]: 22: Hoare triple {14283#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~m % 4294967296 < 16777216; {14283#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:32,608 INFO L290 TraceCheckUtils]: 23: Hoare triple {14283#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume !false; {14283#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:32,609 INFO L290 TraceCheckUtils]: 24: Hoare triple {14283#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~e <= -128;~__retres4~0 := 0; {14284#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:10:32,609 INFO L290 TraceCheckUtils]: 25: Hoare triple {14284#(not (= |base2flt_#in~e| 0))} #res := ~__retres4~0; {14284#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:10:32,610 INFO L290 TraceCheckUtils]: 26: Hoare triple {14284#(not (= |base2flt_#in~e| 0))} assume true; {14284#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:10:32,610 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {14284#(not (= |base2flt_#in~e| 0))} {14237#true} #372#return; {14238#false} is VALID [2022-02-21 03:10:32,610 INFO L290 TraceCheckUtils]: 28: Hoare triple {14238#false} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {14238#false} is VALID [2022-02-21 03:10:32,611 INFO L272 TraceCheckUtils]: 29: Hoare triple {14238#false} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {14280#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:32,611 INFO L290 TraceCheckUtils]: 30: Hoare triple {14280#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14237#true} is VALID [2022-02-21 03:10:32,611 INFO L290 TraceCheckUtils]: 31: Hoare triple {14237#true} assume !(0 == ~m % 4294967296); {14237#true} is VALID [2022-02-21 03:10:32,611 INFO L290 TraceCheckUtils]: 32: Hoare triple {14237#true} assume !(~m % 4294967296 < 16777216); {14237#true} is VALID [2022-02-21 03:10:32,611 INFO L290 TraceCheckUtils]: 33: Hoare triple {14237#true} assume !false; {14237#true} is VALID [2022-02-21 03:10:32,611 INFO L290 TraceCheckUtils]: 34: Hoare triple {14237#true} assume ~m % 4294967296 >= 33554432; {14237#true} is VALID [2022-02-21 03:10:32,611 INFO L290 TraceCheckUtils]: 35: Hoare triple {14237#true} assume ~e >= 127;~__retres4~0 := 4294967295; {14237#true} is VALID [2022-02-21 03:10:32,612 INFO L290 TraceCheckUtils]: 36: Hoare triple {14237#true} #res := ~__retres4~0; {14237#true} is VALID [2022-02-21 03:10:32,612 INFO L290 TraceCheckUtils]: 37: Hoare triple {14237#true} assume true; {14237#true} is VALID [2022-02-21 03:10:32,612 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {14237#true} {14238#false} #374#return; {14238#false} is VALID [2022-02-21 03:10:32,612 INFO L290 TraceCheckUtils]: 39: Hoare triple {14238#false} main_~a~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {14238#false} is VALID [2022-02-21 03:10:32,612 INFO L272 TraceCheckUtils]: 40: Hoare triple {14238#false} call main_#t~ret25#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {14280#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:32,612 INFO L290 TraceCheckUtils]: 41: Hoare triple {14280#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14237#true} is VALID [2022-02-21 03:10:32,612 INFO L290 TraceCheckUtils]: 42: Hoare triple {14237#true} assume !(0 == ~m % 4294967296); {14237#true} is VALID [2022-02-21 03:10:32,613 INFO L290 TraceCheckUtils]: 43: Hoare triple {14237#true} assume !(~m % 4294967296 < 16777216); {14237#true} is VALID [2022-02-21 03:10:32,613 INFO L290 TraceCheckUtils]: 44: Hoare triple {14237#true} assume !false; {14237#true} is VALID [2022-02-21 03:10:32,613 INFO L290 TraceCheckUtils]: 45: Hoare triple {14237#true} assume ~m % 4294967296 >= 33554432; {14237#true} is VALID [2022-02-21 03:10:32,613 INFO L290 TraceCheckUtils]: 46: Hoare triple {14237#true} assume ~e >= 127;~__retres4~0 := 4294967295; {14237#true} is VALID [2022-02-21 03:10:32,613 INFO L290 TraceCheckUtils]: 47: Hoare triple {14237#true} #res := ~__retres4~0; {14237#true} is VALID [2022-02-21 03:10:32,613 INFO L290 TraceCheckUtils]: 48: Hoare triple {14237#true} assume true; {14237#true} is VALID [2022-02-21 03:10:32,614 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {14237#true} {14238#false} #376#return; {14238#false} is VALID [2022-02-21 03:10:32,614 INFO L290 TraceCheckUtils]: 50: Hoare triple {14238#false} main_~b~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {14238#false} is VALID [2022-02-21 03:10:32,614 INFO L290 TraceCheckUtils]: 51: Hoare triple {14238#false} assume main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sb~0#1 := -1; {14238#false} is VALID [2022-02-21 03:10:32,614 INFO L290 TraceCheckUtils]: 52: Hoare triple {14238#false} assume { :begin_inline_mulflt } true;mulflt_#in~a#1, mulflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mulflt_#res#1;havoc mulflt_#t~nondet12#1, mulflt_#t~nondet13#1, mulflt_#t~nondet14#1, mulflt_#t~nondet15#1, mulflt_#t~nondet16#1, mulflt_#t~nondet17#1, mulflt_~a#1, mulflt_~b#1, mulflt_~res~2#1, mulflt_~ma~1#1, mulflt_~mb~1#1, mulflt_~accu~0#1, mulflt_~ea~1#1, mulflt_~eb~1#1, mulflt_~tmp~1#1, mulflt_~__retres10~1#1;mulflt_~a#1 := mulflt_#in~a#1;mulflt_~b#1 := mulflt_#in~b#1;havoc mulflt_~res~2#1;havoc mulflt_~ma~1#1;havoc mulflt_~mb~1#1;havoc mulflt_~accu~0#1;havoc mulflt_~ea~1#1;havoc mulflt_~eb~1#1;havoc mulflt_~tmp~1#1;havoc mulflt_~__retres10~1#1; {14238#false} is VALID [2022-02-21 03:10:32,614 INFO L290 TraceCheckUtils]: 53: Hoare triple {14238#false} assume mulflt_~a#1 % 4294967296 < mulflt_~b#1 % 4294967296;mulflt_~tmp~1#1 := mulflt_~a#1;mulflt_~a#1 := mulflt_~b#1;mulflt_~b#1 := mulflt_~tmp~1#1; {14238#false} is VALID [2022-02-21 03:10:32,614 INFO L290 TraceCheckUtils]: 54: Hoare triple {14238#false} assume !(0 == mulflt_~b#1 % 4294967296); {14238#false} is VALID [2022-02-21 03:10:32,614 INFO L290 TraceCheckUtils]: 55: Hoare triple {14238#false} assume !(0 == mulflt_~a#1); {14238#false} is VALID [2022-02-21 03:10:32,615 INFO L290 TraceCheckUtils]: 56: Hoare triple {14238#false} assume !false; {14238#false} is VALID [2022-02-21 03:10:32,615 INFO L290 TraceCheckUtils]: 57: Hoare triple {14238#false} assume !false; {14238#false} is VALID [2022-02-21 03:10:32,615 INFO L290 TraceCheckUtils]: 58: Hoare triple {14238#false} assume mulflt_~a#1 >= 0;abs_171 := (if mulflt_~a#1 < 16777215 then mulflt_~a#1 else 16777215);assume mulflt_~a#1 >= 0;assume mulflt_~ma~1#1 < abs_171; {14238#false} is VALID [2022-02-21 03:10:32,615 INFO L290 TraceCheckUtils]: 59: Hoare triple {14238#false} assume (if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {14238#false} is VALID [2022-02-21 03:10:32,615 INFO L290 TraceCheckUtils]: 60: Hoare triple {14238#false} assume !((if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {14238#false} is VALID [2022-02-21 03:10:32,616 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-02-21 03:10:32,616 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:32,616 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950136818] [2022-02-21 03:10:32,616 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950136818] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:32,616 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886654862] [2022-02-21 03:10:32,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:32,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:32,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:32,620 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:32,646 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:32,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:32,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:10:32,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:32,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:32,913 INFO L290 TraceCheckUtils]: 0: Hoare triple {14237#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(22, 2);call #Ultimate.allocInit(12, 3); {14237#true} is VALID [2022-02-21 03:10:32,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {14237#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_~sb~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_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {14237#true} is VALID [2022-02-21 03:10:32,913 INFO L272 TraceCheckUtils]: 2: Hoare triple {14237#true} call main_#t~ret22#1 := base2flt(0, 0); {14237#true} is VALID [2022-02-21 03:10:32,913 INFO L290 TraceCheckUtils]: 3: Hoare triple {14237#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14237#true} is VALID [2022-02-21 03:10:32,914 INFO L290 TraceCheckUtils]: 4: Hoare triple {14237#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {14237#true} is VALID [2022-02-21 03:10:32,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {14237#true} #res := ~__retres4~0; {14237#true} is VALID [2022-02-21 03:10:32,914 INFO L290 TraceCheckUtils]: 6: Hoare triple {14237#true} assume true; {14237#true} is VALID [2022-02-21 03:10:32,914 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14237#true} {14237#true} #370#return; {14237#true} is VALID [2022-02-21 03:10:32,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {14237#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {14237#true} is VALID [2022-02-21 03:10:32,914 INFO L272 TraceCheckUtils]: 9: Hoare triple {14237#true} call main_#t~ret23#1 := base2flt(1, 0); {14237#true} is VALID [2022-02-21 03:10:32,914 INFO L290 TraceCheckUtils]: 10: Hoare triple {14237#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14318#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:32,915 INFO L290 TraceCheckUtils]: 11: Hoare triple {14318#(<= |base2flt_#in~e| base2flt_~e)} assume !(0 == ~m % 4294967296); {14318#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:32,915 INFO L290 TraceCheckUtils]: 12: Hoare triple {14318#(<= |base2flt_#in~e| base2flt_~e)} assume ~m % 4294967296 < 16777216; {14318#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:32,915 INFO L290 TraceCheckUtils]: 13: Hoare triple {14318#(<= |base2flt_#in~e| base2flt_~e)} assume !false; {14318#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:32,915 INFO L290 TraceCheckUtils]: 14: Hoare triple {14318#(<= |base2flt_#in~e| base2flt_~e)} assume !(~e <= -128); {14318#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:32,916 INFO L290 TraceCheckUtils]: 15: Hoare triple {14318#(<= |base2flt_#in~e| base2flt_~e)} assume ~e - 1 <= 2147483647; {14318#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:32,916 INFO L290 TraceCheckUtils]: 16: Hoare triple {14318#(<= |base2flt_#in~e| base2flt_~e)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {14337#(<= |base2flt_#in~e| (+ base2flt_~e 1))} is VALID [2022-02-21 03:10:32,917 INFO L290 TraceCheckUtils]: 17: Hoare triple {14337#(<= |base2flt_#in~e| (+ base2flt_~e 1))} assume ~m % 4294967296 < 16777216; {14337#(<= |base2flt_#in~e| (+ base2flt_~e 1))} is VALID [2022-02-21 03:10:32,917 INFO L290 TraceCheckUtils]: 18: Hoare triple {14337#(<= |base2flt_#in~e| (+ base2flt_~e 1))} assume !false; {14337#(<= |base2flt_#in~e| (+ base2flt_~e 1))} is VALID [2022-02-21 03:10:32,917 INFO L290 TraceCheckUtils]: 19: Hoare triple {14337#(<= |base2flt_#in~e| (+ base2flt_~e 1))} assume !(~e <= -128); {14337#(<= |base2flt_#in~e| (+ base2flt_~e 1))} is VALID [2022-02-21 03:10:32,917 INFO L290 TraceCheckUtils]: 20: Hoare triple {14337#(<= |base2flt_#in~e| (+ base2flt_~e 1))} assume ~e - 1 <= 2147483647; {14337#(<= |base2flt_#in~e| (+ base2flt_~e 1))} is VALID [2022-02-21 03:10:32,918 INFO L290 TraceCheckUtils]: 21: Hoare triple {14337#(<= |base2flt_#in~e| (+ base2flt_~e 1))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {14353#(<= |base2flt_#in~e| (+ 2 base2flt_~e))} is VALID [2022-02-21 03:10:32,918 INFO L290 TraceCheckUtils]: 22: Hoare triple {14353#(<= |base2flt_#in~e| (+ 2 base2flt_~e))} assume ~m % 4294967296 < 16777216; {14353#(<= |base2flt_#in~e| (+ 2 base2flt_~e))} is VALID [2022-02-21 03:10:32,919 INFO L290 TraceCheckUtils]: 23: Hoare triple {14353#(<= |base2flt_#in~e| (+ 2 base2flt_~e))} assume !false; {14353#(<= |base2flt_#in~e| (+ 2 base2flt_~e))} is VALID [2022-02-21 03:10:32,919 INFO L290 TraceCheckUtils]: 24: Hoare triple {14353#(<= |base2flt_#in~e| (+ 2 base2flt_~e))} assume ~e <= -128;~__retres4~0 := 0; {14363#(<= (+ 126 |base2flt_#in~e|) 0)} is VALID [2022-02-21 03:10:32,919 INFO L290 TraceCheckUtils]: 25: Hoare triple {14363#(<= (+ 126 |base2flt_#in~e|) 0)} #res := ~__retres4~0; {14363#(<= (+ 126 |base2flt_#in~e|) 0)} is VALID [2022-02-21 03:10:32,920 INFO L290 TraceCheckUtils]: 26: Hoare triple {14363#(<= (+ 126 |base2flt_#in~e|) 0)} assume true; {14363#(<= (+ 126 |base2flt_#in~e|) 0)} is VALID [2022-02-21 03:10:32,920 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {14363#(<= (+ 126 |base2flt_#in~e|) 0)} {14237#true} #372#return; {14238#false} is VALID [2022-02-21 03:10:32,920 INFO L290 TraceCheckUtils]: 28: Hoare triple {14238#false} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {14238#false} is VALID [2022-02-21 03:10:32,921 INFO L272 TraceCheckUtils]: 29: Hoare triple {14238#false} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {14238#false} is VALID [2022-02-21 03:10:32,921 INFO L290 TraceCheckUtils]: 30: Hoare triple {14238#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14238#false} is VALID [2022-02-21 03:10:32,921 INFO L290 TraceCheckUtils]: 31: Hoare triple {14238#false} assume !(0 == ~m % 4294967296); {14238#false} is VALID [2022-02-21 03:10:32,921 INFO L290 TraceCheckUtils]: 32: Hoare triple {14238#false} assume !(~m % 4294967296 < 16777216); {14238#false} is VALID [2022-02-21 03:10:32,921 INFO L290 TraceCheckUtils]: 33: Hoare triple {14238#false} assume !false; {14238#false} is VALID [2022-02-21 03:10:32,921 INFO L290 TraceCheckUtils]: 34: Hoare triple {14238#false} assume ~m % 4294967296 >= 33554432; {14238#false} is VALID [2022-02-21 03:10:32,921 INFO L290 TraceCheckUtils]: 35: Hoare triple {14238#false} assume ~e >= 127;~__retres4~0 := 4294967295; {14238#false} is VALID [2022-02-21 03:10:32,921 INFO L290 TraceCheckUtils]: 36: Hoare triple {14238#false} #res := ~__retres4~0; {14238#false} is VALID [2022-02-21 03:10:32,921 INFO L290 TraceCheckUtils]: 37: Hoare triple {14238#false} assume true; {14238#false} is VALID [2022-02-21 03:10:32,921 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {14238#false} {14238#false} #374#return; {14238#false} is VALID [2022-02-21 03:10:32,921 INFO L290 TraceCheckUtils]: 39: Hoare triple {14238#false} main_~a~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {14238#false} is VALID [2022-02-21 03:10:32,921 INFO L272 TraceCheckUtils]: 40: Hoare triple {14238#false} call main_#t~ret25#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {14238#false} is VALID [2022-02-21 03:10:32,922 INFO L290 TraceCheckUtils]: 41: Hoare triple {14238#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14238#false} is VALID [2022-02-21 03:10:32,922 INFO L290 TraceCheckUtils]: 42: Hoare triple {14238#false} assume !(0 == ~m % 4294967296); {14238#false} is VALID [2022-02-21 03:10:32,922 INFO L290 TraceCheckUtils]: 43: Hoare triple {14238#false} assume !(~m % 4294967296 < 16777216); {14238#false} is VALID [2022-02-21 03:10:32,922 INFO L290 TraceCheckUtils]: 44: Hoare triple {14238#false} assume !false; {14238#false} is VALID [2022-02-21 03:10:32,922 INFO L290 TraceCheckUtils]: 45: Hoare triple {14238#false} assume ~m % 4294967296 >= 33554432; {14238#false} is VALID [2022-02-21 03:10:32,922 INFO L290 TraceCheckUtils]: 46: Hoare triple {14238#false} assume ~e >= 127;~__retres4~0 := 4294967295; {14238#false} is VALID [2022-02-21 03:10:32,922 INFO L290 TraceCheckUtils]: 47: Hoare triple {14238#false} #res := ~__retres4~0; {14238#false} is VALID [2022-02-21 03:10:32,922 INFO L290 TraceCheckUtils]: 48: Hoare triple {14238#false} assume true; {14238#false} is VALID [2022-02-21 03:10:32,922 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {14238#false} {14238#false} #376#return; {14238#false} is VALID [2022-02-21 03:10:32,922 INFO L290 TraceCheckUtils]: 50: Hoare triple {14238#false} main_~b~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {14238#false} is VALID [2022-02-21 03:10:32,922 INFO L290 TraceCheckUtils]: 51: Hoare triple {14238#false} assume main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sb~0#1 := -1; {14238#false} is VALID [2022-02-21 03:10:32,923 INFO L290 TraceCheckUtils]: 52: Hoare triple {14238#false} assume { :begin_inline_mulflt } true;mulflt_#in~a#1, mulflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mulflt_#res#1;havoc mulflt_#t~nondet12#1, mulflt_#t~nondet13#1, mulflt_#t~nondet14#1, mulflt_#t~nondet15#1, mulflt_#t~nondet16#1, mulflt_#t~nondet17#1, mulflt_~a#1, mulflt_~b#1, mulflt_~res~2#1, mulflt_~ma~1#1, mulflt_~mb~1#1, mulflt_~accu~0#1, mulflt_~ea~1#1, mulflt_~eb~1#1, mulflt_~tmp~1#1, mulflt_~__retres10~1#1;mulflt_~a#1 := mulflt_#in~a#1;mulflt_~b#1 := mulflt_#in~b#1;havoc mulflt_~res~2#1;havoc mulflt_~ma~1#1;havoc mulflt_~mb~1#1;havoc mulflt_~accu~0#1;havoc mulflt_~ea~1#1;havoc mulflt_~eb~1#1;havoc mulflt_~tmp~1#1;havoc mulflt_~__retres10~1#1; {14238#false} is VALID [2022-02-21 03:10:32,923 INFO L290 TraceCheckUtils]: 53: Hoare triple {14238#false} assume mulflt_~a#1 % 4294967296 < mulflt_~b#1 % 4294967296;mulflt_~tmp~1#1 := mulflt_~a#1;mulflt_~a#1 := mulflt_~b#1;mulflt_~b#1 := mulflt_~tmp~1#1; {14238#false} is VALID [2022-02-21 03:10:32,923 INFO L290 TraceCheckUtils]: 54: Hoare triple {14238#false} assume !(0 == mulflt_~b#1 % 4294967296); {14238#false} is VALID [2022-02-21 03:10:32,923 INFO L290 TraceCheckUtils]: 55: Hoare triple {14238#false} assume !(0 == mulflt_~a#1); {14238#false} is VALID [2022-02-21 03:10:32,923 INFO L290 TraceCheckUtils]: 56: Hoare triple {14238#false} assume !false; {14238#false} is VALID [2022-02-21 03:10:32,923 INFO L290 TraceCheckUtils]: 57: Hoare triple {14238#false} assume !false; {14238#false} is VALID [2022-02-21 03:10:32,923 INFO L290 TraceCheckUtils]: 58: Hoare triple {14238#false} assume mulflt_~a#1 >= 0;abs_171 := (if mulflt_~a#1 < 16777215 then mulflt_~a#1 else 16777215);assume mulflt_~a#1 >= 0;assume mulflt_~ma~1#1 < abs_171; {14238#false} is VALID [2022-02-21 03:10:32,927 INFO L290 TraceCheckUtils]: 59: Hoare triple {14238#false} assume (if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {14238#false} is VALID [2022-02-21 03:10:32,927 INFO L290 TraceCheckUtils]: 60: Hoare triple {14238#false} assume !((if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {14238#false} is VALID [2022-02-21 03:10:32,928 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-21 03:10:32,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:10:33,315 INFO L290 TraceCheckUtils]: 60: Hoare triple {14238#false} assume !((if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {14238#false} is VALID [2022-02-21 03:10:33,315 INFO L290 TraceCheckUtils]: 59: Hoare triple {14238#false} assume (if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {14238#false} is VALID [2022-02-21 03:10:33,315 INFO L290 TraceCheckUtils]: 58: Hoare triple {14238#false} assume mulflt_~a#1 >= 0;abs_171 := (if mulflt_~a#1 < 16777215 then mulflt_~a#1 else 16777215);assume mulflt_~a#1 >= 0;assume mulflt_~ma~1#1 < abs_171; {14238#false} is VALID [2022-02-21 03:10:33,315 INFO L290 TraceCheckUtils]: 57: Hoare triple {14238#false} assume !false; {14238#false} is VALID [2022-02-21 03:10:33,315 INFO L290 TraceCheckUtils]: 56: Hoare triple {14238#false} assume !false; {14238#false} is VALID [2022-02-21 03:10:33,316 INFO L290 TraceCheckUtils]: 55: Hoare triple {14238#false} assume !(0 == mulflt_~a#1); {14238#false} is VALID [2022-02-21 03:10:33,316 INFO L290 TraceCheckUtils]: 54: Hoare triple {14238#false} assume !(0 == mulflt_~b#1 % 4294967296); {14238#false} is VALID [2022-02-21 03:10:33,316 INFO L290 TraceCheckUtils]: 53: Hoare triple {14238#false} assume mulflt_~a#1 % 4294967296 < mulflt_~b#1 % 4294967296;mulflt_~tmp~1#1 := mulflt_~a#1;mulflt_~a#1 := mulflt_~b#1;mulflt_~b#1 := mulflt_~tmp~1#1; {14238#false} is VALID [2022-02-21 03:10:33,316 INFO L290 TraceCheckUtils]: 52: Hoare triple {14238#false} assume { :begin_inline_mulflt } true;mulflt_#in~a#1, mulflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mulflt_#res#1;havoc mulflt_#t~nondet12#1, mulflt_#t~nondet13#1, mulflt_#t~nondet14#1, mulflt_#t~nondet15#1, mulflt_#t~nondet16#1, mulflt_#t~nondet17#1, mulflt_~a#1, mulflt_~b#1, mulflt_~res~2#1, mulflt_~ma~1#1, mulflt_~mb~1#1, mulflt_~accu~0#1, mulflt_~ea~1#1, mulflt_~eb~1#1, mulflt_~tmp~1#1, mulflt_~__retres10~1#1;mulflt_~a#1 := mulflt_#in~a#1;mulflt_~b#1 := mulflt_#in~b#1;havoc mulflt_~res~2#1;havoc mulflt_~ma~1#1;havoc mulflt_~mb~1#1;havoc mulflt_~accu~0#1;havoc mulflt_~ea~1#1;havoc mulflt_~eb~1#1;havoc mulflt_~tmp~1#1;havoc mulflt_~__retres10~1#1; {14238#false} is VALID [2022-02-21 03:10:33,316 INFO L290 TraceCheckUtils]: 51: Hoare triple {14238#false} assume main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sb~0#1 := -1; {14238#false} is VALID [2022-02-21 03:10:33,316 INFO L290 TraceCheckUtils]: 50: Hoare triple {14238#false} main_~b~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {14238#false} is VALID [2022-02-21 03:10:33,316 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {14237#true} {14238#false} #376#return; {14238#false} is VALID [2022-02-21 03:10:33,317 INFO L290 TraceCheckUtils]: 48: Hoare triple {14237#true} assume true; {14237#true} is VALID [2022-02-21 03:10:33,317 INFO L290 TraceCheckUtils]: 47: Hoare triple {14237#true} #res := ~__retres4~0; {14237#true} is VALID [2022-02-21 03:10:33,317 INFO L290 TraceCheckUtils]: 46: Hoare triple {14237#true} assume ~e >= 127;~__retres4~0 := 4294967295; {14237#true} is VALID [2022-02-21 03:10:33,317 INFO L290 TraceCheckUtils]: 45: Hoare triple {14237#true} assume ~m % 4294967296 >= 33554432; {14237#true} is VALID [2022-02-21 03:10:33,317 INFO L290 TraceCheckUtils]: 44: Hoare triple {14237#true} assume !false; {14237#true} is VALID [2022-02-21 03:10:33,317 INFO L290 TraceCheckUtils]: 43: Hoare triple {14237#true} assume !(~m % 4294967296 < 16777216); {14237#true} is VALID [2022-02-21 03:10:33,318 INFO L290 TraceCheckUtils]: 42: Hoare triple {14237#true} assume !(0 == ~m % 4294967296); {14237#true} is VALID [2022-02-21 03:10:33,318 INFO L290 TraceCheckUtils]: 41: Hoare triple {14237#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14237#true} is VALID [2022-02-21 03:10:33,318 INFO L272 TraceCheckUtils]: 40: Hoare triple {14238#false} call main_#t~ret25#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {14237#true} is VALID [2022-02-21 03:10:33,318 INFO L290 TraceCheckUtils]: 39: Hoare triple {14238#false} main_~a~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {14238#false} is VALID [2022-02-21 03:10:33,318 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {14237#true} {14238#false} #374#return; {14238#false} is VALID [2022-02-21 03:10:33,318 INFO L290 TraceCheckUtils]: 37: Hoare triple {14237#true} assume true; {14237#true} is VALID [2022-02-21 03:10:33,318 INFO L290 TraceCheckUtils]: 36: Hoare triple {14237#true} #res := ~__retres4~0; {14237#true} is VALID [2022-02-21 03:10:33,319 INFO L290 TraceCheckUtils]: 35: Hoare triple {14237#true} assume ~e >= 127;~__retres4~0 := 4294967295; {14237#true} is VALID [2022-02-21 03:10:33,319 INFO L290 TraceCheckUtils]: 34: Hoare triple {14237#true} assume ~m % 4294967296 >= 33554432; {14237#true} is VALID [2022-02-21 03:10:33,319 INFO L290 TraceCheckUtils]: 33: Hoare triple {14237#true} assume !false; {14237#true} is VALID [2022-02-21 03:10:33,319 INFO L290 TraceCheckUtils]: 32: Hoare triple {14237#true} assume !(~m % 4294967296 < 16777216); {14237#true} is VALID [2022-02-21 03:10:33,319 INFO L290 TraceCheckUtils]: 31: Hoare triple {14237#true} assume !(0 == ~m % 4294967296); {14237#true} is VALID [2022-02-21 03:10:33,319 INFO L290 TraceCheckUtils]: 30: Hoare triple {14237#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14237#true} is VALID [2022-02-21 03:10:33,319 INFO L272 TraceCheckUtils]: 29: Hoare triple {14238#false} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {14237#true} is VALID [2022-02-21 03:10:33,320 INFO L290 TraceCheckUtils]: 28: Hoare triple {14238#false} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {14238#false} is VALID [2022-02-21 03:10:33,320 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {14574#(not (<= 0 |base2flt_#in~e|))} {14237#true} #372#return; {14238#false} is VALID [2022-02-21 03:10:33,321 INFO L290 TraceCheckUtils]: 26: Hoare triple {14574#(not (<= 0 |base2flt_#in~e|))} assume true; {14574#(not (<= 0 |base2flt_#in~e|))} is VALID [2022-02-21 03:10:33,321 INFO L290 TraceCheckUtils]: 25: Hoare triple {14574#(not (<= 0 |base2flt_#in~e|))} #res := ~__retres4~0; {14574#(not (<= 0 |base2flt_#in~e|))} is VALID [2022-02-21 03:10:33,321 INFO L290 TraceCheckUtils]: 24: Hoare triple {14584#(or (not (<= (+ 128 base2flt_~e) 0)) (not (<= 0 |base2flt_#in~e|)))} assume ~e <= -128;~__retres4~0 := 0; {14574#(not (<= 0 |base2flt_#in~e|))} is VALID [2022-02-21 03:10:33,322 INFO L290 TraceCheckUtils]: 23: Hoare triple {14584#(or (not (<= (+ 128 base2flt_~e) 0)) (not (<= 0 |base2flt_#in~e|)))} assume !false; {14584#(or (not (<= (+ 128 base2flt_~e) 0)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:33,322 INFO L290 TraceCheckUtils]: 22: Hoare triple {14584#(or (not (<= (+ 128 base2flt_~e) 0)) (not (<= 0 |base2flt_#in~e|)))} assume ~m % 4294967296 < 16777216; {14584#(or (not (<= (+ 128 base2flt_~e) 0)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:33,323 INFO L290 TraceCheckUtils]: 21: Hoare triple {14594#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {14584#(or (not (<= (+ 128 base2flt_~e) 0)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:33,323 INFO L290 TraceCheckUtils]: 20: Hoare triple {14594#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 <= 2147483647; {14594#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:33,324 INFO L290 TraceCheckUtils]: 19: Hoare triple {14594#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} assume !(~e <= -128); {14594#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:33,324 INFO L290 TraceCheckUtils]: 18: Hoare triple {14594#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} assume !false; {14594#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:33,324 INFO L290 TraceCheckUtils]: 17: Hoare triple {14594#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} assume ~m % 4294967296 < 16777216; {14594#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:33,325 INFO L290 TraceCheckUtils]: 16: Hoare triple {14610#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {14594#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:33,325 INFO L290 TraceCheckUtils]: 15: Hoare triple {14610#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 <= 2147483647; {14610#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:33,326 INFO L290 TraceCheckUtils]: 14: Hoare triple {14610#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume !(~e <= -128); {14610#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:33,326 INFO L290 TraceCheckUtils]: 13: Hoare triple {14610#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume !false; {14610#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:33,326 INFO L290 TraceCheckUtils]: 12: Hoare triple {14610#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume ~m % 4294967296 < 16777216; {14610#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:33,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {14610#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume !(0 == ~m % 4294967296); {14610#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:33,327 INFO L290 TraceCheckUtils]: 10: Hoare triple {14237#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14610#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:33,327 INFO L272 TraceCheckUtils]: 9: Hoare triple {14237#true} call main_#t~ret23#1 := base2flt(1, 0); {14237#true} is VALID [2022-02-21 03:10:33,328 INFO L290 TraceCheckUtils]: 8: Hoare triple {14237#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {14237#true} is VALID [2022-02-21 03:10:33,328 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14237#true} {14237#true} #370#return; {14237#true} is VALID [2022-02-21 03:10:33,328 INFO L290 TraceCheckUtils]: 6: Hoare triple {14237#true} assume true; {14237#true} is VALID [2022-02-21 03:10:33,328 INFO L290 TraceCheckUtils]: 5: Hoare triple {14237#true} #res := ~__retres4~0; {14237#true} is VALID [2022-02-21 03:10:33,328 INFO L290 TraceCheckUtils]: 4: Hoare triple {14237#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {14237#true} is VALID [2022-02-21 03:10:33,328 INFO L290 TraceCheckUtils]: 3: Hoare triple {14237#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14237#true} is VALID [2022-02-21 03:10:33,328 INFO L272 TraceCheckUtils]: 2: Hoare triple {14237#true} call main_#t~ret22#1 := base2flt(0, 0); {14237#true} is VALID [2022-02-21 03:10:33,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {14237#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_~sb~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_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {14237#true} is VALID [2022-02-21 03:10:33,329 INFO L290 TraceCheckUtils]: 0: Hoare triple {14237#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(22, 2);call #Ultimate.allocInit(12, 3); {14237#true} is VALID [2022-02-21 03:10:33,329 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-02-21 03:10:33,329 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886654862] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:10:33,329 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:10:33,330 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2022-02-21 03:10:33,330 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242879582] [2022-02-21 03:10:33,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:10:33,331 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 14 states have internal predecessors, (85), 2 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 61 [2022-02-21 03:10:33,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:33,332 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 14 states have internal predecessors, (85), 2 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-21 03:10:33,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:33,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-21 03:10:33,403 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:33,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-21 03:10:33,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-02-21 03:10:33,403 INFO L87 Difference]: Start difference. First operand 216 states and 279 transitions. Second operand has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 14 states have internal predecessors, (85), 2 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-21 03:10:35,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:35,419 INFO L93 Difference]: Finished difference Result 1111 states and 1461 transitions. [2022-02-21 03:10:35,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-02-21 03:10:35,419 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 14 states have internal predecessors, (85), 2 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 61 [2022-02-21 03:10:35,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:35,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 14 states have internal predecessors, (85), 2 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-21 03:10:35,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 628 transitions. [2022-02-21 03:10:35,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 14 states have internal predecessors, (85), 2 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-21 03:10:35,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 628 transitions. [2022-02-21 03:10:35,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 628 transitions. [2022-02-21 03:10:35,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 628 edges. 628 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:36,026 INFO L225 Difference]: With dead ends: 1111 [2022-02-21 03:10:36,026 INFO L226 Difference]: Without dead ends: 931 [2022-02-21 03:10:36,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=346, Invalid=710, Unknown=0, NotChecked=0, Total=1056 [2022-02-21 03:10:36,030 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 691 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:36,031 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [691 Valid, 679 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-21 03:10:36,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2022-02-21 03:10:36,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 236. [2022-02-21 03:10:36,163 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:36,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 931 states. Second operand has 236 states, 219 states have (on average 1.3424657534246576) internal successors, (294), 226 states have internal predecessors, (294), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-21 03:10:36,164 INFO L74 IsIncluded]: Start isIncluded. First operand 931 states. Second operand has 236 states, 219 states have (on average 1.3424657534246576) internal successors, (294), 226 states have internal predecessors, (294), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-21 03:10:36,164 INFO L87 Difference]: Start difference. First operand 931 states. Second operand has 236 states, 219 states have (on average 1.3424657534246576) internal successors, (294), 226 states have internal predecessors, (294), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-21 03:10:36,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:36,209 INFO L93 Difference]: Finished difference Result 931 states and 1206 transitions. [2022-02-21 03:10:36,209 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1206 transitions. [2022-02-21 03:10:36,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:36,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:36,211 INFO L74 IsIncluded]: Start isIncluded. First operand has 236 states, 219 states have (on average 1.3424657534246576) internal successors, (294), 226 states have internal predecessors, (294), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Second operand 931 states. [2022-02-21 03:10:36,211 INFO L87 Difference]: Start difference. First operand has 236 states, 219 states have (on average 1.3424657534246576) internal successors, (294), 226 states have internal predecessors, (294), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Second operand 931 states. [2022-02-21 03:10:36,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:36,267 INFO L93 Difference]: Finished difference Result 931 states and 1206 transitions. [2022-02-21 03:10:36,267 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1206 transitions. [2022-02-21 03:10:36,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:36,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:36,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:36,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:36,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 219 states have (on average 1.3424657534246576) internal successors, (294), 226 states have internal predecessors, (294), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-21 03:10:36,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 303 transitions. [2022-02-21 03:10:36,274 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 303 transitions. Word has length 61 [2022-02-21 03:10:36,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:36,275 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 303 transitions. [2022-02-21 03:10:36,275 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 14 states have internal predecessors, (85), 2 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-21 03:10:36,275 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 303 transitions. [2022-02-21 03:10:36,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-21 03:10:36,276 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:36,276 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:36,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-02-21 03:10:36,491 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,SelfDestructingSolverStorable14 [2022-02-21 03:10:36,492 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-02-21 03:10:36,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:36,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1752267481, now seen corresponding path program 1 times [2022-02-21 03:10:36,492 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:36,492 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097138162] [2022-02-21 03:10:36,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:36,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:36,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:36,543 INFO L290 TraceCheckUtils]: 0: Hoare triple {18139#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18093#true} is VALID [2022-02-21 03:10:36,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {18093#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {18093#true} is VALID [2022-02-21 03:10:36,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {18093#true} #res := ~__retres4~0; {18093#true} is VALID [2022-02-21 03:10:36,543 INFO L290 TraceCheckUtils]: 3: Hoare triple {18093#true} assume true; {18093#true} is VALID [2022-02-21 03:10:36,543 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {18093#true} {18093#true} #370#return; {18093#true} is VALID [2022-02-21 03:10:36,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:36,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:36,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {18139#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18140#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:36,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {18140#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !(0 == ~m % 4294967296); {18140#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:36,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {18140#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~m % 4294967296 < 16777216; {18140#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:36,595 INFO L290 TraceCheckUtils]: 3: Hoare triple {18140#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !false; {18140#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:36,595 INFO L290 TraceCheckUtils]: 4: Hoare triple {18140#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !(~e <= -128); {18140#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:36,596 INFO L290 TraceCheckUtils]: 5: Hoare triple {18140#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~e - 1 <= 2147483647; {18140#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:36,596 INFO L290 TraceCheckUtils]: 6: Hoare triple {18140#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {18141#(or (and (<= base2flt_~m 2) (not (<= (+ (div base2flt_~m 4294967296) 1) 0))) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:36,597 INFO L290 TraceCheckUtils]: 7: Hoare triple {18141#(or (and (<= base2flt_~m 2) (not (<= (+ (div base2flt_~m 4294967296) 1) 0))) (not (= |base2flt_#in~m| 1)))} assume !(~m % 4294967296 < 16777216); {18142#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:36,597 INFO L290 TraceCheckUtils]: 8: Hoare triple {18142#(not (= |base2flt_#in~m| 1))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {18142#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:36,597 INFO L290 TraceCheckUtils]: 9: Hoare triple {18142#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {18142#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:36,598 INFO L290 TraceCheckUtils]: 10: Hoare triple {18142#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {18142#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:36,598 INFO L290 TraceCheckUtils]: 11: Hoare triple {18142#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {18142#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:36,599 INFO L290 TraceCheckUtils]: 12: Hoare triple {18142#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {18142#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:36,599 INFO L290 TraceCheckUtils]: 13: Hoare triple {18142#(not (= |base2flt_#in~m| 1))} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {18142#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:36,599 INFO L290 TraceCheckUtils]: 14: Hoare triple {18142#(not (= |base2flt_#in~m| 1))} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {18142#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:36,600 INFO L290 TraceCheckUtils]: 15: Hoare triple {18142#(not (= |base2flt_#in~m| 1))} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {18142#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:36,600 INFO L290 TraceCheckUtils]: 16: Hoare triple {18142#(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; {18142#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:36,600 INFO L290 TraceCheckUtils]: 17: Hoare triple {18142#(not (= |base2flt_#in~m| 1))} ~__retres4~0 := ~res~0; {18142#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:36,601 INFO L290 TraceCheckUtils]: 18: Hoare triple {18142#(not (= |base2flt_#in~m| 1))} #res := ~__retres4~0; {18142#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:36,601 INFO L290 TraceCheckUtils]: 19: Hoare triple {18142#(not (= |base2flt_#in~m| 1))} assume true; {18142#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:36,602 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {18142#(not (= |base2flt_#in~m| 1))} {18093#true} #372#return; {18094#false} is VALID [2022-02-21 03:10:36,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-02-21 03:10:36,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:36,607 INFO L290 TraceCheckUtils]: 0: Hoare triple {18139#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18093#true} is VALID [2022-02-21 03:10:36,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {18093#true} assume !(0 == ~m % 4294967296); {18093#true} is VALID [2022-02-21 03:10:36,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {18093#true} assume !(~m % 4294967296 < 16777216); {18093#true} is VALID [2022-02-21 03:10:36,607 INFO L290 TraceCheckUtils]: 3: Hoare triple {18093#true} assume !false; {18093#true} is VALID [2022-02-21 03:10:36,607 INFO L290 TraceCheckUtils]: 4: Hoare triple {18093#true} assume ~m % 4294967296 >= 33554432; {18093#true} is VALID [2022-02-21 03:10:36,607 INFO L290 TraceCheckUtils]: 5: Hoare triple {18093#true} assume ~e >= 127;~__retres4~0 := 4294967295; {18093#true} is VALID [2022-02-21 03:10:36,608 INFO L290 TraceCheckUtils]: 6: Hoare triple {18093#true} #res := ~__retres4~0; {18093#true} is VALID [2022-02-21 03:10:36,608 INFO L290 TraceCheckUtils]: 7: Hoare triple {18093#true} assume true; {18093#true} is VALID [2022-02-21 03:10:36,608 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {18093#true} {18094#false} #374#return; {18094#false} is VALID [2022-02-21 03:10:36,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-21 03:10:36,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:36,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {18139#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18093#true} is VALID [2022-02-21 03:10:36,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {18093#true} assume !(0 == ~m % 4294967296); {18093#true} is VALID [2022-02-21 03:10:36,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {18093#true} assume !(~m % 4294967296 < 16777216); {18093#true} is VALID [2022-02-21 03:10:36,612 INFO L290 TraceCheckUtils]: 3: Hoare triple {18093#true} assume !false; {18093#true} is VALID [2022-02-21 03:10:36,612 INFO L290 TraceCheckUtils]: 4: Hoare triple {18093#true} assume ~m % 4294967296 >= 33554432; {18093#true} is VALID [2022-02-21 03:10:36,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {18093#true} assume ~e >= 127;~__retres4~0 := 4294967295; {18093#true} is VALID [2022-02-21 03:10:36,613 INFO L290 TraceCheckUtils]: 6: Hoare triple {18093#true} #res := ~__retres4~0; {18093#true} is VALID [2022-02-21 03:10:36,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {18093#true} assume true; {18093#true} is VALID [2022-02-21 03:10:36,613 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {18093#true} {18094#false} #376#return; {18094#false} is VALID [2022-02-21 03:10:36,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {18093#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(22, 2);call #Ultimate.allocInit(12, 3); {18093#true} is VALID [2022-02-21 03:10:36,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {18093#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_~sb~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_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {18093#true} is VALID [2022-02-21 03:10:36,614 INFO L272 TraceCheckUtils]: 2: Hoare triple {18093#true} call main_#t~ret22#1 := base2flt(0, 0); {18139#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:36,614 INFO L290 TraceCheckUtils]: 3: Hoare triple {18139#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18093#true} is VALID [2022-02-21 03:10:36,614 INFO L290 TraceCheckUtils]: 4: Hoare triple {18093#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {18093#true} is VALID [2022-02-21 03:10:36,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {18093#true} #res := ~__retres4~0; {18093#true} is VALID [2022-02-21 03:10:36,614 INFO L290 TraceCheckUtils]: 6: Hoare triple {18093#true} assume true; {18093#true} is VALID [2022-02-21 03:10:36,614 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {18093#true} {18093#true} #370#return; {18093#true} is VALID [2022-02-21 03:10:36,614 INFO L290 TraceCheckUtils]: 8: Hoare triple {18093#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {18093#true} is VALID [2022-02-21 03:10:36,615 INFO L272 TraceCheckUtils]: 9: Hoare triple {18093#true} call main_#t~ret23#1 := base2flt(1, 0); {18139#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:36,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {18139#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18140#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:36,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {18140#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !(0 == ~m % 4294967296); {18140#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:36,616 INFO L290 TraceCheckUtils]: 12: Hoare triple {18140#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~m % 4294967296 < 16777216; {18140#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:36,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {18140#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !false; {18140#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:36,616 INFO L290 TraceCheckUtils]: 14: Hoare triple {18140#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !(~e <= -128); {18140#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:36,617 INFO L290 TraceCheckUtils]: 15: Hoare triple {18140#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~e - 1 <= 2147483647; {18140#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:36,617 INFO L290 TraceCheckUtils]: 16: Hoare triple {18140#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {18141#(or (and (<= base2flt_~m 2) (not (<= (+ (div base2flt_~m 4294967296) 1) 0))) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:36,618 INFO L290 TraceCheckUtils]: 17: Hoare triple {18141#(or (and (<= base2flt_~m 2) (not (<= (+ (div base2flt_~m 4294967296) 1) 0))) (not (= |base2flt_#in~m| 1)))} assume !(~m % 4294967296 < 16777216); {18142#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:36,618 INFO L290 TraceCheckUtils]: 18: Hoare triple {18142#(not (= |base2flt_#in~m| 1))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {18142#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:36,619 INFO L290 TraceCheckUtils]: 19: Hoare triple {18142#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {18142#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:36,619 INFO L290 TraceCheckUtils]: 20: Hoare triple {18142#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {18142#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:36,619 INFO L290 TraceCheckUtils]: 21: Hoare triple {18142#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {18142#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:36,619 INFO L290 TraceCheckUtils]: 22: Hoare triple {18142#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {18142#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:36,620 INFO L290 TraceCheckUtils]: 23: Hoare triple {18142#(not (= |base2flt_#in~m| 1))} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {18142#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:36,620 INFO L290 TraceCheckUtils]: 24: Hoare triple {18142#(not (= |base2flt_#in~m| 1))} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {18142#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:36,620 INFO L290 TraceCheckUtils]: 25: Hoare triple {18142#(not (= |base2flt_#in~m| 1))} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {18142#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:36,621 INFO L290 TraceCheckUtils]: 26: Hoare triple {18142#(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; {18142#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:36,621 INFO L290 TraceCheckUtils]: 27: Hoare triple {18142#(not (= |base2flt_#in~m| 1))} ~__retres4~0 := ~res~0; {18142#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:36,621 INFO L290 TraceCheckUtils]: 28: Hoare triple {18142#(not (= |base2flt_#in~m| 1))} #res := ~__retres4~0; {18142#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:36,621 INFO L290 TraceCheckUtils]: 29: Hoare triple {18142#(not (= |base2flt_#in~m| 1))} assume true; {18142#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:36,622 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {18142#(not (= |base2flt_#in~m| 1))} {18093#true} #372#return; {18094#false} is VALID [2022-02-21 03:10:36,622 INFO L290 TraceCheckUtils]: 31: Hoare triple {18094#false} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {18094#false} is VALID [2022-02-21 03:10:36,622 INFO L272 TraceCheckUtils]: 32: Hoare triple {18094#false} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {18139#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:36,622 INFO L290 TraceCheckUtils]: 33: Hoare triple {18139#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18093#true} is VALID [2022-02-21 03:10:36,623 INFO L290 TraceCheckUtils]: 34: Hoare triple {18093#true} assume !(0 == ~m % 4294967296); {18093#true} is VALID [2022-02-21 03:10:36,623 INFO L290 TraceCheckUtils]: 35: Hoare triple {18093#true} assume !(~m % 4294967296 < 16777216); {18093#true} is VALID [2022-02-21 03:10:36,623 INFO L290 TraceCheckUtils]: 36: Hoare triple {18093#true} assume !false; {18093#true} is VALID [2022-02-21 03:10:36,623 INFO L290 TraceCheckUtils]: 37: Hoare triple {18093#true} assume ~m % 4294967296 >= 33554432; {18093#true} is VALID [2022-02-21 03:10:36,623 INFO L290 TraceCheckUtils]: 38: Hoare triple {18093#true} assume ~e >= 127;~__retres4~0 := 4294967295; {18093#true} is VALID [2022-02-21 03:10:36,623 INFO L290 TraceCheckUtils]: 39: Hoare triple {18093#true} #res := ~__retres4~0; {18093#true} is VALID [2022-02-21 03:10:36,623 INFO L290 TraceCheckUtils]: 40: Hoare triple {18093#true} assume true; {18093#true} is VALID [2022-02-21 03:10:36,623 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {18093#true} {18094#false} #374#return; {18094#false} is VALID [2022-02-21 03:10:36,623 INFO L290 TraceCheckUtils]: 42: Hoare triple {18094#false} main_~a~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {18094#false} is VALID [2022-02-21 03:10:36,623 INFO L272 TraceCheckUtils]: 43: Hoare triple {18094#false} call main_#t~ret25#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {18139#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:36,624 INFO L290 TraceCheckUtils]: 44: Hoare triple {18139#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18093#true} is VALID [2022-02-21 03:10:36,624 INFO L290 TraceCheckUtils]: 45: Hoare triple {18093#true} assume !(0 == ~m % 4294967296); {18093#true} is VALID [2022-02-21 03:10:36,624 INFO L290 TraceCheckUtils]: 46: Hoare triple {18093#true} assume !(~m % 4294967296 < 16777216); {18093#true} is VALID [2022-02-21 03:10:36,624 INFO L290 TraceCheckUtils]: 47: Hoare triple {18093#true} assume !false; {18093#true} is VALID [2022-02-21 03:10:36,624 INFO L290 TraceCheckUtils]: 48: Hoare triple {18093#true} assume ~m % 4294967296 >= 33554432; {18093#true} is VALID [2022-02-21 03:10:36,624 INFO L290 TraceCheckUtils]: 49: Hoare triple {18093#true} assume ~e >= 127;~__retres4~0 := 4294967295; {18093#true} is VALID [2022-02-21 03:10:36,624 INFO L290 TraceCheckUtils]: 50: Hoare triple {18093#true} #res := ~__retres4~0; {18093#true} is VALID [2022-02-21 03:10:36,624 INFO L290 TraceCheckUtils]: 51: Hoare triple {18093#true} assume true; {18093#true} is VALID [2022-02-21 03:10:36,624 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {18093#true} {18094#false} #376#return; {18094#false} is VALID [2022-02-21 03:10:36,624 INFO L290 TraceCheckUtils]: 53: Hoare triple {18094#false} main_~b~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {18094#false} is VALID [2022-02-21 03:10:36,625 INFO L290 TraceCheckUtils]: 54: Hoare triple {18094#false} assume main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sb~0#1 := -1; {18094#false} is VALID [2022-02-21 03:10:36,625 INFO L290 TraceCheckUtils]: 55: Hoare triple {18094#false} assume { :begin_inline_mulflt } true;mulflt_#in~a#1, mulflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mulflt_#res#1;havoc mulflt_#t~nondet12#1, mulflt_#t~nondet13#1, mulflt_#t~nondet14#1, mulflt_#t~nondet15#1, mulflt_#t~nondet16#1, mulflt_#t~nondet17#1, mulflt_~a#1, mulflt_~b#1, mulflt_~res~2#1, mulflt_~ma~1#1, mulflt_~mb~1#1, mulflt_~accu~0#1, mulflt_~ea~1#1, mulflt_~eb~1#1, mulflt_~tmp~1#1, mulflt_~__retres10~1#1;mulflt_~a#1 := mulflt_#in~a#1;mulflt_~b#1 := mulflt_#in~b#1;havoc mulflt_~res~2#1;havoc mulflt_~ma~1#1;havoc mulflt_~mb~1#1;havoc mulflt_~accu~0#1;havoc mulflt_~ea~1#1;havoc mulflt_~eb~1#1;havoc mulflt_~tmp~1#1;havoc mulflt_~__retres10~1#1; {18094#false} is VALID [2022-02-21 03:10:36,625 INFO L290 TraceCheckUtils]: 56: Hoare triple {18094#false} assume mulflt_~a#1 % 4294967296 < mulflt_~b#1 % 4294967296;mulflt_~tmp~1#1 := mulflt_~a#1;mulflt_~a#1 := mulflt_~b#1;mulflt_~b#1 := mulflt_~tmp~1#1; {18094#false} is VALID [2022-02-21 03:10:36,625 INFO L290 TraceCheckUtils]: 57: Hoare triple {18094#false} assume !(0 == mulflt_~b#1 % 4294967296); {18094#false} is VALID [2022-02-21 03:10:36,625 INFO L290 TraceCheckUtils]: 58: Hoare triple {18094#false} assume !(0 == mulflt_~a#1); {18094#false} is VALID [2022-02-21 03:10:36,625 INFO L290 TraceCheckUtils]: 59: Hoare triple {18094#false} assume !false; {18094#false} is VALID [2022-02-21 03:10:36,625 INFO L290 TraceCheckUtils]: 60: Hoare triple {18094#false} assume !false; {18094#false} is VALID [2022-02-21 03:10:36,625 INFO L290 TraceCheckUtils]: 61: Hoare triple {18094#false} assume mulflt_~a#1 >= 0;abs_171 := (if mulflt_~a#1 < 16777215 then mulflt_~a#1 else 16777215);assume mulflt_~a#1 >= 0;assume mulflt_~ma~1#1 < abs_171; {18094#false} is VALID [2022-02-21 03:10:36,625 INFO L290 TraceCheckUtils]: 62: Hoare triple {18094#false} assume (if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {18094#false} is VALID [2022-02-21 03:10:36,625 INFO L290 TraceCheckUtils]: 63: Hoare triple {18094#false} assume !((if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {18094#false} is VALID [2022-02-21 03:10:36,626 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-02-21 03:10:36,626 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:36,626 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097138162] [2022-02-21 03:10:36,626 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097138162] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:36,626 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2830514] [2022-02-21 03:10:36,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:36,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:36,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:36,628 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:36,629 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:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:36,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-21 03:10:36,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:36,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:36,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {18093#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(22, 2);call #Ultimate.allocInit(12, 3); {18093#true} is VALID [2022-02-21 03:10:36,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {18093#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_~sb~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_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {18093#true} is VALID [2022-02-21 03:10:36,924 INFO L272 TraceCheckUtils]: 2: Hoare triple {18093#true} call main_#t~ret22#1 := base2flt(0, 0); {18093#true} is VALID [2022-02-21 03:10:36,925 INFO L290 TraceCheckUtils]: 3: Hoare triple {18093#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18155#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:36,925 INFO L290 TraceCheckUtils]: 4: Hoare triple {18155#(= base2flt_~m |base2flt_#in~m|)} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {18159#(and (<= (mod |base2flt_#in~m| 4294967296) 0) (= base2flt_~__retres4~0 0))} is VALID [2022-02-21 03:10:36,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {18159#(and (<= (mod |base2flt_#in~m| 4294967296) 0) (= base2flt_~__retres4~0 0))} #res := ~__retres4~0; {18163#(and (= |base2flt_#res| 0) (<= (mod |base2flt_#in~m| 4294967296) 0))} is VALID [2022-02-21 03:10:36,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {18163#(and (= |base2flt_#res| 0) (<= (mod |base2flt_#in~m| 4294967296) 0))} assume true; {18163#(and (= |base2flt_#res| 0) (<= (mod |base2flt_#in~m| 4294967296) 0))} is VALID [2022-02-21 03:10:36,927 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {18163#(and (= |base2flt_#res| 0) (<= (mod |base2flt_#in~m| 4294967296) 0))} {18093#true} #370#return; {18170#(= |ULTIMATE.start_main_#t~ret22#1| 0)} is VALID [2022-02-21 03:10:36,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {18170#(= |ULTIMATE.start_main_#t~ret22#1| 0)} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {18174#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:36,928 INFO L272 TraceCheckUtils]: 9: Hoare triple {18174#(= |ULTIMATE.start_main_~zero~0#1| 0)} call main_#t~ret23#1 := base2flt(1, 0); {18093#true} is VALID [2022-02-21 03:10:36,928 INFO L290 TraceCheckUtils]: 10: Hoare triple {18093#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18093#true} is VALID [2022-02-21 03:10:36,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {18093#true} assume !(0 == ~m % 4294967296); {18093#true} is VALID [2022-02-21 03:10:36,928 INFO L290 TraceCheckUtils]: 12: Hoare triple {18093#true} assume ~m % 4294967296 < 16777216; {18093#true} is VALID [2022-02-21 03:10:36,928 INFO L290 TraceCheckUtils]: 13: Hoare triple {18093#true} assume !false; {18093#true} is VALID [2022-02-21 03:10:36,928 INFO L290 TraceCheckUtils]: 14: Hoare triple {18093#true} assume !(~e <= -128); {18093#true} is VALID [2022-02-21 03:10:36,928 INFO L290 TraceCheckUtils]: 15: Hoare triple {18093#true} assume ~e - 1 <= 2147483647; {18093#true} is VALID [2022-02-21 03:10:36,928 INFO L290 TraceCheckUtils]: 16: Hoare triple {18093#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {18093#true} is VALID [2022-02-21 03:10:36,928 INFO L290 TraceCheckUtils]: 17: Hoare triple {18093#true} assume !(~m % 4294967296 < 16777216); {18093#true} is VALID [2022-02-21 03:10:36,928 INFO L290 TraceCheckUtils]: 18: Hoare triple {18093#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {18093#true} is VALID [2022-02-21 03:10:36,928 INFO L290 TraceCheckUtils]: 19: Hoare triple {18093#true} assume 128 + ~e <= 2147483647; {18093#true} is VALID [2022-02-21 03:10:36,928 INFO L290 TraceCheckUtils]: 20: Hoare triple {18093#true} assume 128 + ~e >= -2147483648; {18093#true} is VALID [2022-02-21 03:10:36,929 INFO L290 TraceCheckUtils]: 21: Hoare triple {18093#true} assume 128 + ~e <= 2147483647; {18093#true} is VALID [2022-02-21 03:10:36,929 INFO L290 TraceCheckUtils]: 22: Hoare triple {18093#true} assume 128 + ~e >= -2147483648; {18093#true} is VALID [2022-02-21 03:10:36,929 INFO L290 TraceCheckUtils]: 23: Hoare triple {18093#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {18093#true} is VALID [2022-02-21 03:10:36,929 INFO L290 TraceCheckUtils]: 24: Hoare triple {18093#true} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {18093#true} is VALID [2022-02-21 03:10:36,929 INFO L290 TraceCheckUtils]: 25: Hoare triple {18093#true} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {18093#true} is VALID [2022-02-21 03:10:36,929 INFO L290 TraceCheckUtils]: 26: Hoare triple {18093#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; {18093#true} is VALID [2022-02-21 03:10:36,929 INFO L290 TraceCheckUtils]: 27: Hoare triple {18093#true} ~__retres4~0 := ~res~0; {18093#true} is VALID [2022-02-21 03:10:36,929 INFO L290 TraceCheckUtils]: 28: Hoare triple {18093#true} #res := ~__retres4~0; {18093#true} is VALID [2022-02-21 03:10:36,929 INFO L290 TraceCheckUtils]: 29: Hoare triple {18093#true} assume true; {18093#true} is VALID [2022-02-21 03:10:36,930 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {18093#true} {18174#(= |ULTIMATE.start_main_~zero~0#1| 0)} #372#return; {18174#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:36,930 INFO L290 TraceCheckUtils]: 31: Hoare triple {18174#(= |ULTIMATE.start_main_~zero~0#1| 0)} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {18174#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:36,931 INFO L272 TraceCheckUtils]: 32: Hoare triple {18174#(= |ULTIMATE.start_main_~zero~0#1| 0)} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {18093#true} is VALID [2022-02-21 03:10:36,931 INFO L290 TraceCheckUtils]: 33: Hoare triple {18093#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18093#true} is VALID [2022-02-21 03:10:36,931 INFO L290 TraceCheckUtils]: 34: Hoare triple {18093#true} assume !(0 == ~m % 4294967296); {18093#true} is VALID [2022-02-21 03:10:36,931 INFO L290 TraceCheckUtils]: 35: Hoare triple {18093#true} assume !(~m % 4294967296 < 16777216); {18093#true} is VALID [2022-02-21 03:10:36,931 INFO L290 TraceCheckUtils]: 36: Hoare triple {18093#true} assume !false; {18093#true} is VALID [2022-02-21 03:10:36,931 INFO L290 TraceCheckUtils]: 37: Hoare triple {18093#true} assume ~m % 4294967296 >= 33554432; {18093#true} is VALID [2022-02-21 03:10:36,931 INFO L290 TraceCheckUtils]: 38: Hoare triple {18093#true} assume ~e >= 127;~__retres4~0 := 4294967295; {18093#true} is VALID [2022-02-21 03:10:36,931 INFO L290 TraceCheckUtils]: 39: Hoare triple {18093#true} #res := ~__retres4~0; {18093#true} is VALID [2022-02-21 03:10:36,931 INFO L290 TraceCheckUtils]: 40: Hoare triple {18093#true} assume true; {18093#true} is VALID [2022-02-21 03:10:36,932 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {18093#true} {18174#(= |ULTIMATE.start_main_~zero~0#1| 0)} #374#return; {18174#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:36,932 INFO L290 TraceCheckUtils]: 42: Hoare triple {18174#(= |ULTIMATE.start_main_~zero~0#1| 0)} main_~a~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {18174#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:36,933 INFO L272 TraceCheckUtils]: 43: Hoare triple {18174#(= |ULTIMATE.start_main_~zero~0#1| 0)} call main_#t~ret25#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {18093#true} is VALID [2022-02-21 03:10:36,933 INFO L290 TraceCheckUtils]: 44: Hoare triple {18093#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18093#true} is VALID [2022-02-21 03:10:36,933 INFO L290 TraceCheckUtils]: 45: Hoare triple {18093#true} assume !(0 == ~m % 4294967296); {18093#true} is VALID [2022-02-21 03:10:36,933 INFO L290 TraceCheckUtils]: 46: Hoare triple {18093#true} assume !(~m % 4294967296 < 16777216); {18093#true} is VALID [2022-02-21 03:10:36,933 INFO L290 TraceCheckUtils]: 47: Hoare triple {18093#true} assume !false; {18093#true} is VALID [2022-02-21 03:10:36,933 INFO L290 TraceCheckUtils]: 48: Hoare triple {18093#true} assume ~m % 4294967296 >= 33554432; {18093#true} is VALID [2022-02-21 03:10:36,933 INFO L290 TraceCheckUtils]: 49: Hoare triple {18093#true} assume ~e >= 127;~__retres4~0 := 4294967295; {18093#true} is VALID [2022-02-21 03:10:36,934 INFO L290 TraceCheckUtils]: 50: Hoare triple {18093#true} #res := ~__retres4~0; {18093#true} is VALID [2022-02-21 03:10:36,934 INFO L290 TraceCheckUtils]: 51: Hoare triple {18093#true} assume true; {18093#true} is VALID [2022-02-21 03:10:36,934 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {18093#true} {18174#(= |ULTIMATE.start_main_~zero~0#1| 0)} #376#return; {18174#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:36,935 INFO L290 TraceCheckUtils]: 53: Hoare triple {18174#(= |ULTIMATE.start_main_~zero~0#1| 0)} main_~b~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {18174#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:36,935 INFO L290 TraceCheckUtils]: 54: Hoare triple {18174#(= |ULTIMATE.start_main_~zero~0#1| 0)} assume main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sb~0#1 := -1; {18094#false} is VALID [2022-02-21 03:10:36,935 INFO L290 TraceCheckUtils]: 55: Hoare triple {18094#false} assume { :begin_inline_mulflt } true;mulflt_#in~a#1, mulflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mulflt_#res#1;havoc mulflt_#t~nondet12#1, mulflt_#t~nondet13#1, mulflt_#t~nondet14#1, mulflt_#t~nondet15#1, mulflt_#t~nondet16#1, mulflt_#t~nondet17#1, mulflt_~a#1, mulflt_~b#1, mulflt_~res~2#1, mulflt_~ma~1#1, mulflt_~mb~1#1, mulflt_~accu~0#1, mulflt_~ea~1#1, mulflt_~eb~1#1, mulflt_~tmp~1#1, mulflt_~__retres10~1#1;mulflt_~a#1 := mulflt_#in~a#1;mulflt_~b#1 := mulflt_#in~b#1;havoc mulflt_~res~2#1;havoc mulflt_~ma~1#1;havoc mulflt_~mb~1#1;havoc mulflt_~accu~0#1;havoc mulflt_~ea~1#1;havoc mulflt_~eb~1#1;havoc mulflt_~tmp~1#1;havoc mulflt_~__retres10~1#1; {18094#false} is VALID [2022-02-21 03:10:36,936 INFO L290 TraceCheckUtils]: 56: Hoare triple {18094#false} assume mulflt_~a#1 % 4294967296 < mulflt_~b#1 % 4294967296;mulflt_~tmp~1#1 := mulflt_~a#1;mulflt_~a#1 := mulflt_~b#1;mulflt_~b#1 := mulflt_~tmp~1#1; {18094#false} is VALID [2022-02-21 03:10:36,936 INFO L290 TraceCheckUtils]: 57: Hoare triple {18094#false} assume !(0 == mulflt_~b#1 % 4294967296); {18094#false} is VALID [2022-02-21 03:10:36,936 INFO L290 TraceCheckUtils]: 58: Hoare triple {18094#false} assume !(0 == mulflt_~a#1); {18094#false} is VALID [2022-02-21 03:10:36,936 INFO L290 TraceCheckUtils]: 59: Hoare triple {18094#false} assume !false; {18094#false} is VALID [2022-02-21 03:10:36,936 INFO L290 TraceCheckUtils]: 60: Hoare triple {18094#false} assume !false; {18094#false} is VALID [2022-02-21 03:10:36,936 INFO L290 TraceCheckUtils]: 61: Hoare triple {18094#false} assume mulflt_~a#1 >= 0;abs_171 := (if mulflt_~a#1 < 16777215 then mulflt_~a#1 else 16777215);assume mulflt_~a#1 >= 0;assume mulflt_~ma~1#1 < abs_171; {18094#false} is VALID [2022-02-21 03:10:36,937 INFO L290 TraceCheckUtils]: 62: Hoare triple {18094#false} assume (if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {18094#false} is VALID [2022-02-21 03:10:36,937 INFO L290 TraceCheckUtils]: 63: Hoare triple {18094#false} assume !((if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {18094#false} is VALID [2022-02-21 03:10:36,937 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-21 03:10:36,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:10:37,351 INFO L290 TraceCheckUtils]: 63: Hoare triple {18094#false} assume !((if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {18094#false} is VALID [2022-02-21 03:10:37,351 INFO L290 TraceCheckUtils]: 62: Hoare triple {18094#false} assume (if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {18094#false} is VALID [2022-02-21 03:10:37,352 INFO L290 TraceCheckUtils]: 61: Hoare triple {18094#false} assume mulflt_~a#1 >= 0;abs_171 := (if mulflt_~a#1 < 16777215 then mulflt_~a#1 else 16777215);assume mulflt_~a#1 >= 0;assume mulflt_~ma~1#1 < abs_171; {18094#false} is VALID [2022-02-21 03:10:37,352 INFO L290 TraceCheckUtils]: 60: Hoare triple {18094#false} assume !false; {18094#false} is VALID [2022-02-21 03:10:37,352 INFO L290 TraceCheckUtils]: 59: Hoare triple {18094#false} assume !false; {18094#false} is VALID [2022-02-21 03:10:37,352 INFO L290 TraceCheckUtils]: 58: Hoare triple {18094#false} assume !(0 == mulflt_~a#1); {18094#false} is VALID [2022-02-21 03:10:37,352 INFO L290 TraceCheckUtils]: 57: Hoare triple {18094#false} assume !(0 == mulflt_~b#1 % 4294967296); {18094#false} is VALID [2022-02-21 03:10:37,352 INFO L290 TraceCheckUtils]: 56: Hoare triple {18094#false} assume mulflt_~a#1 % 4294967296 < mulflt_~b#1 % 4294967296;mulflt_~tmp~1#1 := mulflt_~a#1;mulflt_~a#1 := mulflt_~b#1;mulflt_~b#1 := mulflt_~tmp~1#1; {18094#false} is VALID [2022-02-21 03:10:37,352 INFO L290 TraceCheckUtils]: 55: Hoare triple {18094#false} assume { :begin_inline_mulflt } true;mulflt_#in~a#1, mulflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mulflt_#res#1;havoc mulflt_#t~nondet12#1, mulflt_#t~nondet13#1, mulflt_#t~nondet14#1, mulflt_#t~nondet15#1, mulflt_#t~nondet16#1, mulflt_#t~nondet17#1, mulflt_~a#1, mulflt_~b#1, mulflt_~res~2#1, mulflt_~ma~1#1, mulflt_~mb~1#1, mulflt_~accu~0#1, mulflt_~ea~1#1, mulflt_~eb~1#1, mulflt_~tmp~1#1, mulflt_~__retres10~1#1;mulflt_~a#1 := mulflt_#in~a#1;mulflt_~b#1 := mulflt_#in~b#1;havoc mulflt_~res~2#1;havoc mulflt_~ma~1#1;havoc mulflt_~mb~1#1;havoc mulflt_~accu~0#1;havoc mulflt_~ea~1#1;havoc mulflt_~eb~1#1;havoc mulflt_~tmp~1#1;havoc mulflt_~__retres10~1#1; {18094#false} is VALID [2022-02-21 03:10:37,354 INFO L290 TraceCheckUtils]: 54: Hoare triple {18367#(<= (mod |ULTIMATE.start_main_~zero~0#1| 4294967296) 0)} assume main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sb~0#1 := -1; {18094#false} is VALID [2022-02-21 03:10:37,354 INFO L290 TraceCheckUtils]: 53: Hoare triple {18367#(<= (mod |ULTIMATE.start_main_~zero~0#1| 4294967296) 0)} main_~b~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {18367#(<= (mod |ULTIMATE.start_main_~zero~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:37,355 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {18093#true} {18367#(<= (mod |ULTIMATE.start_main_~zero~0#1| 4294967296) 0)} #376#return; {18367#(<= (mod |ULTIMATE.start_main_~zero~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:37,355 INFO L290 TraceCheckUtils]: 51: Hoare triple {18093#true} assume true; {18093#true} is VALID [2022-02-21 03:10:37,355 INFO L290 TraceCheckUtils]: 50: Hoare triple {18093#true} #res := ~__retres4~0; {18093#true} is VALID [2022-02-21 03:10:37,355 INFO L290 TraceCheckUtils]: 49: Hoare triple {18093#true} assume ~e >= 127;~__retres4~0 := 4294967295; {18093#true} is VALID [2022-02-21 03:10:37,355 INFO L290 TraceCheckUtils]: 48: Hoare triple {18093#true} assume ~m % 4294967296 >= 33554432; {18093#true} is VALID [2022-02-21 03:10:37,355 INFO L290 TraceCheckUtils]: 47: Hoare triple {18093#true} assume !false; {18093#true} is VALID [2022-02-21 03:10:37,355 INFO L290 TraceCheckUtils]: 46: Hoare triple {18093#true} assume !(~m % 4294967296 < 16777216); {18093#true} is VALID [2022-02-21 03:10:37,355 INFO L290 TraceCheckUtils]: 45: Hoare triple {18093#true} assume !(0 == ~m % 4294967296); {18093#true} is VALID [2022-02-21 03:10:37,356 INFO L290 TraceCheckUtils]: 44: Hoare triple {18093#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18093#true} is VALID [2022-02-21 03:10:37,356 INFO L272 TraceCheckUtils]: 43: Hoare triple {18367#(<= (mod |ULTIMATE.start_main_~zero~0#1| 4294967296) 0)} call main_#t~ret25#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {18093#true} is VALID [2022-02-21 03:10:37,356 INFO L290 TraceCheckUtils]: 42: Hoare triple {18367#(<= (mod |ULTIMATE.start_main_~zero~0#1| 4294967296) 0)} main_~a~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {18367#(<= (mod |ULTIMATE.start_main_~zero~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:37,356 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {18093#true} {18367#(<= (mod |ULTIMATE.start_main_~zero~0#1| 4294967296) 0)} #374#return; {18367#(<= (mod |ULTIMATE.start_main_~zero~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:37,357 INFO L290 TraceCheckUtils]: 40: Hoare triple {18093#true} assume true; {18093#true} is VALID [2022-02-21 03:10:37,357 INFO L290 TraceCheckUtils]: 39: Hoare triple {18093#true} #res := ~__retres4~0; {18093#true} is VALID [2022-02-21 03:10:37,357 INFO L290 TraceCheckUtils]: 38: Hoare triple {18093#true} assume ~e >= 127;~__retres4~0 := 4294967295; {18093#true} is VALID [2022-02-21 03:10:37,357 INFO L290 TraceCheckUtils]: 37: Hoare triple {18093#true} assume ~m % 4294967296 >= 33554432; {18093#true} is VALID [2022-02-21 03:10:37,357 INFO L290 TraceCheckUtils]: 36: Hoare triple {18093#true} assume !false; {18093#true} is VALID [2022-02-21 03:10:37,357 INFO L290 TraceCheckUtils]: 35: Hoare triple {18093#true} assume !(~m % 4294967296 < 16777216); {18093#true} is VALID [2022-02-21 03:10:37,357 INFO L290 TraceCheckUtils]: 34: Hoare triple {18093#true} assume !(0 == ~m % 4294967296); {18093#true} is VALID [2022-02-21 03:10:37,357 INFO L290 TraceCheckUtils]: 33: Hoare triple {18093#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18093#true} is VALID [2022-02-21 03:10:37,357 INFO L272 TraceCheckUtils]: 32: Hoare triple {18367#(<= (mod |ULTIMATE.start_main_~zero~0#1| 4294967296) 0)} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {18093#true} is VALID [2022-02-21 03:10:37,357 INFO L290 TraceCheckUtils]: 31: Hoare triple {18367#(<= (mod |ULTIMATE.start_main_~zero~0#1| 4294967296) 0)} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {18367#(<= (mod |ULTIMATE.start_main_~zero~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:37,358 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {18093#true} {18367#(<= (mod |ULTIMATE.start_main_~zero~0#1| 4294967296) 0)} #372#return; {18367#(<= (mod |ULTIMATE.start_main_~zero~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:37,358 INFO L290 TraceCheckUtils]: 29: Hoare triple {18093#true} assume true; {18093#true} is VALID [2022-02-21 03:10:37,358 INFO L290 TraceCheckUtils]: 28: Hoare triple {18093#true} #res := ~__retres4~0; {18093#true} is VALID [2022-02-21 03:10:37,358 INFO L290 TraceCheckUtils]: 27: Hoare triple {18093#true} ~__retres4~0 := ~res~0; {18093#true} is VALID [2022-02-21 03:10:37,358 INFO L290 TraceCheckUtils]: 26: Hoare triple {18093#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; {18093#true} is VALID [2022-02-21 03:10:37,358 INFO L290 TraceCheckUtils]: 25: Hoare triple {18093#true} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {18093#true} is VALID [2022-02-21 03:10:37,358 INFO L290 TraceCheckUtils]: 24: Hoare triple {18093#true} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {18093#true} is VALID [2022-02-21 03:10:37,358 INFO L290 TraceCheckUtils]: 23: Hoare triple {18093#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {18093#true} is VALID [2022-02-21 03:10:37,359 INFO L290 TraceCheckUtils]: 22: Hoare triple {18093#true} assume 128 + ~e >= -2147483648; {18093#true} is VALID [2022-02-21 03:10:37,359 INFO L290 TraceCheckUtils]: 21: Hoare triple {18093#true} assume 128 + ~e <= 2147483647; {18093#true} is VALID [2022-02-21 03:10:37,359 INFO L290 TraceCheckUtils]: 20: Hoare triple {18093#true} assume 128 + ~e >= -2147483648; {18093#true} is VALID [2022-02-21 03:10:37,359 INFO L290 TraceCheckUtils]: 19: Hoare triple {18093#true} assume 128 + ~e <= 2147483647; {18093#true} is VALID [2022-02-21 03:10:37,359 INFO L290 TraceCheckUtils]: 18: Hoare triple {18093#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {18093#true} is VALID [2022-02-21 03:10:37,359 INFO L290 TraceCheckUtils]: 17: Hoare triple {18093#true} assume !(~m % 4294967296 < 16777216); {18093#true} is VALID [2022-02-21 03:10:37,359 INFO L290 TraceCheckUtils]: 16: Hoare triple {18093#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {18093#true} is VALID [2022-02-21 03:10:37,359 INFO L290 TraceCheckUtils]: 15: Hoare triple {18093#true} assume ~e - 1 <= 2147483647; {18093#true} is VALID [2022-02-21 03:10:37,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {18093#true} assume !(~e <= -128); {18093#true} is VALID [2022-02-21 03:10:37,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {18093#true} assume !false; {18093#true} is VALID [2022-02-21 03:10:37,359 INFO L290 TraceCheckUtils]: 12: Hoare triple {18093#true} assume ~m % 4294967296 < 16777216; {18093#true} is VALID [2022-02-21 03:10:37,359 INFO L290 TraceCheckUtils]: 11: Hoare triple {18093#true} assume !(0 == ~m % 4294967296); {18093#true} is VALID [2022-02-21 03:10:37,359 INFO L290 TraceCheckUtils]: 10: Hoare triple {18093#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18093#true} is VALID [2022-02-21 03:10:37,359 INFO L272 TraceCheckUtils]: 9: Hoare triple {18367#(<= (mod |ULTIMATE.start_main_~zero~0#1| 4294967296) 0)} call main_#t~ret23#1 := base2flt(1, 0); {18093#true} is VALID [2022-02-21 03:10:37,360 INFO L290 TraceCheckUtils]: 8: Hoare triple {18506#(<= (mod |ULTIMATE.start_main_#t~ret22#1| 4294967296) 0)} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {18367#(<= (mod |ULTIMATE.start_main_~zero~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:37,361 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {18513#(or (not (= |base2flt_#in~m| 0)) (<= (mod |base2flt_#res| 4294967296) 0))} {18093#true} #370#return; {18506#(<= (mod |ULTIMATE.start_main_#t~ret22#1| 4294967296) 0)} is VALID [2022-02-21 03:10:37,361 INFO L290 TraceCheckUtils]: 6: Hoare triple {18513#(or (not (= |base2flt_#in~m| 0)) (<= (mod |base2flt_#res| 4294967296) 0))} assume true; {18513#(or (not (= |base2flt_#in~m| 0)) (<= (mod |base2flt_#res| 4294967296) 0))} is VALID [2022-02-21 03:10:37,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {18520#(or (<= (mod base2flt_~__retres4~0 4294967296) 0) (not (= |base2flt_#in~m| 0)))} #res := ~__retres4~0; {18513#(or (not (= |base2flt_#in~m| 0)) (<= (mod |base2flt_#res| 4294967296) 0))} is VALID [2022-02-21 03:10:37,362 INFO L290 TraceCheckUtils]: 4: Hoare triple {18093#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {18520#(or (<= (mod base2flt_~__retres4~0 4294967296) 0) (not (= |base2flt_#in~m| 0)))} is VALID [2022-02-21 03:10:37,362 INFO L290 TraceCheckUtils]: 3: Hoare triple {18093#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18093#true} is VALID [2022-02-21 03:10:37,362 INFO L272 TraceCheckUtils]: 2: Hoare triple {18093#true} call main_#t~ret22#1 := base2flt(0, 0); {18093#true} is VALID [2022-02-21 03:10:37,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {18093#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_~sb~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_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {18093#true} is VALID [2022-02-21 03:10:37,362 INFO L290 TraceCheckUtils]: 0: Hoare triple {18093#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(22, 2);call #Ultimate.allocInit(12, 3); {18093#true} is VALID [2022-02-21 03:10:37,363 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-02-21 03:10:37,363 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2830514] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:10:37,363 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:10:37,363 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 15 [2022-02-21 03:10:37,363 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092837915] [2022-02-21 03:10:37,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:10:37,364 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 12 states have internal predecessors, (79), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) Word has length 64 [2022-02-21 03:10:37,364 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:37,365 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 12 states have internal predecessors, (79), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-21 03:10:37,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:37,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-21 03:10:37,460 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:37,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-21 03:10:37,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-02-21 03:10:37,460 INFO L87 Difference]: Start difference. First operand 236 states and 303 transitions. Second operand has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 12 states have internal predecessors, (79), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-21 03:10:39,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:39,897 INFO L93 Difference]: Finished difference Result 691 states and 875 transitions. [2022-02-21 03:10:39,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-02-21 03:10:39,898 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 12 states have internal predecessors, (79), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) Word has length 64 [2022-02-21 03:10:39,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:39,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 12 states have internal predecessors, (79), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-21 03:10:39,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 381 transitions. [2022-02-21 03:10:39,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 12 states have internal predecessors, (79), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-21 03:10:39,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 381 transitions. [2022-02-21 03:10:39,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 381 transitions. [2022-02-21 03:10:40,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 381 edges. 381 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:40,262 INFO L225 Difference]: With dead ends: 691 [2022-02-21 03:10:40,262 INFO L226 Difference]: Without dead ends: 498 [2022-02-21 03:10:40,263 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=565, Invalid=1985, Unknown=0, NotChecked=0, Total=2550 [2022-02-21 03:10:40,264 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 486 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:40,264 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [486 Valid, 819 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-21 03:10:40,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2022-02-21 03:10:40,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 236. [2022-02-21 03:10:40,418 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:40,419 INFO L82 GeneralOperation]: Start isEquivalent. First operand 498 states. Second operand has 236 states, 219 states have (on average 1.3242009132420092) internal successors, (290), 226 states have internal predecessors, (290), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-21 03:10:40,419 INFO L74 IsIncluded]: Start isIncluded. First operand 498 states. Second operand has 236 states, 219 states have (on average 1.3242009132420092) internal successors, (290), 226 states have internal predecessors, (290), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-21 03:10:40,420 INFO L87 Difference]: Start difference. First operand 498 states. Second operand has 236 states, 219 states have (on average 1.3242009132420092) internal successors, (290), 226 states have internal predecessors, (290), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-21 03:10:40,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:40,434 INFO L93 Difference]: Finished difference Result 498 states and 625 transitions. [2022-02-21 03:10:40,434 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 625 transitions. [2022-02-21 03:10:40,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:40,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:40,435 INFO L74 IsIncluded]: Start isIncluded. First operand has 236 states, 219 states have (on average 1.3242009132420092) internal successors, (290), 226 states have internal predecessors, (290), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Second operand 498 states. [2022-02-21 03:10:40,435 INFO L87 Difference]: Start difference. First operand has 236 states, 219 states have (on average 1.3242009132420092) internal successors, (290), 226 states have internal predecessors, (290), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Second operand 498 states. [2022-02-21 03:10:40,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:40,449 INFO L93 Difference]: Finished difference Result 498 states and 625 transitions. [2022-02-21 03:10:40,449 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 625 transitions. [2022-02-21 03:10:40,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:40,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:40,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:40,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:40,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 219 states have (on average 1.3242009132420092) internal successors, (290), 226 states have internal predecessors, (290), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-21 03:10:40,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 299 transitions. [2022-02-21 03:10:40,455 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 299 transitions. Word has length 64 [2022-02-21 03:10:40,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:40,455 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 299 transitions. [2022-02-21 03:10:40,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 12 states have internal predecessors, (79), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-21 03:10:40,455 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 299 transitions. [2022-02-21 03:10:40,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-02-21 03:10:40,458 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:40,458 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:40,480 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:40,671 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,SelfDestructingSolverStorable15 [2022-02-21 03:10:40,672 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-02-21 03:10:40,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:40,672 INFO L85 PathProgramCache]: Analyzing trace with hash 22079575, now seen corresponding path program 1 times [2022-02-21 03:10:40,672 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:40,672 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292932728] [2022-02-21 03:10:40,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:40,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:40,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:40,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:40,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:40,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {20706#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20655#true} is VALID [2022-02-21 03:10:40,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {20655#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {20655#true} is VALID [2022-02-21 03:10:40,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {20655#true} #res := ~__retres4~0; {20655#true} is VALID [2022-02-21 03:10:40,734 INFO L290 TraceCheckUtils]: 3: Hoare triple {20655#true} assume true; {20655#true} is VALID [2022-02-21 03:10:40,734 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {20655#true} {20655#true} #370#return; {20655#true} is VALID [2022-02-21 03:10:40,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:40,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {20706#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20707#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:40,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {20707#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !(0 == ~m % 4294967296); {20707#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:40,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {20707#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~m % 4294967296 < 16777216; {20707#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:40,817 INFO L290 TraceCheckUtils]: 3: Hoare triple {20707#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !false; {20707#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:40,817 INFO L290 TraceCheckUtils]: 4: Hoare triple {20707#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !(~e <= -128); {20707#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:40,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {20707#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~e - 1 <= 2147483647; {20707#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:40,818 INFO L290 TraceCheckUtils]: 6: Hoare triple {20707#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {20708#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:40,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {20708#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {20708#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:40,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {20708#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {20708#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:40,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {20708#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {20708#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:40,821 INFO L290 TraceCheckUtils]: 10: Hoare triple {20708#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {20708#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:40,821 INFO L290 TraceCheckUtils]: 11: Hoare triple {20708#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {20709#(or (and (<= base2flt_~m 4) (not (<= (+ (div base2flt_~m 4294967296) 1) 0))) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:40,822 INFO L290 TraceCheckUtils]: 12: Hoare triple {20709#(or (and (<= base2flt_~m 4) (not (<= (+ (div base2flt_~m 4294967296) 1) 0))) (not (= |base2flt_#in~m| 1)))} assume !(~m % 4294967296 < 16777216); {20710#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:40,822 INFO L290 TraceCheckUtils]: 13: Hoare triple {20710#(not (= |base2flt_#in~m| 1))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {20710#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:40,823 INFO L290 TraceCheckUtils]: 14: Hoare triple {20710#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {20710#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:40,823 INFO L290 TraceCheckUtils]: 15: Hoare triple {20710#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {20710#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:40,823 INFO L290 TraceCheckUtils]: 16: Hoare triple {20710#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {20710#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:40,824 INFO L290 TraceCheckUtils]: 17: Hoare triple {20710#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {20710#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:40,824 INFO L290 TraceCheckUtils]: 18: Hoare triple {20710#(not (= |base2flt_#in~m| 1))} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {20710#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:40,824 INFO L290 TraceCheckUtils]: 19: Hoare triple {20710#(not (= |base2flt_#in~m| 1))} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {20710#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:40,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {20710#(not (= |base2flt_#in~m| 1))} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {20710#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:40,825 INFO L290 TraceCheckUtils]: 21: Hoare triple {20710#(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; {20710#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:40,825 INFO L290 TraceCheckUtils]: 22: Hoare triple {20710#(not (= |base2flt_#in~m| 1))} ~__retres4~0 := ~res~0; {20710#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:40,825 INFO L290 TraceCheckUtils]: 23: Hoare triple {20710#(not (= |base2flt_#in~m| 1))} #res := ~__retres4~0; {20710#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:40,826 INFO L290 TraceCheckUtils]: 24: Hoare triple {20710#(not (= |base2flt_#in~m| 1))} assume true; {20710#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:40,826 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {20710#(not (= |base2flt_#in~m| 1))} {20655#true} #372#return; {20656#false} is VALID [2022-02-21 03:10:40,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-02-21 03:10:40,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:40,831 INFO L290 TraceCheckUtils]: 0: Hoare triple {20706#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20655#true} is VALID [2022-02-21 03:10:40,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {20655#true} assume !(0 == ~m % 4294967296); {20655#true} is VALID [2022-02-21 03:10:40,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {20655#true} assume !(~m % 4294967296 < 16777216); {20655#true} is VALID [2022-02-21 03:10:40,832 INFO L290 TraceCheckUtils]: 3: Hoare triple {20655#true} assume !false; {20655#true} is VALID [2022-02-21 03:10:40,832 INFO L290 TraceCheckUtils]: 4: Hoare triple {20655#true} assume ~m % 4294967296 >= 33554432; {20655#true} is VALID [2022-02-21 03:10:40,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {20655#true} assume ~e >= 127;~__retres4~0 := 4294967295; {20655#true} is VALID [2022-02-21 03:10:40,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {20655#true} #res := ~__retres4~0; {20655#true} is VALID [2022-02-21 03:10:40,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {20655#true} assume true; {20655#true} is VALID [2022-02-21 03:10:40,832 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {20655#true} {20656#false} #374#return; {20656#false} is VALID [2022-02-21 03:10:40,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-21 03:10:40,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:40,848 INFO L290 TraceCheckUtils]: 0: Hoare triple {20706#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20655#true} is VALID [2022-02-21 03:10:40,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {20655#true} assume !(0 == ~m % 4294967296); {20655#true} is VALID [2022-02-21 03:10:40,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {20655#true} assume !(~m % 4294967296 < 16777216); {20655#true} is VALID [2022-02-21 03:10:40,849 INFO L290 TraceCheckUtils]: 3: Hoare triple {20655#true} assume !false; {20655#true} is VALID [2022-02-21 03:10:40,849 INFO L290 TraceCheckUtils]: 4: Hoare triple {20655#true} assume ~m % 4294967296 >= 33554432; {20655#true} is VALID [2022-02-21 03:10:40,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {20655#true} assume ~e >= 127;~__retres4~0 := 4294967295; {20655#true} is VALID [2022-02-21 03:10:40,849 INFO L290 TraceCheckUtils]: 6: Hoare triple {20655#true} #res := ~__retres4~0; {20655#true} is VALID [2022-02-21 03:10:40,849 INFO L290 TraceCheckUtils]: 7: Hoare triple {20655#true} assume true; {20655#true} is VALID [2022-02-21 03:10:40,849 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {20655#true} {20656#false} #376#return; {20656#false} is VALID [2022-02-21 03:10:40,849 INFO L290 TraceCheckUtils]: 0: Hoare triple {20655#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(22, 2);call #Ultimate.allocInit(12, 3); {20655#true} is VALID [2022-02-21 03:10:40,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {20655#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_~sb~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_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {20655#true} is VALID [2022-02-21 03:10:40,850 INFO L272 TraceCheckUtils]: 2: Hoare triple {20655#true} call main_#t~ret22#1 := base2flt(0, 0); {20706#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:40,850 INFO L290 TraceCheckUtils]: 3: Hoare triple {20706#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20655#true} is VALID [2022-02-21 03:10:40,850 INFO L290 TraceCheckUtils]: 4: Hoare triple {20655#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {20655#true} is VALID [2022-02-21 03:10:40,850 INFO L290 TraceCheckUtils]: 5: Hoare triple {20655#true} #res := ~__retres4~0; {20655#true} is VALID [2022-02-21 03:10:40,850 INFO L290 TraceCheckUtils]: 6: Hoare triple {20655#true} assume true; {20655#true} is VALID [2022-02-21 03:10:40,851 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {20655#true} {20655#true} #370#return; {20655#true} is VALID [2022-02-21 03:10:40,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {20655#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {20655#true} is VALID [2022-02-21 03:10:40,851 INFO L272 TraceCheckUtils]: 9: Hoare triple {20655#true} call main_#t~ret23#1 := base2flt(1, 0); {20706#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:40,852 INFO L290 TraceCheckUtils]: 10: Hoare triple {20706#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20707#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:40,852 INFO L290 TraceCheckUtils]: 11: Hoare triple {20707#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !(0 == ~m % 4294967296); {20707#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:40,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {20707#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~m % 4294967296 < 16777216; {20707#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:40,852 INFO L290 TraceCheckUtils]: 13: Hoare triple {20707#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !false; {20707#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:40,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {20707#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !(~e <= -128); {20707#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:40,853 INFO L290 TraceCheckUtils]: 15: Hoare triple {20707#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~e - 1 <= 2147483647; {20707#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:40,853 INFO L290 TraceCheckUtils]: 16: Hoare triple {20707#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {20708#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:40,855 INFO L290 TraceCheckUtils]: 17: Hoare triple {20708#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {20708#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:40,855 INFO L290 TraceCheckUtils]: 18: Hoare triple {20708#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {20708#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:40,855 INFO L290 TraceCheckUtils]: 19: Hoare triple {20708#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {20708#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:40,856 INFO L290 TraceCheckUtils]: 20: Hoare triple {20708#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {20708#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:40,857 INFO L290 TraceCheckUtils]: 21: Hoare triple {20708#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {20709#(or (and (<= base2flt_~m 4) (not (<= (+ (div base2flt_~m 4294967296) 1) 0))) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:40,857 INFO L290 TraceCheckUtils]: 22: Hoare triple {20709#(or (and (<= base2flt_~m 4) (not (<= (+ (div base2flt_~m 4294967296) 1) 0))) (not (= |base2flt_#in~m| 1)))} assume !(~m % 4294967296 < 16777216); {20710#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:40,858 INFO L290 TraceCheckUtils]: 23: Hoare triple {20710#(not (= |base2flt_#in~m| 1))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {20710#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:40,858 INFO L290 TraceCheckUtils]: 24: Hoare triple {20710#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {20710#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:40,858 INFO L290 TraceCheckUtils]: 25: Hoare triple {20710#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {20710#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:40,858 INFO L290 TraceCheckUtils]: 26: Hoare triple {20710#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {20710#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:40,859 INFO L290 TraceCheckUtils]: 27: Hoare triple {20710#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {20710#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:40,859 INFO L290 TraceCheckUtils]: 28: Hoare triple {20710#(not (= |base2flt_#in~m| 1))} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {20710#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:40,859 INFO L290 TraceCheckUtils]: 29: Hoare triple {20710#(not (= |base2flt_#in~m| 1))} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {20710#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:40,860 INFO L290 TraceCheckUtils]: 30: Hoare triple {20710#(not (= |base2flt_#in~m| 1))} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {20710#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:40,860 INFO L290 TraceCheckUtils]: 31: Hoare triple {20710#(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; {20710#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:40,860 INFO L290 TraceCheckUtils]: 32: Hoare triple {20710#(not (= |base2flt_#in~m| 1))} ~__retres4~0 := ~res~0; {20710#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:40,861 INFO L290 TraceCheckUtils]: 33: Hoare triple {20710#(not (= |base2flt_#in~m| 1))} #res := ~__retres4~0; {20710#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:40,861 INFO L290 TraceCheckUtils]: 34: Hoare triple {20710#(not (= |base2flt_#in~m| 1))} assume true; {20710#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:40,862 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {20710#(not (= |base2flt_#in~m| 1))} {20655#true} #372#return; {20656#false} is VALID [2022-02-21 03:10:40,862 INFO L290 TraceCheckUtils]: 36: Hoare triple {20656#false} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {20656#false} is VALID [2022-02-21 03:10:40,862 INFO L272 TraceCheckUtils]: 37: Hoare triple {20656#false} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {20706#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:40,862 INFO L290 TraceCheckUtils]: 38: Hoare triple {20706#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20655#true} is VALID [2022-02-21 03:10:40,862 INFO L290 TraceCheckUtils]: 39: Hoare triple {20655#true} assume !(0 == ~m % 4294967296); {20655#true} is VALID [2022-02-21 03:10:40,862 INFO L290 TraceCheckUtils]: 40: Hoare triple {20655#true} assume !(~m % 4294967296 < 16777216); {20655#true} is VALID [2022-02-21 03:10:40,862 INFO L290 TraceCheckUtils]: 41: Hoare triple {20655#true} assume !false; {20655#true} is VALID [2022-02-21 03:10:40,863 INFO L290 TraceCheckUtils]: 42: Hoare triple {20655#true} assume ~m % 4294967296 >= 33554432; {20655#true} is VALID [2022-02-21 03:10:40,863 INFO L290 TraceCheckUtils]: 43: Hoare triple {20655#true} assume ~e >= 127;~__retres4~0 := 4294967295; {20655#true} is VALID [2022-02-21 03:10:40,863 INFO L290 TraceCheckUtils]: 44: Hoare triple {20655#true} #res := ~__retres4~0; {20655#true} is VALID [2022-02-21 03:10:40,863 INFO L290 TraceCheckUtils]: 45: Hoare triple {20655#true} assume true; {20655#true} is VALID [2022-02-21 03:10:40,863 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {20655#true} {20656#false} #374#return; {20656#false} is VALID [2022-02-21 03:10:40,863 INFO L290 TraceCheckUtils]: 47: Hoare triple {20656#false} main_~a~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {20656#false} is VALID [2022-02-21 03:10:40,863 INFO L272 TraceCheckUtils]: 48: Hoare triple {20656#false} call main_#t~ret25#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {20706#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:40,863 INFO L290 TraceCheckUtils]: 49: Hoare triple {20706#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20655#true} is VALID [2022-02-21 03:10:40,863 INFO L290 TraceCheckUtils]: 50: Hoare triple {20655#true} assume !(0 == ~m % 4294967296); {20655#true} is VALID [2022-02-21 03:10:40,863 INFO L290 TraceCheckUtils]: 51: Hoare triple {20655#true} assume !(~m % 4294967296 < 16777216); {20655#true} is VALID [2022-02-21 03:10:40,863 INFO L290 TraceCheckUtils]: 52: Hoare triple {20655#true} assume !false; {20655#true} is VALID [2022-02-21 03:10:40,863 INFO L290 TraceCheckUtils]: 53: Hoare triple {20655#true} assume ~m % 4294967296 >= 33554432; {20655#true} is VALID [2022-02-21 03:10:40,863 INFO L290 TraceCheckUtils]: 54: Hoare triple {20655#true} assume ~e >= 127;~__retres4~0 := 4294967295; {20655#true} is VALID [2022-02-21 03:10:40,863 INFO L290 TraceCheckUtils]: 55: Hoare triple {20655#true} #res := ~__retres4~0; {20655#true} is VALID [2022-02-21 03:10:40,863 INFO L290 TraceCheckUtils]: 56: Hoare triple {20655#true} assume true; {20655#true} is VALID [2022-02-21 03:10:40,864 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {20655#true} {20656#false} #376#return; {20656#false} is VALID [2022-02-21 03:10:40,864 INFO L290 TraceCheckUtils]: 58: Hoare triple {20656#false} main_~b~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {20656#false} is VALID [2022-02-21 03:10:40,864 INFO L290 TraceCheckUtils]: 59: Hoare triple {20656#false} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {20656#false} is VALID [2022-02-21 03:10:40,864 INFO L290 TraceCheckUtils]: 60: Hoare triple {20656#false} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {20656#false} is VALID [2022-02-21 03:10:40,864 INFO L290 TraceCheckUtils]: 61: Hoare triple {20656#false} main_~sb~0#1 := main_~tmp~2#1; {20656#false} is VALID [2022-02-21 03:10:40,864 INFO L290 TraceCheckUtils]: 62: Hoare triple {20656#false} assume { :begin_inline_mulflt } true;mulflt_#in~a#1, mulflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mulflt_#res#1;havoc mulflt_#t~nondet12#1, mulflt_#t~nondet13#1, mulflt_#t~nondet14#1, mulflt_#t~nondet15#1, mulflt_#t~nondet16#1, mulflt_#t~nondet17#1, mulflt_~a#1, mulflt_~b#1, mulflt_~res~2#1, mulflt_~ma~1#1, mulflt_~mb~1#1, mulflt_~accu~0#1, mulflt_~ea~1#1, mulflt_~eb~1#1, mulflt_~tmp~1#1, mulflt_~__retres10~1#1;mulflt_~a#1 := mulflt_#in~a#1;mulflt_~b#1 := mulflt_#in~b#1;havoc mulflt_~res~2#1;havoc mulflt_~ma~1#1;havoc mulflt_~mb~1#1;havoc mulflt_~accu~0#1;havoc mulflt_~ea~1#1;havoc mulflt_~eb~1#1;havoc mulflt_~tmp~1#1;havoc mulflt_~__retres10~1#1; {20656#false} is VALID [2022-02-21 03:10:40,864 INFO L290 TraceCheckUtils]: 63: Hoare triple {20656#false} assume mulflt_~a#1 % 4294967296 < mulflt_~b#1 % 4294967296;mulflt_~tmp~1#1 := mulflt_~a#1;mulflt_~a#1 := mulflt_~b#1;mulflt_~b#1 := mulflt_~tmp~1#1; {20656#false} is VALID [2022-02-21 03:10:40,864 INFO L290 TraceCheckUtils]: 64: Hoare triple {20656#false} assume !(0 == mulflt_~b#1 % 4294967296); {20656#false} is VALID [2022-02-21 03:10:40,864 INFO L290 TraceCheckUtils]: 65: Hoare triple {20656#false} assume !(0 == mulflt_~a#1); {20656#false} is VALID [2022-02-21 03:10:40,864 INFO L290 TraceCheckUtils]: 66: Hoare triple {20656#false} assume !false; {20656#false} is VALID [2022-02-21 03:10:40,865 INFO L290 TraceCheckUtils]: 67: Hoare triple {20656#false} assume !false; {20656#false} is VALID [2022-02-21 03:10:40,865 INFO L290 TraceCheckUtils]: 68: Hoare triple {20656#false} assume mulflt_~a#1 >= 0;abs_171 := (if mulflt_~a#1 < 16777215 then mulflt_~a#1 else 16777215);assume mulflt_~a#1 >= 0;assume mulflt_~ma~1#1 < abs_171; {20656#false} is VALID [2022-02-21 03:10:40,865 INFO L290 TraceCheckUtils]: 69: Hoare triple {20656#false} assume (if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {20656#false} is VALID [2022-02-21 03:10:40,866 INFO L290 TraceCheckUtils]: 70: Hoare triple {20656#false} assume !((if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {20656#false} is VALID [2022-02-21 03:10:40,866 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-02-21 03:10:40,867 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:40,867 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292932728] [2022-02-21 03:10:40,867 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292932728] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:40,867 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631803720] [2022-02-21 03:10:40,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:40,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:40,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:40,869 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:40,897 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:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:40,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-21 03:10:40,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:40,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:41,157 INFO L290 TraceCheckUtils]: 0: Hoare triple {20655#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(22, 2);call #Ultimate.allocInit(12, 3); {20655#true} is VALID [2022-02-21 03:10:41,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {20655#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_~sb~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_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {20655#true} is VALID [2022-02-21 03:10:41,157 INFO L272 TraceCheckUtils]: 2: Hoare triple {20655#true} call main_#t~ret22#1 := base2flt(0, 0); {20655#true} is VALID [2022-02-21 03:10:41,157 INFO L290 TraceCheckUtils]: 3: Hoare triple {20655#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20655#true} is VALID [2022-02-21 03:10:41,158 INFO L290 TraceCheckUtils]: 4: Hoare triple {20655#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {20655#true} is VALID [2022-02-21 03:10:41,158 INFO L290 TraceCheckUtils]: 5: Hoare triple {20655#true} #res := ~__retres4~0; {20655#true} is VALID [2022-02-21 03:10:41,158 INFO L290 TraceCheckUtils]: 6: Hoare triple {20655#true} assume true; {20655#true} is VALID [2022-02-21 03:10:41,158 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {20655#true} {20655#true} #370#return; {20655#true} is VALID [2022-02-21 03:10:41,158 INFO L290 TraceCheckUtils]: 8: Hoare triple {20655#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {20655#true} is VALID [2022-02-21 03:10:41,158 INFO L272 TraceCheckUtils]: 9: Hoare triple {20655#true} call main_#t~ret23#1 := base2flt(1, 0); {20655#true} is VALID [2022-02-21 03:10:41,158 INFO L290 TraceCheckUtils]: 10: Hoare triple {20655#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20744#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:41,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {20744#(= base2flt_~m |base2flt_#in~m|)} assume !(0 == ~m % 4294967296); {20744#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:41,159 INFO L290 TraceCheckUtils]: 12: Hoare triple {20744#(= base2flt_~m |base2flt_#in~m|)} assume ~m % 4294967296 < 16777216; {20744#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:41,159 INFO L290 TraceCheckUtils]: 13: Hoare triple {20744#(= base2flt_~m |base2flt_#in~m|)} assume !false; {20744#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:41,159 INFO L290 TraceCheckUtils]: 14: Hoare triple {20744#(= base2flt_~m |base2flt_#in~m|)} assume !(~e <= -128); {20744#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:41,160 INFO L290 TraceCheckUtils]: 15: Hoare triple {20744#(= base2flt_~m |base2flt_#in~m|)} assume ~e - 1 <= 2147483647; {20744#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:41,160 INFO L290 TraceCheckUtils]: 16: Hoare triple {20744#(= base2flt_~m |base2flt_#in~m|)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {20763#(= (* 2 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:41,160 INFO L290 TraceCheckUtils]: 17: Hoare triple {20763#(= (* 2 |base2flt_#in~m|) base2flt_~m)} assume ~m % 4294967296 < 16777216; {20763#(= (* 2 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:41,161 INFO L290 TraceCheckUtils]: 18: Hoare triple {20763#(= (* 2 |base2flt_#in~m|) base2flt_~m)} assume !false; {20763#(= (* 2 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:41,161 INFO L290 TraceCheckUtils]: 19: Hoare triple {20763#(= (* 2 |base2flt_#in~m|) base2flt_~m)} assume !(~e <= -128); {20763#(= (* 2 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:41,170 INFO L290 TraceCheckUtils]: 20: Hoare triple {20763#(= (* 2 |base2flt_#in~m|) base2flt_~m)} assume ~e - 1 <= 2147483647; {20763#(= (* 2 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:41,171 INFO L290 TraceCheckUtils]: 21: Hoare triple {20763#(= (* 2 |base2flt_#in~m|) base2flt_~m)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {20779#(= (* |base2flt_#in~m| 4) base2flt_~m)} is VALID [2022-02-21 03:10:41,172 INFO L290 TraceCheckUtils]: 22: Hoare triple {20779#(= (* |base2flt_#in~m| 4) base2flt_~m)} assume !(~m % 4294967296 < 16777216); {20783#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} is VALID [2022-02-21 03:10:41,172 INFO L290 TraceCheckUtils]: 23: Hoare triple {20783#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {20783#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} is VALID [2022-02-21 03:10:41,173 INFO L290 TraceCheckUtils]: 24: Hoare triple {20783#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} assume 128 + ~e <= 2147483647; {20783#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} is VALID [2022-02-21 03:10:41,173 INFO L290 TraceCheckUtils]: 25: Hoare triple {20783#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} assume 128 + ~e >= -2147483648; {20783#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} is VALID [2022-02-21 03:10:41,173 INFO L290 TraceCheckUtils]: 26: Hoare triple {20783#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} assume 128 + ~e <= 2147483647; {20783#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} is VALID [2022-02-21 03:10:41,173 INFO L290 TraceCheckUtils]: 27: Hoare triple {20783#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} assume 128 + ~e >= -2147483648; {20783#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} is VALID [2022-02-21 03:10:41,175 INFO L290 TraceCheckUtils]: 28: Hoare triple {20783#(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))); {20783#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} is VALID [2022-02-21 03:10:41,175 INFO L290 TraceCheckUtils]: 29: Hoare triple {20783#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {20783#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} is VALID [2022-02-21 03:10:41,176 INFO L290 TraceCheckUtils]: 30: Hoare triple {20783#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {20783#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} is VALID [2022-02-21 03:10:41,176 INFO L290 TraceCheckUtils]: 31: Hoare triple {20783#(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; {20783#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} is VALID [2022-02-21 03:10:41,176 INFO L290 TraceCheckUtils]: 32: Hoare triple {20783#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} ~__retres4~0 := ~res~0; {20783#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} is VALID [2022-02-21 03:10:41,177 INFO L290 TraceCheckUtils]: 33: Hoare triple {20783#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} #res := ~__retres4~0; {20783#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} is VALID [2022-02-21 03:10:41,177 INFO L290 TraceCheckUtils]: 34: Hoare triple {20783#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} assume true; {20783#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} is VALID [2022-02-21 03:10:41,178 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {20783#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} {20655#true} #372#return; {20656#false} is VALID [2022-02-21 03:10:41,178 INFO L290 TraceCheckUtils]: 36: Hoare triple {20656#false} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {20656#false} is VALID [2022-02-21 03:10:41,178 INFO L272 TraceCheckUtils]: 37: Hoare triple {20656#false} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {20656#false} is VALID [2022-02-21 03:10:41,178 INFO L290 TraceCheckUtils]: 38: Hoare triple {20656#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20656#false} is VALID [2022-02-21 03:10:41,178 INFO L290 TraceCheckUtils]: 39: Hoare triple {20656#false} assume !(0 == ~m % 4294967296); {20656#false} is VALID [2022-02-21 03:10:41,178 INFO L290 TraceCheckUtils]: 40: Hoare triple {20656#false} assume !(~m % 4294967296 < 16777216); {20656#false} is VALID [2022-02-21 03:10:41,178 INFO L290 TraceCheckUtils]: 41: Hoare triple {20656#false} assume !false; {20656#false} is VALID [2022-02-21 03:10:41,178 INFO L290 TraceCheckUtils]: 42: Hoare triple {20656#false} assume ~m % 4294967296 >= 33554432; {20656#false} is VALID [2022-02-21 03:10:41,178 INFO L290 TraceCheckUtils]: 43: Hoare triple {20656#false} assume ~e >= 127;~__retres4~0 := 4294967295; {20656#false} is VALID [2022-02-21 03:10:41,178 INFO L290 TraceCheckUtils]: 44: Hoare triple {20656#false} #res := ~__retres4~0; {20656#false} is VALID [2022-02-21 03:10:41,178 INFO L290 TraceCheckUtils]: 45: Hoare triple {20656#false} assume true; {20656#false} is VALID [2022-02-21 03:10:41,178 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {20656#false} {20656#false} #374#return; {20656#false} is VALID [2022-02-21 03:10:41,178 INFO L290 TraceCheckUtils]: 47: Hoare triple {20656#false} main_~a~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {20656#false} is VALID [2022-02-21 03:10:41,179 INFO L272 TraceCheckUtils]: 48: Hoare triple {20656#false} call main_#t~ret25#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {20656#false} is VALID [2022-02-21 03:10:41,179 INFO L290 TraceCheckUtils]: 49: Hoare triple {20656#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20656#false} is VALID [2022-02-21 03:10:41,179 INFO L290 TraceCheckUtils]: 50: Hoare triple {20656#false} assume !(0 == ~m % 4294967296); {20656#false} is VALID [2022-02-21 03:10:41,179 INFO L290 TraceCheckUtils]: 51: Hoare triple {20656#false} assume !(~m % 4294967296 < 16777216); {20656#false} is VALID [2022-02-21 03:10:41,179 INFO L290 TraceCheckUtils]: 52: Hoare triple {20656#false} assume !false; {20656#false} is VALID [2022-02-21 03:10:41,179 INFO L290 TraceCheckUtils]: 53: Hoare triple {20656#false} assume ~m % 4294967296 >= 33554432; {20656#false} is VALID [2022-02-21 03:10:41,179 INFO L290 TraceCheckUtils]: 54: Hoare triple {20656#false} assume ~e >= 127;~__retres4~0 := 4294967295; {20656#false} is VALID [2022-02-21 03:10:41,179 INFO L290 TraceCheckUtils]: 55: Hoare triple {20656#false} #res := ~__retres4~0; {20656#false} is VALID [2022-02-21 03:10:41,179 INFO L290 TraceCheckUtils]: 56: Hoare triple {20656#false} assume true; {20656#false} is VALID [2022-02-21 03:10:41,179 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {20656#false} {20656#false} #376#return; {20656#false} is VALID [2022-02-21 03:10:41,179 INFO L290 TraceCheckUtils]: 58: Hoare triple {20656#false} main_~b~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {20656#false} is VALID [2022-02-21 03:10:41,179 INFO L290 TraceCheckUtils]: 59: Hoare triple {20656#false} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {20656#false} is VALID [2022-02-21 03:10:41,179 INFO L290 TraceCheckUtils]: 60: Hoare triple {20656#false} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {20656#false} is VALID [2022-02-21 03:10:41,179 INFO L290 TraceCheckUtils]: 61: Hoare triple {20656#false} main_~sb~0#1 := main_~tmp~2#1; {20656#false} is VALID [2022-02-21 03:10:41,180 INFO L290 TraceCheckUtils]: 62: Hoare triple {20656#false} assume { :begin_inline_mulflt } true;mulflt_#in~a#1, mulflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mulflt_#res#1;havoc mulflt_#t~nondet12#1, mulflt_#t~nondet13#1, mulflt_#t~nondet14#1, mulflt_#t~nondet15#1, mulflt_#t~nondet16#1, mulflt_#t~nondet17#1, mulflt_~a#1, mulflt_~b#1, mulflt_~res~2#1, mulflt_~ma~1#1, mulflt_~mb~1#1, mulflt_~accu~0#1, mulflt_~ea~1#1, mulflt_~eb~1#1, mulflt_~tmp~1#1, mulflt_~__retres10~1#1;mulflt_~a#1 := mulflt_#in~a#1;mulflt_~b#1 := mulflt_#in~b#1;havoc mulflt_~res~2#1;havoc mulflt_~ma~1#1;havoc mulflt_~mb~1#1;havoc mulflt_~accu~0#1;havoc mulflt_~ea~1#1;havoc mulflt_~eb~1#1;havoc mulflt_~tmp~1#1;havoc mulflt_~__retres10~1#1; {20656#false} is VALID [2022-02-21 03:10:41,180 INFO L290 TraceCheckUtils]: 63: Hoare triple {20656#false} assume mulflt_~a#1 % 4294967296 < mulflt_~b#1 % 4294967296;mulflt_~tmp~1#1 := mulflt_~a#1;mulflt_~a#1 := mulflt_~b#1;mulflt_~b#1 := mulflt_~tmp~1#1; {20656#false} is VALID [2022-02-21 03:10:41,180 INFO L290 TraceCheckUtils]: 64: Hoare triple {20656#false} assume !(0 == mulflt_~b#1 % 4294967296); {20656#false} is VALID [2022-02-21 03:10:41,180 INFO L290 TraceCheckUtils]: 65: Hoare triple {20656#false} assume !(0 == mulflt_~a#1); {20656#false} is VALID [2022-02-21 03:10:41,180 INFO L290 TraceCheckUtils]: 66: Hoare triple {20656#false} assume !false; {20656#false} is VALID [2022-02-21 03:10:41,180 INFO L290 TraceCheckUtils]: 67: Hoare triple {20656#false} assume !false; {20656#false} is VALID [2022-02-21 03:10:41,180 INFO L290 TraceCheckUtils]: 68: Hoare triple {20656#false} assume mulflt_~a#1 >= 0;abs_171 := (if mulflt_~a#1 < 16777215 then mulflt_~a#1 else 16777215);assume mulflt_~a#1 >= 0;assume mulflt_~ma~1#1 < abs_171; {20656#false} is VALID [2022-02-21 03:10:41,180 INFO L290 TraceCheckUtils]: 69: Hoare triple {20656#false} assume (if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {20656#false} is VALID [2022-02-21 03:10:41,180 INFO L290 TraceCheckUtils]: 70: Hoare triple {20656#false} assume !((if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {20656#false} is VALID [2022-02-21 03:10:41,180 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-21 03:10:41,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:10:41,479 INFO L290 TraceCheckUtils]: 70: Hoare triple {20656#false} assume !((if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {20656#false} is VALID [2022-02-21 03:10:41,479 INFO L290 TraceCheckUtils]: 69: Hoare triple {20656#false} assume (if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {20656#false} is VALID [2022-02-21 03:10:41,479 INFO L290 TraceCheckUtils]: 68: Hoare triple {20656#false} assume mulflt_~a#1 >= 0;abs_171 := (if mulflt_~a#1 < 16777215 then mulflt_~a#1 else 16777215);assume mulflt_~a#1 >= 0;assume mulflt_~ma~1#1 < abs_171; {20656#false} is VALID [2022-02-21 03:10:41,479 INFO L290 TraceCheckUtils]: 67: Hoare triple {20656#false} assume !false; {20656#false} is VALID [2022-02-21 03:10:41,479 INFO L290 TraceCheckUtils]: 66: Hoare triple {20656#false} assume !false; {20656#false} is VALID [2022-02-21 03:10:41,479 INFO L290 TraceCheckUtils]: 65: Hoare triple {20656#false} assume !(0 == mulflt_~a#1); {20656#false} is VALID [2022-02-21 03:10:41,479 INFO L290 TraceCheckUtils]: 64: Hoare triple {20656#false} assume !(0 == mulflt_~b#1 % 4294967296); {20656#false} is VALID [2022-02-21 03:10:41,479 INFO L290 TraceCheckUtils]: 63: Hoare triple {20656#false} assume mulflt_~a#1 % 4294967296 < mulflt_~b#1 % 4294967296;mulflt_~tmp~1#1 := mulflt_~a#1;mulflt_~a#1 := mulflt_~b#1;mulflt_~b#1 := mulflt_~tmp~1#1; {20656#false} is VALID [2022-02-21 03:10:41,479 INFO L290 TraceCheckUtils]: 62: Hoare triple {20656#false} assume { :begin_inline_mulflt } true;mulflt_#in~a#1, mulflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mulflt_#res#1;havoc mulflt_#t~nondet12#1, mulflt_#t~nondet13#1, mulflt_#t~nondet14#1, mulflt_#t~nondet15#1, mulflt_#t~nondet16#1, mulflt_#t~nondet17#1, mulflt_~a#1, mulflt_~b#1, mulflt_~res~2#1, mulflt_~ma~1#1, mulflt_~mb~1#1, mulflt_~accu~0#1, mulflt_~ea~1#1, mulflt_~eb~1#1, mulflt_~tmp~1#1, mulflt_~__retres10~1#1;mulflt_~a#1 := mulflt_#in~a#1;mulflt_~b#1 := mulflt_#in~b#1;havoc mulflt_~res~2#1;havoc mulflt_~ma~1#1;havoc mulflt_~mb~1#1;havoc mulflt_~accu~0#1;havoc mulflt_~ea~1#1;havoc mulflt_~eb~1#1;havoc mulflt_~tmp~1#1;havoc mulflt_~__retres10~1#1; {20656#false} is VALID [2022-02-21 03:10:41,480 INFO L290 TraceCheckUtils]: 61: Hoare triple {20656#false} main_~sb~0#1 := main_~tmp~2#1; {20656#false} is VALID [2022-02-21 03:10:41,480 INFO L290 TraceCheckUtils]: 60: Hoare triple {20656#false} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {20656#false} is VALID [2022-02-21 03:10:41,480 INFO L290 TraceCheckUtils]: 59: Hoare triple {20656#false} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {20656#false} is VALID [2022-02-21 03:10:41,480 INFO L290 TraceCheckUtils]: 58: Hoare triple {20656#false} main_~b~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {20656#false} is VALID [2022-02-21 03:10:41,480 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {20655#true} {20656#false} #376#return; {20656#false} is VALID [2022-02-21 03:10:41,480 INFO L290 TraceCheckUtils]: 56: Hoare triple {20655#true} assume true; {20655#true} is VALID [2022-02-21 03:10:41,480 INFO L290 TraceCheckUtils]: 55: Hoare triple {20655#true} #res := ~__retres4~0; {20655#true} is VALID [2022-02-21 03:10:41,480 INFO L290 TraceCheckUtils]: 54: Hoare triple {20655#true} assume ~e >= 127;~__retres4~0 := 4294967295; {20655#true} is VALID [2022-02-21 03:10:41,480 INFO L290 TraceCheckUtils]: 53: Hoare triple {20655#true} assume ~m % 4294967296 >= 33554432; {20655#true} is VALID [2022-02-21 03:10:41,480 INFO L290 TraceCheckUtils]: 52: Hoare triple {20655#true} assume !false; {20655#true} is VALID [2022-02-21 03:10:41,480 INFO L290 TraceCheckUtils]: 51: Hoare triple {20655#true} assume !(~m % 4294967296 < 16777216); {20655#true} is VALID [2022-02-21 03:10:41,480 INFO L290 TraceCheckUtils]: 50: Hoare triple {20655#true} assume !(0 == ~m % 4294967296); {20655#true} is VALID [2022-02-21 03:10:41,480 INFO L290 TraceCheckUtils]: 49: Hoare triple {20655#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20655#true} is VALID [2022-02-21 03:10:41,480 INFO L272 TraceCheckUtils]: 48: Hoare triple {20656#false} call main_#t~ret25#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {20655#true} is VALID [2022-02-21 03:10:41,481 INFO L290 TraceCheckUtils]: 47: Hoare triple {20656#false} main_~a~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {20656#false} is VALID [2022-02-21 03:10:41,481 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {20655#true} {20656#false} #374#return; {20656#false} is VALID [2022-02-21 03:10:41,481 INFO L290 TraceCheckUtils]: 45: Hoare triple {20655#true} assume true; {20655#true} is VALID [2022-02-21 03:10:41,481 INFO L290 TraceCheckUtils]: 44: Hoare triple {20655#true} #res := ~__retres4~0; {20655#true} is VALID [2022-02-21 03:10:41,481 INFO L290 TraceCheckUtils]: 43: Hoare triple {20655#true} assume ~e >= 127;~__retres4~0 := 4294967295; {20655#true} is VALID [2022-02-21 03:10:41,481 INFO L290 TraceCheckUtils]: 42: Hoare triple {20655#true} assume ~m % 4294967296 >= 33554432; {20655#true} is VALID [2022-02-21 03:10:41,481 INFO L290 TraceCheckUtils]: 41: Hoare triple {20655#true} assume !false; {20655#true} is VALID [2022-02-21 03:10:41,481 INFO L290 TraceCheckUtils]: 40: Hoare triple {20655#true} assume !(~m % 4294967296 < 16777216); {20655#true} is VALID [2022-02-21 03:10:41,481 INFO L290 TraceCheckUtils]: 39: Hoare triple {20655#true} assume !(0 == ~m % 4294967296); {20655#true} is VALID [2022-02-21 03:10:41,481 INFO L290 TraceCheckUtils]: 38: Hoare triple {20655#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20655#true} is VALID [2022-02-21 03:10:41,481 INFO L272 TraceCheckUtils]: 37: Hoare triple {20656#false} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {20655#true} is VALID [2022-02-21 03:10:41,481 INFO L290 TraceCheckUtils]: 36: Hoare triple {20656#false} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {20656#false} is VALID [2022-02-21 03:10:41,491 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {20710#(not (= |base2flt_#in~m| 1))} {20655#true} #372#return; {20656#false} is VALID [2022-02-21 03:10:41,491 INFO L290 TraceCheckUtils]: 34: Hoare triple {20710#(not (= |base2flt_#in~m| 1))} assume true; {20710#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:41,492 INFO L290 TraceCheckUtils]: 33: Hoare triple {20710#(not (= |base2flt_#in~m| 1))} #res := ~__retres4~0; {20710#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:41,492 INFO L290 TraceCheckUtils]: 32: Hoare triple {20710#(not (= |base2flt_#in~m| 1))} ~__retres4~0 := ~res~0; {20710#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:41,493 INFO L290 TraceCheckUtils]: 31: Hoare triple {20710#(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; {20710#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:41,493 INFO L290 TraceCheckUtils]: 30: Hoare triple {20710#(not (= |base2flt_#in~m| 1))} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {20710#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:41,493 INFO L290 TraceCheckUtils]: 29: Hoare triple {20710#(not (= |base2flt_#in~m| 1))} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {20710#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:41,494 INFO L290 TraceCheckUtils]: 28: Hoare triple {20710#(not (= |base2flt_#in~m| 1))} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {20710#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:41,494 INFO L290 TraceCheckUtils]: 27: Hoare triple {20710#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {20710#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:41,494 INFO L290 TraceCheckUtils]: 26: Hoare triple {20710#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {20710#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:41,495 INFO L290 TraceCheckUtils]: 25: Hoare triple {20710#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {20710#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:41,495 INFO L290 TraceCheckUtils]: 24: Hoare triple {20710#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {20710#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:41,495 INFO L290 TraceCheckUtils]: 23: Hoare triple {20710#(not (= |base2flt_#in~m| 1))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {20710#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:41,496 INFO L290 TraceCheckUtils]: 22: Hoare triple {21075#(or (< (mod base2flt_~m 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !(~m % 4294967296 < 16777216); {20710#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:41,497 INFO L290 TraceCheckUtils]: 21: Hoare triple {21079#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {21075#(or (< (mod base2flt_~m 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:41,498 INFO L290 TraceCheckUtils]: 20: Hoare triple {21079#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {21079#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:41,498 INFO L290 TraceCheckUtils]: 19: Hoare triple {21079#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {21079#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:41,498 INFO L290 TraceCheckUtils]: 18: Hoare triple {21079#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !false; {21079#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:41,499 INFO L290 TraceCheckUtils]: 17: Hoare triple {21079#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {21079#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:41,500 INFO L290 TraceCheckUtils]: 16: Hoare triple {21095#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {21079#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:41,500 INFO L290 TraceCheckUtils]: 15: Hoare triple {21095#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {21095#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:41,500 INFO L290 TraceCheckUtils]: 14: Hoare triple {21095#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {21095#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:41,500 INFO L290 TraceCheckUtils]: 13: Hoare triple {21095#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !false; {21095#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:41,501 INFO L290 TraceCheckUtils]: 12: Hoare triple {21095#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {21095#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:41,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {21095#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !(0 == ~m % 4294967296); {21095#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:41,501 INFO L290 TraceCheckUtils]: 10: Hoare triple {20655#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {21095#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:41,501 INFO L272 TraceCheckUtils]: 9: Hoare triple {20655#true} call main_#t~ret23#1 := base2flt(1, 0); {20655#true} is VALID [2022-02-21 03:10:41,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {20655#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {20655#true} is VALID [2022-02-21 03:10:41,502 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {20655#true} {20655#true} #370#return; {20655#true} is VALID [2022-02-21 03:10:41,502 INFO L290 TraceCheckUtils]: 6: Hoare triple {20655#true} assume true; {20655#true} is VALID [2022-02-21 03:10:41,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {20655#true} #res := ~__retres4~0; {20655#true} is VALID [2022-02-21 03:10:41,502 INFO L290 TraceCheckUtils]: 4: Hoare triple {20655#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {20655#true} is VALID [2022-02-21 03:10:41,502 INFO L290 TraceCheckUtils]: 3: Hoare triple {20655#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20655#true} is VALID [2022-02-21 03:10:41,502 INFO L272 TraceCheckUtils]: 2: Hoare triple {20655#true} call main_#t~ret22#1 := base2flt(0, 0); {20655#true} is VALID [2022-02-21 03:10:41,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {20655#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_~sb~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_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {20655#true} is VALID [2022-02-21 03:10:41,502 INFO L290 TraceCheckUtils]: 0: Hoare triple {20655#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(22, 2);call #Ultimate.allocInit(12, 3); {20655#true} is VALID [2022-02-21 03:10:41,502 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-02-21 03:10:41,502 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631803720] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:10:41,503 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:10:41,503 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-02-21 03:10:41,503 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401070359] [2022-02-21 03:10:41,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:10:41,503 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 13 states have internal predecessors, (99), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2022-02-21 03:10:41,505 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:41,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 13 states have internal predecessors, (99), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-21 03:10:41,590 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:41,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-21 03:10:41,590 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:41,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-21 03:10:41,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-02-21 03:10:41,591 INFO L87 Difference]: Start difference. First operand 236 states and 299 transitions. Second operand has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 13 states have internal predecessors, (99), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-21 03:10:45,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:45,352 INFO L93 Difference]: Finished difference Result 866 states and 1099 transitions. [2022-02-21 03:10:45,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-02-21 03:10:45,353 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 13 states have internal predecessors, (99), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2022-02-21 03:10:45,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:45,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 13 states have internal predecessors, (99), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-21 03:10:45,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 486 transitions. [2022-02-21 03:10:45,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 13 states have internal predecessors, (99), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-21 03:10:45,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 486 transitions. [2022-02-21 03:10:45,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 486 transitions. [2022-02-21 03:10:45,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 486 edges. 486 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:46,010 INFO L225 Difference]: With dead ends: 866 [2022-02-21 03:10:46,011 INFO L226 Difference]: Without dead ends: 630 [2022-02-21 03:10:46,012 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=345, Invalid=845, Unknown=0, NotChecked=0, Total=1190 [2022-02-21 03:10:46,012 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 648 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:46,013 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [648 Valid, 603 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-21 03:10:46,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2022-02-21 03:10:46,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 267. [2022-02-21 03:10:46,220 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:46,220 INFO L82 GeneralOperation]: Start isEquivalent. First operand 630 states. Second operand has 267 states, 250 states have (on average 1.284) internal successors, (321), 257 states have internal predecessors, (321), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-21 03:10:46,221 INFO L74 IsIncluded]: Start isIncluded. First operand 630 states. Second operand has 267 states, 250 states have (on average 1.284) internal successors, (321), 257 states have internal predecessors, (321), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-21 03:10:46,221 INFO L87 Difference]: Start difference. First operand 630 states. Second operand has 267 states, 250 states have (on average 1.284) internal successors, (321), 257 states have internal predecessors, (321), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-21 03:10:46,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:46,240 INFO L93 Difference]: Finished difference Result 630 states and 783 transitions. [2022-02-21 03:10:46,240 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 783 transitions. [2022-02-21 03:10:46,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:46,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:46,241 INFO L74 IsIncluded]: Start isIncluded. First operand has 267 states, 250 states have (on average 1.284) internal successors, (321), 257 states have internal predecessors, (321), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Second operand 630 states. [2022-02-21 03:10:46,242 INFO L87 Difference]: Start difference. First operand has 267 states, 250 states have (on average 1.284) internal successors, (321), 257 states have internal predecessors, (321), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Second operand 630 states. [2022-02-21 03:10:46,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:46,261 INFO L93 Difference]: Finished difference Result 630 states and 783 transitions. [2022-02-21 03:10:46,261 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 783 transitions. [2022-02-21 03:10:46,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:46,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:46,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:46,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:46,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 250 states have (on average 1.284) internal successors, (321), 257 states have internal predecessors, (321), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-21 03:10:46,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 330 transitions. [2022-02-21 03:10:46,268 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 330 transitions. Word has length 71 [2022-02-21 03:10:46,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:46,268 INFO L470 AbstractCegarLoop]: Abstraction has 267 states and 330 transitions. [2022-02-21 03:10:46,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 13 states have internal predecessors, (99), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-21 03:10:46,268 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 330 transitions. [2022-02-21 03:10:46,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-02-21 03:10:46,269 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:46,270 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 4, 4, 4, 3, 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] [2022-02-21 03:10:46,289 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:46,483 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,SelfDestructingSolverStorable16 [2022-02-21 03:10:46,483 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-02-21 03:10:46,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:46,484 INFO L85 PathProgramCache]: Analyzing trace with hash -859088779, now seen corresponding path program 1 times [2022-02-21 03:10:46,484 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:46,484 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079620236] [2022-02-21 03:10:46,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:46,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:46,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:46,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:46,547 INFO L290 TraceCheckUtils]: 0: Hoare triple {23804#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {23741#true} is VALID [2022-02-21 03:10:46,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {23741#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {23741#true} is VALID [2022-02-21 03:10:46,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {23741#true} #res := ~__retres4~0; {23741#true} is VALID [2022-02-21 03:10:46,548 INFO L290 TraceCheckUtils]: 3: Hoare triple {23741#true} assume true; {23741#true} is VALID [2022-02-21 03:10:46,548 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {23741#true} {23741#true} #370#return; {23741#true} is VALID [2022-02-21 03:10:46,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:46,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:46,646 INFO L290 TraceCheckUtils]: 0: Hoare triple {23804#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {23805#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:46,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {23805#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !(0 == ~m % 4294967296); {23805#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:46,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {23805#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~m % 4294967296 < 16777216; {23805#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:46,647 INFO L290 TraceCheckUtils]: 3: Hoare triple {23805#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !false; {23805#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:46,648 INFO L290 TraceCheckUtils]: 4: Hoare triple {23805#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !(~e <= -128); {23805#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:46,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {23805#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~e - 1 <= 2147483647; {23805#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:46,648 INFO L290 TraceCheckUtils]: 6: Hoare triple {23805#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {23806#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:46,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {23806#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume ~m % 4294967296 < 16777216; {23806#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:46,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {23806#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume !false; {23806#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:46,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {23806#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume !(~e <= -128); {23806#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:46,650 INFO L290 TraceCheckUtils]: 10: Hoare triple {23806#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume ~e - 1 <= 2147483647; {23806#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:46,650 INFO L290 TraceCheckUtils]: 11: Hoare triple {23806#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {23807#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:46,651 INFO L290 TraceCheckUtils]: 12: Hoare triple {23807#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~m % 4294967296 < 16777216; {23807#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:46,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {23807#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume !false; {23807#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:46,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {23807#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume !(~e <= -128); {23807#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:46,652 INFO L290 TraceCheckUtils]: 15: Hoare triple {23807#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~e - 1 <= 2147483647; {23807#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:46,652 INFO L290 TraceCheckUtils]: 16: Hoare triple {23807#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {23808#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} is VALID [2022-02-21 03:10:46,652 INFO L290 TraceCheckUtils]: 17: Hoare triple {23808#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} assume ~m % 4294967296 < 16777216; {23808#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} is VALID [2022-02-21 03:10:46,653 INFO L290 TraceCheckUtils]: 18: Hoare triple {23808#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} assume !false; {23808#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} is VALID [2022-02-21 03:10:46,653 INFO L290 TraceCheckUtils]: 19: Hoare triple {23808#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} assume !(~e <= -128); {23808#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} is VALID [2022-02-21 03:10:46,653 INFO L290 TraceCheckUtils]: 20: Hoare triple {23808#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} assume ~e - 1 <= 2147483647; {23808#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} is VALID [2022-02-21 03:10:46,654 INFO L290 TraceCheckUtils]: 21: Hoare triple {23808#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {23809#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:46,654 INFO L290 TraceCheckUtils]: 22: Hoare triple {23809#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} assume ~m % 4294967296 < 16777216; {23809#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:46,655 INFO L290 TraceCheckUtils]: 23: Hoare triple {23809#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} assume !false; {23809#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:46,655 INFO L290 TraceCheckUtils]: 24: Hoare triple {23809#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} assume !(~e <= -128); {23809#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:46,656 INFO L290 TraceCheckUtils]: 25: Hoare triple {23809#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} assume ~e - 1 <= 2147483647; {23809#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:46,656 INFO L290 TraceCheckUtils]: 26: Hoare triple {23809#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {23810#(or (<= 0 (+ 5 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:46,656 INFO L290 TraceCheckUtils]: 27: Hoare triple {23810#(or (<= 0 (+ 5 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~m % 4294967296 < 16777216; {23810#(or (<= 0 (+ 5 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:46,657 INFO L290 TraceCheckUtils]: 28: Hoare triple {23810#(or (<= 0 (+ 5 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume !false; {23810#(or (<= 0 (+ 5 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:46,657 INFO L290 TraceCheckUtils]: 29: Hoare triple {23810#(or (<= 0 (+ 5 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume !(~e <= -128); {23810#(or (<= 0 (+ 5 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:46,657 INFO L290 TraceCheckUtils]: 30: Hoare triple {23810#(or (<= 0 (+ 5 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~e - 1 <= 2147483647; {23810#(or (<= 0 (+ 5 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:46,658 INFO L290 TraceCheckUtils]: 31: Hoare triple {23810#(or (<= 0 (+ 5 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {23811#(or (<= 0 (+ 6 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:46,658 INFO L290 TraceCheckUtils]: 32: Hoare triple {23811#(or (<= 0 (+ 6 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~m % 4294967296 < 16777216; {23811#(or (<= 0 (+ 6 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:46,659 INFO L290 TraceCheckUtils]: 33: Hoare triple {23811#(or (<= 0 (+ 6 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume !false; {23811#(or (<= 0 (+ 6 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:46,659 INFO L290 TraceCheckUtils]: 34: Hoare triple {23811#(or (<= 0 (+ 6 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~e <= -128;~__retres4~0 := 0; {23812#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:10:46,659 INFO L290 TraceCheckUtils]: 35: Hoare triple {23812#(not (= |base2flt_#in~e| 0))} #res := ~__retres4~0; {23812#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:10:46,660 INFO L290 TraceCheckUtils]: 36: Hoare triple {23812#(not (= |base2flt_#in~e| 0))} assume true; {23812#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:10:46,662 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {23812#(not (= |base2flt_#in~e| 0))} {23741#true} #372#return; {23742#false} is VALID [2022-02-21 03:10:46,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-21 03:10:46,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:46,672 INFO L290 TraceCheckUtils]: 0: Hoare triple {23804#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {23741#true} is VALID [2022-02-21 03:10:46,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {23741#true} assume !(0 == ~m % 4294967296); {23741#true} is VALID [2022-02-21 03:10:46,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {23741#true} assume !(~m % 4294967296 < 16777216); {23741#true} is VALID [2022-02-21 03:10:46,673 INFO L290 TraceCheckUtils]: 3: Hoare triple {23741#true} assume !false; {23741#true} is VALID [2022-02-21 03:10:46,673 INFO L290 TraceCheckUtils]: 4: Hoare triple {23741#true} assume ~m % 4294967296 >= 33554432; {23741#true} is VALID [2022-02-21 03:10:46,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {23741#true} assume ~e >= 127;~__retres4~0 := 4294967295; {23741#true} is VALID [2022-02-21 03:10:46,673 INFO L290 TraceCheckUtils]: 6: Hoare triple {23741#true} #res := ~__retres4~0; {23741#true} is VALID [2022-02-21 03:10:46,673 INFO L290 TraceCheckUtils]: 7: Hoare triple {23741#true} assume true; {23741#true} is VALID [2022-02-21 03:10:46,673 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {23741#true} {23742#false} #374#return; {23742#false} is VALID [2022-02-21 03:10:46,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-02-21 03:10:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:46,678 INFO L290 TraceCheckUtils]: 0: Hoare triple {23804#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {23741#true} is VALID [2022-02-21 03:10:46,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {23741#true} assume !(0 == ~m % 4294967296); {23741#true} is VALID [2022-02-21 03:10:46,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {23741#true} assume !(~m % 4294967296 < 16777216); {23741#true} is VALID [2022-02-21 03:10:46,679 INFO L290 TraceCheckUtils]: 3: Hoare triple {23741#true} assume !false; {23741#true} is VALID [2022-02-21 03:10:46,679 INFO L290 TraceCheckUtils]: 4: Hoare triple {23741#true} assume ~m % 4294967296 >= 33554432; {23741#true} is VALID [2022-02-21 03:10:46,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {23741#true} assume ~e >= 127;~__retres4~0 := 4294967295; {23741#true} is VALID [2022-02-21 03:10:46,679 INFO L290 TraceCheckUtils]: 6: Hoare triple {23741#true} #res := ~__retres4~0; {23741#true} is VALID [2022-02-21 03:10:46,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {23741#true} assume true; {23741#true} is VALID [2022-02-21 03:10:46,679 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {23741#true} {23742#false} #376#return; {23742#false} is VALID [2022-02-21 03:10:46,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {23741#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(22, 2);call #Ultimate.allocInit(12, 3); {23741#true} is VALID [2022-02-21 03:10:46,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {23741#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_~sb~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_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {23741#true} is VALID [2022-02-21 03:10:46,680 INFO L272 TraceCheckUtils]: 2: Hoare triple {23741#true} call main_#t~ret22#1 := base2flt(0, 0); {23804#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:46,680 INFO L290 TraceCheckUtils]: 3: Hoare triple {23804#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {23741#true} is VALID [2022-02-21 03:10:46,681 INFO L290 TraceCheckUtils]: 4: Hoare triple {23741#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {23741#true} is VALID [2022-02-21 03:10:46,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {23741#true} #res := ~__retres4~0; {23741#true} is VALID [2022-02-21 03:10:46,681 INFO L290 TraceCheckUtils]: 6: Hoare triple {23741#true} assume true; {23741#true} is VALID [2022-02-21 03:10:46,681 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {23741#true} {23741#true} #370#return; {23741#true} is VALID [2022-02-21 03:10:46,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {23741#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {23741#true} is VALID [2022-02-21 03:10:46,681 INFO L272 TraceCheckUtils]: 9: Hoare triple {23741#true} call main_#t~ret23#1 := base2flt(1, 0); {23804#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:46,682 INFO L290 TraceCheckUtils]: 10: Hoare triple {23804#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {23805#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:46,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {23805#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !(0 == ~m % 4294967296); {23805#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:46,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {23805#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~m % 4294967296 < 16777216; {23805#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:46,683 INFO L290 TraceCheckUtils]: 13: Hoare triple {23805#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !false; {23805#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:46,683 INFO L290 TraceCheckUtils]: 14: Hoare triple {23805#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !(~e <= -128); {23805#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:46,684 INFO L290 TraceCheckUtils]: 15: Hoare triple {23805#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~e - 1 <= 2147483647; {23805#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:46,684 INFO L290 TraceCheckUtils]: 16: Hoare triple {23805#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {23806#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:46,685 INFO L290 TraceCheckUtils]: 17: Hoare triple {23806#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume ~m % 4294967296 < 16777216; {23806#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:46,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {23806#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume !false; {23806#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:46,685 INFO L290 TraceCheckUtils]: 19: Hoare triple {23806#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume !(~e <= -128); {23806#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:46,686 INFO L290 TraceCheckUtils]: 20: Hoare triple {23806#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume ~e - 1 <= 2147483647; {23806#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:46,686 INFO L290 TraceCheckUtils]: 21: Hoare triple {23806#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {23807#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:46,687 INFO L290 TraceCheckUtils]: 22: Hoare triple {23807#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~m % 4294967296 < 16777216; {23807#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:46,687 INFO L290 TraceCheckUtils]: 23: Hoare triple {23807#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume !false; {23807#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:46,688 INFO L290 TraceCheckUtils]: 24: Hoare triple {23807#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume !(~e <= -128); {23807#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:46,688 INFO L290 TraceCheckUtils]: 25: Hoare triple {23807#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~e - 1 <= 2147483647; {23807#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:46,689 INFO L290 TraceCheckUtils]: 26: Hoare triple {23807#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {23808#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} is VALID [2022-02-21 03:10:46,689 INFO L290 TraceCheckUtils]: 27: Hoare triple {23808#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} assume ~m % 4294967296 < 16777216; {23808#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} is VALID [2022-02-21 03:10:46,689 INFO L290 TraceCheckUtils]: 28: Hoare triple {23808#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} assume !false; {23808#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} is VALID [2022-02-21 03:10:46,690 INFO L290 TraceCheckUtils]: 29: Hoare triple {23808#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} assume !(~e <= -128); {23808#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} is VALID [2022-02-21 03:10:46,690 INFO L290 TraceCheckUtils]: 30: Hoare triple {23808#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} assume ~e - 1 <= 2147483647; {23808#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} is VALID [2022-02-21 03:10:46,691 INFO L290 TraceCheckUtils]: 31: Hoare triple {23808#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {23809#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:46,691 INFO L290 TraceCheckUtils]: 32: Hoare triple {23809#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} assume ~m % 4294967296 < 16777216; {23809#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:46,691 INFO L290 TraceCheckUtils]: 33: Hoare triple {23809#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} assume !false; {23809#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:46,692 INFO L290 TraceCheckUtils]: 34: Hoare triple {23809#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} assume !(~e <= -128); {23809#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:46,692 INFO L290 TraceCheckUtils]: 35: Hoare triple {23809#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} assume ~e - 1 <= 2147483647; {23809#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:46,693 INFO L290 TraceCheckUtils]: 36: Hoare triple {23809#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {23810#(or (<= 0 (+ 5 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:46,693 INFO L290 TraceCheckUtils]: 37: Hoare triple {23810#(or (<= 0 (+ 5 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~m % 4294967296 < 16777216; {23810#(or (<= 0 (+ 5 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:46,693 INFO L290 TraceCheckUtils]: 38: Hoare triple {23810#(or (<= 0 (+ 5 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume !false; {23810#(or (<= 0 (+ 5 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:46,694 INFO L290 TraceCheckUtils]: 39: Hoare triple {23810#(or (<= 0 (+ 5 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume !(~e <= -128); {23810#(or (<= 0 (+ 5 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:46,694 INFO L290 TraceCheckUtils]: 40: Hoare triple {23810#(or (<= 0 (+ 5 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~e - 1 <= 2147483647; {23810#(or (<= 0 (+ 5 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:46,695 INFO L290 TraceCheckUtils]: 41: Hoare triple {23810#(or (<= 0 (+ 5 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {23811#(or (<= 0 (+ 6 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:46,695 INFO L290 TraceCheckUtils]: 42: Hoare triple {23811#(or (<= 0 (+ 6 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~m % 4294967296 < 16777216; {23811#(or (<= 0 (+ 6 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:46,696 INFO L290 TraceCheckUtils]: 43: Hoare triple {23811#(or (<= 0 (+ 6 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume !false; {23811#(or (<= 0 (+ 6 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:46,696 INFO L290 TraceCheckUtils]: 44: Hoare triple {23811#(or (<= 0 (+ 6 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~e <= -128;~__retres4~0 := 0; {23812#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:10:46,696 INFO L290 TraceCheckUtils]: 45: Hoare triple {23812#(not (= |base2flt_#in~e| 0))} #res := ~__retres4~0; {23812#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:10:46,697 INFO L290 TraceCheckUtils]: 46: Hoare triple {23812#(not (= |base2flt_#in~e| 0))} assume true; {23812#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:10:46,697 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {23812#(not (= |base2flt_#in~e| 0))} {23741#true} #372#return; {23742#false} is VALID [2022-02-21 03:10:46,697 INFO L290 TraceCheckUtils]: 48: Hoare triple {23742#false} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {23742#false} is VALID [2022-02-21 03:10:46,697 INFO L272 TraceCheckUtils]: 49: Hoare triple {23742#false} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {23804#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:46,698 INFO L290 TraceCheckUtils]: 50: Hoare triple {23804#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {23741#true} is VALID [2022-02-21 03:10:46,698 INFO L290 TraceCheckUtils]: 51: Hoare triple {23741#true} assume !(0 == ~m % 4294967296); {23741#true} is VALID [2022-02-21 03:10:46,698 INFO L290 TraceCheckUtils]: 52: Hoare triple {23741#true} assume !(~m % 4294967296 < 16777216); {23741#true} is VALID [2022-02-21 03:10:46,698 INFO L290 TraceCheckUtils]: 53: Hoare triple {23741#true} assume !false; {23741#true} is VALID [2022-02-21 03:10:46,698 INFO L290 TraceCheckUtils]: 54: Hoare triple {23741#true} assume ~m % 4294967296 >= 33554432; {23741#true} is VALID [2022-02-21 03:10:46,698 INFO L290 TraceCheckUtils]: 55: Hoare triple {23741#true} assume ~e >= 127;~__retres4~0 := 4294967295; {23741#true} is VALID [2022-02-21 03:10:46,698 INFO L290 TraceCheckUtils]: 56: Hoare triple {23741#true} #res := ~__retres4~0; {23741#true} is VALID [2022-02-21 03:10:46,698 INFO L290 TraceCheckUtils]: 57: Hoare triple {23741#true} assume true; {23741#true} is VALID [2022-02-21 03:10:46,698 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {23741#true} {23742#false} #374#return; {23742#false} is VALID [2022-02-21 03:10:46,698 INFO L290 TraceCheckUtils]: 59: Hoare triple {23742#false} main_~a~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {23742#false} is VALID [2022-02-21 03:10:46,699 INFO L272 TraceCheckUtils]: 60: Hoare triple {23742#false} call main_#t~ret25#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {23804#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:46,699 INFO L290 TraceCheckUtils]: 61: Hoare triple {23804#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {23741#true} is VALID [2022-02-21 03:10:46,699 INFO L290 TraceCheckUtils]: 62: Hoare triple {23741#true} assume !(0 == ~m % 4294967296); {23741#true} is VALID [2022-02-21 03:10:46,699 INFO L290 TraceCheckUtils]: 63: Hoare triple {23741#true} assume !(~m % 4294967296 < 16777216); {23741#true} is VALID [2022-02-21 03:10:46,699 INFO L290 TraceCheckUtils]: 64: Hoare triple {23741#true} assume !false; {23741#true} is VALID [2022-02-21 03:10:46,699 INFO L290 TraceCheckUtils]: 65: Hoare triple {23741#true} assume ~m % 4294967296 >= 33554432; {23741#true} is VALID [2022-02-21 03:10:46,699 INFO L290 TraceCheckUtils]: 66: Hoare triple {23741#true} assume ~e >= 127;~__retres4~0 := 4294967295; {23741#true} is VALID [2022-02-21 03:10:46,699 INFO L290 TraceCheckUtils]: 67: Hoare triple {23741#true} #res := ~__retres4~0; {23741#true} is VALID [2022-02-21 03:10:46,699 INFO L290 TraceCheckUtils]: 68: Hoare triple {23741#true} assume true; {23741#true} is VALID [2022-02-21 03:10:46,699 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {23741#true} {23742#false} #376#return; {23742#false} is VALID [2022-02-21 03:10:46,700 INFO L290 TraceCheckUtils]: 70: Hoare triple {23742#false} main_~b~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {23742#false} is VALID [2022-02-21 03:10:46,700 INFO L290 TraceCheckUtils]: 71: Hoare triple {23742#false} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {23742#false} is VALID [2022-02-21 03:10:46,700 INFO L290 TraceCheckUtils]: 72: Hoare triple {23742#false} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {23742#false} is VALID [2022-02-21 03:10:46,700 INFO L290 TraceCheckUtils]: 73: Hoare triple {23742#false} main_~sb~0#1 := main_~tmp~2#1; {23742#false} is VALID [2022-02-21 03:10:46,700 INFO L290 TraceCheckUtils]: 74: Hoare triple {23742#false} assume { :begin_inline_mulflt } true;mulflt_#in~a#1, mulflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mulflt_#res#1;havoc mulflt_#t~nondet12#1, mulflt_#t~nondet13#1, mulflt_#t~nondet14#1, mulflt_#t~nondet15#1, mulflt_#t~nondet16#1, mulflt_#t~nondet17#1, mulflt_~a#1, mulflt_~b#1, mulflt_~res~2#1, mulflt_~ma~1#1, mulflt_~mb~1#1, mulflt_~accu~0#1, mulflt_~ea~1#1, mulflt_~eb~1#1, mulflt_~tmp~1#1, mulflt_~__retres10~1#1;mulflt_~a#1 := mulflt_#in~a#1;mulflt_~b#1 := mulflt_#in~b#1;havoc mulflt_~res~2#1;havoc mulflt_~ma~1#1;havoc mulflt_~mb~1#1;havoc mulflt_~accu~0#1;havoc mulflt_~ea~1#1;havoc mulflt_~eb~1#1;havoc mulflt_~tmp~1#1;havoc mulflt_~__retres10~1#1; {23742#false} is VALID [2022-02-21 03:10:46,700 INFO L290 TraceCheckUtils]: 75: Hoare triple {23742#false} assume mulflt_~a#1 % 4294967296 < mulflt_~b#1 % 4294967296;mulflt_~tmp~1#1 := mulflt_~a#1;mulflt_~a#1 := mulflt_~b#1;mulflt_~b#1 := mulflt_~tmp~1#1; {23742#false} is VALID [2022-02-21 03:10:46,700 INFO L290 TraceCheckUtils]: 76: Hoare triple {23742#false} assume !(0 == mulflt_~b#1 % 4294967296); {23742#false} is VALID [2022-02-21 03:10:46,700 INFO L290 TraceCheckUtils]: 77: Hoare triple {23742#false} assume !(0 == mulflt_~a#1); {23742#false} is VALID [2022-02-21 03:10:46,700 INFO L290 TraceCheckUtils]: 78: Hoare triple {23742#false} assume !false; {23742#false} is VALID [2022-02-21 03:10:46,701 INFO L290 TraceCheckUtils]: 79: Hoare triple {23742#false} assume !false; {23742#false} is VALID [2022-02-21 03:10:46,701 INFO L290 TraceCheckUtils]: 80: Hoare triple {23742#false} assume mulflt_~a#1 >= 0;abs_171 := (if mulflt_~a#1 < 16777215 then mulflt_~a#1 else 16777215);assume mulflt_~a#1 >= 0;assume mulflt_~ma~1#1 < abs_171; {23742#false} is VALID [2022-02-21 03:10:46,701 INFO L290 TraceCheckUtils]: 81: Hoare triple {23742#false} assume (if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {23742#false} is VALID [2022-02-21 03:10:46,701 INFO L290 TraceCheckUtils]: 82: Hoare triple {23742#false} assume !((if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {23742#false} is VALID [2022-02-21 03:10:46,701 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 4 proven. 97 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-02-21 03:10:46,701 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:46,702 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079620236] [2022-02-21 03:10:46,702 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079620236] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:46,702 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118770326] [2022-02-21 03:10:46,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:46,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:46,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:46,704 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:46,730 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:46,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:46,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-21 03:10:46,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:46,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:47,156 INFO L290 TraceCheckUtils]: 0: Hoare triple {23741#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(22, 2);call #Ultimate.allocInit(12, 3); {23741#true} is VALID [2022-02-21 03:10:47,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {23741#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_~sb~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_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {23741#true} is VALID [2022-02-21 03:10:47,156 INFO L272 TraceCheckUtils]: 2: Hoare triple {23741#true} call main_#t~ret22#1 := base2flt(0, 0); {23741#true} is VALID [2022-02-21 03:10:47,156 INFO L290 TraceCheckUtils]: 3: Hoare triple {23741#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {23741#true} is VALID [2022-02-21 03:10:47,156 INFO L290 TraceCheckUtils]: 4: Hoare triple {23741#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {23741#true} is VALID [2022-02-21 03:10:47,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {23741#true} #res := ~__retres4~0; {23741#true} is VALID [2022-02-21 03:10:47,156 INFO L290 TraceCheckUtils]: 6: Hoare triple {23741#true} assume true; {23741#true} is VALID [2022-02-21 03:10:47,156 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {23741#true} {23741#true} #370#return; {23741#true} is VALID [2022-02-21 03:10:47,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {23741#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {23741#true} is VALID [2022-02-21 03:10:47,156 INFO L272 TraceCheckUtils]: 9: Hoare triple {23741#true} call main_#t~ret23#1 := base2flt(1, 0); {23741#true} is VALID [2022-02-21 03:10:47,157 INFO L290 TraceCheckUtils]: 10: Hoare triple {23741#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {23846#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:47,157 INFO L290 TraceCheckUtils]: 11: Hoare triple {23846#(<= |base2flt_#in~e| base2flt_~e)} assume !(0 == ~m % 4294967296); {23846#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:47,157 INFO L290 TraceCheckUtils]: 12: Hoare triple {23846#(<= |base2flt_#in~e| base2flt_~e)} assume ~m % 4294967296 < 16777216; {23846#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:47,158 INFO L290 TraceCheckUtils]: 13: Hoare triple {23846#(<= |base2flt_#in~e| base2flt_~e)} assume !false; {23846#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:47,158 INFO L290 TraceCheckUtils]: 14: Hoare triple {23846#(<= |base2flt_#in~e| base2flt_~e)} assume !(~e <= -128); {23846#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:47,158 INFO L290 TraceCheckUtils]: 15: Hoare triple {23846#(<= |base2flt_#in~e| base2flt_~e)} assume ~e - 1 <= 2147483647; {23846#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:47,159 INFO L290 TraceCheckUtils]: 16: Hoare triple {23846#(<= |base2flt_#in~e| base2flt_~e)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {23865#(<= |base2flt_#in~e| (+ base2flt_~e 1))} is VALID [2022-02-21 03:10:47,159 INFO L290 TraceCheckUtils]: 17: Hoare triple {23865#(<= |base2flt_#in~e| (+ base2flt_~e 1))} assume ~m % 4294967296 < 16777216; {23865#(<= |base2flt_#in~e| (+ base2flt_~e 1))} is VALID [2022-02-21 03:10:47,159 INFO L290 TraceCheckUtils]: 18: Hoare triple {23865#(<= |base2flt_#in~e| (+ base2flt_~e 1))} assume !false; {23865#(<= |base2flt_#in~e| (+ base2flt_~e 1))} is VALID [2022-02-21 03:10:47,160 INFO L290 TraceCheckUtils]: 19: Hoare triple {23865#(<= |base2flt_#in~e| (+ base2flt_~e 1))} assume !(~e <= -128); {23865#(<= |base2flt_#in~e| (+ base2flt_~e 1))} is VALID [2022-02-21 03:10:47,160 INFO L290 TraceCheckUtils]: 20: Hoare triple {23865#(<= |base2flt_#in~e| (+ base2flt_~e 1))} assume ~e - 1 <= 2147483647; {23865#(<= |base2flt_#in~e| (+ base2flt_~e 1))} is VALID [2022-02-21 03:10:47,161 INFO L290 TraceCheckUtils]: 21: Hoare triple {23865#(<= |base2flt_#in~e| (+ base2flt_~e 1))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {23881#(<= |base2flt_#in~e| (+ 2 base2flt_~e))} is VALID [2022-02-21 03:10:47,161 INFO L290 TraceCheckUtils]: 22: Hoare triple {23881#(<= |base2flt_#in~e| (+ 2 base2flt_~e))} assume ~m % 4294967296 < 16777216; {23881#(<= |base2flt_#in~e| (+ 2 base2flt_~e))} is VALID [2022-02-21 03:10:47,161 INFO L290 TraceCheckUtils]: 23: Hoare triple {23881#(<= |base2flt_#in~e| (+ 2 base2flt_~e))} assume !false; {23881#(<= |base2flt_#in~e| (+ 2 base2flt_~e))} is VALID [2022-02-21 03:10:47,161 INFO L290 TraceCheckUtils]: 24: Hoare triple {23881#(<= |base2flt_#in~e| (+ 2 base2flt_~e))} assume !(~e <= -128); {23881#(<= |base2flt_#in~e| (+ 2 base2flt_~e))} is VALID [2022-02-21 03:10:47,162 INFO L290 TraceCheckUtils]: 25: Hoare triple {23881#(<= |base2flt_#in~e| (+ 2 base2flt_~e))} assume ~e - 1 <= 2147483647; {23881#(<= |base2flt_#in~e| (+ 2 base2flt_~e))} is VALID [2022-02-21 03:10:47,162 INFO L290 TraceCheckUtils]: 26: Hoare triple {23881#(<= |base2flt_#in~e| (+ 2 base2flt_~e))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {23897#(<= |base2flt_#in~e| (+ 3 base2flt_~e))} is VALID [2022-02-21 03:10:47,163 INFO L290 TraceCheckUtils]: 27: Hoare triple {23897#(<= |base2flt_#in~e| (+ 3 base2flt_~e))} assume ~m % 4294967296 < 16777216; {23897#(<= |base2flt_#in~e| (+ 3 base2flt_~e))} is VALID [2022-02-21 03:10:47,163 INFO L290 TraceCheckUtils]: 28: Hoare triple {23897#(<= |base2flt_#in~e| (+ 3 base2flt_~e))} assume !false; {23897#(<= |base2flt_#in~e| (+ 3 base2flt_~e))} is VALID [2022-02-21 03:10:47,163 INFO L290 TraceCheckUtils]: 29: Hoare triple {23897#(<= |base2flt_#in~e| (+ 3 base2flt_~e))} assume !(~e <= -128); {23897#(<= |base2flt_#in~e| (+ 3 base2flt_~e))} is VALID [2022-02-21 03:10:47,163 INFO L290 TraceCheckUtils]: 30: Hoare triple {23897#(<= |base2flt_#in~e| (+ 3 base2flt_~e))} assume ~e - 1 <= 2147483647; {23897#(<= |base2flt_#in~e| (+ 3 base2flt_~e))} is VALID [2022-02-21 03:10:47,164 INFO L290 TraceCheckUtils]: 31: Hoare triple {23897#(<= |base2flt_#in~e| (+ 3 base2flt_~e))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {23913#(<= |base2flt_#in~e| (+ base2flt_~e 4))} is VALID [2022-02-21 03:10:47,164 INFO L290 TraceCheckUtils]: 32: Hoare triple {23913#(<= |base2flt_#in~e| (+ base2flt_~e 4))} assume ~m % 4294967296 < 16777216; {23913#(<= |base2flt_#in~e| (+ base2flt_~e 4))} is VALID [2022-02-21 03:10:47,165 INFO L290 TraceCheckUtils]: 33: Hoare triple {23913#(<= |base2flt_#in~e| (+ base2flt_~e 4))} assume !false; {23913#(<= |base2flt_#in~e| (+ base2flt_~e 4))} is VALID [2022-02-21 03:10:47,165 INFO L290 TraceCheckUtils]: 34: Hoare triple {23913#(<= |base2flt_#in~e| (+ base2flt_~e 4))} assume !(~e <= -128); {23913#(<= |base2flt_#in~e| (+ base2flt_~e 4))} is VALID [2022-02-21 03:10:47,165 INFO L290 TraceCheckUtils]: 35: Hoare triple {23913#(<= |base2flt_#in~e| (+ base2flt_~e 4))} assume ~e - 1 <= 2147483647; {23913#(<= |base2flt_#in~e| (+ base2flt_~e 4))} is VALID [2022-02-21 03:10:47,166 INFO L290 TraceCheckUtils]: 36: Hoare triple {23913#(<= |base2flt_#in~e| (+ base2flt_~e 4))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {23929#(<= |base2flt_#in~e| (+ 5 base2flt_~e))} is VALID [2022-02-21 03:10:47,166 INFO L290 TraceCheckUtils]: 37: Hoare triple {23929#(<= |base2flt_#in~e| (+ 5 base2flt_~e))} assume ~m % 4294967296 < 16777216; {23929#(<= |base2flt_#in~e| (+ 5 base2flt_~e))} is VALID [2022-02-21 03:10:47,166 INFO L290 TraceCheckUtils]: 38: Hoare triple {23929#(<= |base2flt_#in~e| (+ 5 base2flt_~e))} assume !false; {23929#(<= |base2flt_#in~e| (+ 5 base2flt_~e))} is VALID [2022-02-21 03:10:47,167 INFO L290 TraceCheckUtils]: 39: Hoare triple {23929#(<= |base2flt_#in~e| (+ 5 base2flt_~e))} assume !(~e <= -128); {23929#(<= |base2flt_#in~e| (+ 5 base2flt_~e))} is VALID [2022-02-21 03:10:47,167 INFO L290 TraceCheckUtils]: 40: Hoare triple {23929#(<= |base2flt_#in~e| (+ 5 base2flt_~e))} assume ~e - 1 <= 2147483647; {23929#(<= |base2flt_#in~e| (+ 5 base2flt_~e))} is VALID [2022-02-21 03:10:47,167 INFO L290 TraceCheckUtils]: 41: Hoare triple {23929#(<= |base2flt_#in~e| (+ 5 base2flt_~e))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {23945#(<= |base2flt_#in~e| (+ 6 base2flt_~e))} is VALID [2022-02-21 03:10:47,168 INFO L290 TraceCheckUtils]: 42: Hoare triple {23945#(<= |base2flt_#in~e| (+ 6 base2flt_~e))} assume ~m % 4294967296 < 16777216; {23945#(<= |base2flt_#in~e| (+ 6 base2flt_~e))} is VALID [2022-02-21 03:10:47,168 INFO L290 TraceCheckUtils]: 43: Hoare triple {23945#(<= |base2flt_#in~e| (+ 6 base2flt_~e))} assume !false; {23945#(<= |base2flt_#in~e| (+ 6 base2flt_~e))} is VALID [2022-02-21 03:10:47,168 INFO L290 TraceCheckUtils]: 44: Hoare triple {23945#(<= |base2flt_#in~e| (+ 6 base2flt_~e))} assume ~e <= -128;~__retres4~0 := 0; {23955#(<= (+ 122 |base2flt_#in~e|) 0)} is VALID [2022-02-21 03:10:47,169 INFO L290 TraceCheckUtils]: 45: Hoare triple {23955#(<= (+ 122 |base2flt_#in~e|) 0)} #res := ~__retres4~0; {23955#(<= (+ 122 |base2flt_#in~e|) 0)} is VALID [2022-02-21 03:10:47,169 INFO L290 TraceCheckUtils]: 46: Hoare triple {23955#(<= (+ 122 |base2flt_#in~e|) 0)} assume true; {23955#(<= (+ 122 |base2flt_#in~e|) 0)} is VALID [2022-02-21 03:10:47,170 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {23955#(<= (+ 122 |base2flt_#in~e|) 0)} {23741#true} #372#return; {23742#false} is VALID [2022-02-21 03:10:47,170 INFO L290 TraceCheckUtils]: 48: Hoare triple {23742#false} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {23742#false} is VALID [2022-02-21 03:10:47,170 INFO L272 TraceCheckUtils]: 49: Hoare triple {23742#false} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {23742#false} is VALID [2022-02-21 03:10:47,170 INFO L290 TraceCheckUtils]: 50: Hoare triple {23742#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {23742#false} is VALID [2022-02-21 03:10:47,170 INFO L290 TraceCheckUtils]: 51: Hoare triple {23742#false} assume !(0 == ~m % 4294967296); {23742#false} is VALID [2022-02-21 03:10:47,170 INFO L290 TraceCheckUtils]: 52: Hoare triple {23742#false} assume !(~m % 4294967296 < 16777216); {23742#false} is VALID [2022-02-21 03:10:47,170 INFO L290 TraceCheckUtils]: 53: Hoare triple {23742#false} assume !false; {23742#false} is VALID [2022-02-21 03:10:47,170 INFO L290 TraceCheckUtils]: 54: Hoare triple {23742#false} assume ~m % 4294967296 >= 33554432; {23742#false} is VALID [2022-02-21 03:10:47,170 INFO L290 TraceCheckUtils]: 55: Hoare triple {23742#false} assume ~e >= 127;~__retres4~0 := 4294967295; {23742#false} is VALID [2022-02-21 03:10:47,170 INFO L290 TraceCheckUtils]: 56: Hoare triple {23742#false} #res := ~__retres4~0; {23742#false} is VALID [2022-02-21 03:10:47,170 INFO L290 TraceCheckUtils]: 57: Hoare triple {23742#false} assume true; {23742#false} is VALID [2022-02-21 03:10:47,170 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {23742#false} {23742#false} #374#return; {23742#false} is VALID [2022-02-21 03:10:47,170 INFO L290 TraceCheckUtils]: 59: Hoare triple {23742#false} main_~a~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {23742#false} is VALID [2022-02-21 03:10:47,171 INFO L272 TraceCheckUtils]: 60: Hoare triple {23742#false} call main_#t~ret25#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {23742#false} is VALID [2022-02-21 03:10:47,171 INFO L290 TraceCheckUtils]: 61: Hoare triple {23742#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {23742#false} is VALID [2022-02-21 03:10:47,171 INFO L290 TraceCheckUtils]: 62: Hoare triple {23742#false} assume !(0 == ~m % 4294967296); {23742#false} is VALID [2022-02-21 03:10:47,171 INFO L290 TraceCheckUtils]: 63: Hoare triple {23742#false} assume !(~m % 4294967296 < 16777216); {23742#false} is VALID [2022-02-21 03:10:47,171 INFO L290 TraceCheckUtils]: 64: Hoare triple {23742#false} assume !false; {23742#false} is VALID [2022-02-21 03:10:47,171 INFO L290 TraceCheckUtils]: 65: Hoare triple {23742#false} assume ~m % 4294967296 >= 33554432; {23742#false} is VALID [2022-02-21 03:10:47,171 INFO L290 TraceCheckUtils]: 66: Hoare triple {23742#false} assume ~e >= 127;~__retres4~0 := 4294967295; {23742#false} is VALID [2022-02-21 03:10:47,171 INFO L290 TraceCheckUtils]: 67: Hoare triple {23742#false} #res := ~__retres4~0; {23742#false} is VALID [2022-02-21 03:10:47,171 INFO L290 TraceCheckUtils]: 68: Hoare triple {23742#false} assume true; {23742#false} is VALID [2022-02-21 03:10:47,171 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {23742#false} {23742#false} #376#return; {23742#false} is VALID [2022-02-21 03:10:47,171 INFO L290 TraceCheckUtils]: 70: Hoare triple {23742#false} main_~b~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {23742#false} is VALID [2022-02-21 03:10:47,171 INFO L290 TraceCheckUtils]: 71: Hoare triple {23742#false} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {23742#false} is VALID [2022-02-21 03:10:47,171 INFO L290 TraceCheckUtils]: 72: Hoare triple {23742#false} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {23742#false} is VALID [2022-02-21 03:10:47,172 INFO L290 TraceCheckUtils]: 73: Hoare triple {23742#false} main_~sb~0#1 := main_~tmp~2#1; {23742#false} is VALID [2022-02-21 03:10:47,172 INFO L290 TraceCheckUtils]: 74: Hoare triple {23742#false} assume { :begin_inline_mulflt } true;mulflt_#in~a#1, mulflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mulflt_#res#1;havoc mulflt_#t~nondet12#1, mulflt_#t~nondet13#1, mulflt_#t~nondet14#1, mulflt_#t~nondet15#1, mulflt_#t~nondet16#1, mulflt_#t~nondet17#1, mulflt_~a#1, mulflt_~b#1, mulflt_~res~2#1, mulflt_~ma~1#1, mulflt_~mb~1#1, mulflt_~accu~0#1, mulflt_~ea~1#1, mulflt_~eb~1#1, mulflt_~tmp~1#1, mulflt_~__retres10~1#1;mulflt_~a#1 := mulflt_#in~a#1;mulflt_~b#1 := mulflt_#in~b#1;havoc mulflt_~res~2#1;havoc mulflt_~ma~1#1;havoc mulflt_~mb~1#1;havoc mulflt_~accu~0#1;havoc mulflt_~ea~1#1;havoc mulflt_~eb~1#1;havoc mulflt_~tmp~1#1;havoc mulflt_~__retres10~1#1; {23742#false} is VALID [2022-02-21 03:10:47,172 INFO L290 TraceCheckUtils]: 75: Hoare triple {23742#false} assume mulflt_~a#1 % 4294967296 < mulflt_~b#1 % 4294967296;mulflt_~tmp~1#1 := mulflt_~a#1;mulflt_~a#1 := mulflt_~b#1;mulflt_~b#1 := mulflt_~tmp~1#1; {23742#false} is VALID [2022-02-21 03:10:47,172 INFO L290 TraceCheckUtils]: 76: Hoare triple {23742#false} assume !(0 == mulflt_~b#1 % 4294967296); {23742#false} is VALID [2022-02-21 03:10:47,172 INFO L290 TraceCheckUtils]: 77: Hoare triple {23742#false} assume !(0 == mulflt_~a#1); {23742#false} is VALID [2022-02-21 03:10:47,172 INFO L290 TraceCheckUtils]: 78: Hoare triple {23742#false} assume !false; {23742#false} is VALID [2022-02-21 03:10:47,172 INFO L290 TraceCheckUtils]: 79: Hoare triple {23742#false} assume !false; {23742#false} is VALID [2022-02-21 03:10:47,172 INFO L290 TraceCheckUtils]: 80: Hoare triple {23742#false} assume mulflt_~a#1 >= 0;abs_171 := (if mulflt_~a#1 < 16777215 then mulflt_~a#1 else 16777215);assume mulflt_~a#1 >= 0;assume mulflt_~ma~1#1 < abs_171; {23742#false} is VALID [2022-02-21 03:10:47,172 INFO L290 TraceCheckUtils]: 81: Hoare triple {23742#false} assume (if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {23742#false} is VALID [2022-02-21 03:10:47,172 INFO L290 TraceCheckUtils]: 82: Hoare triple {23742#false} assume !((if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {23742#false} is VALID [2022-02-21 03:10:47,172 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 26 proven. 87 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-21 03:10:47,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:10:47,817 INFO L290 TraceCheckUtils]: 82: Hoare triple {23742#false} assume !((if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {23742#false} is VALID [2022-02-21 03:10:47,817 INFO L290 TraceCheckUtils]: 81: Hoare triple {23742#false} assume (if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {23742#false} is VALID [2022-02-21 03:10:47,818 INFO L290 TraceCheckUtils]: 80: Hoare triple {23742#false} assume mulflt_~a#1 >= 0;abs_171 := (if mulflt_~a#1 < 16777215 then mulflt_~a#1 else 16777215);assume mulflt_~a#1 >= 0;assume mulflt_~ma~1#1 < abs_171; {23742#false} is VALID [2022-02-21 03:10:47,818 INFO L290 TraceCheckUtils]: 79: Hoare triple {23742#false} assume !false; {23742#false} is VALID [2022-02-21 03:10:47,818 INFO L290 TraceCheckUtils]: 78: Hoare triple {23742#false} assume !false; {23742#false} is VALID [2022-02-21 03:10:47,818 INFO L290 TraceCheckUtils]: 77: Hoare triple {23742#false} assume !(0 == mulflt_~a#1); {23742#false} is VALID [2022-02-21 03:10:47,818 INFO L290 TraceCheckUtils]: 76: Hoare triple {23742#false} assume !(0 == mulflt_~b#1 % 4294967296); {23742#false} is VALID [2022-02-21 03:10:47,818 INFO L290 TraceCheckUtils]: 75: Hoare triple {23742#false} assume mulflt_~a#1 % 4294967296 < mulflt_~b#1 % 4294967296;mulflt_~tmp~1#1 := mulflt_~a#1;mulflt_~a#1 := mulflt_~b#1;mulflt_~b#1 := mulflt_~tmp~1#1; {23742#false} is VALID [2022-02-21 03:10:47,818 INFO L290 TraceCheckUtils]: 74: Hoare triple {23742#false} assume { :begin_inline_mulflt } true;mulflt_#in~a#1, mulflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mulflt_#res#1;havoc mulflt_#t~nondet12#1, mulflt_#t~nondet13#1, mulflt_#t~nondet14#1, mulflt_#t~nondet15#1, mulflt_#t~nondet16#1, mulflt_#t~nondet17#1, mulflt_~a#1, mulflt_~b#1, mulflt_~res~2#1, mulflt_~ma~1#1, mulflt_~mb~1#1, mulflt_~accu~0#1, mulflt_~ea~1#1, mulflt_~eb~1#1, mulflt_~tmp~1#1, mulflt_~__retres10~1#1;mulflt_~a#1 := mulflt_#in~a#1;mulflt_~b#1 := mulflt_#in~b#1;havoc mulflt_~res~2#1;havoc mulflt_~ma~1#1;havoc mulflt_~mb~1#1;havoc mulflt_~accu~0#1;havoc mulflt_~ea~1#1;havoc mulflt_~eb~1#1;havoc mulflt_~tmp~1#1;havoc mulflt_~__retres10~1#1; {23742#false} is VALID [2022-02-21 03:10:47,818 INFO L290 TraceCheckUtils]: 73: Hoare triple {23742#false} main_~sb~0#1 := main_~tmp~2#1; {23742#false} is VALID [2022-02-21 03:10:47,818 INFO L290 TraceCheckUtils]: 72: Hoare triple {23742#false} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {23742#false} is VALID [2022-02-21 03:10:47,818 INFO L290 TraceCheckUtils]: 71: Hoare triple {23742#false} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {23742#false} is VALID [2022-02-21 03:10:47,818 INFO L290 TraceCheckUtils]: 70: Hoare triple {23742#false} main_~b~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {23742#false} is VALID [2022-02-21 03:10:47,818 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {23741#true} {23742#false} #376#return; {23742#false} is VALID [2022-02-21 03:10:47,819 INFO L290 TraceCheckUtils]: 68: Hoare triple {23741#true} assume true; {23741#true} is VALID [2022-02-21 03:10:47,819 INFO L290 TraceCheckUtils]: 67: Hoare triple {23741#true} #res := ~__retres4~0; {23741#true} is VALID [2022-02-21 03:10:47,819 INFO L290 TraceCheckUtils]: 66: Hoare triple {23741#true} assume ~e >= 127;~__retres4~0 := 4294967295; {23741#true} is VALID [2022-02-21 03:10:47,819 INFO L290 TraceCheckUtils]: 65: Hoare triple {23741#true} assume ~m % 4294967296 >= 33554432; {23741#true} is VALID [2022-02-21 03:10:47,819 INFO L290 TraceCheckUtils]: 64: Hoare triple {23741#true} assume !false; {23741#true} is VALID [2022-02-21 03:10:47,819 INFO L290 TraceCheckUtils]: 63: Hoare triple {23741#true} assume !(~m % 4294967296 < 16777216); {23741#true} is VALID [2022-02-21 03:10:47,819 INFO L290 TraceCheckUtils]: 62: Hoare triple {23741#true} assume !(0 == ~m % 4294967296); {23741#true} is VALID [2022-02-21 03:10:47,819 INFO L290 TraceCheckUtils]: 61: Hoare triple {23741#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {23741#true} is VALID [2022-02-21 03:10:47,819 INFO L272 TraceCheckUtils]: 60: Hoare triple {23742#false} call main_#t~ret25#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {23741#true} is VALID [2022-02-21 03:10:47,819 INFO L290 TraceCheckUtils]: 59: Hoare triple {23742#false} main_~a~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {23742#false} is VALID [2022-02-21 03:10:47,819 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {23741#true} {23742#false} #374#return; {23742#false} is VALID [2022-02-21 03:10:47,819 INFO L290 TraceCheckUtils]: 57: Hoare triple {23741#true} assume true; {23741#true} is VALID [2022-02-21 03:10:47,820 INFO L290 TraceCheckUtils]: 56: Hoare triple {23741#true} #res := ~__retres4~0; {23741#true} is VALID [2022-02-21 03:10:47,820 INFO L290 TraceCheckUtils]: 55: Hoare triple {23741#true} assume ~e >= 127;~__retres4~0 := 4294967295; {23741#true} is VALID [2022-02-21 03:10:47,823 INFO L290 TraceCheckUtils]: 54: Hoare triple {23741#true} assume ~m % 4294967296 >= 33554432; {23741#true} is VALID [2022-02-21 03:10:47,823 INFO L290 TraceCheckUtils]: 53: Hoare triple {23741#true} assume !false; {23741#true} is VALID [2022-02-21 03:10:47,823 INFO L290 TraceCheckUtils]: 52: Hoare triple {23741#true} assume !(~m % 4294967296 < 16777216); {23741#true} is VALID [2022-02-21 03:10:47,823 INFO L290 TraceCheckUtils]: 51: Hoare triple {23741#true} assume !(0 == ~m % 4294967296); {23741#true} is VALID [2022-02-21 03:10:47,823 INFO L290 TraceCheckUtils]: 50: Hoare triple {23741#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {23741#true} is VALID [2022-02-21 03:10:47,823 INFO L272 TraceCheckUtils]: 49: Hoare triple {23742#false} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {23741#true} is VALID [2022-02-21 03:10:47,823 INFO L290 TraceCheckUtils]: 48: Hoare triple {23742#false} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {23742#false} is VALID [2022-02-21 03:10:47,824 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {24178#(not (<= 0 |base2flt_#in~e|))} {23741#true} #372#return; {23742#false} is VALID [2022-02-21 03:10:47,824 INFO L290 TraceCheckUtils]: 46: Hoare triple {24178#(not (<= 0 |base2flt_#in~e|))} assume true; {24178#(not (<= 0 |base2flt_#in~e|))} is VALID [2022-02-21 03:10:47,825 INFO L290 TraceCheckUtils]: 45: Hoare triple {24178#(not (<= 0 |base2flt_#in~e|))} #res := ~__retres4~0; {24178#(not (<= 0 |base2flt_#in~e|))} is VALID [2022-02-21 03:10:47,825 INFO L290 TraceCheckUtils]: 44: Hoare triple {24188#(or (not (<= (+ 128 base2flt_~e) 0)) (not (<= 0 |base2flt_#in~e|)))} assume ~e <= -128;~__retres4~0 := 0; {24178#(not (<= 0 |base2flt_#in~e|))} is VALID [2022-02-21 03:10:47,825 INFO L290 TraceCheckUtils]: 43: Hoare triple {24188#(or (not (<= (+ 128 base2flt_~e) 0)) (not (<= 0 |base2flt_#in~e|)))} assume !false; {24188#(or (not (<= (+ 128 base2flt_~e) 0)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:47,826 INFO L290 TraceCheckUtils]: 42: Hoare triple {24188#(or (not (<= (+ 128 base2flt_~e) 0)) (not (<= 0 |base2flt_#in~e|)))} assume ~m % 4294967296 < 16777216; {24188#(or (not (<= (+ 128 base2flt_~e) 0)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:47,826 INFO L290 TraceCheckUtils]: 41: Hoare triple {24198#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {24188#(or (not (<= (+ 128 base2flt_~e) 0)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:47,827 INFO L290 TraceCheckUtils]: 40: Hoare triple {24198#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 <= 2147483647; {24198#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:47,827 INFO L290 TraceCheckUtils]: 39: Hoare triple {24198#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} assume !(~e <= -128); {24198#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:47,827 INFO L290 TraceCheckUtils]: 38: Hoare triple {24198#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} assume !false; {24198#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:47,828 INFO L290 TraceCheckUtils]: 37: Hoare triple {24198#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} assume ~m % 4294967296 < 16777216; {24198#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:47,828 INFO L290 TraceCheckUtils]: 36: Hoare triple {24214#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {24198#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:47,828 INFO L290 TraceCheckUtils]: 35: Hoare triple {24214#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 <= 2147483647; {24214#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:47,829 INFO L290 TraceCheckUtils]: 34: Hoare triple {24214#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume !(~e <= -128); {24214#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:47,829 INFO L290 TraceCheckUtils]: 33: Hoare triple {24214#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume !false; {24214#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:47,829 INFO L290 TraceCheckUtils]: 32: Hoare triple {24214#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume ~m % 4294967296 < 16777216; {24214#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:47,830 INFO L290 TraceCheckUtils]: 31: Hoare triple {24230#(or (< 0 (+ 125 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {24214#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:47,830 INFO L290 TraceCheckUtils]: 30: Hoare triple {24230#(or (< 0 (+ 125 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 <= 2147483647; {24230#(or (< 0 (+ 125 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:47,830 INFO L290 TraceCheckUtils]: 29: Hoare triple {24230#(or (< 0 (+ 125 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume !(~e <= -128); {24230#(or (< 0 (+ 125 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:47,831 INFO L290 TraceCheckUtils]: 28: Hoare triple {24230#(or (< 0 (+ 125 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume !false; {24230#(or (< 0 (+ 125 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:47,831 INFO L290 TraceCheckUtils]: 27: Hoare triple {24230#(or (< 0 (+ 125 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume ~m % 4294967296 < 16777216; {24230#(or (< 0 (+ 125 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:47,831 INFO L290 TraceCheckUtils]: 26: Hoare triple {24246#(or (< 0 (+ base2flt_~e 124)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {24230#(or (< 0 (+ 125 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:47,832 INFO L290 TraceCheckUtils]: 25: Hoare triple {24246#(or (< 0 (+ base2flt_~e 124)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 <= 2147483647; {24246#(or (< 0 (+ base2flt_~e 124)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:47,832 INFO L290 TraceCheckUtils]: 24: Hoare triple {24246#(or (< 0 (+ base2flt_~e 124)) (not (<= 0 |base2flt_#in~e|)))} assume !(~e <= -128); {24246#(or (< 0 (+ base2flt_~e 124)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:47,832 INFO L290 TraceCheckUtils]: 23: Hoare triple {24246#(or (< 0 (+ base2flt_~e 124)) (not (<= 0 |base2flt_#in~e|)))} assume !false; {24246#(or (< 0 (+ base2flt_~e 124)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:47,833 INFO L290 TraceCheckUtils]: 22: Hoare triple {24246#(or (< 0 (+ base2flt_~e 124)) (not (<= 0 |base2flt_#in~e|)))} assume ~m % 4294967296 < 16777216; {24246#(or (< 0 (+ base2flt_~e 124)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:47,833 INFO L290 TraceCheckUtils]: 21: Hoare triple {24262#(or (< 0 (+ 123 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {24246#(or (< 0 (+ base2flt_~e 124)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:47,834 INFO L290 TraceCheckUtils]: 20: Hoare triple {24262#(or (< 0 (+ 123 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 <= 2147483647; {24262#(or (< 0 (+ 123 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:47,834 INFO L290 TraceCheckUtils]: 19: Hoare triple {24262#(or (< 0 (+ 123 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume !(~e <= -128); {24262#(or (< 0 (+ 123 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:47,834 INFO L290 TraceCheckUtils]: 18: Hoare triple {24262#(or (< 0 (+ 123 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume !false; {24262#(or (< 0 (+ 123 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:47,835 INFO L290 TraceCheckUtils]: 17: Hoare triple {24262#(or (< 0 (+ 123 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume ~m % 4294967296 < 16777216; {24262#(or (< 0 (+ 123 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:47,835 INFO L290 TraceCheckUtils]: 16: Hoare triple {24278#(or (< 0 (+ 122 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {24262#(or (< 0 (+ 123 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:47,836 INFO L290 TraceCheckUtils]: 15: Hoare triple {24278#(or (< 0 (+ 122 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 <= 2147483647; {24278#(or (< 0 (+ 122 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:47,836 INFO L290 TraceCheckUtils]: 14: Hoare triple {24278#(or (< 0 (+ 122 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume !(~e <= -128); {24278#(or (< 0 (+ 122 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:47,836 INFO L290 TraceCheckUtils]: 13: Hoare triple {24278#(or (< 0 (+ 122 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume !false; {24278#(or (< 0 (+ 122 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:47,837 INFO L290 TraceCheckUtils]: 12: Hoare triple {24278#(or (< 0 (+ 122 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume ~m % 4294967296 < 16777216; {24278#(or (< 0 (+ 122 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:47,837 INFO L290 TraceCheckUtils]: 11: Hoare triple {24278#(or (< 0 (+ 122 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume !(0 == ~m % 4294967296); {24278#(or (< 0 (+ 122 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:47,837 INFO L290 TraceCheckUtils]: 10: Hoare triple {23741#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {24278#(or (< 0 (+ 122 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:47,837 INFO L272 TraceCheckUtils]: 9: Hoare triple {23741#true} call main_#t~ret23#1 := base2flt(1, 0); {23741#true} is VALID [2022-02-21 03:10:47,837 INFO L290 TraceCheckUtils]: 8: Hoare triple {23741#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {23741#true} is VALID [2022-02-21 03:10:47,838 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {23741#true} {23741#true} #370#return; {23741#true} is VALID [2022-02-21 03:10:47,838 INFO L290 TraceCheckUtils]: 6: Hoare triple {23741#true} assume true; {23741#true} is VALID [2022-02-21 03:10:47,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {23741#true} #res := ~__retres4~0; {23741#true} is VALID [2022-02-21 03:10:47,838 INFO L290 TraceCheckUtils]: 4: Hoare triple {23741#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {23741#true} is VALID [2022-02-21 03:10:47,838 INFO L290 TraceCheckUtils]: 3: Hoare triple {23741#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {23741#true} is VALID [2022-02-21 03:10:47,838 INFO L272 TraceCheckUtils]: 2: Hoare triple {23741#true} call main_#t~ret22#1 := base2flt(0, 0); {23741#true} is VALID [2022-02-21 03:10:47,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {23741#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_~sb~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_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {23741#true} is VALID [2022-02-21 03:10:47,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {23741#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(22, 2);call #Ultimate.allocInit(12, 3); {23741#true} is VALID [2022-02-21 03:10:47,838 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 4 proven. 97 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-02-21 03:10:47,839 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118770326] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:10:47,839 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:10:47,839 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 27 [2022-02-21 03:10:47,839 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387034261] [2022-02-21 03:10:47,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:10:47,840 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 5.444444444444445) internal successors, (147), 26 states have internal predecessors, (147), 2 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 83 [2022-02-21 03:10:47,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:47,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 5.444444444444445) internal successors, (147), 26 states have internal predecessors, (147), 2 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-21 03:10:47,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:47,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-02-21 03:10:47,956 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:47,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-02-21 03:10:47,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=470, Unknown=0, NotChecked=0, Total=702 [2022-02-21 03:10:47,957 INFO L87 Difference]: Start difference. First operand 267 states and 330 transitions. Second operand has 27 states, 27 states have (on average 5.444444444444445) internal successors, (147), 26 states have internal predecessors, (147), 2 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-21 03:10:52,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:52,298 INFO L93 Difference]: Finished difference Result 1871 states and 2467 transitions. [2022-02-21 03:10:52,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-02-21 03:10:52,298 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 5.444444444444445) internal successors, (147), 26 states have internal predecessors, (147), 2 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 83 [2022-02-21 03:10:52,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:52,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 5.444444444444445) internal successors, (147), 26 states have internal predecessors, (147), 2 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-21 03:10:52,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 1048 transitions. [2022-02-21 03:10:52,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 5.444444444444445) internal successors, (147), 26 states have internal predecessors, (147), 2 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-21 03:10:52,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 1048 transitions. [2022-02-21 03:10:52,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states and 1048 transitions. [2022-02-21 03:10:53,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1048 edges. 1048 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:53,274 INFO L225 Difference]: With dead ends: 1871 [2022-02-21 03:10:53,274 INFO L226 Difference]: Without dead ends: 1649 [2022-02-21 03:10:53,275 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1154, Invalid=2386, Unknown=0, NotChecked=0, Total=3540 [2022-02-21 03:10:53,276 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 1532 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1532 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:53,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1532 Valid, 969 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-21 03:10:53,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2022-02-21 03:10:53,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 318. [2022-02-21 03:10:53,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:53,569 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1649 states. Second operand has 318 states, 301 states have (on average 1.2757475083056478) internal successors, (384), 308 states have internal predecessors, (384), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-21 03:10:53,569 INFO L74 IsIncluded]: Start isIncluded. First operand 1649 states. Second operand has 318 states, 301 states have (on average 1.2757475083056478) internal successors, (384), 308 states have internal predecessors, (384), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-21 03:10:53,570 INFO L87 Difference]: Start difference. First operand 1649 states. Second operand has 318 states, 301 states have (on average 1.2757475083056478) internal successors, (384), 308 states have internal predecessors, (384), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-21 03:10:53,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:53,689 INFO L93 Difference]: Finished difference Result 1649 states and 2136 transitions. [2022-02-21 03:10:53,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2136 transitions. [2022-02-21 03:10:53,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:53,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:53,693 INFO L74 IsIncluded]: Start isIncluded. First operand has 318 states, 301 states have (on average 1.2757475083056478) internal successors, (384), 308 states have internal predecessors, (384), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Second operand 1649 states. [2022-02-21 03:10:53,693 INFO L87 Difference]: Start difference. First operand has 318 states, 301 states have (on average 1.2757475083056478) internal successors, (384), 308 states have internal predecessors, (384), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Second operand 1649 states. [2022-02-21 03:10:53,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:53,787 INFO L93 Difference]: Finished difference Result 1649 states and 2136 transitions. [2022-02-21 03:10:53,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2136 transitions. [2022-02-21 03:10:53,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:53,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:53,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:53,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:53,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 301 states have (on average 1.2757475083056478) internal successors, (384), 308 states have internal predecessors, (384), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-21 03:10:53,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 393 transitions. [2022-02-21 03:10:53,797 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 393 transitions. Word has length 83 [2022-02-21 03:10:53,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:53,797 INFO L470 AbstractCegarLoop]: Abstraction has 318 states and 393 transitions. [2022-02-21 03:10:53,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.444444444444445) internal successors, (147), 26 states have internal predecessors, (147), 2 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-21 03:10:53,797 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 393 transitions. [2022-02-21 03:10:53,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-21 03:10:53,798 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:53,798 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:53,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:10:54,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-02-21 03:10:54,015 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-02-21 03:10:54,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:54,016 INFO L85 PathProgramCache]: Analyzing trace with hash -782914729, now seen corresponding path program 2 times [2022-02-21 03:10:54,016 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:54,016 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436564320] [2022-02-21 03:10:54,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:54,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:54,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:54,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:54,106 INFO L290 TraceCheckUtils]: 0: Hoare triple {30270#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {30199#true} is VALID [2022-02-21 03:10:54,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {30199#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {30199#true} is VALID [2022-02-21 03:10:54,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {30199#true} #res := ~__retres4~0; {30199#true} is VALID [2022-02-21 03:10:54,106 INFO L290 TraceCheckUtils]: 3: Hoare triple {30199#true} assume true; {30199#true} is VALID [2022-02-21 03:10:54,106 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {30199#true} {30199#true} #370#return; {30199#true} is VALID [2022-02-21 03:10:54,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:54,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:54,275 INFO L290 TraceCheckUtils]: 0: Hoare triple {30270#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {30271#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:54,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {30271#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !(0 == ~m % 4294967296); {30271#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:54,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {30271#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~m % 4294967296 < 16777216; {30271#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:54,277 INFO L290 TraceCheckUtils]: 3: Hoare triple {30271#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !false; {30271#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:54,277 INFO L290 TraceCheckUtils]: 4: Hoare triple {30271#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !(~e <= -128); {30271#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:54,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {30271#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~e - 1 <= 2147483647; {30271#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:54,278 INFO L290 TraceCheckUtils]: 6: Hoare triple {30271#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30272#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,279 INFO L290 TraceCheckUtils]: 7: Hoare triple {30272#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {30272#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {30272#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {30272#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {30272#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {30272#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,281 INFO L290 TraceCheckUtils]: 10: Hoare triple {30272#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {30272#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,282 INFO L290 TraceCheckUtils]: 11: Hoare triple {30272#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30273#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,283 INFO L290 TraceCheckUtils]: 12: Hoare triple {30273#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {30273#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,283 INFO L290 TraceCheckUtils]: 13: Hoare triple {30273#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume !false; {30273#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,284 INFO L290 TraceCheckUtils]: 14: Hoare triple {30273#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {30273#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,284 INFO L290 TraceCheckUtils]: 15: Hoare triple {30273#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {30273#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,285 INFO L290 TraceCheckUtils]: 16: Hoare triple {30273#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30274#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,285 INFO L290 TraceCheckUtils]: 17: Hoare triple {30274#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {30274#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,286 INFO L290 TraceCheckUtils]: 18: Hoare triple {30274#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume !false; {30274#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,286 INFO L290 TraceCheckUtils]: 19: Hoare triple {30274#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {30274#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,287 INFO L290 TraceCheckUtils]: 20: Hoare triple {30274#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {30274#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,287 INFO L290 TraceCheckUtils]: 21: Hoare triple {30274#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30275#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,288 INFO L290 TraceCheckUtils]: 22: Hoare triple {30275#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {30275#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,289 INFO L290 TraceCheckUtils]: 23: Hoare triple {30275#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {30275#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,289 INFO L290 TraceCheckUtils]: 24: Hoare triple {30275#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {30275#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,290 INFO L290 TraceCheckUtils]: 25: Hoare triple {30275#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {30275#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,290 INFO L290 TraceCheckUtils]: 26: Hoare triple {30275#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30276#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,291 INFO L290 TraceCheckUtils]: 27: Hoare triple {30276#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {30276#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,292 INFO L290 TraceCheckUtils]: 28: Hoare triple {30276#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {30276#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,292 INFO L290 TraceCheckUtils]: 29: Hoare triple {30276#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {30276#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,293 INFO L290 TraceCheckUtils]: 30: Hoare triple {30276#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {30276#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,294 INFO L290 TraceCheckUtils]: 31: Hoare triple {30276#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30277#(or (and (not (<= (+ (div base2flt_~m 4294967296) 1) 0)) (<= base2flt_~m 64)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,295 INFO L290 TraceCheckUtils]: 32: Hoare triple {30277#(or (and (not (<= (+ (div base2flt_~m 4294967296) 1) 0)) (<= base2flt_~m 64)) (not (= |base2flt_#in~m| 1)))} assume !(~m % 4294967296 < 16777216); {30278#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:54,295 INFO L290 TraceCheckUtils]: 33: Hoare triple {30278#(not (= |base2flt_#in~m| 1))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {30278#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:54,295 INFO L290 TraceCheckUtils]: 34: Hoare triple {30278#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {30278#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:54,296 INFO L290 TraceCheckUtils]: 35: Hoare triple {30278#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {30278#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:54,296 INFO L290 TraceCheckUtils]: 36: Hoare triple {30278#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {30278#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:54,297 INFO L290 TraceCheckUtils]: 37: Hoare triple {30278#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {30278#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:54,297 INFO L290 TraceCheckUtils]: 38: Hoare triple {30278#(not (= |base2flt_#in~m| 1))} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {30278#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:54,297 INFO L290 TraceCheckUtils]: 39: Hoare triple {30278#(not (= |base2flt_#in~m| 1))} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {30278#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:54,298 INFO L290 TraceCheckUtils]: 40: Hoare triple {30278#(not (= |base2flt_#in~m| 1))} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {30278#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:54,298 INFO L290 TraceCheckUtils]: 41: Hoare triple {30278#(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; {30278#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:54,299 INFO L290 TraceCheckUtils]: 42: Hoare triple {30278#(not (= |base2flt_#in~m| 1))} ~__retres4~0 := ~res~0; {30278#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:54,299 INFO L290 TraceCheckUtils]: 43: Hoare triple {30278#(not (= |base2flt_#in~m| 1))} #res := ~__retres4~0; {30278#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:54,299 INFO L290 TraceCheckUtils]: 44: Hoare triple {30278#(not (= |base2flt_#in~m| 1))} assume true; {30278#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:54,300 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {30278#(not (= |base2flt_#in~m| 1))} {30199#true} #372#return; {30200#false} is VALID [2022-02-21 03:10:54,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-02-21 03:10:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:54,305 INFO L290 TraceCheckUtils]: 0: Hoare triple {30270#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {30199#true} is VALID [2022-02-21 03:10:54,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {30199#true} assume !(0 == ~m % 4294967296); {30199#true} is VALID [2022-02-21 03:10:54,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {30199#true} assume !(~m % 4294967296 < 16777216); {30199#true} is VALID [2022-02-21 03:10:54,306 INFO L290 TraceCheckUtils]: 3: Hoare triple {30199#true} assume !false; {30199#true} is VALID [2022-02-21 03:10:54,306 INFO L290 TraceCheckUtils]: 4: Hoare triple {30199#true} assume ~m % 4294967296 >= 33554432; {30199#true} is VALID [2022-02-21 03:10:54,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {30199#true} assume ~e >= 127;~__retres4~0 := 4294967295; {30199#true} is VALID [2022-02-21 03:10:54,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {30199#true} #res := ~__retres4~0; {30199#true} is VALID [2022-02-21 03:10:54,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {30199#true} assume true; {30199#true} is VALID [2022-02-21 03:10:54,307 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {30199#true} {30200#false} #374#return; {30200#false} is VALID [2022-02-21 03:10:54,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-02-21 03:10:54,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:54,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {30270#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {30199#true} is VALID [2022-02-21 03:10:54,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {30199#true} assume !(0 == ~m % 4294967296); {30199#true} is VALID [2022-02-21 03:10:54,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {30199#true} assume !(~m % 4294967296 < 16777216); {30199#true} is VALID [2022-02-21 03:10:54,312 INFO L290 TraceCheckUtils]: 3: Hoare triple {30199#true} assume !false; {30199#true} is VALID [2022-02-21 03:10:54,312 INFO L290 TraceCheckUtils]: 4: Hoare triple {30199#true} assume ~m % 4294967296 >= 33554432; {30199#true} is VALID [2022-02-21 03:10:54,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {30199#true} assume ~e >= 127;~__retres4~0 := 4294967295; {30199#true} is VALID [2022-02-21 03:10:54,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {30199#true} #res := ~__retres4~0; {30199#true} is VALID [2022-02-21 03:10:54,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {30199#true} assume true; {30199#true} is VALID [2022-02-21 03:10:54,313 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {30199#true} {30200#false} #376#return; {30200#false} is VALID [2022-02-21 03:10:54,313 INFO L290 TraceCheckUtils]: 0: Hoare triple {30199#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(22, 2);call #Ultimate.allocInit(12, 3); {30199#true} is VALID [2022-02-21 03:10:54,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {30199#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_~sb~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_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {30199#true} is VALID [2022-02-21 03:10:54,314 INFO L272 TraceCheckUtils]: 2: Hoare triple {30199#true} call main_#t~ret22#1 := base2flt(0, 0); {30270#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:54,314 INFO L290 TraceCheckUtils]: 3: Hoare triple {30270#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {30199#true} is VALID [2022-02-21 03:10:54,314 INFO L290 TraceCheckUtils]: 4: Hoare triple {30199#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {30199#true} is VALID [2022-02-21 03:10:54,314 INFO L290 TraceCheckUtils]: 5: Hoare triple {30199#true} #res := ~__retres4~0; {30199#true} is VALID [2022-02-21 03:10:54,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {30199#true} assume true; {30199#true} is VALID [2022-02-21 03:10:54,315 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {30199#true} {30199#true} #370#return; {30199#true} is VALID [2022-02-21 03:10:54,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {30199#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {30199#true} is VALID [2022-02-21 03:10:54,316 INFO L272 TraceCheckUtils]: 9: Hoare triple {30199#true} call main_#t~ret23#1 := base2flt(1, 0); {30270#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:54,316 INFO L290 TraceCheckUtils]: 10: Hoare triple {30270#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {30271#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:54,317 INFO L290 TraceCheckUtils]: 11: Hoare triple {30271#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !(0 == ~m % 4294967296); {30271#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:54,317 INFO L290 TraceCheckUtils]: 12: Hoare triple {30271#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~m % 4294967296 < 16777216; {30271#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:54,317 INFO L290 TraceCheckUtils]: 13: Hoare triple {30271#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !false; {30271#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:54,318 INFO L290 TraceCheckUtils]: 14: Hoare triple {30271#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !(~e <= -128); {30271#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:54,318 INFO L290 TraceCheckUtils]: 15: Hoare triple {30271#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~e - 1 <= 2147483647; {30271#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:54,319 INFO L290 TraceCheckUtils]: 16: Hoare triple {30271#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30272#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,320 INFO L290 TraceCheckUtils]: 17: Hoare triple {30272#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {30272#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,321 INFO L290 TraceCheckUtils]: 18: Hoare triple {30272#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {30272#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,321 INFO L290 TraceCheckUtils]: 19: Hoare triple {30272#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {30272#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,322 INFO L290 TraceCheckUtils]: 20: Hoare triple {30272#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {30272#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,323 INFO L290 TraceCheckUtils]: 21: Hoare triple {30272#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30273#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,324 INFO L290 TraceCheckUtils]: 22: Hoare triple {30273#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {30273#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,324 INFO L290 TraceCheckUtils]: 23: Hoare triple {30273#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume !false; {30273#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,325 INFO L290 TraceCheckUtils]: 24: Hoare triple {30273#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {30273#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,326 INFO L290 TraceCheckUtils]: 25: Hoare triple {30273#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {30273#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,326 INFO L290 TraceCheckUtils]: 26: Hoare triple {30273#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30274#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,327 INFO L290 TraceCheckUtils]: 27: Hoare triple {30274#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {30274#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,327 INFO L290 TraceCheckUtils]: 28: Hoare triple {30274#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume !false; {30274#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,328 INFO L290 TraceCheckUtils]: 29: Hoare triple {30274#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {30274#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,328 INFO L290 TraceCheckUtils]: 30: Hoare triple {30274#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {30274#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,329 INFO L290 TraceCheckUtils]: 31: Hoare triple {30274#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30275#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,330 INFO L290 TraceCheckUtils]: 32: Hoare triple {30275#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {30275#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,330 INFO L290 TraceCheckUtils]: 33: Hoare triple {30275#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {30275#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,331 INFO L290 TraceCheckUtils]: 34: Hoare triple {30275#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {30275#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,332 INFO L290 TraceCheckUtils]: 35: Hoare triple {30275#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {30275#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,332 INFO L290 TraceCheckUtils]: 36: Hoare triple {30275#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30276#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,333 INFO L290 TraceCheckUtils]: 37: Hoare triple {30276#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {30276#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,334 INFO L290 TraceCheckUtils]: 38: Hoare triple {30276#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {30276#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,334 INFO L290 TraceCheckUtils]: 39: Hoare triple {30276#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {30276#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,335 INFO L290 TraceCheckUtils]: 40: Hoare triple {30276#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {30276#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,336 INFO L290 TraceCheckUtils]: 41: Hoare triple {30276#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30277#(or (and (not (<= (+ (div base2flt_~m 4294967296) 1) 0)) (<= base2flt_~m 64)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:54,337 INFO L290 TraceCheckUtils]: 42: Hoare triple {30277#(or (and (not (<= (+ (div base2flt_~m 4294967296) 1) 0)) (<= base2flt_~m 64)) (not (= |base2flt_#in~m| 1)))} assume !(~m % 4294967296 < 16777216); {30278#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:54,337 INFO L290 TraceCheckUtils]: 43: Hoare triple {30278#(not (= |base2flt_#in~m| 1))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {30278#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:54,338 INFO L290 TraceCheckUtils]: 44: Hoare triple {30278#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {30278#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:54,338 INFO L290 TraceCheckUtils]: 45: Hoare triple {30278#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {30278#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:54,339 INFO L290 TraceCheckUtils]: 46: Hoare triple {30278#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {30278#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:54,339 INFO L290 TraceCheckUtils]: 47: Hoare triple {30278#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {30278#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:54,339 INFO L290 TraceCheckUtils]: 48: Hoare triple {30278#(not (= |base2flt_#in~m| 1))} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {30278#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:54,340 INFO L290 TraceCheckUtils]: 49: Hoare triple {30278#(not (= |base2flt_#in~m| 1))} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {30278#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:54,340 INFO L290 TraceCheckUtils]: 50: Hoare triple {30278#(not (= |base2flt_#in~m| 1))} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {30278#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:54,341 INFO L290 TraceCheckUtils]: 51: Hoare triple {30278#(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; {30278#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:54,341 INFO L290 TraceCheckUtils]: 52: Hoare triple {30278#(not (= |base2flt_#in~m| 1))} ~__retres4~0 := ~res~0; {30278#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:54,341 INFO L290 TraceCheckUtils]: 53: Hoare triple {30278#(not (= |base2flt_#in~m| 1))} #res := ~__retres4~0; {30278#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:54,342 INFO L290 TraceCheckUtils]: 54: Hoare triple {30278#(not (= |base2flt_#in~m| 1))} assume true; {30278#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:54,343 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {30278#(not (= |base2flt_#in~m| 1))} {30199#true} #372#return; {30200#false} is VALID [2022-02-21 03:10:54,343 INFO L290 TraceCheckUtils]: 56: Hoare triple {30200#false} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {30200#false} is VALID [2022-02-21 03:10:54,343 INFO L272 TraceCheckUtils]: 57: Hoare triple {30200#false} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {30270#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:54,343 INFO L290 TraceCheckUtils]: 58: Hoare triple {30270#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {30199#true} is VALID [2022-02-21 03:10:54,343 INFO L290 TraceCheckUtils]: 59: Hoare triple {30199#true} assume !(0 == ~m % 4294967296); {30199#true} is VALID [2022-02-21 03:10:54,343 INFO L290 TraceCheckUtils]: 60: Hoare triple {30199#true} assume !(~m % 4294967296 < 16777216); {30199#true} is VALID [2022-02-21 03:10:54,344 INFO L290 TraceCheckUtils]: 61: Hoare triple {30199#true} assume !false; {30199#true} is VALID [2022-02-21 03:10:54,344 INFO L290 TraceCheckUtils]: 62: Hoare triple {30199#true} assume ~m % 4294967296 >= 33554432; {30199#true} is VALID [2022-02-21 03:10:54,344 INFO L290 TraceCheckUtils]: 63: Hoare triple {30199#true} assume ~e >= 127;~__retres4~0 := 4294967295; {30199#true} is VALID [2022-02-21 03:10:54,344 INFO L290 TraceCheckUtils]: 64: Hoare triple {30199#true} #res := ~__retres4~0; {30199#true} is VALID [2022-02-21 03:10:54,344 INFO L290 TraceCheckUtils]: 65: Hoare triple {30199#true} assume true; {30199#true} is VALID [2022-02-21 03:10:54,344 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {30199#true} {30200#false} #374#return; {30200#false} is VALID [2022-02-21 03:10:54,344 INFO L290 TraceCheckUtils]: 67: Hoare triple {30200#false} main_~a~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {30200#false} is VALID [2022-02-21 03:10:54,345 INFO L272 TraceCheckUtils]: 68: Hoare triple {30200#false} call main_#t~ret25#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {30270#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:54,345 INFO L290 TraceCheckUtils]: 69: Hoare triple {30270#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {30199#true} is VALID [2022-02-21 03:10:54,345 INFO L290 TraceCheckUtils]: 70: Hoare triple {30199#true} assume !(0 == ~m % 4294967296); {30199#true} is VALID [2022-02-21 03:10:54,345 INFO L290 TraceCheckUtils]: 71: Hoare triple {30199#true} assume !(~m % 4294967296 < 16777216); {30199#true} is VALID [2022-02-21 03:10:54,345 INFO L290 TraceCheckUtils]: 72: Hoare triple {30199#true} assume !false; {30199#true} is VALID [2022-02-21 03:10:54,345 INFO L290 TraceCheckUtils]: 73: Hoare triple {30199#true} assume ~m % 4294967296 >= 33554432; {30199#true} is VALID [2022-02-21 03:10:54,345 INFO L290 TraceCheckUtils]: 74: Hoare triple {30199#true} assume ~e >= 127;~__retres4~0 := 4294967295; {30199#true} is VALID [2022-02-21 03:10:54,346 INFO L290 TraceCheckUtils]: 75: Hoare triple {30199#true} #res := ~__retres4~0; {30199#true} is VALID [2022-02-21 03:10:54,346 INFO L290 TraceCheckUtils]: 76: Hoare triple {30199#true} assume true; {30199#true} is VALID [2022-02-21 03:10:54,346 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {30199#true} {30200#false} #376#return; {30200#false} is VALID [2022-02-21 03:10:54,346 INFO L290 TraceCheckUtils]: 78: Hoare triple {30200#false} main_~b~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {30200#false} is VALID [2022-02-21 03:10:54,346 INFO L290 TraceCheckUtils]: 79: Hoare triple {30200#false} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {30200#false} is VALID [2022-02-21 03:10:54,346 INFO L290 TraceCheckUtils]: 80: Hoare triple {30200#false} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {30200#false} is VALID [2022-02-21 03:10:54,346 INFO L290 TraceCheckUtils]: 81: Hoare triple {30200#false} main_~sb~0#1 := main_~tmp~2#1; {30200#false} is VALID [2022-02-21 03:10:54,347 INFO L290 TraceCheckUtils]: 82: Hoare triple {30200#false} assume { :begin_inline_mulflt } true;mulflt_#in~a#1, mulflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mulflt_#res#1;havoc mulflt_#t~nondet12#1, mulflt_#t~nondet13#1, mulflt_#t~nondet14#1, mulflt_#t~nondet15#1, mulflt_#t~nondet16#1, mulflt_#t~nondet17#1, mulflt_~a#1, mulflt_~b#1, mulflt_~res~2#1, mulflt_~ma~1#1, mulflt_~mb~1#1, mulflt_~accu~0#1, mulflt_~ea~1#1, mulflt_~eb~1#1, mulflt_~tmp~1#1, mulflt_~__retres10~1#1;mulflt_~a#1 := mulflt_#in~a#1;mulflt_~b#1 := mulflt_#in~b#1;havoc mulflt_~res~2#1;havoc mulflt_~ma~1#1;havoc mulflt_~mb~1#1;havoc mulflt_~accu~0#1;havoc mulflt_~ea~1#1;havoc mulflt_~eb~1#1;havoc mulflt_~tmp~1#1;havoc mulflt_~__retres10~1#1; {30200#false} is VALID [2022-02-21 03:10:54,347 INFO L290 TraceCheckUtils]: 83: Hoare triple {30200#false} assume mulflt_~a#1 % 4294967296 < mulflt_~b#1 % 4294967296;mulflt_~tmp~1#1 := mulflt_~a#1;mulflt_~a#1 := mulflt_~b#1;mulflt_~b#1 := mulflt_~tmp~1#1; {30200#false} is VALID [2022-02-21 03:10:54,347 INFO L290 TraceCheckUtils]: 84: Hoare triple {30200#false} assume !(0 == mulflt_~b#1 % 4294967296); {30200#false} is VALID [2022-02-21 03:10:54,347 INFO L290 TraceCheckUtils]: 85: Hoare triple {30200#false} assume !(0 == mulflt_~a#1); {30200#false} is VALID [2022-02-21 03:10:54,347 INFO L290 TraceCheckUtils]: 86: Hoare triple {30200#false} assume !false; {30200#false} is VALID [2022-02-21 03:10:54,347 INFO L290 TraceCheckUtils]: 87: Hoare triple {30200#false} assume !false; {30200#false} is VALID [2022-02-21 03:10:54,347 INFO L290 TraceCheckUtils]: 88: Hoare triple {30200#false} assume mulflt_~a#1 >= 0;abs_171 := (if mulflt_~a#1 < 16777215 then mulflt_~a#1 else 16777215);assume mulflt_~a#1 >= 0;assume mulflt_~ma~1#1 < abs_171; {30200#false} is VALID [2022-02-21 03:10:54,348 INFO L290 TraceCheckUtils]: 89: Hoare triple {30200#false} assume (if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {30200#false} is VALID [2022-02-21 03:10:54,348 INFO L290 TraceCheckUtils]: 90: Hoare triple {30200#false} assume !((if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {30200#false} is VALID [2022-02-21 03:10:54,348 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 4 proven. 85 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-02-21 03:10:54,348 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:54,348 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436564320] [2022-02-21 03:10:54,349 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436564320] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:54,349 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673064398] [2022-02-21 03:10:54,349 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:10:54,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:54,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:54,352 INFO L229 MonitoredProcess]: Starting monitored process 13 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:54,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-02-21 03:10:54,423 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-21 03:10:54,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:10:54,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-21 03:10:54,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:54,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:54,659 INFO L290 TraceCheckUtils]: 0: Hoare triple {30199#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(22, 2);call #Ultimate.allocInit(12, 3); {30199#true} is VALID [2022-02-21 03:10:54,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {30199#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_~sb~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_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {30199#true} is VALID [2022-02-21 03:10:54,659 INFO L272 TraceCheckUtils]: 2: Hoare triple {30199#true} call main_#t~ret22#1 := base2flt(0, 0); {30199#true} is VALID [2022-02-21 03:10:54,660 INFO L290 TraceCheckUtils]: 3: Hoare triple {30199#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {30199#true} is VALID [2022-02-21 03:10:54,660 INFO L290 TraceCheckUtils]: 4: Hoare triple {30199#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {30199#true} is VALID [2022-02-21 03:10:54,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {30199#true} #res := ~__retres4~0; {30199#true} is VALID [2022-02-21 03:10:54,660 INFO L290 TraceCheckUtils]: 6: Hoare triple {30199#true} assume true; {30199#true} is VALID [2022-02-21 03:10:54,660 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {30199#true} {30199#true} #370#return; {30199#true} is VALID [2022-02-21 03:10:54,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {30199#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {30199#true} is VALID [2022-02-21 03:10:54,660 INFO L272 TraceCheckUtils]: 9: Hoare triple {30199#true} call main_#t~ret23#1 := base2flt(1, 0); {30199#true} is VALID [2022-02-21 03:10:54,660 INFO L290 TraceCheckUtils]: 10: Hoare triple {30199#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {30199#true} is VALID [2022-02-21 03:10:54,660 INFO L290 TraceCheckUtils]: 11: Hoare triple {30199#true} assume !(0 == ~m % 4294967296); {30199#true} is VALID [2022-02-21 03:10:54,660 INFO L290 TraceCheckUtils]: 12: Hoare triple {30199#true} assume ~m % 4294967296 < 16777216; {30199#true} is VALID [2022-02-21 03:10:54,660 INFO L290 TraceCheckUtils]: 13: Hoare triple {30199#true} assume !false; {30199#true} is VALID [2022-02-21 03:10:54,660 INFO L290 TraceCheckUtils]: 14: Hoare triple {30199#true} assume !(~e <= -128); {30199#true} is VALID [2022-02-21 03:10:54,660 INFO L290 TraceCheckUtils]: 15: Hoare triple {30199#true} assume ~e - 1 <= 2147483647; {30199#true} is VALID [2022-02-21 03:10:54,660 INFO L290 TraceCheckUtils]: 16: Hoare triple {30199#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30199#true} is VALID [2022-02-21 03:10:54,661 INFO L290 TraceCheckUtils]: 17: Hoare triple {30199#true} assume ~m % 4294967296 < 16777216; {30199#true} is VALID [2022-02-21 03:10:54,661 INFO L290 TraceCheckUtils]: 18: Hoare triple {30199#true} assume !false; {30199#true} is VALID [2022-02-21 03:10:54,661 INFO L290 TraceCheckUtils]: 19: Hoare triple {30199#true} assume !(~e <= -128); {30199#true} is VALID [2022-02-21 03:10:54,661 INFO L290 TraceCheckUtils]: 20: Hoare triple {30199#true} assume ~e - 1 <= 2147483647; {30199#true} is VALID [2022-02-21 03:10:54,661 INFO L290 TraceCheckUtils]: 21: Hoare triple {30199#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30199#true} is VALID [2022-02-21 03:10:54,661 INFO L290 TraceCheckUtils]: 22: Hoare triple {30199#true} assume ~m % 4294967296 < 16777216; {30199#true} is VALID [2022-02-21 03:10:54,661 INFO L290 TraceCheckUtils]: 23: Hoare triple {30199#true} assume !false; {30199#true} is VALID [2022-02-21 03:10:54,661 INFO L290 TraceCheckUtils]: 24: Hoare triple {30199#true} assume !(~e <= -128); {30199#true} is VALID [2022-02-21 03:10:54,662 INFO L290 TraceCheckUtils]: 25: Hoare triple {30199#true} assume ~e - 1 <= 2147483647; {30199#true} is VALID [2022-02-21 03:10:54,662 INFO L290 TraceCheckUtils]: 26: Hoare triple {30199#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30199#true} is VALID [2022-02-21 03:10:54,662 INFO L290 TraceCheckUtils]: 27: Hoare triple {30199#true} assume ~m % 4294967296 < 16777216; {30199#true} is VALID [2022-02-21 03:10:54,662 INFO L290 TraceCheckUtils]: 28: Hoare triple {30199#true} assume !false; {30199#true} is VALID [2022-02-21 03:10:54,662 INFO L290 TraceCheckUtils]: 29: Hoare triple {30199#true} assume !(~e <= -128); {30199#true} is VALID [2022-02-21 03:10:54,662 INFO L290 TraceCheckUtils]: 30: Hoare triple {30199#true} assume ~e - 1 <= 2147483647; {30199#true} is VALID [2022-02-21 03:10:54,662 INFO L290 TraceCheckUtils]: 31: Hoare triple {30199#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30199#true} is VALID [2022-02-21 03:10:54,662 INFO L290 TraceCheckUtils]: 32: Hoare triple {30199#true} assume ~m % 4294967296 < 16777216; {30199#true} is VALID [2022-02-21 03:10:54,662 INFO L290 TraceCheckUtils]: 33: Hoare triple {30199#true} assume !false; {30199#true} is VALID [2022-02-21 03:10:54,662 INFO L290 TraceCheckUtils]: 34: Hoare triple {30199#true} assume !(~e <= -128); {30199#true} is VALID [2022-02-21 03:10:54,662 INFO L290 TraceCheckUtils]: 35: Hoare triple {30199#true} assume ~e - 1 <= 2147483647; {30199#true} is VALID [2022-02-21 03:10:54,662 INFO L290 TraceCheckUtils]: 36: Hoare triple {30199#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30199#true} is VALID [2022-02-21 03:10:54,662 INFO L290 TraceCheckUtils]: 37: Hoare triple {30199#true} assume ~m % 4294967296 < 16777216; {30199#true} is VALID [2022-02-21 03:10:54,662 INFO L290 TraceCheckUtils]: 38: Hoare triple {30199#true} assume !false; {30199#true} is VALID [2022-02-21 03:10:54,663 INFO L290 TraceCheckUtils]: 39: Hoare triple {30199#true} assume !(~e <= -128); {30199#true} is VALID [2022-02-21 03:10:54,663 INFO L290 TraceCheckUtils]: 40: Hoare triple {30199#true} assume ~e - 1 <= 2147483647; {30199#true} is VALID [2022-02-21 03:10:54,663 INFO L290 TraceCheckUtils]: 41: Hoare triple {30199#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {30199#true} is VALID [2022-02-21 03:10:54,663 INFO L290 TraceCheckUtils]: 42: Hoare triple {30199#true} assume !(~m % 4294967296 < 16777216); {30199#true} is VALID [2022-02-21 03:10:54,663 INFO L290 TraceCheckUtils]: 43: Hoare triple {30199#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {30199#true} is VALID [2022-02-21 03:10:54,663 INFO L290 TraceCheckUtils]: 44: Hoare triple {30199#true} assume 128 + ~e <= 2147483647; {30199#true} is VALID [2022-02-21 03:10:54,663 INFO L290 TraceCheckUtils]: 45: Hoare triple {30199#true} assume 128 + ~e >= -2147483648; {30199#true} is VALID [2022-02-21 03:10:54,663 INFO L290 TraceCheckUtils]: 46: Hoare triple {30199#true} assume 128 + ~e <= 2147483647; {30199#true} is VALID [2022-02-21 03:10:54,663 INFO L290 TraceCheckUtils]: 47: Hoare triple {30199#true} assume 128 + ~e >= -2147483648; {30199#true} is VALID [2022-02-21 03:10:54,663 INFO L290 TraceCheckUtils]: 48: Hoare triple {30199#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {30199#true} is VALID [2022-02-21 03:10:54,663 INFO L290 TraceCheckUtils]: 49: Hoare triple {30199#true} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {30199#true} is VALID [2022-02-21 03:10:54,663 INFO L290 TraceCheckUtils]: 50: Hoare triple {30199#true} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {30199#true} is VALID [2022-02-21 03:10:54,663 INFO L290 TraceCheckUtils]: 51: Hoare triple {30199#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; {30199#true} is VALID [2022-02-21 03:10:54,664 INFO L290 TraceCheckUtils]: 52: Hoare triple {30199#true} ~__retres4~0 := ~res~0; {30199#true} is VALID [2022-02-21 03:10:54,664 INFO L290 TraceCheckUtils]: 53: Hoare triple {30199#true} #res := ~__retres4~0; {30199#true} is VALID [2022-02-21 03:10:54,664 INFO L290 TraceCheckUtils]: 54: Hoare triple {30199#true} assume true; {30199#true} is VALID [2022-02-21 03:10:54,664 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {30199#true} {30199#true} #372#return; {30199#true} is VALID [2022-02-21 03:10:54,664 INFO L290 TraceCheckUtils]: 56: Hoare triple {30199#true} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {30199#true} is VALID [2022-02-21 03:10:54,664 INFO L272 TraceCheckUtils]: 57: Hoare triple {30199#true} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {30199#true} is VALID [2022-02-21 03:10:54,664 INFO L290 TraceCheckUtils]: 58: Hoare triple {30199#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {30199#true} is VALID [2022-02-21 03:10:54,665 INFO L290 TraceCheckUtils]: 59: Hoare triple {30199#true} assume !(0 == ~m % 4294967296); {30199#true} is VALID [2022-02-21 03:10:54,665 INFO L290 TraceCheckUtils]: 60: Hoare triple {30199#true} assume !(~m % 4294967296 < 16777216); {30199#true} is VALID [2022-02-21 03:10:54,665 INFO L290 TraceCheckUtils]: 61: Hoare triple {30199#true} assume !false; {30199#true} is VALID [2022-02-21 03:10:54,665 INFO L290 TraceCheckUtils]: 62: Hoare triple {30199#true} assume ~m % 4294967296 >= 33554432; {30199#true} is VALID [2022-02-21 03:10:54,665 INFO L290 TraceCheckUtils]: 63: Hoare triple {30199#true} assume ~e >= 127;~__retres4~0 := 4294967295; {30199#true} is VALID [2022-02-21 03:10:54,665 INFO L290 TraceCheckUtils]: 64: Hoare triple {30199#true} #res := ~__retres4~0; {30199#true} is VALID [2022-02-21 03:10:54,665 INFO L290 TraceCheckUtils]: 65: Hoare triple {30199#true} assume true; {30199#true} is VALID [2022-02-21 03:10:54,665 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {30199#true} {30199#true} #374#return; {30199#true} is VALID [2022-02-21 03:10:54,666 INFO L290 TraceCheckUtils]: 67: Hoare triple {30199#true} main_~a~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {30199#true} is VALID [2022-02-21 03:10:54,666 INFO L272 TraceCheckUtils]: 68: Hoare triple {30199#true} call main_#t~ret25#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {30199#true} is VALID [2022-02-21 03:10:54,666 INFO L290 TraceCheckUtils]: 69: Hoare triple {30199#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {30199#true} is VALID [2022-02-21 03:10:54,666 INFO L290 TraceCheckUtils]: 70: Hoare triple {30199#true} assume !(0 == ~m % 4294967296); {30199#true} is VALID [2022-02-21 03:10:54,666 INFO L290 TraceCheckUtils]: 71: Hoare triple {30199#true} assume !(~m % 4294967296 < 16777216); {30199#true} is VALID [2022-02-21 03:10:54,666 INFO L290 TraceCheckUtils]: 72: Hoare triple {30199#true} assume !false; {30199#true} is VALID [2022-02-21 03:10:54,666 INFO L290 TraceCheckUtils]: 73: Hoare triple {30199#true} assume ~m % 4294967296 >= 33554432; {30199#true} is VALID [2022-02-21 03:10:54,666 INFO L290 TraceCheckUtils]: 74: Hoare triple {30199#true} assume ~e >= 127;~__retres4~0 := 4294967295; {30504#(= 4294967295 base2flt_~__retres4~0)} is VALID [2022-02-21 03:10:54,667 INFO L290 TraceCheckUtils]: 75: Hoare triple {30504#(= 4294967295 base2flt_~__retres4~0)} #res := ~__retres4~0; {30508#(= |base2flt_#res| 4294967295)} is VALID [2022-02-21 03:10:54,667 INFO L290 TraceCheckUtils]: 76: Hoare triple {30508#(= |base2flt_#res| 4294967295)} assume true; {30508#(= |base2flt_#res| 4294967295)} is VALID [2022-02-21 03:10:54,668 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {30508#(= |base2flt_#res| 4294967295)} {30199#true} #376#return; {30515#(= 4294967295 |ULTIMATE.start_main_#t~ret25#1|)} is VALID [2022-02-21 03:10:54,668 INFO L290 TraceCheckUtils]: 78: Hoare triple {30515#(= 4294967295 |ULTIMATE.start_main_#t~ret25#1|)} main_~b~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {30519#(= 4294967295 |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-21 03:10:54,668 INFO L290 TraceCheckUtils]: 79: Hoare triple {30519#(= 4294967295 |ULTIMATE.start_main_~b~0#1|)} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {30519#(= 4294967295 |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-21 03:10:54,669 INFO L290 TraceCheckUtils]: 80: Hoare triple {30519#(= 4294967295 |ULTIMATE.start_main_~b~0#1|)} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {30519#(= 4294967295 |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-21 03:10:54,669 INFO L290 TraceCheckUtils]: 81: Hoare triple {30519#(= 4294967295 |ULTIMATE.start_main_~b~0#1|)} main_~sb~0#1 := main_~tmp~2#1; {30519#(= 4294967295 |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-21 03:10:54,671 INFO L290 TraceCheckUtils]: 82: Hoare triple {30519#(= 4294967295 |ULTIMATE.start_main_~b~0#1|)} assume { :begin_inline_mulflt } true;mulflt_#in~a#1, mulflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mulflt_#res#1;havoc mulflt_#t~nondet12#1, mulflt_#t~nondet13#1, mulflt_#t~nondet14#1, mulflt_#t~nondet15#1, mulflt_#t~nondet16#1, mulflt_#t~nondet17#1, mulflt_~a#1, mulflt_~b#1, mulflt_~res~2#1, mulflt_~ma~1#1, mulflt_~mb~1#1, mulflt_~accu~0#1, mulflt_~ea~1#1, mulflt_~eb~1#1, mulflt_~tmp~1#1, mulflt_~__retres10~1#1;mulflt_~a#1 := mulflt_#in~a#1;mulflt_~b#1 := mulflt_#in~b#1;havoc mulflt_~res~2#1;havoc mulflt_~ma~1#1;havoc mulflt_~mb~1#1;havoc mulflt_~accu~0#1;havoc mulflt_~ea~1#1;havoc mulflt_~eb~1#1;havoc mulflt_~tmp~1#1;havoc mulflt_~__retres10~1#1; {30532#(= 4294967295 |ULTIMATE.start_mulflt_~b#1|)} is VALID [2022-02-21 03:10:54,673 INFO L290 TraceCheckUtils]: 83: Hoare triple {30532#(= 4294967295 |ULTIMATE.start_mulflt_~b#1|)} assume mulflt_~a#1 % 4294967296 < mulflt_~b#1 % 4294967296;mulflt_~tmp~1#1 := mulflt_~a#1;mulflt_~a#1 := mulflt_~b#1;mulflt_~b#1 := mulflt_~tmp~1#1; {30536#(= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} is VALID [2022-02-21 03:10:54,675 INFO L290 TraceCheckUtils]: 84: Hoare triple {30536#(= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} assume !(0 == mulflt_~b#1 % 4294967296); {30536#(= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} is VALID [2022-02-21 03:10:54,675 INFO L290 TraceCheckUtils]: 85: Hoare triple {30536#(= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} assume !(0 == mulflt_~a#1); {30536#(= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} is VALID [2022-02-21 03:10:54,677 INFO L290 TraceCheckUtils]: 86: Hoare triple {30536#(= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} assume !false; {30536#(= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} is VALID [2022-02-21 03:10:54,678 INFO L290 TraceCheckUtils]: 87: Hoare triple {30536#(= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} assume !false; {30536#(= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} is VALID [2022-02-21 03:10:54,679 INFO L290 TraceCheckUtils]: 88: Hoare triple {30536#(= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} assume mulflt_~a#1 >= 0;abs_171 := (if mulflt_~a#1 < 16777215 then mulflt_~a#1 else 16777215);assume mulflt_~a#1 >= 0;assume mulflt_~ma~1#1 < abs_171; {30536#(= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} is VALID [2022-02-21 03:10:54,680 INFO L290 TraceCheckUtils]: 89: Hoare triple {30536#(= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} assume (if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {30536#(= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} is VALID [2022-02-21 03:10:54,680 INFO L290 TraceCheckUtils]: 90: Hoare triple {30536#(= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} assume !((if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {30200#false} is VALID [2022-02-21 03:10:54,680 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-02-21 03:10:54,681 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:10:54,681 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673064398] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:54,681 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:10:54,681 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 17 [2022-02-21 03:10:54,681 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796267766] [2022-02-21 03:10:54,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:54,682 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 91 [2022-02-21 03:10:54,682 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:54,682 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:10:54,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:54,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-21 03:10:54,721 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:54,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 03:10:54,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2022-02-21 03:10:54,722 INFO L87 Difference]: Start difference. First operand 318 states and 393 transitions. Second operand has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:10:55,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:55,507 INFO L93 Difference]: Finished difference Result 381 states and 458 transitions. [2022-02-21 03:10:55,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 03:10:55,508 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 91 [2022-02-21 03:10:55,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:55,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:10:55,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 203 transitions. [2022-02-21 03:10:55,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:10:55,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 203 transitions. [2022-02-21 03:10:55,510 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 203 transitions. [2022-02-21 03:10:55,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:55,655 INFO L225 Difference]: With dead ends: 381 [2022-02-21 03:10:55,655 INFO L226 Difference]: Without dead ends: 379 [2022-02-21 03:10:55,655 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2022-02-21 03:10:55,656 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 164 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:55,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 790 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:10:55,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-02-21 03:10:55,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 318. [2022-02-21 03:10:55,912 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:55,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 379 states. Second operand has 318 states, 301 states have (on average 1.2757475083056478) internal successors, (384), 308 states have internal predecessors, (384), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-21 03:10:55,913 INFO L74 IsIncluded]: Start isIncluded. First operand 379 states. Second operand has 318 states, 301 states have (on average 1.2757475083056478) internal successors, (384), 308 states have internal predecessors, (384), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-21 03:10:55,913 INFO L87 Difference]: Start difference. First operand 379 states. Second operand has 318 states, 301 states have (on average 1.2757475083056478) internal successors, (384), 308 states have internal predecessors, (384), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-21 03:10:55,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:55,918 INFO L93 Difference]: Finished difference Result 379 states and 456 transitions. [2022-02-21 03:10:55,918 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 456 transitions. [2022-02-21 03:10:55,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:55,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:55,919 INFO L74 IsIncluded]: Start isIncluded. First operand has 318 states, 301 states have (on average 1.2757475083056478) internal successors, (384), 308 states have internal predecessors, (384), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Second operand 379 states. [2022-02-21 03:10:55,919 INFO L87 Difference]: Start difference. First operand has 318 states, 301 states have (on average 1.2757475083056478) internal successors, (384), 308 states have internal predecessors, (384), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Second operand 379 states. [2022-02-21 03:10:55,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:55,924 INFO L93 Difference]: Finished difference Result 379 states and 456 transitions. [2022-02-21 03:10:55,924 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 456 transitions. [2022-02-21 03:10:55,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:55,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:55,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:55,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:55,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 301 states have (on average 1.2757475083056478) internal successors, (384), 308 states have internal predecessors, (384), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-21 03:10:55,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 393 transitions. [2022-02-21 03:10:55,929 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 393 transitions. Word has length 91 [2022-02-21 03:10:55,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:55,929 INFO L470 AbstractCegarLoop]: Abstraction has 318 states and 393 transitions. [2022-02-21 03:10:55,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:10:55,929 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 393 transitions. [2022-02-21 03:10:55,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-21 03:10:55,930 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:55,930 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:55,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-02-21 03:10:56,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:56,131 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-02-21 03:10:56,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:56,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1592259433, now seen corresponding path program 1 times [2022-02-21 03:10:56,131 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:56,132 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378526022] [2022-02-21 03:10:56,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:56,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:56,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:56,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:56,204 INFO L290 TraceCheckUtils]: 0: Hoare triple {32187#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {32113#true} is VALID [2022-02-21 03:10:56,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {32113#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {32113#true} is VALID [2022-02-21 03:10:56,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {32113#true} #res := ~__retres4~0; {32113#true} is VALID [2022-02-21 03:10:56,204 INFO L290 TraceCheckUtils]: 3: Hoare triple {32113#true} assume true; {32113#true} is VALID [2022-02-21 03:10:56,205 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {32113#true} {32113#true} #370#return; {32113#true} is VALID [2022-02-21 03:10:56,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:56,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:56,220 INFO L290 TraceCheckUtils]: 0: Hoare triple {32187#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {32113#true} is VALID [2022-02-21 03:10:56,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {32113#true} assume !(0 == ~m % 4294967296); {32113#true} is VALID [2022-02-21 03:10:56,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {32113#true} assume ~m % 4294967296 < 16777216; {32113#true} is VALID [2022-02-21 03:10:56,221 INFO L290 TraceCheckUtils]: 3: Hoare triple {32113#true} assume !false; {32113#true} is VALID [2022-02-21 03:10:56,221 INFO L290 TraceCheckUtils]: 4: Hoare triple {32113#true} assume !(~e <= -128); {32113#true} is VALID [2022-02-21 03:10:56,221 INFO L290 TraceCheckUtils]: 5: Hoare triple {32113#true} assume ~e - 1 <= 2147483647; {32113#true} is VALID [2022-02-21 03:10:56,221 INFO L290 TraceCheckUtils]: 6: Hoare triple {32113#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {32113#true} is VALID [2022-02-21 03:10:56,233 INFO L290 TraceCheckUtils]: 7: Hoare triple {32113#true} assume ~m % 4294967296 < 16777216; {32113#true} is VALID [2022-02-21 03:10:56,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {32113#true} assume !false; {32113#true} is VALID [2022-02-21 03:10:56,234 INFO L290 TraceCheckUtils]: 9: Hoare triple {32113#true} assume !(~e <= -128); {32113#true} is VALID [2022-02-21 03:10:56,234 INFO L290 TraceCheckUtils]: 10: Hoare triple {32113#true} assume ~e - 1 <= 2147483647; {32113#true} is VALID [2022-02-21 03:10:56,234 INFO L290 TraceCheckUtils]: 11: Hoare triple {32113#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {32113#true} is VALID [2022-02-21 03:10:56,234 INFO L290 TraceCheckUtils]: 12: Hoare triple {32113#true} assume ~m % 4294967296 < 16777216; {32113#true} is VALID [2022-02-21 03:10:56,234 INFO L290 TraceCheckUtils]: 13: Hoare triple {32113#true} assume !false; {32113#true} is VALID [2022-02-21 03:10:56,234 INFO L290 TraceCheckUtils]: 14: Hoare triple {32113#true} assume !(~e <= -128); {32113#true} is VALID [2022-02-21 03:10:56,235 INFO L290 TraceCheckUtils]: 15: Hoare triple {32113#true} assume ~e - 1 <= 2147483647; {32113#true} is VALID [2022-02-21 03:10:56,235 INFO L290 TraceCheckUtils]: 16: Hoare triple {32113#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {32113#true} is VALID [2022-02-21 03:10:56,235 INFO L290 TraceCheckUtils]: 17: Hoare triple {32113#true} assume ~m % 4294967296 < 16777216; {32113#true} is VALID [2022-02-21 03:10:56,235 INFO L290 TraceCheckUtils]: 18: Hoare triple {32113#true} assume !false; {32113#true} is VALID [2022-02-21 03:10:56,235 INFO L290 TraceCheckUtils]: 19: Hoare triple {32113#true} assume !(~e <= -128); {32113#true} is VALID [2022-02-21 03:10:56,235 INFO L290 TraceCheckUtils]: 20: Hoare triple {32113#true} assume ~e - 1 <= 2147483647; {32113#true} is VALID [2022-02-21 03:10:56,235 INFO L290 TraceCheckUtils]: 21: Hoare triple {32113#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {32113#true} is VALID [2022-02-21 03:10:56,236 INFO L290 TraceCheckUtils]: 22: Hoare triple {32113#true} assume ~m % 4294967296 < 16777216; {32113#true} is VALID [2022-02-21 03:10:56,236 INFO L290 TraceCheckUtils]: 23: Hoare triple {32113#true} assume !false; {32113#true} is VALID [2022-02-21 03:10:56,236 INFO L290 TraceCheckUtils]: 24: Hoare triple {32113#true} assume !(~e <= -128); {32113#true} is VALID [2022-02-21 03:10:56,236 INFO L290 TraceCheckUtils]: 25: Hoare triple {32113#true} assume ~e - 1 <= 2147483647; {32113#true} is VALID [2022-02-21 03:10:56,236 INFO L290 TraceCheckUtils]: 26: Hoare triple {32113#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {32113#true} is VALID [2022-02-21 03:10:56,236 INFO L290 TraceCheckUtils]: 27: Hoare triple {32113#true} assume ~m % 4294967296 < 16777216; {32113#true} is VALID [2022-02-21 03:10:56,237 INFO L290 TraceCheckUtils]: 28: Hoare triple {32113#true} assume !false; {32113#true} is VALID [2022-02-21 03:10:56,237 INFO L290 TraceCheckUtils]: 29: Hoare triple {32113#true} assume !(~e <= -128); {32113#true} is VALID [2022-02-21 03:10:56,237 INFO L290 TraceCheckUtils]: 30: Hoare triple {32113#true} assume ~e - 1 <= 2147483647; {32113#true} is VALID [2022-02-21 03:10:56,237 INFO L290 TraceCheckUtils]: 31: Hoare triple {32113#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {32113#true} is VALID [2022-02-21 03:10:56,237 INFO L290 TraceCheckUtils]: 32: Hoare triple {32113#true} assume !(~m % 4294967296 < 16777216); {32113#true} is VALID [2022-02-21 03:10:56,237 INFO L290 TraceCheckUtils]: 33: Hoare triple {32113#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {32113#true} is VALID [2022-02-21 03:10:56,237 INFO L290 TraceCheckUtils]: 34: Hoare triple {32113#true} assume 128 + ~e <= 2147483647; {32113#true} is VALID [2022-02-21 03:10:56,238 INFO L290 TraceCheckUtils]: 35: Hoare triple {32113#true} assume 128 + ~e >= -2147483648; {32113#true} is VALID [2022-02-21 03:10:56,238 INFO L290 TraceCheckUtils]: 36: Hoare triple {32113#true} assume 128 + ~e <= 2147483647; {32113#true} is VALID [2022-02-21 03:10:56,238 INFO L290 TraceCheckUtils]: 37: Hoare triple {32113#true} assume 128 + ~e >= -2147483648; {32113#true} is VALID [2022-02-21 03:10:56,238 INFO L290 TraceCheckUtils]: 38: Hoare triple {32113#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {32113#true} is VALID [2022-02-21 03:10:56,238 INFO L290 TraceCheckUtils]: 39: Hoare triple {32113#true} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {32113#true} is VALID [2022-02-21 03:10:56,238 INFO L290 TraceCheckUtils]: 40: Hoare triple {32113#true} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {32113#true} is VALID [2022-02-21 03:10:56,238 INFO L290 TraceCheckUtils]: 41: Hoare triple {32113#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; {32113#true} is VALID [2022-02-21 03:10:56,239 INFO L290 TraceCheckUtils]: 42: Hoare triple {32113#true} ~__retres4~0 := ~res~0; {32113#true} is VALID [2022-02-21 03:10:56,239 INFO L290 TraceCheckUtils]: 43: Hoare triple {32113#true} #res := ~__retres4~0; {32113#true} is VALID [2022-02-21 03:10:56,239 INFO L290 TraceCheckUtils]: 44: Hoare triple {32113#true} assume true; {32113#true} is VALID [2022-02-21 03:10:56,239 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {32113#true} {32113#true} #372#return; {32113#true} is VALID [2022-02-21 03:10:56,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-02-21 03:10:56,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:56,259 INFO L290 TraceCheckUtils]: 0: Hoare triple {32187#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {32113#true} is VALID [2022-02-21 03:10:56,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {32113#true} assume !(0 == ~m % 4294967296); {32113#true} is VALID [2022-02-21 03:10:56,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {32113#true} assume !(~m % 4294967296 < 16777216); {32113#true} is VALID [2022-02-21 03:10:56,259 INFO L290 TraceCheckUtils]: 3: Hoare triple {32113#true} assume !false; {32113#true} is VALID [2022-02-21 03:10:56,260 INFO L290 TraceCheckUtils]: 4: Hoare triple {32113#true} assume ~m % 4294967296 >= 33554432; {32113#true} is VALID [2022-02-21 03:10:56,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {32113#true} assume ~e >= 127;~__retres4~0 := 4294967295; {32188#(<= 4294967295 base2flt_~__retres4~0)} is VALID [2022-02-21 03:10:56,260 INFO L290 TraceCheckUtils]: 6: Hoare triple {32188#(<= 4294967295 base2flt_~__retres4~0)} #res := ~__retres4~0; {32189#(<= 4294967295 |base2flt_#res|)} is VALID [2022-02-21 03:10:56,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {32189#(<= 4294967295 |base2flt_#res|)} assume true; {32189#(<= 4294967295 |base2flt_#res|)} is VALID [2022-02-21 03:10:56,261 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {32189#(<= 4294967295 |base2flt_#res|)} {32113#true} #374#return; {32175#(<= 4294967295 |ULTIMATE.start_main_#t~ret24#1|)} is VALID [2022-02-21 03:10:56,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-02-21 03:10:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:56,268 INFO L290 TraceCheckUtils]: 0: Hoare triple {32187#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {32113#true} is VALID [2022-02-21 03:10:56,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {32113#true} assume !(0 == ~m % 4294967296); {32113#true} is VALID [2022-02-21 03:10:56,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {32113#true} assume !(~m % 4294967296 < 16777216); {32113#true} is VALID [2022-02-21 03:10:56,269 INFO L290 TraceCheckUtils]: 3: Hoare triple {32113#true} assume !false; {32113#true} is VALID [2022-02-21 03:10:56,269 INFO L290 TraceCheckUtils]: 4: Hoare triple {32113#true} assume ~m % 4294967296 >= 33554432; {32113#true} is VALID [2022-02-21 03:10:56,269 INFO L290 TraceCheckUtils]: 5: Hoare triple {32113#true} assume ~e >= 127;~__retres4~0 := 4294967295; {32113#true} is VALID [2022-02-21 03:10:56,270 INFO L290 TraceCheckUtils]: 6: Hoare triple {32113#true} #res := ~__retres4~0; {32113#true} is VALID [2022-02-21 03:10:56,270 INFO L290 TraceCheckUtils]: 7: Hoare triple {32113#true} assume true; {32113#true} is VALID [2022-02-21 03:10:56,270 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {32113#true} {32176#(<= 4294967295 |ULTIMATE.start_main_~a~0#1|)} #376#return; {32176#(<= 4294967295 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:56,271 INFO L290 TraceCheckUtils]: 0: Hoare triple {32113#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(22, 2);call #Ultimate.allocInit(12, 3); {32113#true} is VALID [2022-02-21 03:10:56,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {32113#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_~sb~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_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {32113#true} is VALID [2022-02-21 03:10:56,271 INFO L272 TraceCheckUtils]: 2: Hoare triple {32113#true} call main_#t~ret22#1 := base2flt(0, 0); {32187#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:56,271 INFO L290 TraceCheckUtils]: 3: Hoare triple {32187#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {32113#true} is VALID [2022-02-21 03:10:56,272 INFO L290 TraceCheckUtils]: 4: Hoare triple {32113#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {32113#true} is VALID [2022-02-21 03:10:56,272 INFO L290 TraceCheckUtils]: 5: Hoare triple {32113#true} #res := ~__retres4~0; {32113#true} is VALID [2022-02-21 03:10:56,272 INFO L290 TraceCheckUtils]: 6: Hoare triple {32113#true} assume true; {32113#true} is VALID [2022-02-21 03:10:56,272 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {32113#true} {32113#true} #370#return; {32113#true} is VALID [2022-02-21 03:10:56,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {32113#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {32113#true} is VALID [2022-02-21 03:10:56,273 INFO L272 TraceCheckUtils]: 9: Hoare triple {32113#true} call main_#t~ret23#1 := base2flt(1, 0); {32187#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:56,273 INFO L290 TraceCheckUtils]: 10: Hoare triple {32187#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {32113#true} is VALID [2022-02-21 03:10:56,273 INFO L290 TraceCheckUtils]: 11: Hoare triple {32113#true} assume !(0 == ~m % 4294967296); {32113#true} is VALID [2022-02-21 03:10:56,273 INFO L290 TraceCheckUtils]: 12: Hoare triple {32113#true} assume ~m % 4294967296 < 16777216; {32113#true} is VALID [2022-02-21 03:10:56,273 INFO L290 TraceCheckUtils]: 13: Hoare triple {32113#true} assume !false; {32113#true} is VALID [2022-02-21 03:10:56,274 INFO L290 TraceCheckUtils]: 14: Hoare triple {32113#true} assume !(~e <= -128); {32113#true} is VALID [2022-02-21 03:10:56,274 INFO L290 TraceCheckUtils]: 15: Hoare triple {32113#true} assume ~e - 1 <= 2147483647; {32113#true} is VALID [2022-02-21 03:10:56,274 INFO L290 TraceCheckUtils]: 16: Hoare triple {32113#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {32113#true} is VALID [2022-02-21 03:10:56,274 INFO L290 TraceCheckUtils]: 17: Hoare triple {32113#true} assume ~m % 4294967296 < 16777216; {32113#true} is VALID [2022-02-21 03:10:56,274 INFO L290 TraceCheckUtils]: 18: Hoare triple {32113#true} assume !false; {32113#true} is VALID [2022-02-21 03:10:56,274 INFO L290 TraceCheckUtils]: 19: Hoare triple {32113#true} assume !(~e <= -128); {32113#true} is VALID [2022-02-21 03:10:56,274 INFO L290 TraceCheckUtils]: 20: Hoare triple {32113#true} assume ~e - 1 <= 2147483647; {32113#true} is VALID [2022-02-21 03:10:56,275 INFO L290 TraceCheckUtils]: 21: Hoare triple {32113#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {32113#true} is VALID [2022-02-21 03:10:56,275 INFO L290 TraceCheckUtils]: 22: Hoare triple {32113#true} assume ~m % 4294967296 < 16777216; {32113#true} is VALID [2022-02-21 03:10:56,275 INFO L290 TraceCheckUtils]: 23: Hoare triple {32113#true} assume !false; {32113#true} is VALID [2022-02-21 03:10:56,275 INFO L290 TraceCheckUtils]: 24: Hoare triple {32113#true} assume !(~e <= -128); {32113#true} is VALID [2022-02-21 03:10:56,275 INFO L290 TraceCheckUtils]: 25: Hoare triple {32113#true} assume ~e - 1 <= 2147483647; {32113#true} is VALID [2022-02-21 03:10:56,275 INFO L290 TraceCheckUtils]: 26: Hoare triple {32113#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {32113#true} is VALID [2022-02-21 03:10:56,275 INFO L290 TraceCheckUtils]: 27: Hoare triple {32113#true} assume ~m % 4294967296 < 16777216; {32113#true} is VALID [2022-02-21 03:10:56,276 INFO L290 TraceCheckUtils]: 28: Hoare triple {32113#true} assume !false; {32113#true} is VALID [2022-02-21 03:10:56,276 INFO L290 TraceCheckUtils]: 29: Hoare triple {32113#true} assume !(~e <= -128); {32113#true} is VALID [2022-02-21 03:10:56,276 INFO L290 TraceCheckUtils]: 30: Hoare triple {32113#true} assume ~e - 1 <= 2147483647; {32113#true} is VALID [2022-02-21 03:10:56,276 INFO L290 TraceCheckUtils]: 31: Hoare triple {32113#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {32113#true} is VALID [2022-02-21 03:10:56,276 INFO L290 TraceCheckUtils]: 32: Hoare triple {32113#true} assume ~m % 4294967296 < 16777216; {32113#true} is VALID [2022-02-21 03:10:56,276 INFO L290 TraceCheckUtils]: 33: Hoare triple {32113#true} assume !false; {32113#true} is VALID [2022-02-21 03:10:56,276 INFO L290 TraceCheckUtils]: 34: Hoare triple {32113#true} assume !(~e <= -128); {32113#true} is VALID [2022-02-21 03:10:56,277 INFO L290 TraceCheckUtils]: 35: Hoare triple {32113#true} assume ~e - 1 <= 2147483647; {32113#true} is VALID [2022-02-21 03:10:56,277 INFO L290 TraceCheckUtils]: 36: Hoare triple {32113#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {32113#true} is VALID [2022-02-21 03:10:56,277 INFO L290 TraceCheckUtils]: 37: Hoare triple {32113#true} assume ~m % 4294967296 < 16777216; {32113#true} is VALID [2022-02-21 03:10:56,277 INFO L290 TraceCheckUtils]: 38: Hoare triple {32113#true} assume !false; {32113#true} is VALID [2022-02-21 03:10:56,277 INFO L290 TraceCheckUtils]: 39: Hoare triple {32113#true} assume !(~e <= -128); {32113#true} is VALID [2022-02-21 03:10:56,277 INFO L290 TraceCheckUtils]: 40: Hoare triple {32113#true} assume ~e - 1 <= 2147483647; {32113#true} is VALID [2022-02-21 03:10:56,278 INFO L290 TraceCheckUtils]: 41: Hoare triple {32113#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {32113#true} is VALID [2022-02-21 03:10:56,278 INFO L290 TraceCheckUtils]: 42: Hoare triple {32113#true} assume !(~m % 4294967296 < 16777216); {32113#true} is VALID [2022-02-21 03:10:56,278 INFO L290 TraceCheckUtils]: 43: Hoare triple {32113#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {32113#true} is VALID [2022-02-21 03:10:56,278 INFO L290 TraceCheckUtils]: 44: Hoare triple {32113#true} assume 128 + ~e <= 2147483647; {32113#true} is VALID [2022-02-21 03:10:56,278 INFO L290 TraceCheckUtils]: 45: Hoare triple {32113#true} assume 128 + ~e >= -2147483648; {32113#true} is VALID [2022-02-21 03:10:56,278 INFO L290 TraceCheckUtils]: 46: Hoare triple {32113#true} assume 128 + ~e <= 2147483647; {32113#true} is VALID [2022-02-21 03:10:56,278 INFO L290 TraceCheckUtils]: 47: Hoare triple {32113#true} assume 128 + ~e >= -2147483648; {32113#true} is VALID [2022-02-21 03:10:56,278 INFO L290 TraceCheckUtils]: 48: Hoare triple {32113#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {32113#true} is VALID [2022-02-21 03:10:56,279 INFO L290 TraceCheckUtils]: 49: Hoare triple {32113#true} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {32113#true} is VALID [2022-02-21 03:10:56,279 INFO L290 TraceCheckUtils]: 50: Hoare triple {32113#true} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {32113#true} is VALID [2022-02-21 03:10:56,279 INFO L290 TraceCheckUtils]: 51: Hoare triple {32113#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; {32113#true} is VALID [2022-02-21 03:10:56,279 INFO L290 TraceCheckUtils]: 52: Hoare triple {32113#true} ~__retres4~0 := ~res~0; {32113#true} is VALID [2022-02-21 03:10:56,279 INFO L290 TraceCheckUtils]: 53: Hoare triple {32113#true} #res := ~__retres4~0; {32113#true} is VALID [2022-02-21 03:10:56,279 INFO L290 TraceCheckUtils]: 54: Hoare triple {32113#true} assume true; {32113#true} is VALID [2022-02-21 03:10:56,280 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {32113#true} {32113#true} #372#return; {32113#true} is VALID [2022-02-21 03:10:56,280 INFO L290 TraceCheckUtils]: 56: Hoare triple {32113#true} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {32113#true} is VALID [2022-02-21 03:10:56,280 INFO L272 TraceCheckUtils]: 57: Hoare triple {32113#true} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {32187#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:56,280 INFO L290 TraceCheckUtils]: 58: Hoare triple {32187#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {32113#true} is VALID [2022-02-21 03:10:56,281 INFO L290 TraceCheckUtils]: 59: Hoare triple {32113#true} assume !(0 == ~m % 4294967296); {32113#true} is VALID [2022-02-21 03:10:56,281 INFO L290 TraceCheckUtils]: 60: Hoare triple {32113#true} assume !(~m % 4294967296 < 16777216); {32113#true} is VALID [2022-02-21 03:10:56,281 INFO L290 TraceCheckUtils]: 61: Hoare triple {32113#true} assume !false; {32113#true} is VALID [2022-02-21 03:10:56,281 INFO L290 TraceCheckUtils]: 62: Hoare triple {32113#true} assume ~m % 4294967296 >= 33554432; {32113#true} is VALID [2022-02-21 03:10:56,281 INFO L290 TraceCheckUtils]: 63: Hoare triple {32113#true} assume ~e >= 127;~__retres4~0 := 4294967295; {32188#(<= 4294967295 base2flt_~__retres4~0)} is VALID [2022-02-21 03:10:56,282 INFO L290 TraceCheckUtils]: 64: Hoare triple {32188#(<= 4294967295 base2flt_~__retres4~0)} #res := ~__retres4~0; {32189#(<= 4294967295 |base2flt_#res|)} is VALID [2022-02-21 03:10:56,282 INFO L290 TraceCheckUtils]: 65: Hoare triple {32189#(<= 4294967295 |base2flt_#res|)} assume true; {32189#(<= 4294967295 |base2flt_#res|)} is VALID [2022-02-21 03:10:56,283 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {32189#(<= 4294967295 |base2flt_#res|)} {32113#true} #374#return; {32175#(<= 4294967295 |ULTIMATE.start_main_#t~ret24#1|)} is VALID [2022-02-21 03:10:56,283 INFO L290 TraceCheckUtils]: 67: Hoare triple {32175#(<= 4294967295 |ULTIMATE.start_main_#t~ret24#1|)} main_~a~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {32176#(<= 4294967295 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:56,284 INFO L272 TraceCheckUtils]: 68: Hoare triple {32176#(<= 4294967295 |ULTIMATE.start_main_~a~0#1|)} call main_#t~ret25#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {32187#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:56,284 INFO L290 TraceCheckUtils]: 69: Hoare triple {32187#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {32113#true} is VALID [2022-02-21 03:10:56,284 INFO L290 TraceCheckUtils]: 70: Hoare triple {32113#true} assume !(0 == ~m % 4294967296); {32113#true} is VALID [2022-02-21 03:10:56,284 INFO L290 TraceCheckUtils]: 71: Hoare triple {32113#true} assume !(~m % 4294967296 < 16777216); {32113#true} is VALID [2022-02-21 03:10:56,285 INFO L290 TraceCheckUtils]: 72: Hoare triple {32113#true} assume !false; {32113#true} is VALID [2022-02-21 03:10:56,285 INFO L290 TraceCheckUtils]: 73: Hoare triple {32113#true} assume ~m % 4294967296 >= 33554432; {32113#true} is VALID [2022-02-21 03:10:56,285 INFO L290 TraceCheckUtils]: 74: Hoare triple {32113#true} assume ~e >= 127;~__retres4~0 := 4294967295; {32113#true} is VALID [2022-02-21 03:10:56,285 INFO L290 TraceCheckUtils]: 75: Hoare triple {32113#true} #res := ~__retres4~0; {32113#true} is VALID [2022-02-21 03:10:56,285 INFO L290 TraceCheckUtils]: 76: Hoare triple {32113#true} assume true; {32113#true} is VALID [2022-02-21 03:10:56,289 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {32113#true} {32176#(<= 4294967295 |ULTIMATE.start_main_~a~0#1|)} #376#return; {32176#(<= 4294967295 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:56,290 INFO L290 TraceCheckUtils]: 78: Hoare triple {32176#(<= 4294967295 |ULTIMATE.start_main_~a~0#1|)} main_~b~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {32176#(<= 4294967295 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:56,290 INFO L290 TraceCheckUtils]: 79: Hoare triple {32176#(<= 4294967295 |ULTIMATE.start_main_~a~0#1|)} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {32176#(<= 4294967295 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:56,290 INFO L290 TraceCheckUtils]: 80: Hoare triple {32176#(<= 4294967295 |ULTIMATE.start_main_~a~0#1|)} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {32176#(<= 4294967295 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:56,291 INFO L290 TraceCheckUtils]: 81: Hoare triple {32176#(<= 4294967295 |ULTIMATE.start_main_~a~0#1|)} main_~sb~0#1 := main_~tmp~2#1; {32176#(<= 4294967295 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:56,291 INFO L290 TraceCheckUtils]: 82: Hoare triple {32176#(<= 4294967295 |ULTIMATE.start_main_~a~0#1|)} assume { :begin_inline_mulflt } true;mulflt_#in~a#1, mulflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mulflt_#res#1;havoc mulflt_#t~nondet12#1, mulflt_#t~nondet13#1, mulflt_#t~nondet14#1, mulflt_#t~nondet15#1, mulflt_#t~nondet16#1, mulflt_#t~nondet17#1, mulflt_~a#1, mulflt_~b#1, mulflt_~res~2#1, mulflt_~ma~1#1, mulflt_~mb~1#1, mulflt_~accu~0#1, mulflt_~ea~1#1, mulflt_~eb~1#1, mulflt_~tmp~1#1, mulflt_~__retres10~1#1;mulflt_~a#1 := mulflt_#in~a#1;mulflt_~b#1 := mulflt_#in~b#1;havoc mulflt_~res~2#1;havoc mulflt_~ma~1#1;havoc mulflt_~mb~1#1;havoc mulflt_~accu~0#1;havoc mulflt_~ea~1#1;havoc mulflt_~eb~1#1;havoc mulflt_~tmp~1#1;havoc mulflt_~__retres10~1#1; {32186#(<= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} is VALID [2022-02-21 03:10:56,292 INFO L290 TraceCheckUtils]: 83: Hoare triple {32186#(<= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} assume !(mulflt_~a#1 % 4294967296 < mulflt_~b#1 % 4294967296); {32186#(<= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} is VALID [2022-02-21 03:10:56,292 INFO L290 TraceCheckUtils]: 84: Hoare triple {32186#(<= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} assume !(0 == mulflt_~b#1 % 4294967296); {32186#(<= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} is VALID [2022-02-21 03:10:56,292 INFO L290 TraceCheckUtils]: 85: Hoare triple {32186#(<= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} assume !(0 == mulflt_~a#1); {32186#(<= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} is VALID [2022-02-21 03:10:56,293 INFO L290 TraceCheckUtils]: 86: Hoare triple {32186#(<= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} assume !false; {32186#(<= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} is VALID [2022-02-21 03:10:56,293 INFO L290 TraceCheckUtils]: 87: Hoare triple {32186#(<= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} assume !false; {32186#(<= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} is VALID [2022-02-21 03:10:56,293 INFO L290 TraceCheckUtils]: 88: Hoare triple {32186#(<= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} assume !(mulflt_~a#1 >= 0);mulflt_~ma~1#1 := mulflt_#t~nondet12#1;havoc mulflt_#t~nondet12#1; {32114#false} is VALID [2022-02-21 03:10:56,293 INFO L290 TraceCheckUtils]: 89: Hoare triple {32114#false} assume (if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {32114#false} is VALID [2022-02-21 03:10:56,294 INFO L290 TraceCheckUtils]: 90: Hoare triple {32114#false} assume !((if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {32114#false} is VALID [2022-02-21 03:10:56,294 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-02-21 03:10:56,294 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:56,294 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378526022] [2022-02-21 03:10:56,294 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378526022] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:56,295 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847972704] [2022-02-21 03:10:56,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:56,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:56,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:56,296 INFO L229 MonitoredProcess]: Starting monitored process 14 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:56,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-02-21 03:10:56,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:56,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:10:56,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:56,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:56,694 INFO L290 TraceCheckUtils]: 0: Hoare triple {32113#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(22, 2);call #Ultimate.allocInit(12, 3); {32113#true} is VALID [2022-02-21 03:10:56,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {32113#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_~sb~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_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {32113#true} is VALID [2022-02-21 03:10:56,695 INFO L272 TraceCheckUtils]: 2: Hoare triple {32113#true} call main_#t~ret22#1 := base2flt(0, 0); {32113#true} is VALID [2022-02-21 03:10:56,695 INFO L290 TraceCheckUtils]: 3: Hoare triple {32113#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {32113#true} is VALID [2022-02-21 03:10:56,695 INFO L290 TraceCheckUtils]: 4: Hoare triple {32113#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {32113#true} is VALID [2022-02-21 03:10:56,695 INFO L290 TraceCheckUtils]: 5: Hoare triple {32113#true} #res := ~__retres4~0; {32113#true} is VALID [2022-02-21 03:10:56,695 INFO L290 TraceCheckUtils]: 6: Hoare triple {32113#true} assume true; {32113#true} is VALID [2022-02-21 03:10:56,696 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {32113#true} {32113#true} #370#return; {32113#true} is VALID [2022-02-21 03:10:56,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {32113#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {32113#true} is VALID [2022-02-21 03:10:56,696 INFO L272 TraceCheckUtils]: 9: Hoare triple {32113#true} call main_#t~ret23#1 := base2flt(1, 0); {32113#true} is VALID [2022-02-21 03:10:56,696 INFO L290 TraceCheckUtils]: 10: Hoare triple {32113#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {32113#true} is VALID [2022-02-21 03:10:56,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {32113#true} assume !(0 == ~m % 4294967296); {32113#true} is VALID [2022-02-21 03:10:56,696 INFO L290 TraceCheckUtils]: 12: Hoare triple {32113#true} assume ~m % 4294967296 < 16777216; {32113#true} is VALID [2022-02-21 03:10:56,696 INFO L290 TraceCheckUtils]: 13: Hoare triple {32113#true} assume !false; {32113#true} is VALID [2022-02-21 03:10:56,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {32113#true} assume !(~e <= -128); {32113#true} is VALID [2022-02-21 03:10:56,697 INFO L290 TraceCheckUtils]: 15: Hoare triple {32113#true} assume ~e - 1 <= 2147483647; {32113#true} is VALID [2022-02-21 03:10:56,697 INFO L290 TraceCheckUtils]: 16: Hoare triple {32113#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {32113#true} is VALID [2022-02-21 03:10:56,697 INFO L290 TraceCheckUtils]: 17: Hoare triple {32113#true} assume ~m % 4294967296 < 16777216; {32113#true} is VALID [2022-02-21 03:10:56,697 INFO L290 TraceCheckUtils]: 18: Hoare triple {32113#true} assume !false; {32113#true} is VALID [2022-02-21 03:10:56,697 INFO L290 TraceCheckUtils]: 19: Hoare triple {32113#true} assume !(~e <= -128); {32113#true} is VALID [2022-02-21 03:10:56,698 INFO L290 TraceCheckUtils]: 20: Hoare triple {32113#true} assume ~e - 1 <= 2147483647; {32113#true} is VALID [2022-02-21 03:10:56,698 INFO L290 TraceCheckUtils]: 21: Hoare triple {32113#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {32113#true} is VALID [2022-02-21 03:10:56,698 INFO L290 TraceCheckUtils]: 22: Hoare triple {32113#true} assume ~m % 4294967296 < 16777216; {32113#true} is VALID [2022-02-21 03:10:56,698 INFO L290 TraceCheckUtils]: 23: Hoare triple {32113#true} assume !false; {32113#true} is VALID [2022-02-21 03:10:56,698 INFO L290 TraceCheckUtils]: 24: Hoare triple {32113#true} assume !(~e <= -128); {32113#true} is VALID [2022-02-21 03:10:56,698 INFO L290 TraceCheckUtils]: 25: Hoare triple {32113#true} assume ~e - 1 <= 2147483647; {32113#true} is VALID [2022-02-21 03:10:56,698 INFO L290 TraceCheckUtils]: 26: Hoare triple {32113#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {32113#true} is VALID [2022-02-21 03:10:56,699 INFO L290 TraceCheckUtils]: 27: Hoare triple {32113#true} assume ~m % 4294967296 < 16777216; {32113#true} is VALID [2022-02-21 03:10:56,699 INFO L290 TraceCheckUtils]: 28: Hoare triple {32113#true} assume !false; {32113#true} is VALID [2022-02-21 03:10:56,699 INFO L290 TraceCheckUtils]: 29: Hoare triple {32113#true} assume !(~e <= -128); {32113#true} is VALID [2022-02-21 03:10:56,699 INFO L290 TraceCheckUtils]: 30: Hoare triple {32113#true} assume ~e - 1 <= 2147483647; {32113#true} is VALID [2022-02-21 03:10:56,699 INFO L290 TraceCheckUtils]: 31: Hoare triple {32113#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {32113#true} is VALID [2022-02-21 03:10:56,699 INFO L290 TraceCheckUtils]: 32: Hoare triple {32113#true} assume ~m % 4294967296 < 16777216; {32113#true} is VALID [2022-02-21 03:10:56,699 INFO L290 TraceCheckUtils]: 33: Hoare triple {32113#true} assume !false; {32113#true} is VALID [2022-02-21 03:10:56,700 INFO L290 TraceCheckUtils]: 34: Hoare triple {32113#true} assume !(~e <= -128); {32113#true} is VALID [2022-02-21 03:10:56,700 INFO L290 TraceCheckUtils]: 35: Hoare triple {32113#true} assume ~e - 1 <= 2147483647; {32113#true} is VALID [2022-02-21 03:10:56,700 INFO L290 TraceCheckUtils]: 36: Hoare triple {32113#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {32113#true} is VALID [2022-02-21 03:10:56,700 INFO L290 TraceCheckUtils]: 37: Hoare triple {32113#true} assume ~m % 4294967296 < 16777216; {32113#true} is VALID [2022-02-21 03:10:56,700 INFO L290 TraceCheckUtils]: 38: Hoare triple {32113#true} assume !false; {32113#true} is VALID [2022-02-21 03:10:56,700 INFO L290 TraceCheckUtils]: 39: Hoare triple {32113#true} assume !(~e <= -128); {32113#true} is VALID [2022-02-21 03:10:56,701 INFO L290 TraceCheckUtils]: 40: Hoare triple {32113#true} assume ~e - 1 <= 2147483647; {32113#true} is VALID [2022-02-21 03:10:56,701 INFO L290 TraceCheckUtils]: 41: Hoare triple {32113#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {32113#true} is VALID [2022-02-21 03:10:56,701 INFO L290 TraceCheckUtils]: 42: Hoare triple {32113#true} assume !(~m % 4294967296 < 16777216); {32113#true} is VALID [2022-02-21 03:10:56,701 INFO L290 TraceCheckUtils]: 43: Hoare triple {32113#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {32113#true} is VALID [2022-02-21 03:10:56,701 INFO L290 TraceCheckUtils]: 44: Hoare triple {32113#true} assume 128 + ~e <= 2147483647; {32113#true} is VALID [2022-02-21 03:10:56,701 INFO L290 TraceCheckUtils]: 45: Hoare triple {32113#true} assume 128 + ~e >= -2147483648; {32113#true} is VALID [2022-02-21 03:10:56,701 INFO L290 TraceCheckUtils]: 46: Hoare triple {32113#true} assume 128 + ~e <= 2147483647; {32113#true} is VALID [2022-02-21 03:10:56,702 INFO L290 TraceCheckUtils]: 47: Hoare triple {32113#true} assume 128 + ~e >= -2147483648; {32113#true} is VALID [2022-02-21 03:10:56,702 INFO L290 TraceCheckUtils]: 48: Hoare triple {32113#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {32113#true} is VALID [2022-02-21 03:10:56,702 INFO L290 TraceCheckUtils]: 49: Hoare triple {32113#true} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {32113#true} is VALID [2022-02-21 03:10:56,702 INFO L290 TraceCheckUtils]: 50: Hoare triple {32113#true} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {32113#true} is VALID [2022-02-21 03:10:56,702 INFO L290 TraceCheckUtils]: 51: Hoare triple {32113#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; {32113#true} is VALID [2022-02-21 03:10:56,702 INFO L290 TraceCheckUtils]: 52: Hoare triple {32113#true} ~__retres4~0 := ~res~0; {32113#true} is VALID [2022-02-21 03:10:56,702 INFO L290 TraceCheckUtils]: 53: Hoare triple {32113#true} #res := ~__retres4~0; {32113#true} is VALID [2022-02-21 03:10:56,703 INFO L290 TraceCheckUtils]: 54: Hoare triple {32113#true} assume true; {32113#true} is VALID [2022-02-21 03:10:56,703 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {32113#true} {32113#true} #372#return; {32113#true} is VALID [2022-02-21 03:10:56,703 INFO L290 TraceCheckUtils]: 56: Hoare triple {32113#true} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {32113#true} is VALID [2022-02-21 03:10:56,703 INFO L272 TraceCheckUtils]: 57: Hoare triple {32113#true} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {32113#true} is VALID [2022-02-21 03:10:56,703 INFO L290 TraceCheckUtils]: 58: Hoare triple {32113#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {32113#true} is VALID [2022-02-21 03:10:56,703 INFO L290 TraceCheckUtils]: 59: Hoare triple {32113#true} assume !(0 == ~m % 4294967296); {32113#true} is VALID [2022-02-21 03:10:56,703 INFO L290 TraceCheckUtils]: 60: Hoare triple {32113#true} assume !(~m % 4294967296 < 16777216); {32113#true} is VALID [2022-02-21 03:10:56,704 INFO L290 TraceCheckUtils]: 61: Hoare triple {32113#true} assume !false; {32113#true} is VALID [2022-02-21 03:10:56,704 INFO L290 TraceCheckUtils]: 62: Hoare triple {32113#true} assume ~m % 4294967296 >= 33554432; {32113#true} is VALID [2022-02-21 03:10:56,705 INFO L290 TraceCheckUtils]: 63: Hoare triple {32113#true} assume ~e >= 127;~__retres4~0 := 4294967295; {32188#(<= 4294967295 base2flt_~__retres4~0)} is VALID [2022-02-21 03:10:56,706 INFO L290 TraceCheckUtils]: 64: Hoare triple {32188#(<= 4294967295 base2flt_~__retres4~0)} #res := ~__retres4~0; {32189#(<= 4294967295 |base2flt_#res|)} is VALID [2022-02-21 03:10:56,706 INFO L290 TraceCheckUtils]: 65: Hoare triple {32189#(<= 4294967295 |base2flt_#res|)} assume true; {32189#(<= 4294967295 |base2flt_#res|)} is VALID [2022-02-21 03:10:56,709 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {32189#(<= 4294967295 |base2flt_#res|)} {32113#true} #374#return; {32175#(<= 4294967295 |ULTIMATE.start_main_#t~ret24#1|)} is VALID [2022-02-21 03:10:56,710 INFO L290 TraceCheckUtils]: 67: Hoare triple {32175#(<= 4294967295 |ULTIMATE.start_main_#t~ret24#1|)} main_~a~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {32176#(<= 4294967295 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:56,710 INFO L272 TraceCheckUtils]: 68: Hoare triple {32176#(<= 4294967295 |ULTIMATE.start_main_~a~0#1|)} call main_#t~ret25#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {32113#true} is VALID [2022-02-21 03:10:56,710 INFO L290 TraceCheckUtils]: 69: Hoare triple {32113#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {32113#true} is VALID [2022-02-21 03:10:56,710 INFO L290 TraceCheckUtils]: 70: Hoare triple {32113#true} assume !(0 == ~m % 4294967296); {32113#true} is VALID [2022-02-21 03:10:56,711 INFO L290 TraceCheckUtils]: 71: Hoare triple {32113#true} assume !(~m % 4294967296 < 16777216); {32113#true} is VALID [2022-02-21 03:10:56,711 INFO L290 TraceCheckUtils]: 72: Hoare triple {32113#true} assume !false; {32113#true} is VALID [2022-02-21 03:10:56,711 INFO L290 TraceCheckUtils]: 73: Hoare triple {32113#true} assume ~m % 4294967296 >= 33554432; {32113#true} is VALID [2022-02-21 03:10:56,711 INFO L290 TraceCheckUtils]: 74: Hoare triple {32113#true} assume ~e >= 127;~__retres4~0 := 4294967295; {32113#true} is VALID [2022-02-21 03:10:56,711 INFO L290 TraceCheckUtils]: 75: Hoare triple {32113#true} #res := ~__retres4~0; {32113#true} is VALID [2022-02-21 03:10:56,711 INFO L290 TraceCheckUtils]: 76: Hoare triple {32113#true} assume true; {32113#true} is VALID [2022-02-21 03:10:56,712 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {32113#true} {32176#(<= 4294967295 |ULTIMATE.start_main_~a~0#1|)} #376#return; {32176#(<= 4294967295 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:56,712 INFO L290 TraceCheckUtils]: 78: Hoare triple {32176#(<= 4294967295 |ULTIMATE.start_main_~a~0#1|)} main_~b~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {32176#(<= 4294967295 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:56,713 INFO L290 TraceCheckUtils]: 79: Hoare triple {32176#(<= 4294967295 |ULTIMATE.start_main_~a~0#1|)} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {32176#(<= 4294967295 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:56,713 INFO L290 TraceCheckUtils]: 80: Hoare triple {32176#(<= 4294967295 |ULTIMATE.start_main_~a~0#1|)} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {32176#(<= 4294967295 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:56,713 INFO L290 TraceCheckUtils]: 81: Hoare triple {32176#(<= 4294967295 |ULTIMATE.start_main_~a~0#1|)} main_~sb~0#1 := main_~tmp~2#1; {32176#(<= 4294967295 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:56,714 INFO L290 TraceCheckUtils]: 82: Hoare triple {32176#(<= 4294967295 |ULTIMATE.start_main_~a~0#1|)} assume { :begin_inline_mulflt } true;mulflt_#in~a#1, mulflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mulflt_#res#1;havoc mulflt_#t~nondet12#1, mulflt_#t~nondet13#1, mulflt_#t~nondet14#1, mulflt_#t~nondet15#1, mulflt_#t~nondet16#1, mulflt_#t~nondet17#1, mulflt_~a#1, mulflt_~b#1, mulflt_~res~2#1, mulflt_~ma~1#1, mulflt_~mb~1#1, mulflt_~accu~0#1, mulflt_~ea~1#1, mulflt_~eb~1#1, mulflt_~tmp~1#1, mulflt_~__retres10~1#1;mulflt_~a#1 := mulflt_#in~a#1;mulflt_~b#1 := mulflt_#in~b#1;havoc mulflt_~res~2#1;havoc mulflt_~ma~1#1;havoc mulflt_~mb~1#1;havoc mulflt_~accu~0#1;havoc mulflt_~ea~1#1;havoc mulflt_~eb~1#1;havoc mulflt_~tmp~1#1;havoc mulflt_~__retres10~1#1; {32186#(<= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} is VALID [2022-02-21 03:10:56,714 INFO L290 TraceCheckUtils]: 83: Hoare triple {32186#(<= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} assume !(mulflt_~a#1 % 4294967296 < mulflt_~b#1 % 4294967296); {32186#(<= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} is VALID [2022-02-21 03:10:56,714 INFO L290 TraceCheckUtils]: 84: Hoare triple {32186#(<= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} assume !(0 == mulflt_~b#1 % 4294967296); {32186#(<= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} is VALID [2022-02-21 03:10:56,715 INFO L290 TraceCheckUtils]: 85: Hoare triple {32186#(<= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} assume !(0 == mulflt_~a#1); {32186#(<= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} is VALID [2022-02-21 03:10:56,715 INFO L290 TraceCheckUtils]: 86: Hoare triple {32186#(<= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} assume !false; {32186#(<= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} is VALID [2022-02-21 03:10:56,715 INFO L290 TraceCheckUtils]: 87: Hoare triple {32186#(<= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} assume !false; {32186#(<= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} is VALID [2022-02-21 03:10:56,717 INFO L290 TraceCheckUtils]: 88: Hoare triple {32186#(<= 4294967295 |ULTIMATE.start_mulflt_~a#1|)} assume !(mulflt_~a#1 >= 0);mulflt_~ma~1#1 := mulflt_#t~nondet12#1;havoc mulflt_#t~nondet12#1; {32114#false} is VALID [2022-02-21 03:10:56,717 INFO L290 TraceCheckUtils]: 89: Hoare triple {32114#false} assume (if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {32114#false} is VALID [2022-02-21 03:10:56,717 INFO L290 TraceCheckUtils]: 90: Hoare triple {32114#false} assume !((if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {32114#false} is VALID [2022-02-21 03:10:56,718 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-02-21 03:10:56,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:10:57,079 INFO L290 TraceCheckUtils]: 90: Hoare triple {32114#false} assume !((if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {32114#false} is VALID [2022-02-21 03:10:57,079 INFO L290 TraceCheckUtils]: 89: Hoare triple {32114#false} assume (if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {32114#false} is VALID [2022-02-21 03:10:57,079 INFO L290 TraceCheckUtils]: 88: Hoare triple {32469#(<= 0 |ULTIMATE.start_mulflt_~a#1|)} assume !(mulflt_~a#1 >= 0);mulflt_~ma~1#1 := mulflt_#t~nondet12#1;havoc mulflt_#t~nondet12#1; {32114#false} is VALID [2022-02-21 03:10:57,079 INFO L290 TraceCheckUtils]: 87: Hoare triple {32469#(<= 0 |ULTIMATE.start_mulflt_~a#1|)} assume !false; {32469#(<= 0 |ULTIMATE.start_mulflt_~a#1|)} is VALID [2022-02-21 03:10:57,080 INFO L290 TraceCheckUtils]: 86: Hoare triple {32469#(<= 0 |ULTIMATE.start_mulflt_~a#1|)} assume !false; {32469#(<= 0 |ULTIMATE.start_mulflt_~a#1|)} is VALID [2022-02-21 03:10:57,080 INFO L290 TraceCheckUtils]: 85: Hoare triple {32469#(<= 0 |ULTIMATE.start_mulflt_~a#1|)} assume !(0 == mulflt_~a#1); {32469#(<= 0 |ULTIMATE.start_mulflt_~a#1|)} is VALID [2022-02-21 03:10:57,080 INFO L290 TraceCheckUtils]: 84: Hoare triple {32469#(<= 0 |ULTIMATE.start_mulflt_~a#1|)} assume !(0 == mulflt_~b#1 % 4294967296); {32469#(<= 0 |ULTIMATE.start_mulflt_~a#1|)} is VALID [2022-02-21 03:10:57,081 INFO L290 TraceCheckUtils]: 83: Hoare triple {32469#(<= 0 |ULTIMATE.start_mulflt_~a#1|)} assume !(mulflt_~a#1 % 4294967296 < mulflt_~b#1 % 4294967296); {32469#(<= 0 |ULTIMATE.start_mulflt_~a#1|)} is VALID [2022-02-21 03:10:57,081 INFO L290 TraceCheckUtils]: 82: Hoare triple {32488#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume { :begin_inline_mulflt } true;mulflt_#in~a#1, mulflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mulflt_#res#1;havoc mulflt_#t~nondet12#1, mulflt_#t~nondet13#1, mulflt_#t~nondet14#1, mulflt_#t~nondet15#1, mulflt_#t~nondet16#1, mulflt_#t~nondet17#1, mulflt_~a#1, mulflt_~b#1, mulflt_~res~2#1, mulflt_~ma~1#1, mulflt_~mb~1#1, mulflt_~accu~0#1, mulflt_~ea~1#1, mulflt_~eb~1#1, mulflt_~tmp~1#1, mulflt_~__retres10~1#1;mulflt_~a#1 := mulflt_#in~a#1;mulflt_~b#1 := mulflt_#in~b#1;havoc mulflt_~res~2#1;havoc mulflt_~ma~1#1;havoc mulflt_~mb~1#1;havoc mulflt_~accu~0#1;havoc mulflt_~ea~1#1;havoc mulflt_~eb~1#1;havoc mulflt_~tmp~1#1;havoc mulflt_~__retres10~1#1; {32469#(<= 0 |ULTIMATE.start_mulflt_~a#1|)} is VALID [2022-02-21 03:10:57,081 INFO L290 TraceCheckUtils]: 81: Hoare triple {32488#(<= 0 |ULTIMATE.start_main_~a~0#1|)} main_~sb~0#1 := main_~tmp~2#1; {32488#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:57,082 INFO L290 TraceCheckUtils]: 80: Hoare triple {32488#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {32488#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:57,082 INFO L290 TraceCheckUtils]: 79: Hoare triple {32488#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {32488#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:57,082 INFO L290 TraceCheckUtils]: 78: Hoare triple {32488#(<= 0 |ULTIMATE.start_main_~a~0#1|)} main_~b~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {32488#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:57,083 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {32113#true} {32488#(<= 0 |ULTIMATE.start_main_~a~0#1|)} #376#return; {32488#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:57,083 INFO L290 TraceCheckUtils]: 76: Hoare triple {32113#true} assume true; {32113#true} is VALID [2022-02-21 03:10:57,083 INFO L290 TraceCheckUtils]: 75: Hoare triple {32113#true} #res := ~__retres4~0; {32113#true} is VALID [2022-02-21 03:10:57,083 INFO L290 TraceCheckUtils]: 74: Hoare triple {32113#true} assume ~e >= 127;~__retres4~0 := 4294967295; {32113#true} is VALID [2022-02-21 03:10:57,083 INFO L290 TraceCheckUtils]: 73: Hoare triple {32113#true} assume ~m % 4294967296 >= 33554432; {32113#true} is VALID [2022-02-21 03:10:57,083 INFO L290 TraceCheckUtils]: 72: Hoare triple {32113#true} assume !false; {32113#true} is VALID [2022-02-21 03:10:57,083 INFO L290 TraceCheckUtils]: 71: Hoare triple {32113#true} assume !(~m % 4294967296 < 16777216); {32113#true} is VALID [2022-02-21 03:10:57,083 INFO L290 TraceCheckUtils]: 70: Hoare triple {32113#true} assume !(0 == ~m % 4294967296); {32113#true} is VALID [2022-02-21 03:10:57,083 INFO L290 TraceCheckUtils]: 69: Hoare triple {32113#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {32113#true} is VALID [2022-02-21 03:10:57,083 INFO L272 TraceCheckUtils]: 68: Hoare triple {32488#(<= 0 |ULTIMATE.start_main_~a~0#1|)} call main_#t~ret25#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {32113#true} is VALID [2022-02-21 03:10:57,084 INFO L290 TraceCheckUtils]: 67: Hoare triple {32534#(<= 0 |ULTIMATE.start_main_#t~ret24#1|)} main_~a~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {32488#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:57,084 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {32541#(<= 0 |base2flt_#res|)} {32113#true} #374#return; {32534#(<= 0 |ULTIMATE.start_main_#t~ret24#1|)} is VALID [2022-02-21 03:10:57,085 INFO L290 TraceCheckUtils]: 65: Hoare triple {32541#(<= 0 |base2flt_#res|)} assume true; {32541#(<= 0 |base2flt_#res|)} is VALID [2022-02-21 03:10:57,085 INFO L290 TraceCheckUtils]: 64: Hoare triple {32548#(<= 0 base2flt_~__retres4~0)} #res := ~__retres4~0; {32541#(<= 0 |base2flt_#res|)} is VALID [2022-02-21 03:10:57,085 INFO L290 TraceCheckUtils]: 63: Hoare triple {32113#true} assume ~e >= 127;~__retres4~0 := 4294967295; {32548#(<= 0 base2flt_~__retres4~0)} is VALID [2022-02-21 03:10:57,085 INFO L290 TraceCheckUtils]: 62: Hoare triple {32113#true} assume ~m % 4294967296 >= 33554432; {32113#true} is VALID [2022-02-21 03:10:57,085 INFO L290 TraceCheckUtils]: 61: Hoare triple {32113#true} assume !false; {32113#true} is VALID [2022-02-21 03:10:57,085 INFO L290 TraceCheckUtils]: 60: Hoare triple {32113#true} assume !(~m % 4294967296 < 16777216); {32113#true} is VALID [2022-02-21 03:10:57,086 INFO L290 TraceCheckUtils]: 59: Hoare triple {32113#true} assume !(0 == ~m % 4294967296); {32113#true} is VALID [2022-02-21 03:10:57,086 INFO L290 TraceCheckUtils]: 58: Hoare triple {32113#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {32113#true} is VALID [2022-02-21 03:10:57,086 INFO L272 TraceCheckUtils]: 57: Hoare triple {32113#true} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {32113#true} is VALID [2022-02-21 03:10:57,086 INFO L290 TraceCheckUtils]: 56: Hoare triple {32113#true} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {32113#true} is VALID [2022-02-21 03:10:57,086 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {32113#true} {32113#true} #372#return; {32113#true} is VALID [2022-02-21 03:10:57,086 INFO L290 TraceCheckUtils]: 54: Hoare triple {32113#true} assume true; {32113#true} is VALID [2022-02-21 03:10:57,086 INFO L290 TraceCheckUtils]: 53: Hoare triple {32113#true} #res := ~__retres4~0; {32113#true} is VALID [2022-02-21 03:10:57,086 INFO L290 TraceCheckUtils]: 52: Hoare triple {32113#true} ~__retres4~0 := ~res~0; {32113#true} is VALID [2022-02-21 03:10:57,086 INFO L290 TraceCheckUtils]: 51: Hoare triple {32113#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; {32113#true} is VALID [2022-02-21 03:10:57,086 INFO L290 TraceCheckUtils]: 50: Hoare triple {32113#true} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {32113#true} is VALID [2022-02-21 03:10:57,086 INFO L290 TraceCheckUtils]: 49: Hoare triple {32113#true} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {32113#true} is VALID [2022-02-21 03:10:57,086 INFO L290 TraceCheckUtils]: 48: Hoare triple {32113#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {32113#true} is VALID [2022-02-21 03:10:57,086 INFO L290 TraceCheckUtils]: 47: Hoare triple {32113#true} assume 128 + ~e >= -2147483648; {32113#true} is VALID [2022-02-21 03:10:57,087 INFO L290 TraceCheckUtils]: 46: Hoare triple {32113#true} assume 128 + ~e <= 2147483647; {32113#true} is VALID [2022-02-21 03:10:57,087 INFO L290 TraceCheckUtils]: 45: Hoare triple {32113#true} assume 128 + ~e >= -2147483648; {32113#true} is VALID [2022-02-21 03:10:57,087 INFO L290 TraceCheckUtils]: 44: Hoare triple {32113#true} assume 128 + ~e <= 2147483647; {32113#true} is VALID [2022-02-21 03:10:57,087 INFO L290 TraceCheckUtils]: 43: Hoare triple {32113#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {32113#true} is VALID [2022-02-21 03:10:57,087 INFO L290 TraceCheckUtils]: 42: Hoare triple {32113#true} assume !(~m % 4294967296 < 16777216); {32113#true} is VALID [2022-02-21 03:10:57,087 INFO L290 TraceCheckUtils]: 41: Hoare triple {32113#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {32113#true} is VALID [2022-02-21 03:10:57,087 INFO L290 TraceCheckUtils]: 40: Hoare triple {32113#true} assume ~e - 1 <= 2147483647; {32113#true} is VALID [2022-02-21 03:10:57,087 INFO L290 TraceCheckUtils]: 39: Hoare triple {32113#true} assume !(~e <= -128); {32113#true} is VALID [2022-02-21 03:10:57,087 INFO L290 TraceCheckUtils]: 38: Hoare triple {32113#true} assume !false; {32113#true} is VALID [2022-02-21 03:10:57,087 INFO L290 TraceCheckUtils]: 37: Hoare triple {32113#true} assume ~m % 4294967296 < 16777216; {32113#true} is VALID [2022-02-21 03:10:57,087 INFO L290 TraceCheckUtils]: 36: Hoare triple {32113#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {32113#true} is VALID [2022-02-21 03:10:57,087 INFO L290 TraceCheckUtils]: 35: Hoare triple {32113#true} assume ~e - 1 <= 2147483647; {32113#true} is VALID [2022-02-21 03:10:57,087 INFO L290 TraceCheckUtils]: 34: Hoare triple {32113#true} assume !(~e <= -128); {32113#true} is VALID [2022-02-21 03:10:57,087 INFO L290 TraceCheckUtils]: 33: Hoare triple {32113#true} assume !false; {32113#true} is VALID [2022-02-21 03:10:57,087 INFO L290 TraceCheckUtils]: 32: Hoare triple {32113#true} assume ~m % 4294967296 < 16777216; {32113#true} is VALID [2022-02-21 03:10:57,088 INFO L290 TraceCheckUtils]: 31: Hoare triple {32113#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {32113#true} is VALID [2022-02-21 03:10:57,088 INFO L290 TraceCheckUtils]: 30: Hoare triple {32113#true} assume ~e - 1 <= 2147483647; {32113#true} is VALID [2022-02-21 03:10:57,088 INFO L290 TraceCheckUtils]: 29: Hoare triple {32113#true} assume !(~e <= -128); {32113#true} is VALID [2022-02-21 03:10:57,088 INFO L290 TraceCheckUtils]: 28: Hoare triple {32113#true} assume !false; {32113#true} is VALID [2022-02-21 03:10:57,088 INFO L290 TraceCheckUtils]: 27: Hoare triple {32113#true} assume ~m % 4294967296 < 16777216; {32113#true} is VALID [2022-02-21 03:10:57,088 INFO L290 TraceCheckUtils]: 26: Hoare triple {32113#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {32113#true} is VALID [2022-02-21 03:10:57,088 INFO L290 TraceCheckUtils]: 25: Hoare triple {32113#true} assume ~e - 1 <= 2147483647; {32113#true} is VALID [2022-02-21 03:10:57,088 INFO L290 TraceCheckUtils]: 24: Hoare triple {32113#true} assume !(~e <= -128); {32113#true} is VALID [2022-02-21 03:10:57,088 INFO L290 TraceCheckUtils]: 23: Hoare triple {32113#true} assume !false; {32113#true} is VALID [2022-02-21 03:10:57,088 INFO L290 TraceCheckUtils]: 22: Hoare triple {32113#true} assume ~m % 4294967296 < 16777216; {32113#true} is VALID [2022-02-21 03:10:57,088 INFO L290 TraceCheckUtils]: 21: Hoare triple {32113#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {32113#true} is VALID [2022-02-21 03:10:57,088 INFO L290 TraceCheckUtils]: 20: Hoare triple {32113#true} assume ~e - 1 <= 2147483647; {32113#true} is VALID [2022-02-21 03:10:57,088 INFO L290 TraceCheckUtils]: 19: Hoare triple {32113#true} assume !(~e <= -128); {32113#true} is VALID [2022-02-21 03:10:57,088 INFO L290 TraceCheckUtils]: 18: Hoare triple {32113#true} assume !false; {32113#true} is VALID [2022-02-21 03:10:57,089 INFO L290 TraceCheckUtils]: 17: Hoare triple {32113#true} assume ~m % 4294967296 < 16777216; {32113#true} is VALID [2022-02-21 03:10:57,089 INFO L290 TraceCheckUtils]: 16: Hoare triple {32113#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {32113#true} is VALID [2022-02-21 03:10:57,089 INFO L290 TraceCheckUtils]: 15: Hoare triple {32113#true} assume ~e - 1 <= 2147483647; {32113#true} is VALID [2022-02-21 03:10:57,089 INFO L290 TraceCheckUtils]: 14: Hoare triple {32113#true} assume !(~e <= -128); {32113#true} is VALID [2022-02-21 03:10:57,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {32113#true} assume !false; {32113#true} is VALID [2022-02-21 03:10:57,089 INFO L290 TraceCheckUtils]: 12: Hoare triple {32113#true} assume ~m % 4294967296 < 16777216; {32113#true} is VALID [2022-02-21 03:10:57,089 INFO L290 TraceCheckUtils]: 11: Hoare triple {32113#true} assume !(0 == ~m % 4294967296); {32113#true} is VALID [2022-02-21 03:10:57,089 INFO L290 TraceCheckUtils]: 10: Hoare triple {32113#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {32113#true} is VALID [2022-02-21 03:10:57,089 INFO L272 TraceCheckUtils]: 9: Hoare triple {32113#true} call main_#t~ret23#1 := base2flt(1, 0); {32113#true} is VALID [2022-02-21 03:10:57,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {32113#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {32113#true} is VALID [2022-02-21 03:10:57,089 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {32113#true} {32113#true} #370#return; {32113#true} is VALID [2022-02-21 03:10:57,089 INFO L290 TraceCheckUtils]: 6: Hoare triple {32113#true} assume true; {32113#true} is VALID [2022-02-21 03:10:57,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {32113#true} #res := ~__retres4~0; {32113#true} is VALID [2022-02-21 03:10:57,089 INFO L290 TraceCheckUtils]: 4: Hoare triple {32113#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {32113#true} is VALID [2022-02-21 03:10:57,090 INFO L290 TraceCheckUtils]: 3: Hoare triple {32113#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {32113#true} is VALID [2022-02-21 03:10:57,090 INFO L272 TraceCheckUtils]: 2: Hoare triple {32113#true} call main_#t~ret22#1 := base2flt(0, 0); {32113#true} is VALID [2022-02-21 03:10:57,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {32113#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_~sb~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_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {32113#true} is VALID [2022-02-21 03:10:57,090 INFO L290 TraceCheckUtils]: 0: Hoare triple {32113#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(22, 2);call #Ultimate.allocInit(12, 3); {32113#true} is VALID [2022-02-21 03:10:57,090 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-02-21 03:10:57,090 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847972704] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:10:57,090 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:10:57,090 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-02-21 03:10:57,091 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858599674] [2022-02-21 03:10:57,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:10:57,091 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 91 [2022-02-21 03:10:57,092 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:57,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:57,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:57,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-21 03:10:57,144 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:57,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-21 03:10:57,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-02-21 03:10:57,145 INFO L87 Difference]: Start difference. First operand 318 states and 393 transitions. Second operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:58,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:58,354 INFO L93 Difference]: Finished difference Result 626 states and 748 transitions. [2022-02-21 03:10:58,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-21 03:10:58,354 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 91 [2022-02-21 03:10:58,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:58,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:58,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 344 transitions. [2022-02-21 03:10:58,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:58,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 344 transitions. [2022-02-21 03:10:58,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 344 transitions. [2022-02-21 03:10:58,609 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 344 edges. 344 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:58,621 INFO L225 Difference]: With dead ends: 626 [2022-02-21 03:10:58,621 INFO L226 Difference]: Without dead ends: 576 [2022-02-21 03:10:58,621 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-02-21 03:10:58,622 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 240 mSDsluCounter, 1202 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:58,623 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [240 Valid, 1343 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:10:58,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2022-02-21 03:10:58,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 345. [2022-02-21 03:10:58,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:58,899 INFO L82 GeneralOperation]: Start isEquivalent. First operand 576 states. Second operand has 345 states, 326 states have (on average 1.2668711656441718) internal successors, (413), 332 states have internal predecessors, (413), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2022-02-21 03:10:58,900 INFO L74 IsIncluded]: Start isIncluded. First operand 576 states. Second operand has 345 states, 326 states have (on average 1.2668711656441718) internal successors, (413), 332 states have internal predecessors, (413), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2022-02-21 03:10:58,900 INFO L87 Difference]: Start difference. First operand 576 states. Second operand has 345 states, 326 states have (on average 1.2668711656441718) internal successors, (413), 332 states have internal predecessors, (413), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2022-02-21 03:10:58,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:58,911 INFO L93 Difference]: Finished difference Result 576 states and 689 transitions. [2022-02-21 03:10:58,911 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 689 transitions. [2022-02-21 03:10:58,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:58,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:58,913 INFO L74 IsIncluded]: Start isIncluded. First operand has 345 states, 326 states have (on average 1.2668711656441718) internal successors, (413), 332 states have internal predecessors, (413), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) Second operand 576 states. [2022-02-21 03:10:58,913 INFO L87 Difference]: Start difference. First operand has 345 states, 326 states have (on average 1.2668711656441718) internal successors, (413), 332 states have internal predecessors, (413), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) Second operand 576 states. [2022-02-21 03:10:58,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:58,930 INFO L93 Difference]: Finished difference Result 576 states and 689 transitions. [2022-02-21 03:10:58,930 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 689 transitions. [2022-02-21 03:10:58,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:58,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:58,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:58,932 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:58,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 326 states have (on average 1.2668711656441718) internal successors, (413), 332 states have internal predecessors, (413), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2022-02-21 03:10:58,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 426 transitions. [2022-02-21 03:10:58,939 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 426 transitions. Word has length 91 [2022-02-21 03:10:58,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:58,940 INFO L470 AbstractCegarLoop]: Abstraction has 345 states and 426 transitions. [2022-02-21 03:10:58,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:58,940 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 426 transitions. [2022-02-21 03:10:58,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-21 03:10:58,941 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:58,941 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:58,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:10:59,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2022-02-21 03:10:59,163 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-02-21 03:10:59,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:59,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1592261355, now seen corresponding path program 1 times [2022-02-21 03:10:59,164 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:59,164 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071991736] [2022-02-21 03:10:59,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:59,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:59,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:59,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:59,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:59,219 INFO L290 TraceCheckUtils]: 0: Hoare triple {35044#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {34973#true} is VALID [2022-02-21 03:10:59,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {34973#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {34973#true} is VALID [2022-02-21 03:10:59,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {34973#true} #res := ~__retres4~0; {34973#true} is VALID [2022-02-21 03:10:59,219 INFO L290 TraceCheckUtils]: 3: Hoare triple {34973#true} assume true; {34973#true} is VALID [2022-02-21 03:10:59,219 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {34973#true} {34973#true} #370#return; {34973#true} is VALID [2022-02-21 03:10:59,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:59,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:59,387 INFO L290 TraceCheckUtils]: 0: Hoare triple {35044#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {35045#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:59,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {35045#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !(0 == ~m % 4294967296); {35045#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:59,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {35045#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~m % 4294967296 < 16777216; {35045#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:59,388 INFO L290 TraceCheckUtils]: 3: Hoare triple {35045#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !false; {35045#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:59,389 INFO L290 TraceCheckUtils]: 4: Hoare triple {35045#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !(~e <= -128); {35045#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:59,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {35045#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~e - 1 <= 2147483647; {35045#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:59,389 INFO L290 TraceCheckUtils]: 6: Hoare triple {35045#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {35046#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {35046#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {35046#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {35046#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {35046#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {35046#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {35046#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,392 INFO L290 TraceCheckUtils]: 10: Hoare triple {35046#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {35046#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {35046#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {35047#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,394 INFO L290 TraceCheckUtils]: 12: Hoare triple {35047#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {35047#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,394 INFO L290 TraceCheckUtils]: 13: Hoare triple {35047#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume !false; {35047#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,395 INFO L290 TraceCheckUtils]: 14: Hoare triple {35047#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {35047#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,395 INFO L290 TraceCheckUtils]: 15: Hoare triple {35047#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {35047#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,396 INFO L290 TraceCheckUtils]: 16: Hoare triple {35047#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {35048#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,396 INFO L290 TraceCheckUtils]: 17: Hoare triple {35048#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {35048#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,397 INFO L290 TraceCheckUtils]: 18: Hoare triple {35048#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume !false; {35048#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,397 INFO L290 TraceCheckUtils]: 19: Hoare triple {35048#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {35048#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,397 INFO L290 TraceCheckUtils]: 20: Hoare triple {35048#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {35048#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,398 INFO L290 TraceCheckUtils]: 21: Hoare triple {35048#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {35049#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,399 INFO L290 TraceCheckUtils]: 22: Hoare triple {35049#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {35049#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,399 INFO L290 TraceCheckUtils]: 23: Hoare triple {35049#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {35049#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,400 INFO L290 TraceCheckUtils]: 24: Hoare triple {35049#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {35049#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,400 INFO L290 TraceCheckUtils]: 25: Hoare triple {35049#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {35049#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,401 INFO L290 TraceCheckUtils]: 26: Hoare triple {35049#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {35050#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,402 INFO L290 TraceCheckUtils]: 27: Hoare triple {35050#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {35050#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,402 INFO L290 TraceCheckUtils]: 28: Hoare triple {35050#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {35050#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,403 INFO L290 TraceCheckUtils]: 29: Hoare triple {35050#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {35050#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,403 INFO L290 TraceCheckUtils]: 30: Hoare triple {35050#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {35050#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,404 INFO L290 TraceCheckUtils]: 31: Hoare triple {35050#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {35051#(or (and (not (<= (+ (div base2flt_~m 4294967296) 1) 0)) (<= base2flt_~m 64)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,405 INFO L290 TraceCheckUtils]: 32: Hoare triple {35051#(or (and (not (<= (+ (div base2flt_~m 4294967296) 1) 0)) (<= base2flt_~m 64)) (not (= |base2flt_#in~m| 1)))} assume !(~m % 4294967296 < 16777216); {35052#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:59,406 INFO L290 TraceCheckUtils]: 33: Hoare triple {35052#(not (= |base2flt_#in~m| 1))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {35052#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:59,406 INFO L290 TraceCheckUtils]: 34: Hoare triple {35052#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {35052#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:59,406 INFO L290 TraceCheckUtils]: 35: Hoare triple {35052#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {35052#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:59,407 INFO L290 TraceCheckUtils]: 36: Hoare triple {35052#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {35052#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:59,407 INFO L290 TraceCheckUtils]: 37: Hoare triple {35052#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {35052#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:59,407 INFO L290 TraceCheckUtils]: 38: Hoare triple {35052#(not (= |base2flt_#in~m| 1))} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {35052#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:59,408 INFO L290 TraceCheckUtils]: 39: Hoare triple {35052#(not (= |base2flt_#in~m| 1))} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {35052#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:59,408 INFO L290 TraceCheckUtils]: 40: Hoare triple {35052#(not (= |base2flt_#in~m| 1))} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {35052#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:59,408 INFO L290 TraceCheckUtils]: 41: Hoare triple {35052#(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; {35052#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:59,409 INFO L290 TraceCheckUtils]: 42: Hoare triple {35052#(not (= |base2flt_#in~m| 1))} ~__retres4~0 := ~res~0; {35052#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:59,409 INFO L290 TraceCheckUtils]: 43: Hoare triple {35052#(not (= |base2flt_#in~m| 1))} #res := ~__retres4~0; {35052#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:59,409 INFO L290 TraceCheckUtils]: 44: Hoare triple {35052#(not (= |base2flt_#in~m| 1))} assume true; {35052#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:59,410 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {35052#(not (= |base2flt_#in~m| 1))} {34973#true} #372#return; {34974#false} is VALID [2022-02-21 03:10:59,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-02-21 03:10:59,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:59,415 INFO L290 TraceCheckUtils]: 0: Hoare triple {35044#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {34973#true} is VALID [2022-02-21 03:10:59,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {34973#true} assume !(0 == ~m % 4294967296); {34973#true} is VALID [2022-02-21 03:10:59,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {34973#true} assume !(~m % 4294967296 < 16777216); {34973#true} is VALID [2022-02-21 03:10:59,415 INFO L290 TraceCheckUtils]: 3: Hoare triple {34973#true} assume !false; {34973#true} is VALID [2022-02-21 03:10:59,415 INFO L290 TraceCheckUtils]: 4: Hoare triple {34973#true} assume ~m % 4294967296 >= 33554432; {34973#true} is VALID [2022-02-21 03:10:59,415 INFO L290 TraceCheckUtils]: 5: Hoare triple {34973#true} assume ~e >= 127;~__retres4~0 := 4294967295; {34973#true} is VALID [2022-02-21 03:10:59,415 INFO L290 TraceCheckUtils]: 6: Hoare triple {34973#true} #res := ~__retres4~0; {34973#true} is VALID [2022-02-21 03:10:59,416 INFO L290 TraceCheckUtils]: 7: Hoare triple {34973#true} assume true; {34973#true} is VALID [2022-02-21 03:10:59,416 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {34973#true} {34974#false} #374#return; {34974#false} is VALID [2022-02-21 03:10:59,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-02-21 03:10:59,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:59,420 INFO L290 TraceCheckUtils]: 0: Hoare triple {35044#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {34973#true} is VALID [2022-02-21 03:10:59,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {34973#true} assume !(0 == ~m % 4294967296); {34973#true} is VALID [2022-02-21 03:10:59,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {34973#true} assume !(~m % 4294967296 < 16777216); {34973#true} is VALID [2022-02-21 03:10:59,420 INFO L290 TraceCheckUtils]: 3: Hoare triple {34973#true} assume !false; {34973#true} is VALID [2022-02-21 03:10:59,420 INFO L290 TraceCheckUtils]: 4: Hoare triple {34973#true} assume ~m % 4294967296 >= 33554432; {34973#true} is VALID [2022-02-21 03:10:59,420 INFO L290 TraceCheckUtils]: 5: Hoare triple {34973#true} assume ~e >= 127;~__retres4~0 := 4294967295; {34973#true} is VALID [2022-02-21 03:10:59,420 INFO L290 TraceCheckUtils]: 6: Hoare triple {34973#true} #res := ~__retres4~0; {34973#true} is VALID [2022-02-21 03:10:59,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {34973#true} assume true; {34973#true} is VALID [2022-02-21 03:10:59,421 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {34973#true} {34974#false} #376#return; {34974#false} is VALID [2022-02-21 03:10:59,421 INFO L290 TraceCheckUtils]: 0: Hoare triple {34973#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(22, 2);call #Ultimate.allocInit(12, 3); {34973#true} is VALID [2022-02-21 03:10:59,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {34973#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_~sb~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_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {34973#true} is VALID [2022-02-21 03:10:59,422 INFO L272 TraceCheckUtils]: 2: Hoare triple {34973#true} call main_#t~ret22#1 := base2flt(0, 0); {35044#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:59,422 INFO L290 TraceCheckUtils]: 3: Hoare triple {35044#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {34973#true} is VALID [2022-02-21 03:10:59,422 INFO L290 TraceCheckUtils]: 4: Hoare triple {34973#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {34973#true} is VALID [2022-02-21 03:10:59,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {34973#true} #res := ~__retres4~0; {34973#true} is VALID [2022-02-21 03:10:59,422 INFO L290 TraceCheckUtils]: 6: Hoare triple {34973#true} assume true; {34973#true} is VALID [2022-02-21 03:10:59,422 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {34973#true} {34973#true} #370#return; {34973#true} is VALID [2022-02-21 03:10:59,423 INFO L290 TraceCheckUtils]: 8: Hoare triple {34973#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {34973#true} is VALID [2022-02-21 03:10:59,423 INFO L272 TraceCheckUtils]: 9: Hoare triple {34973#true} call main_#t~ret23#1 := base2flt(1, 0); {35044#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:59,424 INFO L290 TraceCheckUtils]: 10: Hoare triple {35044#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {35045#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:59,424 INFO L290 TraceCheckUtils]: 11: Hoare triple {35045#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !(0 == ~m % 4294967296); {35045#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:59,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {35045#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~m % 4294967296 < 16777216; {35045#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:59,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {35045#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !false; {35045#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:59,426 INFO L290 TraceCheckUtils]: 14: Hoare triple {35045#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !(~e <= -128); {35045#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:59,426 INFO L290 TraceCheckUtils]: 15: Hoare triple {35045#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~e - 1 <= 2147483647; {35045#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:59,427 INFO L290 TraceCheckUtils]: 16: Hoare triple {35045#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {35046#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,428 INFO L290 TraceCheckUtils]: 17: Hoare triple {35046#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {35046#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,428 INFO L290 TraceCheckUtils]: 18: Hoare triple {35046#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {35046#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,429 INFO L290 TraceCheckUtils]: 19: Hoare triple {35046#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {35046#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,430 INFO L290 TraceCheckUtils]: 20: Hoare triple {35046#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {35046#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,431 INFO L290 TraceCheckUtils]: 21: Hoare triple {35046#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {35047#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,432 INFO L290 TraceCheckUtils]: 22: Hoare triple {35047#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {35047#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,432 INFO L290 TraceCheckUtils]: 23: Hoare triple {35047#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume !false; {35047#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,433 INFO L290 TraceCheckUtils]: 24: Hoare triple {35047#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {35047#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,433 INFO L290 TraceCheckUtils]: 25: Hoare triple {35047#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {35047#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,434 INFO L290 TraceCheckUtils]: 26: Hoare triple {35047#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {35048#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,435 INFO L290 TraceCheckUtils]: 27: Hoare triple {35048#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {35048#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,435 INFO L290 TraceCheckUtils]: 28: Hoare triple {35048#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume !false; {35048#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,435 INFO L290 TraceCheckUtils]: 29: Hoare triple {35048#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {35048#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,436 INFO L290 TraceCheckUtils]: 30: Hoare triple {35048#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {35048#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,437 INFO L290 TraceCheckUtils]: 31: Hoare triple {35048#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {35049#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,437 INFO L290 TraceCheckUtils]: 32: Hoare triple {35049#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {35049#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,438 INFO L290 TraceCheckUtils]: 33: Hoare triple {35049#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {35049#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,438 INFO L290 TraceCheckUtils]: 34: Hoare triple {35049#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {35049#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,439 INFO L290 TraceCheckUtils]: 35: Hoare triple {35049#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {35049#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,440 INFO L290 TraceCheckUtils]: 36: Hoare triple {35049#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {35050#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,441 INFO L290 TraceCheckUtils]: 37: Hoare triple {35050#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {35050#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,441 INFO L290 TraceCheckUtils]: 38: Hoare triple {35050#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {35050#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,442 INFO L290 TraceCheckUtils]: 39: Hoare triple {35050#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {35050#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,442 INFO L290 TraceCheckUtils]: 40: Hoare triple {35050#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {35050#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,443 INFO L290 TraceCheckUtils]: 41: Hoare triple {35050#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {35051#(or (and (not (<= (+ (div base2flt_~m 4294967296) 1) 0)) (<= base2flt_~m 64)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:59,445 INFO L290 TraceCheckUtils]: 42: Hoare triple {35051#(or (and (not (<= (+ (div base2flt_~m 4294967296) 1) 0)) (<= base2flt_~m 64)) (not (= |base2flt_#in~m| 1)))} assume !(~m % 4294967296 < 16777216); {35052#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:59,445 INFO L290 TraceCheckUtils]: 43: Hoare triple {35052#(not (= |base2flt_#in~m| 1))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {35052#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:59,445 INFO L290 TraceCheckUtils]: 44: Hoare triple {35052#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {35052#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:59,446 INFO L290 TraceCheckUtils]: 45: Hoare triple {35052#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {35052#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:59,446 INFO L290 TraceCheckUtils]: 46: Hoare triple {35052#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {35052#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:59,447 INFO L290 TraceCheckUtils]: 47: Hoare triple {35052#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {35052#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:59,447 INFO L290 TraceCheckUtils]: 48: Hoare triple {35052#(not (= |base2flt_#in~m| 1))} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {35052#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:59,447 INFO L290 TraceCheckUtils]: 49: Hoare triple {35052#(not (= |base2flt_#in~m| 1))} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {35052#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:59,448 INFO L290 TraceCheckUtils]: 50: Hoare triple {35052#(not (= |base2flt_#in~m| 1))} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {35052#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:59,448 INFO L290 TraceCheckUtils]: 51: Hoare triple {35052#(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; {35052#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:59,449 INFO L290 TraceCheckUtils]: 52: Hoare triple {35052#(not (= |base2flt_#in~m| 1))} ~__retres4~0 := ~res~0; {35052#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:59,449 INFO L290 TraceCheckUtils]: 53: Hoare triple {35052#(not (= |base2flt_#in~m| 1))} #res := ~__retres4~0; {35052#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:59,449 INFO L290 TraceCheckUtils]: 54: Hoare triple {35052#(not (= |base2flt_#in~m| 1))} assume true; {35052#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:59,450 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {35052#(not (= |base2flt_#in~m| 1))} {34973#true} #372#return; {34974#false} is VALID [2022-02-21 03:10:59,450 INFO L290 TraceCheckUtils]: 56: Hoare triple {34974#false} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {34974#false} is VALID [2022-02-21 03:10:59,451 INFO L272 TraceCheckUtils]: 57: Hoare triple {34974#false} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {35044#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:59,451 INFO L290 TraceCheckUtils]: 58: Hoare triple {35044#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {34973#true} is VALID [2022-02-21 03:10:59,451 INFO L290 TraceCheckUtils]: 59: Hoare triple {34973#true} assume !(0 == ~m % 4294967296); {34973#true} is VALID [2022-02-21 03:10:59,451 INFO L290 TraceCheckUtils]: 60: Hoare triple {34973#true} assume !(~m % 4294967296 < 16777216); {34973#true} is VALID [2022-02-21 03:10:59,451 INFO L290 TraceCheckUtils]: 61: Hoare triple {34973#true} assume !false; {34973#true} is VALID [2022-02-21 03:10:59,451 INFO L290 TraceCheckUtils]: 62: Hoare triple {34973#true} assume ~m % 4294967296 >= 33554432; {34973#true} is VALID [2022-02-21 03:10:59,451 INFO L290 TraceCheckUtils]: 63: Hoare triple {34973#true} assume ~e >= 127;~__retres4~0 := 4294967295; {34973#true} is VALID [2022-02-21 03:10:59,452 INFO L290 TraceCheckUtils]: 64: Hoare triple {34973#true} #res := ~__retres4~0; {34973#true} is VALID [2022-02-21 03:10:59,452 INFO L290 TraceCheckUtils]: 65: Hoare triple {34973#true} assume true; {34973#true} is VALID [2022-02-21 03:10:59,452 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {34973#true} {34974#false} #374#return; {34974#false} is VALID [2022-02-21 03:10:59,452 INFO L290 TraceCheckUtils]: 67: Hoare triple {34974#false} main_~a~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {34974#false} is VALID [2022-02-21 03:10:59,452 INFO L272 TraceCheckUtils]: 68: Hoare triple {34974#false} call main_#t~ret25#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {35044#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:59,452 INFO L290 TraceCheckUtils]: 69: Hoare triple {35044#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {34973#true} is VALID [2022-02-21 03:10:59,452 INFO L290 TraceCheckUtils]: 70: Hoare triple {34973#true} assume !(0 == ~m % 4294967296); {34973#true} is VALID [2022-02-21 03:10:59,453 INFO L290 TraceCheckUtils]: 71: Hoare triple {34973#true} assume !(~m % 4294967296 < 16777216); {34973#true} is VALID [2022-02-21 03:10:59,453 INFO L290 TraceCheckUtils]: 72: Hoare triple {34973#true} assume !false; {34973#true} is VALID [2022-02-21 03:10:59,453 INFO L290 TraceCheckUtils]: 73: Hoare triple {34973#true} assume ~m % 4294967296 >= 33554432; {34973#true} is VALID [2022-02-21 03:10:59,453 INFO L290 TraceCheckUtils]: 74: Hoare triple {34973#true} assume ~e >= 127;~__retres4~0 := 4294967295; {34973#true} is VALID [2022-02-21 03:10:59,453 INFO L290 TraceCheckUtils]: 75: Hoare triple {34973#true} #res := ~__retres4~0; {34973#true} is VALID [2022-02-21 03:10:59,453 INFO L290 TraceCheckUtils]: 76: Hoare triple {34973#true} assume true; {34973#true} is VALID [2022-02-21 03:10:59,453 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {34973#true} {34974#false} #376#return; {34974#false} is VALID [2022-02-21 03:10:59,454 INFO L290 TraceCheckUtils]: 78: Hoare triple {34974#false} main_~b~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {34974#false} is VALID [2022-02-21 03:10:59,454 INFO L290 TraceCheckUtils]: 79: Hoare triple {34974#false} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {34974#false} is VALID [2022-02-21 03:10:59,454 INFO L290 TraceCheckUtils]: 80: Hoare triple {34974#false} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {34974#false} is VALID [2022-02-21 03:10:59,454 INFO L290 TraceCheckUtils]: 81: Hoare triple {34974#false} main_~sb~0#1 := main_~tmp~2#1; {34974#false} is VALID [2022-02-21 03:10:59,454 INFO L290 TraceCheckUtils]: 82: Hoare triple {34974#false} assume { :begin_inline_mulflt } true;mulflt_#in~a#1, mulflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mulflt_#res#1;havoc mulflt_#t~nondet12#1, mulflt_#t~nondet13#1, mulflt_#t~nondet14#1, mulflt_#t~nondet15#1, mulflt_#t~nondet16#1, mulflt_#t~nondet17#1, mulflt_~a#1, mulflt_~b#1, mulflt_~res~2#1, mulflt_~ma~1#1, mulflt_~mb~1#1, mulflt_~accu~0#1, mulflt_~ea~1#1, mulflt_~eb~1#1, mulflt_~tmp~1#1, mulflt_~__retres10~1#1;mulflt_~a#1 := mulflt_#in~a#1;mulflt_~b#1 := mulflt_#in~b#1;havoc mulflt_~res~2#1;havoc mulflt_~ma~1#1;havoc mulflt_~mb~1#1;havoc mulflt_~accu~0#1;havoc mulflt_~ea~1#1;havoc mulflt_~eb~1#1;havoc mulflt_~tmp~1#1;havoc mulflt_~__retres10~1#1; {34974#false} is VALID [2022-02-21 03:10:59,454 INFO L290 TraceCheckUtils]: 83: Hoare triple {34974#false} assume !(mulflt_~a#1 % 4294967296 < mulflt_~b#1 % 4294967296); {34974#false} is VALID [2022-02-21 03:10:59,455 INFO L290 TraceCheckUtils]: 84: Hoare triple {34974#false} assume !(0 == mulflt_~b#1 % 4294967296); {34974#false} is VALID [2022-02-21 03:10:59,455 INFO L290 TraceCheckUtils]: 85: Hoare triple {34974#false} assume !(0 == mulflt_~a#1); {34974#false} is VALID [2022-02-21 03:10:59,455 INFO L290 TraceCheckUtils]: 86: Hoare triple {34974#false} assume !false; {34974#false} is VALID [2022-02-21 03:10:59,455 INFO L290 TraceCheckUtils]: 87: Hoare triple {34974#false} assume !false; {34974#false} is VALID [2022-02-21 03:10:59,455 INFO L290 TraceCheckUtils]: 88: Hoare triple {34974#false} assume mulflt_~a#1 >= 0;abs_171 := (if mulflt_~a#1 < 16777215 then mulflt_~a#1 else 16777215);assume mulflt_~a#1 >= 0;assume mulflt_~ma~1#1 < abs_171; {34974#false} is VALID [2022-02-21 03:10:59,455 INFO L290 TraceCheckUtils]: 89: Hoare triple {34974#false} assume (if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {34974#false} is VALID [2022-02-21 03:10:59,455 INFO L290 TraceCheckUtils]: 90: Hoare triple {34974#false} assume !((if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {34974#false} is VALID [2022-02-21 03:10:59,456 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 4 proven. 85 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-02-21 03:10:59,456 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:59,456 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071991736] [2022-02-21 03:10:59,456 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071991736] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:59,456 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573755863] [2022-02-21 03:10:59,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:59,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:59,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:59,458 INFO L229 MonitoredProcess]: Starting monitored process 15 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:59,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-02-21 03:10:59,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:59,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-21 03:10:59,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:59,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:59,913 INFO L290 TraceCheckUtils]: 0: Hoare triple {34973#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(22, 2);call #Ultimate.allocInit(12, 3); {34973#true} is VALID [2022-02-21 03:10:59,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {34973#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_~sb~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_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {34973#true} is VALID [2022-02-21 03:10:59,915 INFO L272 TraceCheckUtils]: 2: Hoare triple {34973#true} call main_#t~ret22#1 := base2flt(0, 0); {34973#true} is VALID [2022-02-21 03:10:59,915 INFO L290 TraceCheckUtils]: 3: Hoare triple {34973#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {34973#true} is VALID [2022-02-21 03:10:59,915 INFO L290 TraceCheckUtils]: 4: Hoare triple {34973#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {34973#true} is VALID [2022-02-21 03:10:59,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {34973#true} #res := ~__retres4~0; {34973#true} is VALID [2022-02-21 03:10:59,916 INFO L290 TraceCheckUtils]: 6: Hoare triple {34973#true} assume true; {34973#true} is VALID [2022-02-21 03:10:59,916 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {34973#true} {34973#true} #370#return; {34973#true} is VALID [2022-02-21 03:10:59,916 INFO L290 TraceCheckUtils]: 8: Hoare triple {34973#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {34973#true} is VALID [2022-02-21 03:10:59,916 INFO L272 TraceCheckUtils]: 9: Hoare triple {34973#true} call main_#t~ret23#1 := base2flt(1, 0); {34973#true} is VALID [2022-02-21 03:10:59,917 INFO L290 TraceCheckUtils]: 10: Hoare triple {34973#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {35086#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:59,918 INFO L290 TraceCheckUtils]: 11: Hoare triple {35086#(= base2flt_~m |base2flt_#in~m|)} assume !(0 == ~m % 4294967296); {35086#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:59,918 INFO L290 TraceCheckUtils]: 12: Hoare triple {35086#(= base2flt_~m |base2flt_#in~m|)} assume ~m % 4294967296 < 16777216; {35086#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:59,918 INFO L290 TraceCheckUtils]: 13: Hoare triple {35086#(= base2flt_~m |base2flt_#in~m|)} assume !false; {35086#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:59,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {35086#(= base2flt_~m |base2flt_#in~m|)} assume !(~e <= -128); {35086#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:59,919 INFO L290 TraceCheckUtils]: 15: Hoare triple {35086#(= base2flt_~m |base2flt_#in~m|)} assume ~e - 1 <= 2147483647; {35086#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:59,919 INFO L290 TraceCheckUtils]: 16: Hoare triple {35086#(= base2flt_~m |base2flt_#in~m|)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {35105#(= (* 2 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:59,920 INFO L290 TraceCheckUtils]: 17: Hoare triple {35105#(= (* 2 |base2flt_#in~m|) base2flt_~m)} assume ~m % 4294967296 < 16777216; {35105#(= (* 2 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:59,920 INFO L290 TraceCheckUtils]: 18: Hoare triple {35105#(= (* 2 |base2flt_#in~m|) base2flt_~m)} assume !false; {35105#(= (* 2 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:59,920 INFO L290 TraceCheckUtils]: 19: Hoare triple {35105#(= (* 2 |base2flt_#in~m|) base2flt_~m)} assume !(~e <= -128); {35105#(= (* 2 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:59,921 INFO L290 TraceCheckUtils]: 20: Hoare triple {35105#(= (* 2 |base2flt_#in~m|) base2flt_~m)} assume ~e - 1 <= 2147483647; {35105#(= (* 2 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:59,921 INFO L290 TraceCheckUtils]: 21: Hoare triple {35105#(= (* 2 |base2flt_#in~m|) base2flt_~m)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {35121#(= (* |base2flt_#in~m| 4) base2flt_~m)} is VALID [2022-02-21 03:10:59,922 INFO L290 TraceCheckUtils]: 22: Hoare triple {35121#(= (* |base2flt_#in~m| 4) base2flt_~m)} assume ~m % 4294967296 < 16777216; {35121#(= (* |base2flt_#in~m| 4) base2flt_~m)} is VALID [2022-02-21 03:10:59,922 INFO L290 TraceCheckUtils]: 23: Hoare triple {35121#(= (* |base2flt_#in~m| 4) base2flt_~m)} assume !false; {35121#(= (* |base2flt_#in~m| 4) base2flt_~m)} is VALID [2022-02-21 03:10:59,922 INFO L290 TraceCheckUtils]: 24: Hoare triple {35121#(= (* |base2flt_#in~m| 4) base2flt_~m)} assume !(~e <= -128); {35121#(= (* |base2flt_#in~m| 4) base2flt_~m)} is VALID [2022-02-21 03:10:59,923 INFO L290 TraceCheckUtils]: 25: Hoare triple {35121#(= (* |base2flt_#in~m| 4) base2flt_~m)} assume ~e - 1 <= 2147483647; {35121#(= (* |base2flt_#in~m| 4) base2flt_~m)} is VALID [2022-02-21 03:10:59,923 INFO L290 TraceCheckUtils]: 26: Hoare triple {35121#(= (* |base2flt_#in~m| 4) base2flt_~m)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {35137#(= (* 8 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:59,924 INFO L290 TraceCheckUtils]: 27: Hoare triple {35137#(= (* 8 |base2flt_#in~m|) base2flt_~m)} assume ~m % 4294967296 < 16777216; {35137#(= (* 8 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:59,924 INFO L290 TraceCheckUtils]: 28: Hoare triple {35137#(= (* 8 |base2flt_#in~m|) base2flt_~m)} assume !false; {35137#(= (* 8 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:59,924 INFO L290 TraceCheckUtils]: 29: Hoare triple {35137#(= (* 8 |base2flt_#in~m|) base2flt_~m)} assume !(~e <= -128); {35137#(= (* 8 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:59,925 INFO L290 TraceCheckUtils]: 30: Hoare triple {35137#(= (* 8 |base2flt_#in~m|) base2flt_~m)} assume ~e - 1 <= 2147483647; {35137#(= (* 8 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:59,926 INFO L290 TraceCheckUtils]: 31: Hoare triple {35137#(= (* 8 |base2flt_#in~m|) base2flt_~m)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {35153#(= (* 16 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:59,927 INFO L290 TraceCheckUtils]: 32: Hoare triple {35153#(= (* 16 |base2flt_#in~m|) base2flt_~m)} assume ~m % 4294967296 < 16777216; {35153#(= (* 16 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:59,927 INFO L290 TraceCheckUtils]: 33: Hoare triple {35153#(= (* 16 |base2flt_#in~m|) base2flt_~m)} assume !false; {35153#(= (* 16 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:59,927 INFO L290 TraceCheckUtils]: 34: Hoare triple {35153#(= (* 16 |base2flt_#in~m|) base2flt_~m)} assume !(~e <= -128); {35153#(= (* 16 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:59,928 INFO L290 TraceCheckUtils]: 35: Hoare triple {35153#(= (* 16 |base2flt_#in~m|) base2flt_~m)} assume ~e - 1 <= 2147483647; {35153#(= (* 16 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:59,928 INFO L290 TraceCheckUtils]: 36: Hoare triple {35153#(= (* 16 |base2flt_#in~m|) base2flt_~m)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {35169#(= (* 32 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:59,931 INFO L290 TraceCheckUtils]: 37: Hoare triple {35169#(= (* 32 |base2flt_#in~m|) base2flt_~m)} assume ~m % 4294967296 < 16777216; {35169#(= (* 32 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:59,932 INFO L290 TraceCheckUtils]: 38: Hoare triple {35169#(= (* 32 |base2flt_#in~m|) base2flt_~m)} assume !false; {35169#(= (* 32 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:59,932 INFO L290 TraceCheckUtils]: 39: Hoare triple {35169#(= (* 32 |base2flt_#in~m|) base2flt_~m)} assume !(~e <= -128); {35169#(= (* 32 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:59,933 INFO L290 TraceCheckUtils]: 40: Hoare triple {35169#(= (* 32 |base2flt_#in~m|) base2flt_~m)} assume ~e - 1 <= 2147483647; {35169#(= (* 32 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:59,934 INFO L290 TraceCheckUtils]: 41: Hoare triple {35169#(= (* 32 |base2flt_#in~m|) base2flt_~m)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {35185#(= (* 64 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:59,938 INFO L290 TraceCheckUtils]: 42: Hoare triple {35185#(= (* 64 |base2flt_#in~m|) base2flt_~m)} assume !(~m % 4294967296 < 16777216); {35189#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} is VALID [2022-02-21 03:10:59,938 INFO L290 TraceCheckUtils]: 43: Hoare triple {35189#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {35189#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} is VALID [2022-02-21 03:10:59,939 INFO L290 TraceCheckUtils]: 44: Hoare triple {35189#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} assume 128 + ~e <= 2147483647; {35189#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} is VALID [2022-02-21 03:10:59,939 INFO L290 TraceCheckUtils]: 45: Hoare triple {35189#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} assume 128 + ~e >= -2147483648; {35189#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} is VALID [2022-02-21 03:10:59,939 INFO L290 TraceCheckUtils]: 46: Hoare triple {35189#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} assume 128 + ~e <= 2147483647; {35189#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} is VALID [2022-02-21 03:10:59,940 INFO L290 TraceCheckUtils]: 47: Hoare triple {35189#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} assume 128 + ~e >= -2147483648; {35189#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} is VALID [2022-02-21 03:10:59,940 INFO L290 TraceCheckUtils]: 48: Hoare triple {35189#(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))); {35189#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} is VALID [2022-02-21 03:10:59,941 INFO L290 TraceCheckUtils]: 49: Hoare triple {35189#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {35189#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} is VALID [2022-02-21 03:10:59,941 INFO L290 TraceCheckUtils]: 50: Hoare triple {35189#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {35189#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} is VALID [2022-02-21 03:10:59,941 INFO L290 TraceCheckUtils]: 51: Hoare triple {35189#(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; {35189#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} is VALID [2022-02-21 03:10:59,942 INFO L290 TraceCheckUtils]: 52: Hoare triple {35189#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} ~__retres4~0 := ~res~0; {35189#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} is VALID [2022-02-21 03:10:59,942 INFO L290 TraceCheckUtils]: 53: Hoare triple {35189#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} #res := ~__retres4~0; {35189#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} is VALID [2022-02-21 03:10:59,942 INFO L290 TraceCheckUtils]: 54: Hoare triple {35189#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} assume true; {35189#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} is VALID [2022-02-21 03:10:59,943 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {35189#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} {34973#true} #372#return; {34974#false} is VALID [2022-02-21 03:10:59,943 INFO L290 TraceCheckUtils]: 56: Hoare triple {34974#false} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {34974#false} is VALID [2022-02-21 03:10:59,944 INFO L272 TraceCheckUtils]: 57: Hoare triple {34974#false} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {34974#false} is VALID [2022-02-21 03:10:59,944 INFO L290 TraceCheckUtils]: 58: Hoare triple {34974#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {34974#false} is VALID [2022-02-21 03:10:59,944 INFO L290 TraceCheckUtils]: 59: Hoare triple {34974#false} assume !(0 == ~m % 4294967296); {34974#false} is VALID [2022-02-21 03:10:59,944 INFO L290 TraceCheckUtils]: 60: Hoare triple {34974#false} assume !(~m % 4294967296 < 16777216); {34974#false} is VALID [2022-02-21 03:10:59,944 INFO L290 TraceCheckUtils]: 61: Hoare triple {34974#false} assume !false; {34974#false} is VALID [2022-02-21 03:10:59,944 INFO L290 TraceCheckUtils]: 62: Hoare triple {34974#false} assume ~m % 4294967296 >= 33554432; {34974#false} is VALID [2022-02-21 03:10:59,944 INFO L290 TraceCheckUtils]: 63: Hoare triple {34974#false} assume ~e >= 127;~__retres4~0 := 4294967295; {34974#false} is VALID [2022-02-21 03:10:59,945 INFO L290 TraceCheckUtils]: 64: Hoare triple {34974#false} #res := ~__retres4~0; {34974#false} is VALID [2022-02-21 03:10:59,945 INFO L290 TraceCheckUtils]: 65: Hoare triple {34974#false} assume true; {34974#false} is VALID [2022-02-21 03:10:59,945 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {34974#false} {34974#false} #374#return; {34974#false} is VALID [2022-02-21 03:10:59,945 INFO L290 TraceCheckUtils]: 67: Hoare triple {34974#false} main_~a~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {34974#false} is VALID [2022-02-21 03:10:59,945 INFO L272 TraceCheckUtils]: 68: Hoare triple {34974#false} call main_#t~ret25#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {34974#false} is VALID [2022-02-21 03:10:59,945 INFO L290 TraceCheckUtils]: 69: Hoare triple {34974#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {34974#false} is VALID [2022-02-21 03:10:59,945 INFO L290 TraceCheckUtils]: 70: Hoare triple {34974#false} assume !(0 == ~m % 4294967296); {34974#false} is VALID [2022-02-21 03:10:59,946 INFO L290 TraceCheckUtils]: 71: Hoare triple {34974#false} assume !(~m % 4294967296 < 16777216); {34974#false} is VALID [2022-02-21 03:10:59,946 INFO L290 TraceCheckUtils]: 72: Hoare triple {34974#false} assume !false; {34974#false} is VALID [2022-02-21 03:10:59,946 INFO L290 TraceCheckUtils]: 73: Hoare triple {34974#false} assume ~m % 4294967296 >= 33554432; {34974#false} is VALID [2022-02-21 03:10:59,946 INFO L290 TraceCheckUtils]: 74: Hoare triple {34974#false} assume ~e >= 127;~__retres4~0 := 4294967295; {34974#false} is VALID [2022-02-21 03:10:59,946 INFO L290 TraceCheckUtils]: 75: Hoare triple {34974#false} #res := ~__retres4~0; {34974#false} is VALID [2022-02-21 03:10:59,946 INFO L290 TraceCheckUtils]: 76: Hoare triple {34974#false} assume true; {34974#false} is VALID [2022-02-21 03:10:59,946 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {34974#false} {34974#false} #376#return; {34974#false} is VALID [2022-02-21 03:10:59,947 INFO L290 TraceCheckUtils]: 78: Hoare triple {34974#false} main_~b~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {34974#false} is VALID [2022-02-21 03:10:59,947 INFO L290 TraceCheckUtils]: 79: Hoare triple {34974#false} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {34974#false} is VALID [2022-02-21 03:10:59,947 INFO L290 TraceCheckUtils]: 80: Hoare triple {34974#false} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {34974#false} is VALID [2022-02-21 03:10:59,947 INFO L290 TraceCheckUtils]: 81: Hoare triple {34974#false} main_~sb~0#1 := main_~tmp~2#1; {34974#false} is VALID [2022-02-21 03:10:59,947 INFO L290 TraceCheckUtils]: 82: Hoare triple {34974#false} assume { :begin_inline_mulflt } true;mulflt_#in~a#1, mulflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mulflt_#res#1;havoc mulflt_#t~nondet12#1, mulflt_#t~nondet13#1, mulflt_#t~nondet14#1, mulflt_#t~nondet15#1, mulflt_#t~nondet16#1, mulflt_#t~nondet17#1, mulflt_~a#1, mulflt_~b#1, mulflt_~res~2#1, mulflt_~ma~1#1, mulflt_~mb~1#1, mulflt_~accu~0#1, mulflt_~ea~1#1, mulflt_~eb~1#1, mulflt_~tmp~1#1, mulflt_~__retres10~1#1;mulflt_~a#1 := mulflt_#in~a#1;mulflt_~b#1 := mulflt_#in~b#1;havoc mulflt_~res~2#1;havoc mulflt_~ma~1#1;havoc mulflt_~mb~1#1;havoc mulflt_~accu~0#1;havoc mulflt_~ea~1#1;havoc mulflt_~eb~1#1;havoc mulflt_~tmp~1#1;havoc mulflt_~__retres10~1#1; {34974#false} is VALID [2022-02-21 03:10:59,947 INFO L290 TraceCheckUtils]: 83: Hoare triple {34974#false} assume !(mulflt_~a#1 % 4294967296 < mulflt_~b#1 % 4294967296); {34974#false} is VALID [2022-02-21 03:10:59,948 INFO L290 TraceCheckUtils]: 84: Hoare triple {34974#false} assume !(0 == mulflt_~b#1 % 4294967296); {34974#false} is VALID [2022-02-21 03:10:59,948 INFO L290 TraceCheckUtils]: 85: Hoare triple {34974#false} assume !(0 == mulflt_~a#1); {34974#false} is VALID [2022-02-21 03:10:59,948 INFO L290 TraceCheckUtils]: 86: Hoare triple {34974#false} assume !false; {34974#false} is VALID [2022-02-21 03:10:59,948 INFO L290 TraceCheckUtils]: 87: Hoare triple {34974#false} assume !false; {34974#false} is VALID [2022-02-21 03:10:59,948 INFO L290 TraceCheckUtils]: 88: Hoare triple {34974#false} assume mulflt_~a#1 >= 0;abs_171 := (if mulflt_~a#1 < 16777215 then mulflt_~a#1 else 16777215);assume mulflt_~a#1 >= 0;assume mulflt_~ma~1#1 < abs_171; {34974#false} is VALID [2022-02-21 03:10:59,948 INFO L290 TraceCheckUtils]: 89: Hoare triple {34974#false} assume (if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {34974#false} is VALID [2022-02-21 03:10:59,948 INFO L290 TraceCheckUtils]: 90: Hoare triple {34974#false} assume !((if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {34974#false} is VALID [2022-02-21 03:10:59,949 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 26 proven. 75 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-21 03:10:59,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:11:00,495 INFO L290 TraceCheckUtils]: 90: Hoare triple {34974#false} assume !((if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {34974#false} is VALID [2022-02-21 03:11:00,496 INFO L290 TraceCheckUtils]: 89: Hoare triple {34974#false} assume (if mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 else mulflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {34974#false} is VALID [2022-02-21 03:11:00,496 INFO L290 TraceCheckUtils]: 88: Hoare triple {34974#false} assume mulflt_~a#1 >= 0;abs_171 := (if mulflt_~a#1 < 16777215 then mulflt_~a#1 else 16777215);assume mulflt_~a#1 >= 0;assume mulflt_~ma~1#1 < abs_171; {34974#false} is VALID [2022-02-21 03:11:00,496 INFO L290 TraceCheckUtils]: 87: Hoare triple {34974#false} assume !false; {34974#false} is VALID [2022-02-21 03:11:00,496 INFO L290 TraceCheckUtils]: 86: Hoare triple {34974#false} assume !false; {34974#false} is VALID [2022-02-21 03:11:00,497 INFO L290 TraceCheckUtils]: 85: Hoare triple {34974#false} assume !(0 == mulflt_~a#1); {34974#false} is VALID [2022-02-21 03:11:00,497 INFO L290 TraceCheckUtils]: 84: Hoare triple {34974#false} assume !(0 == mulflt_~b#1 % 4294967296); {34974#false} is VALID [2022-02-21 03:11:00,497 INFO L290 TraceCheckUtils]: 83: Hoare triple {34974#false} assume !(mulflt_~a#1 % 4294967296 < mulflt_~b#1 % 4294967296); {34974#false} is VALID [2022-02-21 03:11:00,497 INFO L290 TraceCheckUtils]: 82: Hoare triple {34974#false} assume { :begin_inline_mulflt } true;mulflt_#in~a#1, mulflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mulflt_#res#1;havoc mulflt_#t~nondet12#1, mulflt_#t~nondet13#1, mulflt_#t~nondet14#1, mulflt_#t~nondet15#1, mulflt_#t~nondet16#1, mulflt_#t~nondet17#1, mulflt_~a#1, mulflt_~b#1, mulflt_~res~2#1, mulflt_~ma~1#1, mulflt_~mb~1#1, mulflt_~accu~0#1, mulflt_~ea~1#1, mulflt_~eb~1#1, mulflt_~tmp~1#1, mulflt_~__retres10~1#1;mulflt_~a#1 := mulflt_#in~a#1;mulflt_~b#1 := mulflt_#in~b#1;havoc mulflt_~res~2#1;havoc mulflt_~ma~1#1;havoc mulflt_~mb~1#1;havoc mulflt_~accu~0#1;havoc mulflt_~ea~1#1;havoc mulflt_~eb~1#1;havoc mulflt_~tmp~1#1;havoc mulflt_~__retres10~1#1; {34974#false} is VALID [2022-02-21 03:11:00,497 INFO L290 TraceCheckUtils]: 81: Hoare triple {34974#false} main_~sb~0#1 := main_~tmp~2#1; {34974#false} is VALID [2022-02-21 03:11:00,497 INFO L290 TraceCheckUtils]: 80: Hoare triple {34974#false} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {34974#false} is VALID [2022-02-21 03:11:00,498 INFO L290 TraceCheckUtils]: 79: Hoare triple {34974#false} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {34974#false} is VALID [2022-02-21 03:11:00,498 INFO L290 TraceCheckUtils]: 78: Hoare triple {34974#false} main_~b~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {34974#false} is VALID [2022-02-21 03:11:00,498 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {34973#true} {34974#false} #376#return; {34974#false} is VALID [2022-02-21 03:11:00,498 INFO L290 TraceCheckUtils]: 76: Hoare triple {34973#true} assume true; {34973#true} is VALID [2022-02-21 03:11:00,498 INFO L290 TraceCheckUtils]: 75: Hoare triple {34973#true} #res := ~__retres4~0; {34973#true} is VALID [2022-02-21 03:11:00,498 INFO L290 TraceCheckUtils]: 74: Hoare triple {34973#true} assume ~e >= 127;~__retres4~0 := 4294967295; {34973#true} is VALID [2022-02-21 03:11:00,498 INFO L290 TraceCheckUtils]: 73: Hoare triple {34973#true} assume ~m % 4294967296 >= 33554432; {34973#true} is VALID [2022-02-21 03:11:00,499 INFO L290 TraceCheckUtils]: 72: Hoare triple {34973#true} assume !false; {34973#true} is VALID [2022-02-21 03:11:00,499 INFO L290 TraceCheckUtils]: 71: Hoare triple {34973#true} assume !(~m % 4294967296 < 16777216); {34973#true} is VALID [2022-02-21 03:11:00,499 INFO L290 TraceCheckUtils]: 70: Hoare triple {34973#true} assume !(0 == ~m % 4294967296); {34973#true} is VALID [2022-02-21 03:11:00,499 INFO L290 TraceCheckUtils]: 69: Hoare triple {34973#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {34973#true} is VALID [2022-02-21 03:11:00,499 INFO L272 TraceCheckUtils]: 68: Hoare triple {34974#false} call main_#t~ret25#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {34973#true} is VALID [2022-02-21 03:11:00,499 INFO L290 TraceCheckUtils]: 67: Hoare triple {34974#false} main_~a~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {34974#false} is VALID [2022-02-21 03:11:00,500 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {34973#true} {34974#false} #374#return; {34974#false} is VALID [2022-02-21 03:11:00,500 INFO L290 TraceCheckUtils]: 65: Hoare triple {34973#true} assume true; {34973#true} is VALID [2022-02-21 03:11:00,500 INFO L290 TraceCheckUtils]: 64: Hoare triple {34973#true} #res := ~__retres4~0; {34973#true} is VALID [2022-02-21 03:11:00,500 INFO L290 TraceCheckUtils]: 63: Hoare triple {34973#true} assume ~e >= 127;~__retres4~0 := 4294967295; {34973#true} is VALID [2022-02-21 03:11:00,500 INFO L290 TraceCheckUtils]: 62: Hoare triple {34973#true} assume ~m % 4294967296 >= 33554432; {34973#true} is VALID [2022-02-21 03:11:00,500 INFO L290 TraceCheckUtils]: 61: Hoare triple {34973#true} assume !false; {34973#true} is VALID [2022-02-21 03:11:00,500 INFO L290 TraceCheckUtils]: 60: Hoare triple {34973#true} assume !(~m % 4294967296 < 16777216); {34973#true} is VALID [2022-02-21 03:11:00,501 INFO L290 TraceCheckUtils]: 59: Hoare triple {34973#true} assume !(0 == ~m % 4294967296); {34973#true} is VALID [2022-02-21 03:11:00,501 INFO L290 TraceCheckUtils]: 58: Hoare triple {34973#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {34973#true} is VALID [2022-02-21 03:11:00,501 INFO L272 TraceCheckUtils]: 57: Hoare triple {34974#false} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {34973#true} is VALID [2022-02-21 03:11:00,501 INFO L290 TraceCheckUtils]: 56: Hoare triple {34974#false} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {34974#false} is VALID [2022-02-21 03:11:00,502 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {35052#(not (= |base2flt_#in~m| 1))} {34973#true} #372#return; {34974#false} is VALID [2022-02-21 03:11:00,502 INFO L290 TraceCheckUtils]: 54: Hoare triple {35052#(not (= |base2flt_#in~m| 1))} assume true; {35052#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:11:00,503 INFO L290 TraceCheckUtils]: 53: Hoare triple {35052#(not (= |base2flt_#in~m| 1))} #res := ~__retres4~0; {35052#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:11:00,503 INFO L290 TraceCheckUtils]: 52: Hoare triple {35052#(not (= |base2flt_#in~m| 1))} ~__retres4~0 := ~res~0; {35052#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:11:00,503 INFO L290 TraceCheckUtils]: 51: Hoare triple {35052#(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; {35052#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:11:00,504 INFO L290 TraceCheckUtils]: 50: Hoare triple {35052#(not (= |base2flt_#in~m| 1))} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {35052#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:11:00,504 INFO L290 TraceCheckUtils]: 49: Hoare triple {35052#(not (= |base2flt_#in~m| 1))} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {35052#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:11:00,505 INFO L290 TraceCheckUtils]: 48: Hoare triple {35052#(not (= |base2flt_#in~m| 1))} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {35052#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:11:00,505 INFO L290 TraceCheckUtils]: 47: Hoare triple {35052#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {35052#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:11:00,505 INFO L290 TraceCheckUtils]: 46: Hoare triple {35052#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {35052#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:11:00,506 INFO L290 TraceCheckUtils]: 45: Hoare triple {35052#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {35052#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:11:00,506 INFO L290 TraceCheckUtils]: 44: Hoare triple {35052#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {35052#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:11:00,506 INFO L290 TraceCheckUtils]: 43: Hoare triple {35052#(not (= |base2flt_#in~m| 1))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {35052#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:11:00,507 INFO L290 TraceCheckUtils]: 42: Hoare triple {35481#(or (< (mod base2flt_~m 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !(~m % 4294967296 < 16777216); {35052#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:11:00,509 INFO L290 TraceCheckUtils]: 41: Hoare triple {35485#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {35481#(or (< (mod base2flt_~m 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:11:00,509 INFO L290 TraceCheckUtils]: 40: Hoare triple {35485#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {35485#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:11:00,509 INFO L290 TraceCheckUtils]: 39: Hoare triple {35485#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {35485#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:11:00,510 INFO L290 TraceCheckUtils]: 38: Hoare triple {35485#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !false; {35485#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:11:00,510 INFO L290 TraceCheckUtils]: 37: Hoare triple {35485#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {35485#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:11:00,513 INFO L290 TraceCheckUtils]: 36: Hoare triple {35501#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {35485#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:11:00,513 INFO L290 TraceCheckUtils]: 35: Hoare triple {35501#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {35501#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:11:00,514 INFO L290 TraceCheckUtils]: 34: Hoare triple {35501#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {35501#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:11:00,514 INFO L290 TraceCheckUtils]: 33: Hoare triple {35501#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !false; {35501#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:11:00,514 INFO L290 TraceCheckUtils]: 32: Hoare triple {35501#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {35501#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:11:00,516 INFO L290 TraceCheckUtils]: 31: Hoare triple {35517#(or (< (mod (* base2flt_~m 8) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {35501#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:11:00,516 INFO L290 TraceCheckUtils]: 30: Hoare triple {35517#(or (< (mod (* base2flt_~m 8) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {35517#(or (< (mod (* base2flt_~m 8) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:11:00,516 INFO L290 TraceCheckUtils]: 29: Hoare triple {35517#(or (< (mod (* base2flt_~m 8) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {35517#(or (< (mod (* base2flt_~m 8) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:11:00,520 INFO L290 TraceCheckUtils]: 28: Hoare triple {35517#(or (< (mod (* base2flt_~m 8) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !false; {35517#(or (< (mod (* base2flt_~m 8) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:11:00,521 INFO L290 TraceCheckUtils]: 27: Hoare triple {35517#(or (< (mod (* base2flt_~m 8) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {35517#(or (< (mod (* base2flt_~m 8) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:11:00,523 INFO L290 TraceCheckUtils]: 26: Hoare triple {35533#(or (< (mod (* 16 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {35517#(or (< (mod (* base2flt_~m 8) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:11:00,523 INFO L290 TraceCheckUtils]: 25: Hoare triple {35533#(or (< (mod (* 16 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {35533#(or (< (mod (* 16 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:11:00,523 INFO L290 TraceCheckUtils]: 24: Hoare triple {35533#(or (< (mod (* 16 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {35533#(or (< (mod (* 16 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:11:00,524 INFO L290 TraceCheckUtils]: 23: Hoare triple {35533#(or (< (mod (* 16 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !false; {35533#(or (< (mod (* 16 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:11:00,524 INFO L290 TraceCheckUtils]: 22: Hoare triple {35533#(or (< (mod (* 16 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {35533#(or (< (mod (* 16 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:11:00,528 INFO L290 TraceCheckUtils]: 21: Hoare triple {35549#(or (< (mod (* 32 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {35533#(or (< (mod (* 16 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:11:00,528 INFO L290 TraceCheckUtils]: 20: Hoare triple {35549#(or (< (mod (* 32 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {35549#(or (< (mod (* 32 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:11:00,528 INFO L290 TraceCheckUtils]: 19: Hoare triple {35549#(or (< (mod (* 32 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {35549#(or (< (mod (* 32 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:11:00,529 INFO L290 TraceCheckUtils]: 18: Hoare triple {35549#(or (< (mod (* 32 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !false; {35549#(or (< (mod (* 32 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:11:00,529 INFO L290 TraceCheckUtils]: 17: Hoare triple {35549#(or (< (mod (* 32 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {35549#(or (< (mod (* 32 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:11:00,530 INFO L290 TraceCheckUtils]: 16: Hoare triple {35565#(or (< (mod (* 64 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {35549#(or (< (mod (* 32 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:11:00,531 INFO L290 TraceCheckUtils]: 15: Hoare triple {35565#(or (< (mod (* 64 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {35565#(or (< (mod (* 64 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:11:00,531 INFO L290 TraceCheckUtils]: 14: Hoare triple {35565#(or (< (mod (* 64 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {35565#(or (< (mod (* 64 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:11:00,531 INFO L290 TraceCheckUtils]: 13: Hoare triple {35565#(or (< (mod (* 64 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !false; {35565#(or (< (mod (* 64 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:11:00,532 INFO L290 TraceCheckUtils]: 12: Hoare triple {35565#(or (< (mod (* 64 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {35565#(or (< (mod (* 64 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:11:00,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {35565#(or (< (mod (* 64 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !(0 == ~m % 4294967296); {35565#(or (< (mod (* 64 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:11:00,532 INFO L290 TraceCheckUtils]: 10: Hoare triple {34973#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {35565#(or (< (mod (* 64 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:11:00,532 INFO L272 TraceCheckUtils]: 9: Hoare triple {34973#true} call main_#t~ret23#1 := base2flt(1, 0); {34973#true} is VALID [2022-02-21 03:11:00,532 INFO L290 TraceCheckUtils]: 8: Hoare triple {34973#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {34973#true} is VALID [2022-02-21 03:11:00,532 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {34973#true} {34973#true} #370#return; {34973#true} is VALID [2022-02-21 03:11:00,532 INFO L290 TraceCheckUtils]: 6: Hoare triple {34973#true} assume true; {34973#true} is VALID [2022-02-21 03:11:00,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {34973#true} #res := ~__retres4~0; {34973#true} is VALID [2022-02-21 03:11:00,533 INFO L290 TraceCheckUtils]: 4: Hoare triple {34973#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {34973#true} is VALID [2022-02-21 03:11:00,533 INFO L290 TraceCheckUtils]: 3: Hoare triple {34973#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {34973#true} is VALID [2022-02-21 03:11:00,533 INFO L272 TraceCheckUtils]: 2: Hoare triple {34973#true} call main_#t~ret22#1 := base2flt(0, 0); {34973#true} is VALID [2022-02-21 03:11:00,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {34973#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_~sb~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_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {34973#true} is VALID [2022-02-21 03:11:00,533 INFO L290 TraceCheckUtils]: 0: Hoare triple {34973#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(22, 2);call #Ultimate.allocInit(12, 3); {34973#true} is VALID [2022-02-21 03:11:00,533 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 4 proven. 85 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-02-21 03:11:00,533 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573755863] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:11:00,533 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:11:00,534 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2022-02-21 03:11:00,534 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766737462] [2022-02-21 03:11:00,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:11:00,534 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.115384615384615) internal successors, (159), 25 states have internal predecessors, (159), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 91 [2022-02-21 03:11:00,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:11:00,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 6.115384615384615) internal successors, (159), 25 states have internal predecessors, (159), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-21 03:11:00,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:11:00,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-02-21 03:11:00,687 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:11:00,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-02-21 03:11:00,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-02-21 03:11:00,688 INFO L87 Difference]: Start difference. First operand 345 states and 426 transitions. Second operand has 26 states, 26 states have (on average 6.115384615384615) internal successors, (159), 25 states have internal predecessors, (159), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-21 03:11:07,394 WARN L228 SmtUtils]: Spent 5.91s on a formula simplification. DAG size of input: 47 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)