./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_4-2a.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_4-2a.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 2abfa4882ab8ec6bd7a33a5fbeaa8a88ba40a897019218fc162e52833c89454b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:09:58,182 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:09:58,184 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:09:58,220 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:09:58,225 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:09:58,226 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:09:58,238 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:09:58,240 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:09:58,242 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:09:58,244 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:09:58,245 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:09:58,246 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:09:58,247 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:09:58,250 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:09:58,251 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:09:58,253 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:09:58,254 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:09:58,259 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:09:58,260 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:09:58,262 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:09:58,266 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:09:58,270 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:09:58,271 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:09:58,272 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:09:58,274 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:09:58,277 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:09:58,277 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:09:58,278 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:09:58,278 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:09:58,280 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:09:58,280 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:09:58,281 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:09:58,282 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:09:58,282 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:09:58,283 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:09:58,284 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:09:58,285 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:09:58,285 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:09:58,286 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:09:58,287 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:09:58,287 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:09:58,288 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-02-21 03:09:58,325 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:09:58,326 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:09:58,326 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:09:58,326 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:09:58,327 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:09:58,327 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:09:58,328 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:09:58,328 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:09:58,328 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:09:58,328 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:09:58,330 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:09:58,330 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:09:58,330 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:09:58,330 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:09:58,330 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:09:58,331 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:09:58,331 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:09:58,331 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:09:58,331 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:09:58,331 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:09:58,331 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:09:58,332 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:09:58,332 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:09:58,332 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:09:58,332 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:09:58,332 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:09:58,333 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:09:58,333 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:09:58,333 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:09:58,333 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:09:58,333 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:09:58,334 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:09:58,334 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:09:58,334 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 -> 2abfa4882ab8ec6bd7a33a5fbeaa8a88ba40a897019218fc162e52833c89454b [2022-02-21 03:09:58,585 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:09:58,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:09:58,618 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:09:58,619 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:09:58,619 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:09:58,621 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2022-02-21 03:09:58,699 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ebe6bf3f/a069e4beb6b54b65bb6007fb4f3e10f5/FLAG45bb9a83b [2022-02-21 03:09:59,121 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:09:59,122 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2022-02-21 03:09:59,128 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ebe6bf3f/a069e4beb6b54b65bb6007fb4f3e10f5/FLAG45bb9a83b [2022-02-21 03:09:59,498 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ebe6bf3f/a069e4beb6b54b65bb6007fb4f3e10f5 [2022-02-21 03:09:59,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:09:59,503 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:09:59,505 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:09:59,505 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:09:59,508 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:09:59,511 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:09:59" (1/1) ... [2022-02-21 03:09:59,513 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6876e072 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:09:59, skipping insertion in model container [2022-02-21 03:09:59,513 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:09:59" (1/1) ... [2022-02-21 03:09:59,519 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:09:59,560 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:09:59,707 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_4-2a.c.cil.c[755,768] [2022-02-21 03:09:59,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:09:59,801 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:09:59,812 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_4-2a.c.cil.c[755,768] [2022-02-21 03:09:59,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:09:59,913 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:09:59,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:09:59 WrapperNode [2022-02-21 03:09:59,916 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:09:59,917 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:09:59,917 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:09:59,918 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:09:59,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:09:59" (1/1) ... [2022-02-21 03:09:59,943 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:09:59" (1/1) ... [2022-02-21 03:09:59,970 INFO L137 Inliner]: procedures = 17, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2022-02-21 03:09:59,970 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:09:59,971 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:09:59,971 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:09:59,972 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:09:59,979 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:09:59" (1/1) ... [2022-02-21 03:09:59,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:09:59" (1/1) ... [2022-02-21 03:09:59,992 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:09:59" (1/1) ... [2022-02-21 03:09:59,993 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:09:59" (1/1) ... [2022-02-21 03:10:00,000 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:09:59" (1/1) ... [2022-02-21 03:10:00,006 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:09:59" (1/1) ... [2022-02-21 03:10:00,007 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:09:59" (1/1) ... [2022-02-21 03:10:00,009 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:10:00,010 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:10:00,010 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:10:00,010 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:10:00,011 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:09:59" (1/1) ... [2022-02-21 03:10:00,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:10:00,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:00,056 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:00,080 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:00,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:10:00,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:10:00,101 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-02-21 03:10:00,101 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-02-21 03:10:00,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:10:00,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:10:00,101 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2022-02-21 03:10:00,101 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2022-02-21 03:10:00,101 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-21 03:10:00,102 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-21 03:10:00,193 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:10:00,195 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:10:00,677 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:10:00,684 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:10:00,684 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:10:00,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:10:00 BoogieIcfgContainer [2022-02-21 03:10:00,687 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:10:00,688 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:10:00,689 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:10:00,691 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:10:00,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:09:59" (1/3) ... [2022-02-21 03:10:00,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b059f0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:10:00, skipping insertion in model container [2022-02-21 03:10:00,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:09:59" (2/3) ... [2022-02-21 03:10:00,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b059f0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:10:00, skipping insertion in model container [2022-02-21 03:10:00,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:10:00" (3/3) ... [2022-02-21 03:10:00,694 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_4-2a.c.cil.c [2022-02-21 03:10:00,699 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:10:00,699 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2022-02-21 03:10:00,749 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:10:00,753 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:00,754 INFO L340 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2022-02-21 03:10:00,776 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 92 states have (on average 1.7717391304347827) internal successors, (163), 112 states have internal predecessors, (163), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-21 03:10:00,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-21 03:10:00,780 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:00,781 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:00,782 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:00,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:00,786 INFO L85 PathProgramCache]: Analyzing trace with hash -475863887, now seen corresponding path program 1 times [2022-02-21 03:10:00,805 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:00,806 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203458872] [2022-02-21 03:10:00,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:00,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:00,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:00,953 INFO L290 TraceCheckUtils]: 0: Hoare triple {127#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(24, 2);call #Ultimate.allocInit(12, 3); {127#true} is VALID [2022-02-21 03:10:00,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {127#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {127#true} is VALID [2022-02-21 03:10:00,954 INFO L272 TraceCheckUtils]: 2: Hoare triple {127#true} call main_#t~ret22#1 := base2flt(0, 0); {127#true} is VALID [2022-02-21 03:10:00,954 INFO L290 TraceCheckUtils]: 3: Hoare triple {127#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {127#true} is VALID [2022-02-21 03:10:00,955 INFO L290 TraceCheckUtils]: 4: Hoare triple {127#true} assume !(0 == ~m % 4294967296); {127#true} is VALID [2022-02-21 03:10:00,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {127#true} assume !(~m % 4294967296 < 16777216); {127#true} is VALID [2022-02-21 03:10:00,956 INFO L290 TraceCheckUtils]: 6: Hoare triple {127#true} assume !true; {128#false} is VALID [2022-02-21 03:10:00,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {128#false} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {128#false} is VALID [2022-02-21 03:10:00,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {128#false} assume !(128 + ~e <= 2147483647); {128#false} is VALID [2022-02-21 03:10:00,957 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:00,958 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:00,958 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203458872] [2022-02-21 03:10:00,958 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203458872] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:00,959 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:10:00,959 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:10:00,960 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026619660] [2022-02-21 03:10:00,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:00,965 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:00,966 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:00,968 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:00,979 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:00,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-21 03:10:00,979 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:00,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 03:10:00,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 03:10:01,000 INFO L87 Difference]: Start difference. First operand has 124 states, 92 states have (on average 1.7717391304347827) internal successors, (163), 112 states have internal predecessors, (163), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) 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:01,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:01,131 INFO L93 Difference]: Finished difference Result 243 states and 362 transitions. [2022-02-21 03:10:01,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 03:10:01,131 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:01,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:01,133 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:01,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 362 transitions. [2022-02-21 03:10:01,148 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:01,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 362 transitions. [2022-02-21 03:10:01,157 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 362 transitions. [2022-02-21 03:10:01,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 362 edges. 362 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:01,499 INFO L225 Difference]: With dead ends: 243 [2022-02-21 03:10:01,499 INFO L226 Difference]: Without dead ends: 112 [2022-02-21 03:10:01,503 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:01,506 INFO L933 BasicCegarLoop]: 158 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, 158 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:01,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 158 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:01,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-02-21 03:10:01,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-02-21 03:10:01,535 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:01,537 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand has 112 states, 84 states have (on average 1.5714285714285714) internal successors, (132), 102 states have internal predecessors, (132), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:01,538 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand has 112 states, 84 states have (on average 1.5714285714285714) internal successors, (132), 102 states have internal predecessors, (132), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:01,539 INFO L87 Difference]: Start difference. First operand 112 states. Second operand has 112 states, 84 states have (on average 1.5714285714285714) internal successors, (132), 102 states have internal predecessors, (132), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:01,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:01,559 INFO L93 Difference]: Finished difference Result 112 states and 145 transitions. [2022-02-21 03:10:01,560 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 145 transitions. [2022-02-21 03:10:01,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:01,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:01,562 INFO L74 IsIncluded]: Start isIncluded. First operand has 112 states, 84 states have (on average 1.5714285714285714) internal successors, (132), 102 states have internal predecessors, (132), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 112 states. [2022-02-21 03:10:01,563 INFO L87 Difference]: Start difference. First operand has 112 states, 84 states have (on average 1.5714285714285714) internal successors, (132), 102 states have internal predecessors, (132), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 112 states. [2022-02-21 03:10:01,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:01,573 INFO L93 Difference]: Finished difference Result 112 states and 145 transitions. [2022-02-21 03:10:01,573 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 145 transitions. [2022-02-21 03:10:01,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:01,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:01,584 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:01,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:01,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 84 states have (on average 1.5714285714285714) internal successors, (132), 102 states have internal predecessors, (132), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:01,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 145 transitions. [2022-02-21 03:10:01,599 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 145 transitions. Word has length 9 [2022-02-21 03:10:01,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:01,599 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 145 transitions. [2022-02-21 03:10:01,599 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:01,600 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 145 transitions. [2022-02-21 03:10:01,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-21 03:10:01,600 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:01,600 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:01,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:10:01,601 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:01,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:01,602 INFO L85 PathProgramCache]: Analyzing trace with hash -476805235, now seen corresponding path program 1 times [2022-02-21 03:10:01,602 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:01,602 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931093611] [2022-02-21 03:10:01,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:01,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:01,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:01,679 INFO L290 TraceCheckUtils]: 0: Hoare triple {758#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(24, 2);call #Ultimate.allocInit(12, 3); {758#true} is VALID [2022-02-21 03:10:01,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {758#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {758#true} is VALID [2022-02-21 03:10:01,680 INFO L272 TraceCheckUtils]: 2: Hoare triple {758#true} call main_#t~ret22#1 := base2flt(0, 0); {760#(= |base2flt_#in~e| 0)} is VALID [2022-02-21 03:10:01,681 INFO L290 TraceCheckUtils]: 3: Hoare triple {760#(= |base2flt_#in~e| 0)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {761#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:01,682 INFO L290 TraceCheckUtils]: 4: Hoare triple {761#(= base2flt_~e 0)} assume !(0 == ~m % 4294967296); {761#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:01,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {761#(= base2flt_~e 0)} assume ~m % 4294967296 < 16777216; {761#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:01,683 INFO L290 TraceCheckUtils]: 6: Hoare triple {761#(= base2flt_~e 0)} assume !false; {761#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:01,684 INFO L290 TraceCheckUtils]: 7: Hoare triple {761#(= base2flt_~e 0)} assume !(~e <= -128); {761#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:01,684 INFO L290 TraceCheckUtils]: 8: Hoare triple {761#(= base2flt_~e 0)} assume !(~e - 1 <= 2147483647); {759#false} is VALID [2022-02-21 03:10:01,685 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:01,685 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:01,685 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931093611] [2022-02-21 03:10:01,686 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931093611] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:01,686 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:10:01,686 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:10:01,686 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584485466] [2022-02-21 03:10:01,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:01,688 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:01,688 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:01,688 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:01,696 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:01,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:10:01,697 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:01,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:10:01,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:10:01,698 INFO L87 Difference]: Start difference. First operand 112 states and 145 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:02,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:02,090 INFO L93 Difference]: Finished difference Result 283 states and 381 transitions. [2022-02-21 03:10:02,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:10:02,091 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:02,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:02,092 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:02,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 381 transitions. [2022-02-21 03:10:02,098 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:02,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 381 transitions. [2022-02-21 03:10:02,103 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 381 transitions. [2022-02-21 03:10:02,421 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:02,427 INFO L225 Difference]: With dead ends: 283 [2022-02-21 03:10:02,428 INFO L226 Difference]: Without dead ends: 174 [2022-02-21 03:10:02,429 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:02,430 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 106 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:02,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 385 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:10:02,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-02-21 03:10:02,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 161. [2022-02-21 03:10:02,441 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:02,441 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand has 161 states, 132 states have (on average 1.5681818181818181) internal successors, (207), 150 states have internal predecessors, (207), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:02,442 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand has 161 states, 132 states have (on average 1.5681818181818181) internal successors, (207), 150 states have internal predecessors, (207), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:02,442 INFO L87 Difference]: Start difference. First operand 174 states. Second operand has 161 states, 132 states have (on average 1.5681818181818181) internal successors, (207), 150 states have internal predecessors, (207), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:02,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:02,450 INFO L93 Difference]: Finished difference Result 174 states and 226 transitions. [2022-02-21 03:10:02,450 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 226 transitions. [2022-02-21 03:10:02,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:02,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:02,452 INFO L74 IsIncluded]: Start isIncluded. First operand has 161 states, 132 states have (on average 1.5681818181818181) internal successors, (207), 150 states have internal predecessors, (207), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 174 states. [2022-02-21 03:10:02,453 INFO L87 Difference]: Start difference. First operand has 161 states, 132 states have (on average 1.5681818181818181) internal successors, (207), 150 states have internal predecessors, (207), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 174 states. [2022-02-21 03:10:02,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:02,460 INFO L93 Difference]: Finished difference Result 174 states and 226 transitions. [2022-02-21 03:10:02,460 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 226 transitions. [2022-02-21 03:10:02,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:02,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:02,461 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:02,461 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:02,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 132 states have (on average 1.5681818181818181) internal successors, (207), 150 states have internal predecessors, (207), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:02,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 220 transitions. [2022-02-21 03:10:02,468 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 220 transitions. Word has length 9 [2022-02-21 03:10:02,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:02,469 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 220 transitions. [2022-02-21 03:10:02,469 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:02,469 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 220 transitions. [2022-02-21 03:10:02,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-21 03:10:02,470 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:02,470 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:02,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 03:10:02,470 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:02,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:02,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1876350822, now seen corresponding path program 1 times [2022-02-21 03:10:02,471 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:02,472 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746521903] [2022-02-21 03:10:02,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:02,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:02,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:02,535 INFO L290 TraceCheckUtils]: 0: Hoare triple {1619#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(24, 2);call #Ultimate.allocInit(12, 3); {1619#true} is VALID [2022-02-21 03:10:02,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {1619#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {1619#true} is VALID [2022-02-21 03:10:02,536 INFO L272 TraceCheckUtils]: 2: Hoare triple {1619#true} call main_#t~ret22#1 := base2flt(0, 0); {1621#(= |base2flt_#in~e| 0)} is VALID [2022-02-21 03:10:02,537 INFO L290 TraceCheckUtils]: 3: Hoare triple {1621#(= |base2flt_#in~e| 0)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {1622#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:02,537 INFO L290 TraceCheckUtils]: 4: Hoare triple {1622#(= base2flt_~e 0)} assume !(0 == ~m % 4294967296); {1622#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:02,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {1622#(= base2flt_~e 0)} assume ~m % 4294967296 < 16777216; {1622#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:02,538 INFO L290 TraceCheckUtils]: 6: Hoare triple {1622#(= base2flt_~e 0)} assume !false; {1622#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:02,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {1622#(= base2flt_~e 0)} assume !(~e <= -128); {1622#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:02,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {1622#(= base2flt_~e 0)} assume ~e - 1 <= 2147483647; {1622#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:02,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {1622#(= base2flt_~e 0)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {1623#(<= (+ base2flt_~e 1) 0)} is VALID [2022-02-21 03:10:02,541 INFO L290 TraceCheckUtils]: 10: Hoare triple {1623#(<= (+ base2flt_~e 1) 0)} assume !(~m % 4294967296 < 16777216); {1623#(<= (+ base2flt_~e 1) 0)} is VALID [2022-02-21 03:10:02,541 INFO L290 TraceCheckUtils]: 11: Hoare triple {1623#(<= (+ base2flt_~e 1) 0)} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {1623#(<= (+ base2flt_~e 1) 0)} is VALID [2022-02-21 03:10:02,542 INFO L290 TraceCheckUtils]: 12: Hoare triple {1623#(<= (+ base2flt_~e 1) 0)} assume !(128 + ~e <= 2147483647); {1620#false} is VALID [2022-02-21 03:10:02,542 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:02,542 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:02,543 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746521903] [2022-02-21 03:10:02,543 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746521903] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:02,544 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:10:02,544 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:10:02,545 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920727514] [2022-02-21 03:10:02,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:02,545 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:02,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:02,546 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:02,556 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:02,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:10:02,556 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:02,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:10:02,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:10:02,557 INFO L87 Difference]: Start difference. First operand 161 states and 220 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:03,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:03,030 INFO L93 Difference]: Finished difference Result 196 states and 259 transitions. [2022-02-21 03:10:03,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:10:03,031 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:03,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:03,031 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:03,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 259 transitions. [2022-02-21 03:10:03,035 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:03,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 259 transitions. [2022-02-21 03:10:03,038 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 259 transitions. [2022-02-21 03:10:03,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 259 edges. 259 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:03,234 INFO L225 Difference]: With dead ends: 196 [2022-02-21 03:10:03,234 INFO L226 Difference]: Without dead ends: 193 [2022-02-21 03:10:03,234 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:03,236 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 161 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:03,236 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 515 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:10:03,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-02-21 03:10:03,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 168. [2022-02-21 03:10:03,254 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:03,255 INFO L82 GeneralOperation]: Start isEquivalent. First operand 193 states. Second operand has 168 states, 139 states have (on average 1.5683453237410072) internal successors, (218), 157 states have internal predecessors, (218), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:03,256 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states. Second operand has 168 states, 139 states have (on average 1.5683453237410072) internal successors, (218), 157 states have internal predecessors, (218), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:03,256 INFO L87 Difference]: Start difference. First operand 193 states. Second operand has 168 states, 139 states have (on average 1.5683453237410072) internal successors, (218), 157 states have internal predecessors, (218), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:03,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:03,262 INFO L93 Difference]: Finished difference Result 193 states and 256 transitions. [2022-02-21 03:10:03,262 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 256 transitions. [2022-02-21 03:10:03,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:03,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:03,264 INFO L74 IsIncluded]: Start isIncluded. First operand has 168 states, 139 states have (on average 1.5683453237410072) internal successors, (218), 157 states have internal predecessors, (218), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 193 states. [2022-02-21 03:10:03,265 INFO L87 Difference]: Start difference. First operand has 168 states, 139 states have (on average 1.5683453237410072) internal successors, (218), 157 states have internal predecessors, (218), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 193 states. [2022-02-21 03:10:03,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:03,270 INFO L93 Difference]: Finished difference Result 193 states and 256 transitions. [2022-02-21 03:10:03,271 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 256 transitions. [2022-02-21 03:10:03,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:03,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:03,272 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:03,272 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:03,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 139 states have (on average 1.5683453237410072) internal successors, (218), 157 states have internal predecessors, (218), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:03,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 231 transitions. [2022-02-21 03:10:03,277 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 231 transitions. Word has length 13 [2022-02-21 03:10:03,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:03,278 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 231 transitions. [2022-02-21 03:10:03,278 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:03,278 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 231 transitions. [2022-02-21 03:10:03,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-21 03:10:03,278 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:03,279 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:03,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 03:10:03,279 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:03,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:03,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1962666541, now seen corresponding path program 1 times [2022-02-21 03:10:03,280 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:03,280 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72816993] [2022-02-21 03:10:03,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:03,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:03,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:03,324 INFO L290 TraceCheckUtils]: 0: Hoare triple {2431#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(24, 2);call #Ultimate.allocInit(12, 3); {2431#true} is VALID [2022-02-21 03:10:03,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {2431#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {2431#true} is VALID [2022-02-21 03:10:03,325 INFO L272 TraceCheckUtils]: 2: Hoare triple {2431#true} call main_#t~ret22#1 := base2flt(0, 0); {2433#(= |base2flt_#in~e| 0)} is VALID [2022-02-21 03:10:03,325 INFO L290 TraceCheckUtils]: 3: Hoare triple {2433#(= |base2flt_#in~e| 0)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {2434#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:03,326 INFO L290 TraceCheckUtils]: 4: Hoare triple {2434#(= base2flt_~e 0)} assume !(0 == ~m % 4294967296); {2434#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:03,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {2434#(= base2flt_~e 0)} assume ~m % 4294967296 < 16777216; {2434#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:03,326 INFO L290 TraceCheckUtils]: 6: Hoare triple {2434#(= base2flt_~e 0)} assume !false; {2434#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:03,327 INFO L290 TraceCheckUtils]: 7: Hoare triple {2434#(= base2flt_~e 0)} assume !(~e <= -128); {2434#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:03,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {2434#(= base2flt_~e 0)} assume ~e - 1 <= 2147483647; {2434#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:03,328 INFO L290 TraceCheckUtils]: 9: Hoare triple {2434#(= base2flt_~e 0)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {2435#(<= 0 (+ base2flt_~e 1))} is VALID [2022-02-21 03:10:03,328 INFO L290 TraceCheckUtils]: 10: Hoare triple {2435#(<= 0 (+ base2flt_~e 1))} assume !(~m % 4294967296 < 16777216); {2435#(<= 0 (+ base2flt_~e 1))} is VALID [2022-02-21 03:10:03,329 INFO L290 TraceCheckUtils]: 11: Hoare triple {2435#(<= 0 (+ base2flt_~e 1))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {2435#(<= 0 (+ base2flt_~e 1))} is VALID [2022-02-21 03:10:03,329 INFO L290 TraceCheckUtils]: 12: Hoare triple {2435#(<= 0 (+ base2flt_~e 1))} assume 128 + ~e <= 2147483647; {2435#(<= 0 (+ base2flt_~e 1))} is VALID [2022-02-21 03:10:03,329 INFO L290 TraceCheckUtils]: 13: Hoare triple {2435#(<= 0 (+ base2flt_~e 1))} assume !(128 + ~e >= -2147483648); {2432#false} is VALID [2022-02-21 03:10:03,330 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:03,330 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:03,330 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72816993] [2022-02-21 03:10:03,330 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72816993] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:03,330 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:10:03,331 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:10:03,331 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193132960] [2022-02-21 03:10:03,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:03,331 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:03,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:03,332 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:03,341 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:03,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:10:03,342 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:03,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:10:03,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:10:03,343 INFO L87 Difference]: Start difference. First operand 168 states and 231 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:03,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:03,794 INFO L93 Difference]: Finished difference Result 316 states and 420 transitions. [2022-02-21 03:10:03,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:10:03,794 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:03,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:03,795 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:03,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 405 transitions. [2022-02-21 03:10:03,799 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:03,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 405 transitions. [2022-02-21 03:10:03,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 405 transitions. [2022-02-21 03:10:04,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 405 edges. 405 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:04,085 INFO L225 Difference]: With dead ends: 316 [2022-02-21 03:10:04,085 INFO L226 Difference]: Without dead ends: 203 [2022-02-21 03:10:04,086 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:04,087 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 165 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:04,088 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 525 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:10:04,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-02-21 03:10:04,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 172. [2022-02-21 03:10:04,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:04,118 INFO L82 GeneralOperation]: Start isEquivalent. First operand 203 states. Second operand has 172 states, 143 states have (on average 1.5454545454545454) internal successors, (221), 161 states have internal predecessors, (221), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:04,118 INFO L74 IsIncluded]: Start isIncluded. First operand 203 states. Second operand has 172 states, 143 states have (on average 1.5454545454545454) internal successors, (221), 161 states have internal predecessors, (221), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:04,119 INFO L87 Difference]: Start difference. First operand 203 states. Second operand has 172 states, 143 states have (on average 1.5454545454545454) internal successors, (221), 161 states have internal predecessors, (221), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:04,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:04,131 INFO L93 Difference]: Finished difference Result 203 states and 266 transitions. [2022-02-21 03:10:04,131 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 266 transitions. [2022-02-21 03:10:04,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:04,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:04,133 INFO L74 IsIncluded]: Start isIncluded. First operand has 172 states, 143 states have (on average 1.5454545454545454) internal successors, (221), 161 states have internal predecessors, (221), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 203 states. [2022-02-21 03:10:04,133 INFO L87 Difference]: Start difference. First operand has 172 states, 143 states have (on average 1.5454545454545454) internal successors, (221), 161 states have internal predecessors, (221), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 203 states. [2022-02-21 03:10:04,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:04,141 INFO L93 Difference]: Finished difference Result 203 states and 266 transitions. [2022-02-21 03:10:04,141 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 266 transitions. [2022-02-21 03:10:04,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:04,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:04,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:04,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:04,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 143 states have (on average 1.5454545454545454) internal successors, (221), 161 states have internal predecessors, (221), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:04,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 234 transitions. [2022-02-21 03:10:04,166 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 234 transitions. Word has length 14 [2022-02-21 03:10:04,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:04,166 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 234 transitions. [2022-02-21 03:10:04,167 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:04,167 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 234 transitions. [2022-02-21 03:10:04,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-21 03:10:04,167 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:04,168 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:04,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 03:10:04,168 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:04,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:04,169 INFO L85 PathProgramCache]: Analyzing trace with hash 2026818261, now seen corresponding path program 1 times [2022-02-21 03:10:04,169 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:04,170 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184139763] [2022-02-21 03:10:04,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:04,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:04,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:04,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:04,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:04,238 INFO L290 TraceCheckUtils]: 0: Hoare triple {3415#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {3405#true} is VALID [2022-02-21 03:10:04,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {3405#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {3405#true} is VALID [2022-02-21 03:10:04,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {3405#true} #res := ~__retres4~0; {3405#true} is VALID [2022-02-21 03:10:04,239 INFO L290 TraceCheckUtils]: 3: Hoare triple {3405#true} assume true; {3405#true} is VALID [2022-02-21 03:10:04,240 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3405#true} {3407#(<= |ULTIMATE.start_main_~ea~2#1| 127)} #354#return; {3407#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:10:04,240 INFO L290 TraceCheckUtils]: 0: Hoare triple {3405#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(24, 2);call #Ultimate.allocInit(12, 3); {3405#true} is VALID [2022-02-21 03:10:04,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {3405#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {3407#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:10:04,241 INFO L272 TraceCheckUtils]: 2: Hoare triple {3407#(<= |ULTIMATE.start_main_~ea~2#1| 127)} call main_#t~ret22#1 := base2flt(0, 0); {3415#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:04,241 INFO L290 TraceCheckUtils]: 3: Hoare triple {3415#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {3405#true} is VALID [2022-02-21 03:10:04,242 INFO L290 TraceCheckUtils]: 4: Hoare triple {3405#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {3405#true} is VALID [2022-02-21 03:10:04,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {3405#true} #res := ~__retres4~0; {3405#true} is VALID [2022-02-21 03:10:04,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {3405#true} assume true; {3405#true} is VALID [2022-02-21 03:10:04,243 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3405#true} {3407#(<= |ULTIMATE.start_main_~ea~2#1| 127)} #354#return; {3407#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:10:04,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {3407#(<= |ULTIMATE.start_main_~ea~2#1| 127)} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {3407#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:10:04,244 INFO L272 TraceCheckUtils]: 9: Hoare triple {3407#(<= |ULTIMATE.start_main_~ea~2#1| 127)} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {3413#(<= |base2flt_#in~e| 127)} is VALID [2022-02-21 03:10:04,244 INFO L290 TraceCheckUtils]: 10: Hoare triple {3413#(<= |base2flt_#in~e| 127)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {3414#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:04,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {3414#(<= base2flt_~e 127)} assume !(0 == ~m % 4294967296); {3414#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:04,245 INFO L290 TraceCheckUtils]: 12: Hoare triple {3414#(<= base2flt_~e 127)} assume ~m % 4294967296 < 16777216; {3414#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:04,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {3414#(<= base2flt_~e 127)} assume !false; {3414#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:04,246 INFO L290 TraceCheckUtils]: 14: Hoare triple {3414#(<= base2flt_~e 127)} assume !(~e <= -128); {3414#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:04,246 INFO L290 TraceCheckUtils]: 15: Hoare triple {3414#(<= base2flt_~e 127)} assume !(~e - 1 <= 2147483647); {3406#false} is VALID [2022-02-21 03:10:04,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:04,247 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:04,247 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184139763] [2022-02-21 03:10:04,247 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184139763] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:04,247 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498905135] [2022-02-21 03:10:04,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:04,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:04,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:04,250 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:04,267 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:04,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:04,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:10:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:04,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:04,420 INFO L290 TraceCheckUtils]: 0: Hoare triple {3405#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(24, 2);call #Ultimate.allocInit(12, 3); {3405#true} is VALID [2022-02-21 03:10:04,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {3405#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {3407#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:10:04,421 INFO L272 TraceCheckUtils]: 2: Hoare triple {3407#(<= |ULTIMATE.start_main_~ea~2#1| 127)} call main_#t~ret22#1 := base2flt(0, 0); {3405#true} is VALID [2022-02-21 03:10:04,421 INFO L290 TraceCheckUtils]: 3: Hoare triple {3405#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {3405#true} is VALID [2022-02-21 03:10:04,421 INFO L290 TraceCheckUtils]: 4: Hoare triple {3405#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {3405#true} is VALID [2022-02-21 03:10:04,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {3405#true} #res := ~__retres4~0; {3405#true} is VALID [2022-02-21 03:10:04,421 INFO L290 TraceCheckUtils]: 6: Hoare triple {3405#true} assume true; {3405#true} is VALID [2022-02-21 03:10:04,422 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3405#true} {3407#(<= |ULTIMATE.start_main_~ea~2#1| 127)} #354#return; {3407#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:10:04,423 INFO L290 TraceCheckUtils]: 8: Hoare triple {3407#(<= |ULTIMATE.start_main_~ea~2#1| 127)} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {3407#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:10:04,423 INFO L272 TraceCheckUtils]: 9: Hoare triple {3407#(<= |ULTIMATE.start_main_~ea~2#1| 127)} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {3413#(<= |base2flt_#in~e| 127)} is VALID [2022-02-21 03:10:04,424 INFO L290 TraceCheckUtils]: 10: Hoare triple {3413#(<= |base2flt_#in~e| 127)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {3414#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:04,424 INFO L290 TraceCheckUtils]: 11: Hoare triple {3414#(<= base2flt_~e 127)} assume !(0 == ~m % 4294967296); {3414#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:04,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {3414#(<= base2flt_~e 127)} assume ~m % 4294967296 < 16777216; {3414#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:04,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {3414#(<= base2flt_~e 127)} assume !false; {3414#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:04,426 INFO L290 TraceCheckUtils]: 14: Hoare triple {3414#(<= base2flt_~e 127)} assume !(~e <= -128); {3414#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:04,426 INFO L290 TraceCheckUtils]: 15: Hoare triple {3414#(<= base2flt_~e 127)} assume !(~e - 1 <= 2147483647); {3406#false} is VALID [2022-02-21 03:10:04,427 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:04,427 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:10:04,427 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498905135] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:04,427 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:10:04,427 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-02-21 03:10:04,428 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102642356] [2022-02-21 03:10:04,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:04,428 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, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-21 03:10:04,428 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:04,429 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, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:10:04,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:04,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:10:04,442 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:04,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:10:04,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:10:04,443 INFO L87 Difference]: Start difference. First operand 172 states and 234 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, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:10:04,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:04,921 INFO L93 Difference]: Finished difference Result 242 states and 331 transitions. [2022-02-21 03:10:04,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:10:04,922 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, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-21 03:10:04,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:04,922 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, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:10:04,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 233 transitions. [2022-02-21 03:10:04,925 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, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:10:04,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 233 transitions. [2022-02-21 03:10:04,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 233 transitions. [2022-02-21 03:10:05,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 233 edges. 233 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:05,133 INFO L225 Difference]: With dead ends: 242 [2022-02-21 03:10:05,133 INFO L226 Difference]: Without dead ends: 238 [2022-02-21 03:10:05,135 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 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:05,140 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 122 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:05,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 483 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:10:05,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-02-21 03:10:05,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 208. [2022-02-21 03:10:05,181 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:05,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 238 states. Second operand has 208 states, 179 states have (on average 1.5698324022346368) internal successors, (281), 196 states have internal predecessors, (281), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:05,182 INFO L74 IsIncluded]: Start isIncluded. First operand 238 states. Second operand has 208 states, 179 states have (on average 1.5698324022346368) internal successors, (281), 196 states have internal predecessors, (281), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:05,183 INFO L87 Difference]: Start difference. First operand 238 states. Second operand has 208 states, 179 states have (on average 1.5698324022346368) internal successors, (281), 196 states have internal predecessors, (281), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:05,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:05,189 INFO L93 Difference]: Finished difference Result 238 states and 325 transitions. [2022-02-21 03:10:05,189 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 325 transitions. [2022-02-21 03:10:05,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:05,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:05,190 INFO L74 IsIncluded]: Start isIncluded. First operand has 208 states, 179 states have (on average 1.5698324022346368) internal successors, (281), 196 states have internal predecessors, (281), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 238 states. [2022-02-21 03:10:05,191 INFO L87 Difference]: Start difference. First operand has 208 states, 179 states have (on average 1.5698324022346368) internal successors, (281), 196 states have internal predecessors, (281), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 238 states. [2022-02-21 03:10:05,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:05,196 INFO L93 Difference]: Finished difference Result 238 states and 325 transitions. [2022-02-21 03:10:05,197 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 325 transitions. [2022-02-21 03:10:05,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:05,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:05,198 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:05,198 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:05,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 179 states have (on average 1.5698324022346368) internal successors, (281), 196 states have internal predecessors, (281), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:05,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 294 transitions. [2022-02-21 03:10:05,203 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 294 transitions. Word has length 16 [2022-02-21 03:10:05,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:05,204 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 294 transitions. [2022-02-21 03:10:05,204 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, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:10:05,204 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 294 transitions. [2022-02-21 03:10:05,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-21 03:10:05,205 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:05,205 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:05,231 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:05,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:05,419 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:05,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:05,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1963115407, now seen corresponding path program 1 times [2022-02-21 03:10:05,420 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:05,420 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839860300] [2022-02-21 03:10:05,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:05,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:05,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:05,461 INFO L290 TraceCheckUtils]: 0: Hoare triple {4459#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(24, 2);call #Ultimate.allocInit(12, 3); {4459#true} is VALID [2022-02-21 03:10:05,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {4459#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {4459#true} is VALID [2022-02-21 03:10:05,463 INFO L272 TraceCheckUtils]: 2: Hoare triple {4459#true} call main_#t~ret22#1 := base2flt(0, 0); {4461#(= |base2flt_#in~e| 0)} is VALID [2022-02-21 03:10:05,463 INFO L290 TraceCheckUtils]: 3: Hoare triple {4461#(= |base2flt_#in~e| 0)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {4462#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:05,463 INFO L290 TraceCheckUtils]: 4: Hoare triple {4462#(= base2flt_~e 0)} assume !(0 == ~m % 4294967296); {4462#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:05,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {4462#(= base2flt_~e 0)} assume !(~m % 4294967296 < 16777216); {4462#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:05,464 INFO L290 TraceCheckUtils]: 6: Hoare triple {4462#(= base2flt_~e 0)} assume !false; {4462#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:05,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {4462#(= base2flt_~e 0)} assume ~m % 4294967296 >= 33554432; {4462#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:05,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {4462#(= base2flt_~e 0)} assume !(~e >= 127); {4462#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:05,465 INFO L290 TraceCheckUtils]: 9: Hoare triple {4462#(= base2flt_~e 0)} assume 1 + ~e <= 2147483647; {4462#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:05,466 INFO L290 TraceCheckUtils]: 10: Hoare triple {4462#(= base2flt_~e 0)} assume 1 + ~e >= -2147483648;~e := 1 + ~e;~m := ~m / 2; {4463#(<= base2flt_~e 1)} is VALID [2022-02-21 03:10:05,466 INFO L290 TraceCheckUtils]: 11: Hoare triple {4463#(<= base2flt_~e 1)} assume !false; {4463#(<= base2flt_~e 1)} is VALID [2022-02-21 03:10:05,467 INFO L290 TraceCheckUtils]: 12: Hoare triple {4463#(<= base2flt_~e 1)} assume !(~m % 4294967296 >= 33554432); {4463#(<= base2flt_~e 1)} is VALID [2022-02-21 03:10:05,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {4463#(<= base2flt_~e 1)} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {4463#(<= base2flt_~e 1)} is VALID [2022-02-21 03:10:05,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {4463#(<= base2flt_~e 1)} assume !(128 + ~e <= 2147483647); {4460#false} is VALID [2022-02-21 03:10:05,468 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:05,468 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:05,468 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839860300] [2022-02-21 03:10:05,469 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839860300] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:05,469 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564456962] [2022-02-21 03:10:05,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:05,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:05,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:05,470 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:05,509 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:05,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:05,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:10:05,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:05,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:05,619 INFO L290 TraceCheckUtils]: 0: Hoare triple {4459#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(24, 2);call #Ultimate.allocInit(12, 3); {4459#true} is VALID [2022-02-21 03:10:05,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {4459#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {4459#true} is VALID [2022-02-21 03:10:05,620 INFO L272 TraceCheckUtils]: 2: Hoare triple {4459#true} call main_#t~ret22#1 := base2flt(0, 0); {4459#true} is VALID [2022-02-21 03:10:05,620 INFO L290 TraceCheckUtils]: 3: Hoare triple {4459#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {4459#true} is VALID [2022-02-21 03:10:05,623 INFO L290 TraceCheckUtils]: 4: Hoare triple {4459#true} assume !(0 == ~m % 4294967296); {4459#true} is VALID [2022-02-21 03:10:05,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {4459#true} assume !(~m % 4294967296 < 16777216); {4459#true} is VALID [2022-02-21 03:10:05,624 INFO L290 TraceCheckUtils]: 6: Hoare triple {4459#true} assume !false; {4459#true} is VALID [2022-02-21 03:10:05,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {4459#true} assume ~m % 4294967296 >= 33554432; {4459#true} is VALID [2022-02-21 03:10:05,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {4459#true} assume !(~e >= 127); {4491#(not (<= 127 base2flt_~e))} is VALID [2022-02-21 03:10:05,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {4491#(not (<= 127 base2flt_~e))} assume 1 + ~e <= 2147483647; {4491#(not (<= 127 base2flt_~e))} is VALID [2022-02-21 03:10:05,627 INFO L290 TraceCheckUtils]: 10: Hoare triple {4491#(not (<= 127 base2flt_~e))} assume 1 + ~e >= -2147483648;~e := 1 + ~e;~m := ~m / 2; {4498#(< base2flt_~e 128)} is VALID [2022-02-21 03:10:05,628 INFO L290 TraceCheckUtils]: 11: Hoare triple {4498#(< base2flt_~e 128)} assume !false; {4498#(< base2flt_~e 128)} is VALID [2022-02-21 03:10:05,628 INFO L290 TraceCheckUtils]: 12: Hoare triple {4498#(< base2flt_~e 128)} assume !(~m % 4294967296 >= 33554432); {4498#(< base2flt_~e 128)} is VALID [2022-02-21 03:10:05,629 INFO L290 TraceCheckUtils]: 13: Hoare triple {4498#(< base2flt_~e 128)} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {4498#(< base2flt_~e 128)} is VALID [2022-02-21 03:10:05,629 INFO L290 TraceCheckUtils]: 14: Hoare triple {4498#(< base2flt_~e 128)} assume !(128 + ~e <= 2147483647); {4460#false} is VALID [2022-02-21 03:10:05,629 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:05,629 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:10:05,630 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564456962] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:05,630 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:10:05,630 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-02-21 03:10:05,630 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050281113] [2022-02-21 03:10:05,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:05,631 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:05,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:05,631 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:05,642 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:05,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:10:05,642 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:05,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:10:05,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:10:05,644 INFO L87 Difference]: Start difference. First operand 208 states and 294 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:05,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:05,904 INFO L93 Difference]: Finished difference Result 260 states and 365 transitions. [2022-02-21 03:10:05,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:10:05,904 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:05,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:05,904 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:05,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 185 transitions. [2022-02-21 03:10:05,909 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:05,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 185 transitions. [2022-02-21 03:10:05,912 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 185 transitions. [2022-02-21 03:10:06,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 185 edges. 185 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:06,062 INFO L225 Difference]: With dead ends: 260 [2022-02-21 03:10:06,063 INFO L226 Difference]: Without dead ends: 258 [2022-02-21 03:10:06,063 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:06,067 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 28 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 294 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:06,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 294 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:06,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-02-21 03:10:06,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 201. [2022-02-21 03:10:06,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:06,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 258 states. Second operand has 201 states, 172 states have (on average 1.5465116279069768) internal successors, (266), 189 states have internal predecessors, (266), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:06,109 INFO L74 IsIncluded]: Start isIncluded. First operand 258 states. Second operand has 201 states, 172 states have (on average 1.5465116279069768) internal successors, (266), 189 states have internal predecessors, (266), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:06,110 INFO L87 Difference]: Start difference. First operand 258 states. Second operand has 201 states, 172 states have (on average 1.5465116279069768) internal successors, (266), 189 states have internal predecessors, (266), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:06,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:06,117 INFO L93 Difference]: Finished difference Result 258 states and 359 transitions. [2022-02-21 03:10:06,117 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 359 transitions. [2022-02-21 03:10:06,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:06,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:06,118 INFO L74 IsIncluded]: Start isIncluded. First operand has 201 states, 172 states have (on average 1.5465116279069768) internal successors, (266), 189 states have internal predecessors, (266), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 258 states. [2022-02-21 03:10:06,119 INFO L87 Difference]: Start difference. First operand has 201 states, 172 states have (on average 1.5465116279069768) internal successors, (266), 189 states have internal predecessors, (266), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 258 states. [2022-02-21 03:10:06,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:06,125 INFO L93 Difference]: Finished difference Result 258 states and 359 transitions. [2022-02-21 03:10:06,125 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 359 transitions. [2022-02-21 03:10:06,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:06,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:06,126 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:06,126 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:06,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 172 states have (on average 1.5465116279069768) internal successors, (266), 189 states have internal predecessors, (266), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:06,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 279 transitions. [2022-02-21 03:10:06,131 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 279 transitions. Word has length 15 [2022-02-21 03:10:06,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:06,132 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 279 transitions. [2022-02-21 03:10:06,132 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:06,132 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 279 transitions. [2022-02-21 03:10:06,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-21 03:10:06,133 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:06,133 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:06,153 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:06,343 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,SelfDestructingSolverStorable5 [2022-02-21 03:10:06,344 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:06,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:06,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1593143292, now seen corresponding path program 1 times [2022-02-21 03:10:06,344 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:06,345 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775188842] [2022-02-21 03:10:06,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:06,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:06,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:06,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:06,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:06,409 INFO L290 TraceCheckUtils]: 0: Hoare triple {5566#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5558#true} is VALID [2022-02-21 03:10:06,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {5558#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {5558#true} is VALID [2022-02-21 03:10:06,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {5558#true} #res := ~__retres4~0; {5558#true} is VALID [2022-02-21 03:10:06,410 INFO L290 TraceCheckUtils]: 3: Hoare triple {5558#true} assume true; {5558#true} is VALID [2022-02-21 03:10:06,410 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5558#true} {5558#true} #354#return; {5558#true} is VALID [2022-02-21 03:10:06,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {5558#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(24, 2);call #Ultimate.allocInit(12, 3); {5558#true} is VALID [2022-02-21 03:10:06,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {5558#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {5558#true} is VALID [2022-02-21 03:10:06,412 INFO L272 TraceCheckUtils]: 2: Hoare triple {5558#true} call main_#t~ret22#1 := base2flt(0, 0); {5566#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:06,413 INFO L290 TraceCheckUtils]: 3: Hoare triple {5566#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5558#true} is VALID [2022-02-21 03:10:06,414 INFO L290 TraceCheckUtils]: 4: Hoare triple {5558#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {5558#true} is VALID [2022-02-21 03:10:06,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {5558#true} #res := ~__retres4~0; {5558#true} is VALID [2022-02-21 03:10:06,423 INFO L290 TraceCheckUtils]: 6: Hoare triple {5558#true} assume true; {5558#true} is VALID [2022-02-21 03:10:06,426 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5558#true} {5558#true} #354#return; {5558#true} is VALID [2022-02-21 03:10:06,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {5558#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {5558#true} is VALID [2022-02-21 03:10:06,427 INFO L272 TraceCheckUtils]: 9: Hoare triple {5558#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {5558#true} is VALID [2022-02-21 03:10:06,427 INFO L290 TraceCheckUtils]: 10: Hoare triple {5558#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5558#true} is VALID [2022-02-21 03:10:06,427 INFO L290 TraceCheckUtils]: 11: Hoare triple {5558#true} assume !(0 == ~m % 4294967296); {5558#true} is VALID [2022-02-21 03:10:06,428 INFO L290 TraceCheckUtils]: 12: Hoare triple {5558#true} assume ~m % 4294967296 < 16777216; {5558#true} is VALID [2022-02-21 03:10:06,428 INFO L290 TraceCheckUtils]: 13: Hoare triple {5558#true} assume !false; {5558#true} is VALID [2022-02-21 03:10:06,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {5558#true} assume !(~e <= -128); {5565#(<= 0 (+ base2flt_~e 127))} is VALID [2022-02-21 03:10:06,433 INFO L290 TraceCheckUtils]: 15: Hoare triple {5565#(<= 0 (+ base2flt_~e 127))} assume ~e - 1 <= 2147483647; {5565#(<= 0 (+ base2flt_~e 127))} is VALID [2022-02-21 03:10:06,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {5565#(<= 0 (+ base2flt_~e 127))} assume !(~e - 1 >= -2147483648); {5559#false} is VALID [2022-02-21 03:10:06,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:10:06,435 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:06,435 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775188842] [2022-02-21 03:10:06,435 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775188842] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:06,435 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185038677] [2022-02-21 03:10:06,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:06,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:06,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:06,437 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:06,438 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:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:06,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:10:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:06,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:06,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {5558#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(24, 2);call #Ultimate.allocInit(12, 3); {5558#true} is VALID [2022-02-21 03:10:06,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {5558#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {5558#true} is VALID [2022-02-21 03:10:06,552 INFO L272 TraceCheckUtils]: 2: Hoare triple {5558#true} call main_#t~ret22#1 := base2flt(0, 0); {5558#true} is VALID [2022-02-21 03:10:06,552 INFO L290 TraceCheckUtils]: 3: Hoare triple {5558#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5558#true} is VALID [2022-02-21 03:10:06,552 INFO L290 TraceCheckUtils]: 4: Hoare triple {5558#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {5558#true} is VALID [2022-02-21 03:10:06,552 INFO L290 TraceCheckUtils]: 5: Hoare triple {5558#true} #res := ~__retres4~0; {5558#true} is VALID [2022-02-21 03:10:06,552 INFO L290 TraceCheckUtils]: 6: Hoare triple {5558#true} assume true; {5558#true} is VALID [2022-02-21 03:10:06,552 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5558#true} {5558#true} #354#return; {5558#true} is VALID [2022-02-21 03:10:06,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {5558#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {5558#true} is VALID [2022-02-21 03:10:06,553 INFO L272 TraceCheckUtils]: 9: Hoare triple {5558#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {5558#true} is VALID [2022-02-21 03:10:06,553 INFO L290 TraceCheckUtils]: 10: Hoare triple {5558#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5558#true} is VALID [2022-02-21 03:10:06,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {5558#true} assume !(0 == ~m % 4294967296); {5558#true} is VALID [2022-02-21 03:10:06,553 INFO L290 TraceCheckUtils]: 12: Hoare triple {5558#true} assume ~m % 4294967296 < 16777216; {5558#true} is VALID [2022-02-21 03:10:06,553 INFO L290 TraceCheckUtils]: 13: Hoare triple {5558#true} assume !false; {5558#true} is VALID [2022-02-21 03:10:06,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {5558#true} assume !(~e <= -128); {5565#(<= 0 (+ base2flt_~e 127))} is VALID [2022-02-21 03:10:06,554 INFO L290 TraceCheckUtils]: 15: Hoare triple {5565#(<= 0 (+ base2flt_~e 127))} assume ~e - 1 <= 2147483647; {5565#(<= 0 (+ base2flt_~e 127))} is VALID [2022-02-21 03:10:06,554 INFO L290 TraceCheckUtils]: 16: Hoare triple {5565#(<= 0 (+ base2flt_~e 127))} assume !(~e - 1 >= -2147483648); {5559#false} is VALID [2022-02-21 03:10:06,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:10:06,554 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:10:06,554 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185038677] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:06,554 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:10:06,554 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2022-02-21 03:10:06,555 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462588071] [2022-02-21 03:10:06,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:06,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-21 03:10:06,555 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:06,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:10:06,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:06,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:10:06,571 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:06,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:10:06,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:10:06,573 INFO L87 Difference]: Start difference. First operand 201 states and 279 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:10:06,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:06,762 INFO L93 Difference]: Finished difference Result 210 states and 288 transitions. [2022-02-21 03:10:06,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:10:06,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-21 03:10:06,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:06,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:10:06,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2022-02-21 03:10:06,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:10:06,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2022-02-21 03:10:06,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 149 transitions. [2022-02-21 03:10:06,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:06,878 INFO L225 Difference]: With dead ends: 210 [2022-02-21 03:10:06,879 INFO L226 Difference]: Without dead ends: 209 [2022-02-21 03:10:06,879 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:10:06,879 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 3 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:06,880 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 264 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:10:06,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-02-21 03:10:06,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 198. [2022-02-21 03:10:06,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:06,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 209 states. Second operand has 198 states, 170 states have (on average 1.535294117647059) internal successors, (261), 186 states have internal predecessors, (261), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:06,916 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand has 198 states, 170 states have (on average 1.535294117647059) internal successors, (261), 186 states have internal predecessors, (261), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:06,917 INFO L87 Difference]: Start difference. First operand 209 states. Second operand has 198 states, 170 states have (on average 1.535294117647059) internal successors, (261), 186 states have internal predecessors, (261), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:06,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:06,921 INFO L93 Difference]: Finished difference Result 209 states and 285 transitions. [2022-02-21 03:10:06,922 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 285 transitions. [2022-02-21 03:10:06,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:06,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:06,923 INFO L74 IsIncluded]: Start isIncluded. First operand has 198 states, 170 states have (on average 1.535294117647059) internal successors, (261), 186 states have internal predecessors, (261), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 209 states. [2022-02-21 03:10:06,924 INFO L87 Difference]: Start difference. First operand has 198 states, 170 states have (on average 1.535294117647059) internal successors, (261), 186 states have internal predecessors, (261), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 209 states. [2022-02-21 03:10:06,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:06,928 INFO L93 Difference]: Finished difference Result 209 states and 285 transitions. [2022-02-21 03:10:06,929 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 285 transitions. [2022-02-21 03:10:06,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:06,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:06,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:06,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:06,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 170 states have (on average 1.535294117647059) internal successors, (261), 186 states have internal predecessors, (261), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:06,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 274 transitions. [2022-02-21 03:10:06,934 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 274 transitions. Word has length 17 [2022-02-21 03:10:06,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:06,935 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 274 transitions. [2022-02-21 03:10:06,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:10:06,935 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 274 transitions. [2022-02-21 03:10:06,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-21 03:10:06,936 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:06,936 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:06,963 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:07,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:07,153 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:07,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:07,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1255353667, now seen corresponding path program 1 times [2022-02-21 03:10:07,154 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:07,154 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497356698] [2022-02-21 03:10:07,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:07,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:07,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:07,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:07,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:07,235 INFO L290 TraceCheckUtils]: 0: Hoare triple {6518#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {6508#true} is VALID [2022-02-21 03:10:07,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {6508#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {6508#true} is VALID [2022-02-21 03:10:07,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {6508#true} #res := ~__retres4~0; {6508#true} is VALID [2022-02-21 03:10:07,236 INFO L290 TraceCheckUtils]: 3: Hoare triple {6508#true} assume true; {6508#true} is VALID [2022-02-21 03:10:07,236 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6508#true} {6510#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} #354#return; {6510#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:07,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {6508#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(24, 2);call #Ultimate.allocInit(12, 3); {6508#true} is VALID [2022-02-21 03:10:07,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {6508#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {6510#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:07,238 INFO L272 TraceCheckUtils]: 2: Hoare triple {6510#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret22#1 := base2flt(0, 0); {6518#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:07,238 INFO L290 TraceCheckUtils]: 3: Hoare triple {6518#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {6508#true} is VALID [2022-02-21 03:10:07,238 INFO L290 TraceCheckUtils]: 4: Hoare triple {6508#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {6508#true} is VALID [2022-02-21 03:10:07,239 INFO L290 TraceCheckUtils]: 5: Hoare triple {6508#true} #res := ~__retres4~0; {6508#true} is VALID [2022-02-21 03:10:07,239 INFO L290 TraceCheckUtils]: 6: Hoare triple {6508#true} assume true; {6508#true} is VALID [2022-02-21 03:10:07,240 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6508#true} {6510#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} #354#return; {6510#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:07,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {6510#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {6510#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:07,241 INFO L272 TraceCheckUtils]: 9: Hoare triple {6510#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {6516#(<= 0 (+ 128 |base2flt_#in~e|))} is VALID [2022-02-21 03:10:07,243 INFO L290 TraceCheckUtils]: 10: Hoare triple {6516#(<= 0 (+ 128 |base2flt_#in~e|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {6517#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:07,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {6517#(<= 0 (+ 128 base2flt_~e))} assume !(0 == ~m % 4294967296); {6517#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:07,244 INFO L290 TraceCheckUtils]: 12: Hoare triple {6517#(<= 0 (+ 128 base2flt_~e))} assume !(~m % 4294967296 < 16777216); {6517#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:07,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {6517#(<= 0 (+ 128 base2flt_~e))} assume !false; {6517#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:07,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {6517#(<= 0 (+ 128 base2flt_~e))} assume ~m % 4294967296 >= 33554432; {6517#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:07,246 INFO L290 TraceCheckUtils]: 15: Hoare triple {6517#(<= 0 (+ 128 base2flt_~e))} assume !(~e >= 127); {6517#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:07,246 INFO L290 TraceCheckUtils]: 16: Hoare triple {6517#(<= 0 (+ 128 base2flt_~e))} assume 1 + ~e <= 2147483647; {6517#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:07,247 INFO L290 TraceCheckUtils]: 17: Hoare triple {6517#(<= 0 (+ 128 base2flt_~e))} assume !(1 + ~e >= -2147483648); {6509#false} is VALID [2022-02-21 03:10:07,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:07,247 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:07,247 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497356698] [2022-02-21 03:10:07,247 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497356698] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:07,248 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993929538] [2022-02-21 03:10:07,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:07,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:07,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:07,252 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:07,253 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:07,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:07,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:10:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:07,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:07,401 INFO L290 TraceCheckUtils]: 0: Hoare triple {6508#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(24, 2);call #Ultimate.allocInit(12, 3); {6508#true} is VALID [2022-02-21 03:10:07,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {6508#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {6510#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:07,401 INFO L272 TraceCheckUtils]: 2: Hoare triple {6510#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret22#1 := base2flt(0, 0); {6508#true} is VALID [2022-02-21 03:10:07,402 INFO L290 TraceCheckUtils]: 3: Hoare triple {6508#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {6508#true} is VALID [2022-02-21 03:10:07,402 INFO L290 TraceCheckUtils]: 4: Hoare triple {6508#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {6508#true} is VALID [2022-02-21 03:10:07,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {6508#true} #res := ~__retres4~0; {6508#true} is VALID [2022-02-21 03:10:07,402 INFO L290 TraceCheckUtils]: 6: Hoare triple {6508#true} assume true; {6508#true} is VALID [2022-02-21 03:10:07,403 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6508#true} {6510#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} #354#return; {6510#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:07,403 INFO L290 TraceCheckUtils]: 8: Hoare triple {6510#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {6510#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:07,404 INFO L272 TraceCheckUtils]: 9: Hoare triple {6510#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {6516#(<= 0 (+ 128 |base2flt_#in~e|))} is VALID [2022-02-21 03:10:07,404 INFO L290 TraceCheckUtils]: 10: Hoare triple {6516#(<= 0 (+ 128 |base2flt_#in~e|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {6517#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:07,405 INFO L290 TraceCheckUtils]: 11: Hoare triple {6517#(<= 0 (+ 128 base2flt_~e))} assume !(0 == ~m % 4294967296); {6517#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:07,405 INFO L290 TraceCheckUtils]: 12: Hoare triple {6517#(<= 0 (+ 128 base2flt_~e))} assume !(~m % 4294967296 < 16777216); {6517#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:07,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {6517#(<= 0 (+ 128 base2flt_~e))} assume !false; {6517#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:07,406 INFO L290 TraceCheckUtils]: 14: Hoare triple {6517#(<= 0 (+ 128 base2flt_~e))} assume ~m % 4294967296 >= 33554432; {6517#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:07,407 INFO L290 TraceCheckUtils]: 15: Hoare triple {6517#(<= 0 (+ 128 base2flt_~e))} assume !(~e >= 127); {6517#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:07,407 INFO L290 TraceCheckUtils]: 16: Hoare triple {6517#(<= 0 (+ 128 base2flt_~e))} assume 1 + ~e <= 2147483647; {6517#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:07,408 INFO L290 TraceCheckUtils]: 17: Hoare triple {6517#(<= 0 (+ 128 base2flt_~e))} assume !(1 + ~e >= -2147483648); {6509#false} is VALID [2022-02-21 03:10:07,408 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:07,408 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:10:07,408 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993929538] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:07,408 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:10:07,408 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-02-21 03:10:07,409 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092270019] [2022-02-21 03:10:07,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:07,409 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, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-21 03:10:07,410 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:07,410 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, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:10:07,423 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:07,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:10:07,424 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:07,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:10:07,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:10:07,425 INFO L87 Difference]: Start difference. First operand 198 states and 274 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, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:10:07,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:07,850 INFO L93 Difference]: Finished difference Result 241 states and 328 transitions. [2022-02-21 03:10:07,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:10:07,851 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, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-21 03:10:07,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:07,851 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, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:10:07,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 222 transitions. [2022-02-21 03:10:07,853 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, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:10:07,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 222 transitions. [2022-02-21 03:10:07,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 222 transitions. [2022-02-21 03:10:08,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:08,036 INFO L225 Difference]: With dead ends: 241 [2022-02-21 03:10:08,036 INFO L226 Difference]: Without dead ends: 238 [2022-02-21 03:10:08,036 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 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:08,037 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 107 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:08,037 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 484 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:10:08,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-02-21 03:10:08,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 206. [2022-02-21 03:10:08,089 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:08,089 INFO L82 GeneralOperation]: Start isEquivalent. First operand 238 states. Second operand has 206 states, 178 states have (on average 1.5280898876404494) internal successors, (272), 194 states have internal predecessors, (272), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:08,090 INFO L74 IsIncluded]: Start isIncluded. First operand 238 states. Second operand has 206 states, 178 states have (on average 1.5280898876404494) internal successors, (272), 194 states have internal predecessors, (272), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:08,091 INFO L87 Difference]: Start difference. First operand 238 states. Second operand has 206 states, 178 states have (on average 1.5280898876404494) internal successors, (272), 194 states have internal predecessors, (272), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:08,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:08,096 INFO L93 Difference]: Finished difference Result 238 states and 325 transitions. [2022-02-21 03:10:08,096 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 325 transitions. [2022-02-21 03:10:08,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:08,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:08,097 INFO L74 IsIncluded]: Start isIncluded. First operand has 206 states, 178 states have (on average 1.5280898876404494) internal successors, (272), 194 states have internal predecessors, (272), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 238 states. [2022-02-21 03:10:08,098 INFO L87 Difference]: Start difference. First operand has 206 states, 178 states have (on average 1.5280898876404494) internal successors, (272), 194 states have internal predecessors, (272), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 238 states. [2022-02-21 03:10:08,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:08,103 INFO L93 Difference]: Finished difference Result 238 states and 325 transitions. [2022-02-21 03:10:08,103 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 325 transitions. [2022-02-21 03:10:08,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:08,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:08,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:08,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:08,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 178 states have (on average 1.5280898876404494) internal successors, (272), 194 states have internal predecessors, (272), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:08,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 285 transitions. [2022-02-21 03:10:08,110 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 285 transitions. Word has length 18 [2022-02-21 03:10:08,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:08,110 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 285 transitions. [2022-02-21 03:10:08,111 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, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:10:08,111 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 285 transitions. [2022-02-21 03:10:08,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-21 03:10:08,111 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:08,111 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:08,138 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:08,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:08,335 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:08,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:08,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1571854273, now seen corresponding path program 1 times [2022-02-21 03:10:08,336 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:08,336 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734608788] [2022-02-21 03:10:08,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:08,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:08,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:08,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {7567#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(24, 2);call #Ultimate.allocInit(12, 3); {7567#true} is VALID [2022-02-21 03:10:08,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {7567#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {7567#true} is VALID [2022-02-21 03:10:08,386 INFO L272 TraceCheckUtils]: 2: Hoare triple {7567#true} call main_#t~ret22#1 := base2flt(0, 0); {7567#true} is VALID [2022-02-21 03:10:08,386 INFO L290 TraceCheckUtils]: 3: Hoare triple {7567#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {7567#true} is VALID [2022-02-21 03:10:08,386 INFO L290 TraceCheckUtils]: 4: Hoare triple {7567#true} assume !(0 == ~m % 4294967296); {7567#true} is VALID [2022-02-21 03:10:08,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {7567#true} assume ~m % 4294967296 < 16777216; {7567#true} is VALID [2022-02-21 03:10:08,387 INFO L290 TraceCheckUtils]: 6: Hoare triple {7567#true} assume !false; {7567#true} is VALID [2022-02-21 03:10:08,387 INFO L290 TraceCheckUtils]: 7: Hoare triple {7567#true} assume !(~e <= -128); {7567#true} is VALID [2022-02-21 03:10:08,387 INFO L290 TraceCheckUtils]: 8: Hoare triple {7567#true} assume ~e - 1 <= 2147483647; {7567#true} is VALID [2022-02-21 03:10:08,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {7567#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {7567#true} is VALID [2022-02-21 03:10:08,387 INFO L290 TraceCheckUtils]: 10: Hoare triple {7567#true} assume ~m % 4294967296 < 16777216; {7567#true} is VALID [2022-02-21 03:10:08,387 INFO L290 TraceCheckUtils]: 11: Hoare triple {7567#true} assume !false; {7567#true} is VALID [2022-02-21 03:10:08,388 INFO L290 TraceCheckUtils]: 12: Hoare triple {7567#true} assume !(~e <= -128); {7569#(<= 0 (+ base2flt_~e 127))} is VALID [2022-02-21 03:10:08,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {7569#(<= 0 (+ base2flt_~e 127))} assume ~e - 1 <= 2147483647; {7569#(<= 0 (+ base2flt_~e 127))} is VALID [2022-02-21 03:10:08,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {7569#(<= 0 (+ base2flt_~e 127))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {7570#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:08,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {7570#(<= 0 (+ 128 base2flt_~e))} assume !(~m % 4294967296 < 16777216); {7570#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:08,390 INFO L290 TraceCheckUtils]: 16: Hoare triple {7570#(<= 0 (+ 128 base2flt_~e))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {7570#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:08,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {7570#(<= 0 (+ 128 base2flt_~e))} assume 128 + ~e <= 2147483647; {7570#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:08,394 INFO L290 TraceCheckUtils]: 18: Hoare triple {7570#(<= 0 (+ 128 base2flt_~e))} assume !(128 + ~e >= -2147483648); {7568#false} is VALID [2022-02-21 03:10:08,394 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:08,394 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:08,394 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734608788] [2022-02-21 03:10:08,395 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734608788] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:08,395 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:10:08,395 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:10:08,395 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386905524] [2022-02-21 03:10:08,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:08,396 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:08,396 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:08,396 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:08,411 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:08,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:10:08,411 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:08,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:10:08,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:10:08,412 INFO L87 Difference]: Start difference. First operand 206 states and 285 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:08,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:08,767 INFO L93 Difference]: Finished difference Result 261 states and 361 transitions. [2022-02-21 03:10:08,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:10:08,768 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:08,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:08,768 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:08,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2022-02-21 03:10:08,770 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:08,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2022-02-21 03:10:08,771 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 181 transitions. [2022-02-21 03:10:08,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:08,909 INFO L225 Difference]: With dead ends: 261 [2022-02-21 03:10:08,913 INFO L226 Difference]: Without dead ends: 259 [2022-02-21 03:10:08,913 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:08,914 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 24 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:08,914 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 401 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:10:08,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-02-21 03:10:08,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 206. [2022-02-21 03:10:08,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:08,982 INFO L82 GeneralOperation]: Start isEquivalent. First operand 259 states. Second operand has 206 states, 178 states have (on average 1.5168539325842696) internal successors, (270), 194 states have internal predecessors, (270), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:08,983 INFO L74 IsIncluded]: Start isIncluded. First operand 259 states. Second operand has 206 states, 178 states have (on average 1.5168539325842696) internal successors, (270), 194 states have internal predecessors, (270), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:08,983 INFO L87 Difference]: Start difference. First operand 259 states. Second operand has 206 states, 178 states have (on average 1.5168539325842696) internal successors, (270), 194 states have internal predecessors, (270), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:08,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:08,989 INFO L93 Difference]: Finished difference Result 259 states and 355 transitions. [2022-02-21 03:10:08,989 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 355 transitions. [2022-02-21 03:10:08,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:08,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:08,990 INFO L74 IsIncluded]: Start isIncluded. First operand has 206 states, 178 states have (on average 1.5168539325842696) internal successors, (270), 194 states have internal predecessors, (270), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 259 states. [2022-02-21 03:10:08,990 INFO L87 Difference]: Start difference. First operand has 206 states, 178 states have (on average 1.5168539325842696) internal successors, (270), 194 states have internal predecessors, (270), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 259 states. [2022-02-21 03:10:08,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:08,997 INFO L93 Difference]: Finished difference Result 259 states and 355 transitions. [2022-02-21 03:10:08,997 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 355 transitions. [2022-02-21 03:10:08,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:08,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:08,998 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:08,998 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:08,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 178 states have (on average 1.5168539325842696) internal successors, (270), 194 states have internal predecessors, (270), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:09,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 283 transitions. [2022-02-21 03:10:09,002 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 283 transitions. Word has length 19 [2022-02-21 03:10:09,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:09,003 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 283 transitions. [2022-02-21 03:10:09,003 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:09,003 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 283 transitions. [2022-02-21 03:10:09,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-21 03:10:09,004 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:09,004 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:09,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-21 03:10:09,004 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:09,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:09,005 INFO L85 PathProgramCache]: Analyzing trace with hash -159419185, now seen corresponding path program 1 times [2022-02-21 03:10:09,005 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:09,005 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367130027] [2022-02-21 03:10:09,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:09,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:09,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:09,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:09,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:09,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {8647#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8632#true} is VALID [2022-02-21 03:10:09,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {8632#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {8632#true} is VALID [2022-02-21 03:10:09,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {8632#true} #res := ~__retres4~0; {8632#true} is VALID [2022-02-21 03:10:09,090 INFO L290 TraceCheckUtils]: 3: Hoare triple {8632#true} assume true; {8632#true} is VALID [2022-02-21 03:10:09,091 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {8632#true} {8634#(<= |ULTIMATE.start_main_~eb~2#1| 127)} #354#return; {8634#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:10:09,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:09,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:09,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {8647#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8632#true} is VALID [2022-02-21 03:10:09,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {8632#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {8632#true} is VALID [2022-02-21 03:10:09,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {8632#true} #res := ~__retres4~0; {8632#true} is VALID [2022-02-21 03:10:09,097 INFO L290 TraceCheckUtils]: 3: Hoare triple {8632#true} assume true; {8632#true} is VALID [2022-02-21 03:10:09,098 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {8632#true} {8634#(<= |ULTIMATE.start_main_~eb~2#1| 127)} #356#return; {8634#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:10:09,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {8632#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(24, 2);call #Ultimate.allocInit(12, 3); {8632#true} is VALID [2022-02-21 03:10:09,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {8632#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {8634#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:10:09,100 INFO L272 TraceCheckUtils]: 2: Hoare triple {8634#(<= |ULTIMATE.start_main_~eb~2#1| 127)} call main_#t~ret22#1 := base2flt(0, 0); {8647#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:09,101 INFO L290 TraceCheckUtils]: 3: Hoare triple {8647#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8632#true} is VALID [2022-02-21 03:10:09,101 INFO L290 TraceCheckUtils]: 4: Hoare triple {8632#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {8632#true} is VALID [2022-02-21 03:10:09,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {8632#true} #res := ~__retres4~0; {8632#true} is VALID [2022-02-21 03:10:09,101 INFO L290 TraceCheckUtils]: 6: Hoare triple {8632#true} assume true; {8632#true} is VALID [2022-02-21 03:10:09,102 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {8632#true} {8634#(<= |ULTIMATE.start_main_~eb~2#1| 127)} #354#return; {8634#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:10:09,103 INFO L290 TraceCheckUtils]: 8: Hoare triple {8634#(<= |ULTIMATE.start_main_~eb~2#1| 127)} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {8634#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:10:09,104 INFO L272 TraceCheckUtils]: 9: Hoare triple {8634#(<= |ULTIMATE.start_main_~eb~2#1| 127)} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {8647#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:09,104 INFO L290 TraceCheckUtils]: 10: Hoare triple {8647#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8632#true} is VALID [2022-02-21 03:10:09,104 INFO L290 TraceCheckUtils]: 11: Hoare triple {8632#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {8632#true} is VALID [2022-02-21 03:10:09,105 INFO L290 TraceCheckUtils]: 12: Hoare triple {8632#true} #res := ~__retres4~0; {8632#true} is VALID [2022-02-21 03:10:09,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {8632#true} assume true; {8632#true} is VALID [2022-02-21 03:10:09,105 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {8632#true} {8634#(<= |ULTIMATE.start_main_~eb~2#1| 127)} #356#return; {8634#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:10:09,106 INFO L290 TraceCheckUtils]: 15: Hoare triple {8634#(<= |ULTIMATE.start_main_~eb~2#1| 127)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {8634#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:10:09,107 INFO L272 TraceCheckUtils]: 16: Hoare triple {8634#(<= |ULTIMATE.start_main_~eb~2#1| 127)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {8645#(<= |base2flt_#in~e| 127)} is VALID [2022-02-21 03:10:09,107 INFO L290 TraceCheckUtils]: 17: Hoare triple {8645#(<= |base2flt_#in~e| 127)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8646#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:09,107 INFO L290 TraceCheckUtils]: 18: Hoare triple {8646#(<= base2flt_~e 127)} assume !(0 == ~m % 4294967296); {8646#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:09,108 INFO L290 TraceCheckUtils]: 19: Hoare triple {8646#(<= base2flt_~e 127)} assume ~m % 4294967296 < 16777216; {8646#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:09,108 INFO L290 TraceCheckUtils]: 20: Hoare triple {8646#(<= base2flt_~e 127)} assume !false; {8646#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:09,108 INFO L290 TraceCheckUtils]: 21: Hoare triple {8646#(<= base2flt_~e 127)} assume !(~e <= -128); {8646#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:09,109 INFO L290 TraceCheckUtils]: 22: Hoare triple {8646#(<= base2flt_~e 127)} assume !(~e - 1 <= 2147483647); {8633#false} is VALID [2022-02-21 03:10:09,109 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:09,109 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:09,109 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367130027] [2022-02-21 03:10:09,109 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367130027] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:09,110 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640167496] [2022-02-21 03:10:09,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:09,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:09,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:09,111 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:09,121 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:09,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:09,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:10:09,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:09,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:09,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {8632#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(24, 2);call #Ultimate.allocInit(12, 3); {8632#true} is VALID [2022-02-21 03:10:09,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {8632#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {8634#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:10:09,290 INFO L272 TraceCheckUtils]: 2: Hoare triple {8634#(<= |ULTIMATE.start_main_~eb~2#1| 127)} call main_#t~ret22#1 := base2flt(0, 0); {8632#true} is VALID [2022-02-21 03:10:09,290 INFO L290 TraceCheckUtils]: 3: Hoare triple {8632#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8632#true} is VALID [2022-02-21 03:10:09,291 INFO L290 TraceCheckUtils]: 4: Hoare triple {8632#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {8632#true} is VALID [2022-02-21 03:10:09,300 INFO L290 TraceCheckUtils]: 5: Hoare triple {8632#true} #res := ~__retres4~0; {8632#true} is VALID [2022-02-21 03:10:09,301 INFO L290 TraceCheckUtils]: 6: Hoare triple {8632#true} assume true; {8632#true} is VALID [2022-02-21 03:10:09,308 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {8632#true} {8634#(<= |ULTIMATE.start_main_~eb~2#1| 127)} #354#return; {8634#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:10:09,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {8634#(<= |ULTIMATE.start_main_~eb~2#1| 127)} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {8634#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:10:09,311 INFO L272 TraceCheckUtils]: 9: Hoare triple {8634#(<= |ULTIMATE.start_main_~eb~2#1| 127)} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {8632#true} is VALID [2022-02-21 03:10:09,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {8632#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8632#true} is VALID [2022-02-21 03:10:09,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {8632#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {8632#true} is VALID [2022-02-21 03:10:09,314 INFO L290 TraceCheckUtils]: 12: Hoare triple {8632#true} #res := ~__retres4~0; {8632#true} is VALID [2022-02-21 03:10:09,314 INFO L290 TraceCheckUtils]: 13: Hoare triple {8632#true} assume true; {8632#true} is VALID [2022-02-21 03:10:09,315 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {8632#true} {8634#(<= |ULTIMATE.start_main_~eb~2#1| 127)} #356#return; {8634#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:10:09,316 INFO L290 TraceCheckUtils]: 15: Hoare triple {8634#(<= |ULTIMATE.start_main_~eb~2#1| 127)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {8634#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:10:09,317 INFO L272 TraceCheckUtils]: 16: Hoare triple {8634#(<= |ULTIMATE.start_main_~eb~2#1| 127)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {8645#(<= |base2flt_#in~e| 127)} is VALID [2022-02-21 03:10:09,317 INFO L290 TraceCheckUtils]: 17: Hoare triple {8645#(<= |base2flt_#in~e| 127)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8646#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:09,318 INFO L290 TraceCheckUtils]: 18: Hoare triple {8646#(<= base2flt_~e 127)} assume !(0 == ~m % 4294967296); {8646#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:09,318 INFO L290 TraceCheckUtils]: 19: Hoare triple {8646#(<= base2flt_~e 127)} assume ~m % 4294967296 < 16777216; {8646#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:09,318 INFO L290 TraceCheckUtils]: 20: Hoare triple {8646#(<= base2flt_~e 127)} assume !false; {8646#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:09,319 INFO L290 TraceCheckUtils]: 21: Hoare triple {8646#(<= base2flt_~e 127)} assume !(~e <= -128); {8646#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:09,319 INFO L290 TraceCheckUtils]: 22: Hoare triple {8646#(<= base2flt_~e 127)} assume !(~e - 1 <= 2147483647); {8633#false} is VALID [2022-02-21 03:10:09,320 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:09,320 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:10:09,320 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640167496] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:09,320 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:10:09,320 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-02-21 03:10:09,320 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282381994] [2022-02-21 03:10:09,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:09,321 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:09,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:09,327 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:09,343 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:09,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:10:09,343 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:09,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:10:09,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:10:09,344 INFO L87 Difference]: Start difference. First operand 206 states and 283 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:09,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:09,784 INFO L93 Difference]: Finished difference Result 236 states and 324 transitions. [2022-02-21 03:10:09,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:10:09,784 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:09,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:09,785 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:09,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 221 transitions. [2022-02-21 03:10:09,787 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:09,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 221 transitions. [2022-02-21 03:10:09,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 221 transitions. [2022-02-21 03:10:09,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:09,962 INFO L225 Difference]: With dead ends: 236 [2022-02-21 03:10:09,962 INFO L226 Difference]: Without dead ends: 233 [2022-02-21 03:10:09,963 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:09,963 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 112 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:09,964 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 481 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:10:09,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-02-21 03:10:10,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 194. [2022-02-21 03:10:10,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:10,023 INFO L82 GeneralOperation]: Start isEquivalent. First operand 233 states. Second operand has 194 states, 169 states have (on average 1.4792899408284024) internal successors, (250), 182 states have internal predecessors, (250), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:10,025 INFO L74 IsIncluded]: Start isIncluded. First operand 233 states. Second operand has 194 states, 169 states have (on average 1.4792899408284024) internal successors, (250), 182 states have internal predecessors, (250), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:10,027 INFO L87 Difference]: Start difference. First operand 233 states. Second operand has 194 states, 169 states have (on average 1.4792899408284024) internal successors, (250), 182 states have internal predecessors, (250), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:10,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:10,033 INFO L93 Difference]: Finished difference Result 233 states and 319 transitions. [2022-02-21 03:10:10,033 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 319 transitions. [2022-02-21 03:10:10,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:10,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:10,034 INFO L74 IsIncluded]: Start isIncluded. First operand has 194 states, 169 states have (on average 1.4792899408284024) internal successors, (250), 182 states have internal predecessors, (250), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 233 states. [2022-02-21 03:10:10,035 INFO L87 Difference]: Start difference. First operand has 194 states, 169 states have (on average 1.4792899408284024) internal successors, (250), 182 states have internal predecessors, (250), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 233 states. [2022-02-21 03:10:10,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:10,040 INFO L93 Difference]: Finished difference Result 233 states and 319 transitions. [2022-02-21 03:10:10,040 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 319 transitions. [2022-02-21 03:10:10,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:10,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:10,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:10,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:10,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 169 states have (on average 1.4792899408284024) internal successors, (250), 182 states have internal predecessors, (250), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:10,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 263 transitions. [2022-02-21 03:10:10,046 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 263 transitions. Word has length 23 [2022-02-21 03:10:10,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:10,046 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 263 transitions. [2022-02-21 03:10:10,047 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:10,047 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 263 transitions. [2022-02-21 03:10:10,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-21 03:10:10,047 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:10,048 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:10,072 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:10,263 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,SelfDestructingSolverStorable9 [2022-02-21 03:10:10,263 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:10,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:10,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1990531529, now seen corresponding path program 1 times [2022-02-21 03:10:10,264 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:10,264 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423413089] [2022-02-21 03:10:10,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:10,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:10,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:10,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:10,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {9696#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9681#true} is VALID [2022-02-21 03:10:10,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {9681#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {9681#true} is VALID [2022-02-21 03:10:10,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {9681#true} #res := ~__retres4~0; {9681#true} is VALID [2022-02-21 03:10:10,328 INFO L290 TraceCheckUtils]: 3: Hoare triple {9681#true} assume true; {9681#true} is VALID [2022-02-21 03:10:10,329 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {9681#true} {9683#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} #354#return; {9683#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:10:10,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:10,336 INFO L290 TraceCheckUtils]: 0: Hoare triple {9696#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9681#true} is VALID [2022-02-21 03:10:10,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {9681#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {9681#true} is VALID [2022-02-21 03:10:10,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {9681#true} #res := ~__retres4~0; {9681#true} is VALID [2022-02-21 03:10:10,337 INFO L290 TraceCheckUtils]: 3: Hoare triple {9681#true} assume true; {9681#true} is VALID [2022-02-21 03:10:10,338 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {9681#true} {9683#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} #356#return; {9683#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:10:10,338 INFO L290 TraceCheckUtils]: 0: Hoare triple {9681#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(24, 2);call #Ultimate.allocInit(12, 3); {9681#true} is VALID [2022-02-21 03:10:10,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {9681#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {9683#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:10:10,339 INFO L272 TraceCheckUtils]: 2: Hoare triple {9683#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} call main_#t~ret22#1 := base2flt(0, 0); {9696#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:10,340 INFO L290 TraceCheckUtils]: 3: Hoare triple {9696#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9681#true} is VALID [2022-02-21 03:10:10,340 INFO L290 TraceCheckUtils]: 4: Hoare triple {9681#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {9681#true} is VALID [2022-02-21 03:10:10,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {9681#true} #res := ~__retres4~0; {9681#true} is VALID [2022-02-21 03:10:10,340 INFO L290 TraceCheckUtils]: 6: Hoare triple {9681#true} assume true; {9681#true} is VALID [2022-02-21 03:10:10,341 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {9681#true} {9683#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} #354#return; {9683#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:10:10,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {9683#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {9683#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:10:10,342 INFO L272 TraceCheckUtils]: 9: Hoare triple {9683#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {9696#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:10,342 INFO L290 TraceCheckUtils]: 10: Hoare triple {9696#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9681#true} is VALID [2022-02-21 03:10:10,342 INFO L290 TraceCheckUtils]: 11: Hoare triple {9681#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {9681#true} is VALID [2022-02-21 03:10:10,343 INFO L290 TraceCheckUtils]: 12: Hoare triple {9681#true} #res := ~__retres4~0; {9681#true} is VALID [2022-02-21 03:10:10,343 INFO L290 TraceCheckUtils]: 13: Hoare triple {9681#true} assume true; {9681#true} is VALID [2022-02-21 03:10:10,343 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {9681#true} {9683#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} #356#return; {9683#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:10:10,344 INFO L290 TraceCheckUtils]: 15: Hoare triple {9683#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {9683#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:10:10,345 INFO L272 TraceCheckUtils]: 16: Hoare triple {9683#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {9694#(<= 0 (+ 128 |base2flt_#in~e|))} is VALID [2022-02-21 03:10:10,345 INFO L290 TraceCheckUtils]: 17: Hoare triple {9694#(<= 0 (+ 128 |base2flt_#in~e|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9695#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:10,345 INFO L290 TraceCheckUtils]: 18: Hoare triple {9695#(<= 0 (+ 128 base2flt_~e))} assume !(0 == ~m % 4294967296); {9695#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:10,346 INFO L290 TraceCheckUtils]: 19: Hoare triple {9695#(<= 0 (+ 128 base2flt_~e))} assume !(~m % 4294967296 < 16777216); {9695#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:10,346 INFO L290 TraceCheckUtils]: 20: Hoare triple {9695#(<= 0 (+ 128 base2flt_~e))} assume !false; {9695#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:10,347 INFO L290 TraceCheckUtils]: 21: Hoare triple {9695#(<= 0 (+ 128 base2flt_~e))} assume ~m % 4294967296 >= 33554432; {9695#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:10,347 INFO L290 TraceCheckUtils]: 22: Hoare triple {9695#(<= 0 (+ 128 base2flt_~e))} assume !(~e >= 127); {9695#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:10,348 INFO L290 TraceCheckUtils]: 23: Hoare triple {9695#(<= 0 (+ 128 base2flt_~e))} assume 1 + ~e <= 2147483647; {9695#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:10,348 INFO L290 TraceCheckUtils]: 24: Hoare triple {9695#(<= 0 (+ 128 base2flt_~e))} assume !(1 + ~e >= -2147483648); {9682#false} is VALID [2022-02-21 03:10:10,348 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:10,348 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:10,349 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423413089] [2022-02-21 03:10:10,349 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423413089] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:10,349 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934720588] [2022-02-21 03:10:10,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:10,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:10,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:10,350 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:10,351 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:10,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:10,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:10:10,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:10,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:10,535 INFO L290 TraceCheckUtils]: 0: Hoare triple {9681#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(24, 2);call #Ultimate.allocInit(12, 3); {9681#true} is VALID [2022-02-21 03:10:10,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {9681#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {9683#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:10:10,536 INFO L272 TraceCheckUtils]: 2: Hoare triple {9683#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} call main_#t~ret22#1 := base2flt(0, 0); {9681#true} is VALID [2022-02-21 03:10:10,536 INFO L290 TraceCheckUtils]: 3: Hoare triple {9681#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9681#true} is VALID [2022-02-21 03:10:10,536 INFO L290 TraceCheckUtils]: 4: Hoare triple {9681#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {9681#true} is VALID [2022-02-21 03:10:10,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {9681#true} #res := ~__retres4~0; {9681#true} is VALID [2022-02-21 03:10:10,536 INFO L290 TraceCheckUtils]: 6: Hoare triple {9681#true} assume true; {9681#true} is VALID [2022-02-21 03:10:10,537 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {9681#true} {9683#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} #354#return; {9683#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:10:10,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {9683#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {9683#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:10:10,538 INFO L272 TraceCheckUtils]: 9: Hoare triple {9683#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {9681#true} is VALID [2022-02-21 03:10:10,538 INFO L290 TraceCheckUtils]: 10: Hoare triple {9681#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9681#true} is VALID [2022-02-21 03:10:10,538 INFO L290 TraceCheckUtils]: 11: Hoare triple {9681#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {9681#true} is VALID [2022-02-21 03:10:10,538 INFO L290 TraceCheckUtils]: 12: Hoare triple {9681#true} #res := ~__retres4~0; {9681#true} is VALID [2022-02-21 03:10:10,538 INFO L290 TraceCheckUtils]: 13: Hoare triple {9681#true} assume true; {9681#true} is VALID [2022-02-21 03:10:10,539 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {9681#true} {9683#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} #356#return; {9683#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:10:10,540 INFO L290 TraceCheckUtils]: 15: Hoare triple {9683#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {9683#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:10:10,540 INFO L272 TraceCheckUtils]: 16: Hoare triple {9683#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {9694#(<= 0 (+ 128 |base2flt_#in~e|))} is VALID [2022-02-21 03:10:10,541 INFO L290 TraceCheckUtils]: 17: Hoare triple {9694#(<= 0 (+ 128 |base2flt_#in~e|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9695#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:10,541 INFO L290 TraceCheckUtils]: 18: Hoare triple {9695#(<= 0 (+ 128 base2flt_~e))} assume !(0 == ~m % 4294967296); {9695#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:10,542 INFO L290 TraceCheckUtils]: 19: Hoare triple {9695#(<= 0 (+ 128 base2flt_~e))} assume !(~m % 4294967296 < 16777216); {9695#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:10,542 INFO L290 TraceCheckUtils]: 20: Hoare triple {9695#(<= 0 (+ 128 base2flt_~e))} assume !false; {9695#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:10,542 INFO L290 TraceCheckUtils]: 21: Hoare triple {9695#(<= 0 (+ 128 base2flt_~e))} assume ~m % 4294967296 >= 33554432; {9695#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:10,543 INFO L290 TraceCheckUtils]: 22: Hoare triple {9695#(<= 0 (+ 128 base2flt_~e))} assume !(~e >= 127); {9695#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:10,543 INFO L290 TraceCheckUtils]: 23: Hoare triple {9695#(<= 0 (+ 128 base2flt_~e))} assume 1 + ~e <= 2147483647; {9695#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:10,544 INFO L290 TraceCheckUtils]: 24: Hoare triple {9695#(<= 0 (+ 128 base2flt_~e))} assume !(1 + ~e >= -2147483648); {9682#false} is VALID [2022-02-21 03:10:10,544 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:10,544 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:10:10,544 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934720588] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:10,544 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:10:10,545 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-02-21 03:10:10,545 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127682702] [2022-02-21 03:10:10,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:10,545 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:10,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:10,546 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:10,565 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:10,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:10:10,565 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:10,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:10:10,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:10:10,566 INFO L87 Difference]: Start difference. First operand 194 states and 263 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:11,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:11,050 INFO L93 Difference]: Finished difference Result 224 states and 303 transitions. [2022-02-21 03:10:11,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:10:11,050 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:11,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:11,050 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:11,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 214 transitions. [2022-02-21 03:10:11,052 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:11,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 214 transitions. [2022-02-21 03:10:11,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 214 transitions. [2022-02-21 03:10:11,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 214 edges. 214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:11,225 INFO L225 Difference]: With dead ends: 224 [2022-02-21 03:10:11,225 INFO L226 Difference]: Without dead ends: 221 [2022-02-21 03:10:11,226 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:11,226 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 96 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:11,227 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 487 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:10:11,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-02-21 03:10:11,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 183. [2022-02-21 03:10:11,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:11,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 221 states. Second operand has 183 states, 161 states have (on average 1.4596273291925466) internal successors, (235), 171 states have internal predecessors, (235), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:11,303 INFO L74 IsIncluded]: Start isIncluded. First operand 221 states. Second operand has 183 states, 161 states have (on average 1.4596273291925466) internal successors, (235), 171 states have internal predecessors, (235), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:11,303 INFO L87 Difference]: Start difference. First operand 221 states. Second operand has 183 states, 161 states have (on average 1.4596273291925466) internal successors, (235), 171 states have internal predecessors, (235), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:11,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:11,308 INFO L93 Difference]: Finished difference Result 221 states and 300 transitions. [2022-02-21 03:10:11,308 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 300 transitions. [2022-02-21 03:10:11,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:11,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:11,309 INFO L74 IsIncluded]: Start isIncluded. First operand has 183 states, 161 states have (on average 1.4596273291925466) internal successors, (235), 171 states have internal predecessors, (235), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 221 states. [2022-02-21 03:10:11,309 INFO L87 Difference]: Start difference. First operand has 183 states, 161 states have (on average 1.4596273291925466) internal successors, (235), 171 states have internal predecessors, (235), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 221 states. [2022-02-21 03:10:11,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:11,314 INFO L93 Difference]: Finished difference Result 221 states and 300 transitions. [2022-02-21 03:10:11,314 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 300 transitions. [2022-02-21 03:10:11,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:11,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:11,315 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:11,315 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:11,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 161 states have (on average 1.4596273291925466) internal successors, (235), 171 states have internal predecessors, (235), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:11,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 248 transitions. [2022-02-21 03:10:11,319 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 248 transitions. Word has length 25 [2022-02-21 03:10:11,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:11,319 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 248 transitions. [2022-02-21 03:10:11,320 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:11,320 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 248 transitions. [2022-02-21 03:10:11,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-21 03:10:11,320 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:11,321 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:11,347 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:11,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:11,536 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:11,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:11,536 INFO L85 PathProgramCache]: Analyzing trace with hash 962021647, now seen corresponding path program 1 times [2022-02-21 03:10:11,536 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:11,536 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880916235] [2022-02-21 03:10:11,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:11,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:11,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:11,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:11,627 INFO L290 TraceCheckUtils]: 0: Hoare triple {10709#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {10687#true} is VALID [2022-02-21 03:10:11,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {10687#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {10687#true} is VALID [2022-02-21 03:10:11,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {10687#true} #res := ~__retres4~0; {10687#true} is VALID [2022-02-21 03:10:11,627 INFO L290 TraceCheckUtils]: 3: Hoare triple {10687#true} assume true; {10687#true} is VALID [2022-02-21 03:10:11,627 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10687#true} {10687#true} #354#return; {10687#true} is VALID [2022-02-21 03:10:11,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:11,672 INFO L290 TraceCheckUtils]: 0: Hoare triple {10709#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {10687#true} is VALID [2022-02-21 03:10:11,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {10687#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {10710#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:11,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {10710#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {10711#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:11,674 INFO L290 TraceCheckUtils]: 3: Hoare triple {10711#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {10711#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:11,677 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10711#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {10687#true} #356#return; {10699#(= |ULTIMATE.start_main_#t~ret23#1| 0)} is VALID [2022-02-21 03:10:11,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-21 03:10:11,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:11,684 INFO L290 TraceCheckUtils]: 0: Hoare triple {10709#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {10687#true} is VALID [2022-02-21 03:10:11,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {10687#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {10687#true} is VALID [2022-02-21 03:10:11,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {10687#true} #res := ~__retres4~0; {10687#true} is VALID [2022-02-21 03:10:11,684 INFO L290 TraceCheckUtils]: 3: Hoare triple {10687#true} assume true; {10687#true} is VALID [2022-02-21 03:10:11,691 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10687#true} {10700#(= |ULTIMATE.start_main_~a~0#1| 0)} #358#return; {10700#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:11,692 INFO L290 TraceCheckUtils]: 0: Hoare triple {10687#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(24, 2);call #Ultimate.allocInit(12, 3); {10687#true} is VALID [2022-02-21 03:10:11,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {10687#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {10687#true} is VALID [2022-02-21 03:10:11,693 INFO L272 TraceCheckUtils]: 2: Hoare triple {10687#true} call main_#t~ret22#1 := base2flt(0, 0); {10709#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:11,693 INFO L290 TraceCheckUtils]: 3: Hoare triple {10709#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {10687#true} is VALID [2022-02-21 03:10:11,693 INFO L290 TraceCheckUtils]: 4: Hoare triple {10687#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {10687#true} is VALID [2022-02-21 03:10:11,693 INFO L290 TraceCheckUtils]: 5: Hoare triple {10687#true} #res := ~__retres4~0; {10687#true} is VALID [2022-02-21 03:10:11,693 INFO L290 TraceCheckUtils]: 6: Hoare triple {10687#true} assume true; {10687#true} is VALID [2022-02-21 03:10:11,693 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10687#true} {10687#true} #354#return; {10687#true} is VALID [2022-02-21 03:10:11,694 INFO L290 TraceCheckUtils]: 8: Hoare triple {10687#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {10687#true} is VALID [2022-02-21 03:10:11,694 INFO L272 TraceCheckUtils]: 9: Hoare triple {10687#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {10709#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:11,695 INFO L290 TraceCheckUtils]: 10: Hoare triple {10709#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {10687#true} is VALID [2022-02-21 03:10:11,699 INFO L290 TraceCheckUtils]: 11: Hoare triple {10687#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {10710#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:11,699 INFO L290 TraceCheckUtils]: 12: Hoare triple {10710#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {10711#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:11,700 INFO L290 TraceCheckUtils]: 13: Hoare triple {10711#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {10711#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:11,701 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {10711#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {10687#true} #356#return; {10699#(= |ULTIMATE.start_main_#t~ret23#1| 0)} is VALID [2022-02-21 03:10:11,702 INFO L290 TraceCheckUtils]: 15: Hoare triple {10699#(= |ULTIMATE.start_main_#t~ret23#1| 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {10700#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:11,702 INFO L272 TraceCheckUtils]: 16: Hoare triple {10700#(= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {10709#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:11,703 INFO L290 TraceCheckUtils]: 17: Hoare triple {10709#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {10687#true} is VALID [2022-02-21 03:10:11,703 INFO L290 TraceCheckUtils]: 18: Hoare triple {10687#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {10687#true} is VALID [2022-02-21 03:10:11,703 INFO L290 TraceCheckUtils]: 19: Hoare triple {10687#true} #res := ~__retres4~0; {10687#true} is VALID [2022-02-21 03:10:11,703 INFO L290 TraceCheckUtils]: 20: Hoare triple {10687#true} assume true; {10687#true} is VALID [2022-02-21 03:10:11,704 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10687#true} {10700#(= |ULTIMATE.start_main_~a~0#1| 0)} #358#return; {10700#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:11,704 INFO L290 TraceCheckUtils]: 22: Hoare triple {10700#(= |ULTIMATE.start_main_~a~0#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {10700#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:11,705 INFO L272 TraceCheckUtils]: 23: Hoare triple {10700#(= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {10706#(= |addflt_#in~a| 0)} is VALID [2022-02-21 03:10:11,706 INFO L290 TraceCheckUtils]: 24: Hoare triple {10706#(= |addflt_#in~a| 0)} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {10707#(= addflt_~a 0)} is VALID [2022-02-21 03:10:11,706 INFO L290 TraceCheckUtils]: 25: Hoare triple {10707#(= addflt_~a 0)} assume ~a % 4294967296 < ~b % 4294967296;~tmp~0 := ~a;~a := ~b;~b := ~tmp~0; {10708#(= addflt_~b 0)} is VALID [2022-02-21 03:10:11,707 INFO L290 TraceCheckUtils]: 26: Hoare triple {10708#(= addflt_~b 0)} assume !(0 == ~b % 4294967296); {10688#false} is VALID [2022-02-21 03:10:11,707 INFO L290 TraceCheckUtils]: 27: Hoare triple {10688#false} assume 0 == ~a;~ma~0 := 0; {10688#false} is VALID [2022-02-21 03:10:11,707 INFO L290 TraceCheckUtils]: 28: Hoare triple {10688#false} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {10688#false} is VALID [2022-02-21 03:10:11,707 INFO L290 TraceCheckUtils]: 29: Hoare triple {10688#false} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {10688#false} is VALID [2022-02-21 03:10:11,708 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-21 03:10:11,708 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:11,708 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880916235] [2022-02-21 03:10:11,708 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880916235] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:11,708 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771962358] [2022-02-21 03:10:11,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:11,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:11,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:11,710 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:11,714 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:11,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:11,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-21 03:10:11,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:11,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:11,955 INFO L290 TraceCheckUtils]: 0: Hoare triple {10687#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(24, 2);call #Ultimate.allocInit(12, 3); {10687#true} is VALID [2022-02-21 03:10:11,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {10687#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {10687#true} is VALID [2022-02-21 03:10:11,955 INFO L272 TraceCheckUtils]: 2: Hoare triple {10687#true} call main_#t~ret22#1 := base2flt(0, 0); {10687#true} is VALID [2022-02-21 03:10:11,955 INFO L290 TraceCheckUtils]: 3: Hoare triple {10687#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {10724#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:11,959 INFO L290 TraceCheckUtils]: 4: Hoare triple {10724#(= base2flt_~m |base2flt_#in~m|)} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {10728#(<= (mod |base2flt_#in~m| 4294967296) 0)} is VALID [2022-02-21 03:10:11,960 INFO L290 TraceCheckUtils]: 5: Hoare triple {10728#(<= (mod |base2flt_#in~m| 4294967296) 0)} #res := ~__retres4~0; {10728#(<= (mod |base2flt_#in~m| 4294967296) 0)} is VALID [2022-02-21 03:10:11,961 INFO L290 TraceCheckUtils]: 6: Hoare triple {10728#(<= (mod |base2flt_#in~m| 4294967296) 0)} assume true; {10728#(<= (mod |base2flt_#in~m| 4294967296) 0)} is VALID [2022-02-21 03:10:11,962 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10728#(<= (mod |base2flt_#in~m| 4294967296) 0)} {10687#true} #354#return; {10687#true} is VALID [2022-02-21 03:10:11,962 INFO L290 TraceCheckUtils]: 8: Hoare triple {10687#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {10687#true} is VALID [2022-02-21 03:10:11,962 INFO L272 TraceCheckUtils]: 9: Hoare triple {10687#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {10687#true} is VALID [2022-02-21 03:10:11,962 INFO L290 TraceCheckUtils]: 10: Hoare triple {10687#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {10687#true} is VALID [2022-02-21 03:10:11,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {10687#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {10710#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:11,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {10710#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {10711#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:11,963 INFO L290 TraceCheckUtils]: 13: Hoare triple {10711#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {10711#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:11,964 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {10711#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {10687#true} #356#return; {10699#(= |ULTIMATE.start_main_#t~ret23#1| 0)} is VALID [2022-02-21 03:10:11,965 INFO L290 TraceCheckUtils]: 15: Hoare triple {10699#(= |ULTIMATE.start_main_#t~ret23#1| 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {10700#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:11,965 INFO L272 TraceCheckUtils]: 16: Hoare triple {10700#(= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {10687#true} is VALID [2022-02-21 03:10:11,965 INFO L290 TraceCheckUtils]: 17: Hoare triple {10687#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {10687#true} is VALID [2022-02-21 03:10:11,965 INFO L290 TraceCheckUtils]: 18: Hoare triple {10687#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {10687#true} is VALID [2022-02-21 03:10:11,965 INFO L290 TraceCheckUtils]: 19: Hoare triple {10687#true} #res := ~__retres4~0; {10687#true} is VALID [2022-02-21 03:10:11,965 INFO L290 TraceCheckUtils]: 20: Hoare triple {10687#true} assume true; {10687#true} is VALID [2022-02-21 03:10:11,966 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10687#true} {10700#(= |ULTIMATE.start_main_~a~0#1| 0)} #358#return; {10700#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:11,966 INFO L290 TraceCheckUtils]: 22: Hoare triple {10700#(= |ULTIMATE.start_main_~a~0#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {10700#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:11,967 INFO L272 TraceCheckUtils]: 23: Hoare triple {10700#(= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {10706#(= |addflt_#in~a| 0)} is VALID [2022-02-21 03:10:11,967 INFO L290 TraceCheckUtils]: 24: Hoare triple {10706#(= |addflt_#in~a| 0)} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {10707#(= addflt_~a 0)} is VALID [2022-02-21 03:10:11,968 INFO L290 TraceCheckUtils]: 25: Hoare triple {10707#(= addflt_~a 0)} assume ~a % 4294967296 < ~b % 4294967296;~tmp~0 := ~a;~a := ~b;~b := ~tmp~0; {10708#(= addflt_~b 0)} is VALID [2022-02-21 03:10:11,968 INFO L290 TraceCheckUtils]: 26: Hoare triple {10708#(= addflt_~b 0)} assume !(0 == ~b % 4294967296); {10688#false} is VALID [2022-02-21 03:10:11,968 INFO L290 TraceCheckUtils]: 27: Hoare triple {10688#false} assume 0 == ~a;~ma~0 := 0; {10688#false} is VALID [2022-02-21 03:10:11,968 INFO L290 TraceCheckUtils]: 28: Hoare triple {10688#false} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {10688#false} is VALID [2022-02-21 03:10:11,968 INFO L290 TraceCheckUtils]: 29: Hoare triple {10688#false} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {10688#false} is VALID [2022-02-21 03:10:11,969 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-21 03:10:11,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:10:12,234 INFO L290 TraceCheckUtils]: 29: Hoare triple {10688#false} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {10688#false} is VALID [2022-02-21 03:10:12,235 INFO L290 TraceCheckUtils]: 28: Hoare triple {10688#false} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {10688#false} is VALID [2022-02-21 03:10:12,235 INFO L290 TraceCheckUtils]: 27: Hoare triple {10688#false} assume 0 == ~a;~ma~0 := 0; {10688#false} is VALID [2022-02-21 03:10:12,239 INFO L290 TraceCheckUtils]: 26: Hoare triple {10813#(= (mod addflt_~b 4294967296) 0)} assume !(0 == ~b % 4294967296); {10688#false} is VALID [2022-02-21 03:10:12,240 INFO L290 TraceCheckUtils]: 25: Hoare triple {10817#(= (mod addflt_~a 4294967296) 0)} assume ~a % 4294967296 < ~b % 4294967296;~tmp~0 := ~a;~a := ~b;~b := ~tmp~0; {10813#(= (mod addflt_~b 4294967296) 0)} is VALID [2022-02-21 03:10:12,240 INFO L290 TraceCheckUtils]: 24: Hoare triple {10821#(= (mod |addflt_#in~a| 4294967296) 0)} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {10817#(= (mod addflt_~a 4294967296) 0)} is VALID [2022-02-21 03:10:12,241 INFO L272 TraceCheckUtils]: 23: Hoare triple {10825#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {10821#(= (mod |addflt_#in~a| 4294967296) 0)} is VALID [2022-02-21 03:10:12,242 INFO L290 TraceCheckUtils]: 22: Hoare triple {10825#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {10825#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:12,242 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10687#true} {10825#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} #358#return; {10825#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:12,242 INFO L290 TraceCheckUtils]: 20: Hoare triple {10687#true} assume true; {10687#true} is VALID [2022-02-21 03:10:12,243 INFO L290 TraceCheckUtils]: 19: Hoare triple {10687#true} #res := ~__retres4~0; {10687#true} is VALID [2022-02-21 03:10:12,243 INFO L290 TraceCheckUtils]: 18: Hoare triple {10687#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {10687#true} is VALID [2022-02-21 03:10:12,243 INFO L290 TraceCheckUtils]: 17: Hoare triple {10687#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {10687#true} is VALID [2022-02-21 03:10:12,243 INFO L272 TraceCheckUtils]: 16: Hoare triple {10825#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {10687#true} is VALID [2022-02-21 03:10:12,243 INFO L290 TraceCheckUtils]: 15: Hoare triple {10850#(= (mod |ULTIMATE.start_main_#t~ret23#1| 4294967296) 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {10825#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:12,244 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {10857#(= (mod |base2flt_#res| 4294967296) 0)} {10687#true} #356#return; {10850#(= (mod |ULTIMATE.start_main_#t~ret23#1| 4294967296) 0)} is VALID [2022-02-21 03:10:12,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {10857#(= (mod |base2flt_#res| 4294967296) 0)} assume true; {10857#(= (mod |base2flt_#res| 4294967296) 0)} is VALID [2022-02-21 03:10:12,245 INFO L290 TraceCheckUtils]: 12: Hoare triple {10864#(= (mod base2flt_~__retres4~0 4294967296) 0)} #res := ~__retres4~0; {10857#(= (mod |base2flt_#res| 4294967296) 0)} is VALID [2022-02-21 03:10:12,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {10687#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {10864#(= (mod base2flt_~__retres4~0 4294967296) 0)} is VALID [2022-02-21 03:10:12,245 INFO L290 TraceCheckUtils]: 10: Hoare triple {10687#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {10687#true} is VALID [2022-02-21 03:10:12,245 INFO L272 TraceCheckUtils]: 9: Hoare triple {10687#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {10687#true} is VALID [2022-02-21 03:10:12,246 INFO L290 TraceCheckUtils]: 8: Hoare triple {10687#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {10687#true} is VALID [2022-02-21 03:10:12,246 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10687#true} {10687#true} #354#return; {10687#true} is VALID [2022-02-21 03:10:12,246 INFO L290 TraceCheckUtils]: 6: Hoare triple {10687#true} assume true; {10687#true} is VALID [2022-02-21 03:10:12,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {10687#true} #res := ~__retres4~0; {10687#true} is VALID [2022-02-21 03:10:12,246 INFO L290 TraceCheckUtils]: 4: Hoare triple {10687#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {10687#true} is VALID [2022-02-21 03:10:12,246 INFO L290 TraceCheckUtils]: 3: Hoare triple {10687#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {10687#true} is VALID [2022-02-21 03:10:12,246 INFO L272 TraceCheckUtils]: 2: Hoare triple {10687#true} call main_#t~ret22#1 := base2flt(0, 0); {10687#true} is VALID [2022-02-21 03:10:12,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {10687#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {10687#true} is VALID [2022-02-21 03:10:12,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {10687#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(24, 2);call #Ultimate.allocInit(12, 3); {10687#true} is VALID [2022-02-21 03:10:12,247 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-21 03:10:12,247 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771962358] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:10:12,247 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:10:12,247 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 19 [2022-02-21 03:10:12,247 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244970886] [2022-02-21 03:10:12,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:10:12,248 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 14 states have internal predecessors, (31), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 30 [2022-02-21 03:10:12,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:12,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 14 states have internal predecessors, (31), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:12,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:12,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-21 03:10:12,288 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:12,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-21 03:10:12,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2022-02-21 03:10:12,289 INFO L87 Difference]: Start difference. First operand 183 states and 248 transitions. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 14 states have internal predecessors, (31), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:16,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:16,210 INFO L93 Difference]: Finished difference Result 601 states and 801 transitions. [2022-02-21 03:10:16,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-21 03:10:16,211 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 14 states have internal predecessors, (31), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 30 [2022-02-21 03:10:16,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:16,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 14 states have internal predecessors, (31), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:16,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 572 transitions. [2022-02-21 03:10:16,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 14 states have internal predecessors, (31), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:16,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 572 transitions. [2022-02-21 03:10:16,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 572 transitions. [2022-02-21 03:10:16,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 572 edges. 572 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:16,755 INFO L225 Difference]: With dead ends: 601 [2022-02-21 03:10:16,755 INFO L226 Difference]: Without dead ends: 423 [2022-02-21 03:10:16,756 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=187, Invalid=1145, Unknown=0, NotChecked=0, Total=1332 [2022-02-21 03:10:16,757 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 766 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 1720 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 1783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:16,757 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [770 Valid, 615 Invalid, 1783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1720 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-02-21 03:10:16,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-02-21 03:10:16,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 155. [2022-02-21 03:10:16,823 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:16,824 INFO L82 GeneralOperation]: Start isEquivalent. First operand 423 states. Second operand has 155 states, 129 states have (on average 1.426356589147287) internal successors, (184), 140 states have internal predecessors, (184), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-02-21 03:10:16,824 INFO L74 IsIncluded]: Start isIncluded. First operand 423 states. Second operand has 155 states, 129 states have (on average 1.426356589147287) internal successors, (184), 140 states have internal predecessors, (184), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-02-21 03:10:16,824 INFO L87 Difference]: Start difference. First operand 423 states. Second operand has 155 states, 129 states have (on average 1.426356589147287) internal successors, (184), 140 states have internal predecessors, (184), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-02-21 03:10:16,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:16,838 INFO L93 Difference]: Finished difference Result 423 states and 552 transitions. [2022-02-21 03:10:16,838 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 552 transitions. [2022-02-21 03:10:16,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:16,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:16,841 INFO L74 IsIncluded]: Start isIncluded. First operand has 155 states, 129 states have (on average 1.426356589147287) internal successors, (184), 140 states have internal predecessors, (184), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Second operand 423 states. [2022-02-21 03:10:16,841 INFO L87 Difference]: Start difference. First operand has 155 states, 129 states have (on average 1.426356589147287) internal successors, (184), 140 states have internal predecessors, (184), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Second operand 423 states. [2022-02-21 03:10:16,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:16,856 INFO L93 Difference]: Finished difference Result 423 states and 552 transitions. [2022-02-21 03:10:16,856 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 552 transitions. [2022-02-21 03:10:16,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:16,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:16,859 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:16,859 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:16,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 129 states have (on average 1.426356589147287) internal successors, (184), 140 states have internal predecessors, (184), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-02-21 03:10:16,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 202 transitions. [2022-02-21 03:10:16,862 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 202 transitions. Word has length 30 [2022-02-21 03:10:16,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:16,863 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 202 transitions. [2022-02-21 03:10:16,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 14 states have internal predecessors, (31), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:16,863 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 202 transitions. [2022-02-21 03:10:16,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-21 03:10:16,866 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:16,866 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2022-02-21 03:10:16,892 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:17,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:17,093 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:17,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:17,094 INFO L85 PathProgramCache]: Analyzing trace with hash 217587920, now seen corresponding path program 1 times [2022-02-21 03:10:17,094 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:17,094 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405708912] [2022-02-21 03:10:17,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:17,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:17,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:17,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:17,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:17,179 INFO L290 TraceCheckUtils]: 0: Hoare triple {12678#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12652#true} is VALID [2022-02-21 03:10:17,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {12652#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {12652#true} is VALID [2022-02-21 03:10:17,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {12652#true} #res := ~__retres4~0; {12652#true} is VALID [2022-02-21 03:10:17,180 INFO L290 TraceCheckUtils]: 3: Hoare triple {12652#true} assume true; {12652#true} is VALID [2022-02-21 03:10:17,180 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {12652#true} {12652#true} #354#return; {12652#true} is VALID [2022-02-21 03:10:17,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:17,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:17,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {12678#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12652#true} is VALID [2022-02-21 03:10:17,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {12652#true} assume !(0 == ~m % 4294967296); {12652#true} is VALID [2022-02-21 03:10:17,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {12652#true} assume !(~m % 4294967296 < 16777216); {12652#true} is VALID [2022-02-21 03:10:17,191 INFO L290 TraceCheckUtils]: 3: Hoare triple {12652#true} assume !false; {12652#true} is VALID [2022-02-21 03:10:17,191 INFO L290 TraceCheckUtils]: 4: Hoare triple {12652#true} assume ~m % 4294967296 >= 33554432; {12652#true} is VALID [2022-02-21 03:10:17,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {12652#true} assume ~e >= 127;~__retres4~0 := 4294967295; {12652#true} is VALID [2022-02-21 03:10:17,191 INFO L290 TraceCheckUtils]: 6: Hoare triple {12652#true} #res := ~__retres4~0; {12652#true} is VALID [2022-02-21 03:10:17,192 INFO L290 TraceCheckUtils]: 7: Hoare triple {12652#true} assume true; {12652#true} is VALID [2022-02-21 03:10:17,192 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {12652#true} {12652#true} #356#return; {12652#true} is VALID [2022-02-21 03:10:17,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-21 03:10:17,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:17,232 INFO L290 TraceCheckUtils]: 0: Hoare triple {12678#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12652#true} is VALID [2022-02-21 03:10:17,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {12652#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {12679#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:17,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {12679#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {12680#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:17,234 INFO L290 TraceCheckUtils]: 3: Hoare triple {12680#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {12680#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:17,235 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {12680#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {12652#true} #358#return; {12673#(= |ULTIMATE.start_main_#t~ret24#1| 0)} is VALID [2022-02-21 03:10:17,235 INFO L290 TraceCheckUtils]: 0: Hoare triple {12652#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(24, 2);call #Ultimate.allocInit(12, 3); {12652#true} is VALID [2022-02-21 03:10:17,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {12652#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {12652#true} is VALID [2022-02-21 03:10:17,236 INFO L272 TraceCheckUtils]: 2: Hoare triple {12652#true} call main_#t~ret22#1 := base2flt(0, 0); {12678#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:17,236 INFO L290 TraceCheckUtils]: 3: Hoare triple {12678#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12652#true} is VALID [2022-02-21 03:10:17,236 INFO L290 TraceCheckUtils]: 4: Hoare triple {12652#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {12652#true} is VALID [2022-02-21 03:10:17,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {12652#true} #res := ~__retres4~0; {12652#true} is VALID [2022-02-21 03:10:17,237 INFO L290 TraceCheckUtils]: 6: Hoare triple {12652#true} assume true; {12652#true} is VALID [2022-02-21 03:10:17,237 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {12652#true} {12652#true} #354#return; {12652#true} is VALID [2022-02-21 03:10:17,237 INFO L290 TraceCheckUtils]: 8: Hoare triple {12652#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {12652#true} is VALID [2022-02-21 03:10:17,238 INFO L272 TraceCheckUtils]: 9: Hoare triple {12652#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {12678#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:17,238 INFO L290 TraceCheckUtils]: 10: Hoare triple {12678#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12652#true} is VALID [2022-02-21 03:10:17,238 INFO L290 TraceCheckUtils]: 11: Hoare triple {12652#true} assume !(0 == ~m % 4294967296); {12652#true} is VALID [2022-02-21 03:10:17,238 INFO L290 TraceCheckUtils]: 12: Hoare triple {12652#true} assume !(~m % 4294967296 < 16777216); {12652#true} is VALID [2022-02-21 03:10:17,238 INFO L290 TraceCheckUtils]: 13: Hoare triple {12652#true} assume !false; {12652#true} is VALID [2022-02-21 03:10:17,239 INFO L290 TraceCheckUtils]: 14: Hoare triple {12652#true} assume ~m % 4294967296 >= 33554432; {12652#true} is VALID [2022-02-21 03:10:17,239 INFO L290 TraceCheckUtils]: 15: Hoare triple {12652#true} assume ~e >= 127;~__retres4~0 := 4294967295; {12652#true} is VALID [2022-02-21 03:10:17,239 INFO L290 TraceCheckUtils]: 16: Hoare triple {12652#true} #res := ~__retres4~0; {12652#true} is VALID [2022-02-21 03:10:17,239 INFO L290 TraceCheckUtils]: 17: Hoare triple {12652#true} assume true; {12652#true} is VALID [2022-02-21 03:10:17,239 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12652#true} {12652#true} #356#return; {12652#true} is VALID [2022-02-21 03:10:17,239 INFO L290 TraceCheckUtils]: 19: Hoare triple {12652#true} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {12652#true} is VALID [2022-02-21 03:10:17,240 INFO L272 TraceCheckUtils]: 20: Hoare triple {12652#true} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {12678#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:17,240 INFO L290 TraceCheckUtils]: 21: Hoare triple {12678#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12652#true} is VALID [2022-02-21 03:10:17,240 INFO L290 TraceCheckUtils]: 22: Hoare triple {12652#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {12679#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:17,241 INFO L290 TraceCheckUtils]: 23: Hoare triple {12679#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {12680#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:17,241 INFO L290 TraceCheckUtils]: 24: Hoare triple {12680#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {12680#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:17,242 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {12680#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {12652#true} #358#return; {12673#(= |ULTIMATE.start_main_#t~ret24#1| 0)} is VALID [2022-02-21 03:10:17,243 INFO L290 TraceCheckUtils]: 26: Hoare triple {12673#(= |ULTIMATE.start_main_#t~ret24#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {12674#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-21 03:10:17,243 INFO L272 TraceCheckUtils]: 27: Hoare triple {12674#(= |ULTIMATE.start_main_~b~0#1| 0)} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {12675#(= |addflt_#in~b| 0)} is VALID [2022-02-21 03:10:17,244 INFO L290 TraceCheckUtils]: 28: Hoare triple {12675#(= |addflt_#in~b| 0)} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {12676#(= addflt_~b 0)} is VALID [2022-02-21 03:10:17,244 INFO L290 TraceCheckUtils]: 29: Hoare triple {12676#(= addflt_~b 0)} assume ~a % 4294967296 < ~b % 4294967296;~tmp~0 := ~a;~a := ~b;~b := ~tmp~0; {12677#(= addflt_~a 0)} is VALID [2022-02-21 03:10:17,244 INFO L290 TraceCheckUtils]: 30: Hoare triple {12677#(= addflt_~a 0)} assume !(0 == ~b % 4294967296); {12677#(= addflt_~a 0)} is VALID [2022-02-21 03:10:17,245 INFO L290 TraceCheckUtils]: 31: Hoare triple {12677#(= addflt_~a 0)} assume !(0 == ~a); {12653#false} is VALID [2022-02-21 03:10:17,245 INFO L290 TraceCheckUtils]: 32: Hoare triple {12653#false} assume !false; {12653#false} is VALID [2022-02-21 03:10:17,245 INFO L290 TraceCheckUtils]: 33: Hoare triple {12653#false} assume !false; {12653#false} is VALID [2022-02-21 03:10:17,245 INFO L290 TraceCheckUtils]: 34: Hoare triple {12653#false} assume ~a >= 0;abs_109 := (if ~a < 16777215 then ~a else 16777215);assume ~a >= 0;assume ~ma~0 < abs_109; {12653#false} is VALID [2022-02-21 03:10:17,246 INFO L290 TraceCheckUtils]: 35: Hoare triple {12653#false} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {12653#false} is VALID [2022-02-21 03:10:17,246 INFO L290 TraceCheckUtils]: 36: Hoare triple {12653#false} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {12653#false} is VALID [2022-02-21 03:10:17,246 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-21 03:10:17,246 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:17,246 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405708912] [2022-02-21 03:10:17,247 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405708912] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:17,247 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:10:17,247 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-21 03:10:17,247 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979648915] [2022-02-21 03:10:17,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:17,248 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2022-02-21 03:10:17,248 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:17,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:17,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:17,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-21 03:10:17,274 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:17,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-21 03:10:17,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-02-21 03:10:17,275 INFO L87 Difference]: Start difference. First operand 155 states and 202 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:18,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:18,896 INFO L93 Difference]: Finished difference Result 404 states and 517 transitions. [2022-02-21 03:10:18,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 03:10:18,897 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2022-02-21 03:10:18,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:18,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:18,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 423 transitions. [2022-02-21 03:10:18,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:18,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 423 transitions. [2022-02-21 03:10:18,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 423 transitions. [2022-02-21 03:10:19,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 423 edges. 423 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:19,262 INFO L225 Difference]: With dead ends: 404 [2022-02-21 03:10:19,262 INFO L226 Difference]: Without dead ends: 330 [2022-02-21 03:10:19,263 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-02-21 03:10:19,264 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 448 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:19,264 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [451 Valid, 516 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-21 03:10:19,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-02-21 03:10:19,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 166. [2022-02-21 03:10:19,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:19,331 INFO L82 GeneralOperation]: Start isEquivalent. First operand 330 states. Second operand has 166 states, 137 states have (on average 1.4014598540145986) internal successors, (192), 149 states have internal predecessors, (192), 10 states have call successors, (10), 7 states have call predecessors, (10), 9 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-02-21 03:10:19,331 INFO L74 IsIncluded]: Start isIncluded. First operand 330 states. Second operand has 166 states, 137 states have (on average 1.4014598540145986) internal successors, (192), 149 states have internal predecessors, (192), 10 states have call successors, (10), 7 states have call predecessors, (10), 9 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-02-21 03:10:19,332 INFO L87 Difference]: Start difference. First operand 330 states. Second operand has 166 states, 137 states have (on average 1.4014598540145986) internal successors, (192), 149 states have internal predecessors, (192), 10 states have call successors, (10), 7 states have call predecessors, (10), 9 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-02-21 03:10:19,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:19,345 INFO L93 Difference]: Finished difference Result 330 states and 423 transitions. [2022-02-21 03:10:19,346 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 423 transitions. [2022-02-21 03:10:19,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:19,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:19,348 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 137 states have (on average 1.4014598540145986) internal successors, (192), 149 states have internal predecessors, (192), 10 states have call successors, (10), 7 states have call predecessors, (10), 9 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) Second operand 330 states. [2022-02-21 03:10:19,348 INFO L87 Difference]: Start difference. First operand has 166 states, 137 states have (on average 1.4014598540145986) internal successors, (192), 149 states have internal predecessors, (192), 10 states have call successors, (10), 7 states have call predecessors, (10), 9 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) Second operand 330 states. [2022-02-21 03:10:19,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:19,360 INFO L93 Difference]: Finished difference Result 330 states and 423 transitions. [2022-02-21 03:10:19,360 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 423 transitions. [2022-02-21 03:10:19,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:19,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:19,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:19,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:19,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 137 states have (on average 1.4014598540145986) internal successors, (192), 149 states have internal predecessors, (192), 10 states have call successors, (10), 7 states have call predecessors, (10), 9 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-02-21 03:10:19,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 214 transitions. [2022-02-21 03:10:19,367 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 214 transitions. Word has length 37 [2022-02-21 03:10:19,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:19,367 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 214 transitions. [2022-02-21 03:10:19,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:19,368 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 214 transitions. [2022-02-21 03:10:19,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-21 03:10:19,369 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:19,369 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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:19,369 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-21 03:10:19,370 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:19,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:19,370 INFO L85 PathProgramCache]: Analyzing trace with hash -394807024, now seen corresponding path program 1 times [2022-02-21 03:10:19,371 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:19,371 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672139436] [2022-02-21 03:10:19,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:19,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:19,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:19,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:19,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:19,450 INFO L290 TraceCheckUtils]: 0: Hoare triple {14040#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14012#true} is VALID [2022-02-21 03:10:19,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {14012#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {14012#true} is VALID [2022-02-21 03:10:19,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {14012#true} #res := ~__retres4~0; {14012#true} is VALID [2022-02-21 03:10:19,450 INFO L290 TraceCheckUtils]: 3: Hoare triple {14012#true} assume true; {14012#true} is VALID [2022-02-21 03:10:19,450 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {14012#true} {14012#true} #354#return; {14012#true} is VALID [2022-02-21 03:10:19,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:19,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:19,486 INFO L290 TraceCheckUtils]: 0: Hoare triple {14040#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14012#true} is VALID [2022-02-21 03:10:19,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {14012#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {14041#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:19,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {14041#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {14042#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:19,487 INFO L290 TraceCheckUtils]: 3: Hoare triple {14042#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {14042#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:19,488 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {14042#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {14012#true} #356#return; {14024#(= |ULTIMATE.start_main_#t~ret23#1| 0)} is VALID [2022-02-21 03:10:19,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-21 03:10:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:19,493 INFO L290 TraceCheckUtils]: 0: Hoare triple {14040#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14012#true} is VALID [2022-02-21 03:10:19,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {14012#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {14012#true} is VALID [2022-02-21 03:10:19,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {14012#true} #res := ~__retres4~0; {14012#true} is VALID [2022-02-21 03:10:19,494 INFO L290 TraceCheckUtils]: 3: Hoare triple {14012#true} assume true; {14012#true} is VALID [2022-02-21 03:10:19,495 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {14012#true} {14025#(= |ULTIMATE.start_main_~a~0#1| 0)} #358#return; {14025#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:19,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-21 03:10:19,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:19,517 INFO L290 TraceCheckUtils]: 0: Hoare triple {14043#(and (= abs_142 |old(abs_142)|) (= abs_114 |old(abs_114)|) (= abs_111 |old(abs_111)|) (= abs_141 |old(abs_141)|) (= abs_109 |old(abs_109)|) (= abs_112 |old(abs_112)|))} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {14012#true} is VALID [2022-02-21 03:10:19,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {14012#true} assume !(~a % 4294967296 < ~b % 4294967296); {14012#true} is VALID [2022-02-21 03:10:19,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {14012#true} assume 0 == ~b % 4294967296;~__retres10~0 := ~a; {14012#true} is VALID [2022-02-21 03:10:19,518 INFO L290 TraceCheckUtils]: 3: Hoare triple {14012#true} #res := ~__retres10~0; {14012#true} is VALID [2022-02-21 03:10:19,518 INFO L290 TraceCheckUtils]: 4: Hoare triple {14012#true} assume true; {14012#true} is VALID [2022-02-21 03:10:19,519 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {14012#true} {14025#(= |ULTIMATE.start_main_~a~0#1| 0)} #360#return; {14025#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:19,519 INFO L290 TraceCheckUtils]: 0: Hoare triple {14012#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(24, 2);call #Ultimate.allocInit(12, 3); {14012#true} is VALID [2022-02-21 03:10:19,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {14012#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {14012#true} is VALID [2022-02-21 03:10:19,520 INFO L272 TraceCheckUtils]: 2: Hoare triple {14012#true} call main_#t~ret22#1 := base2flt(0, 0); {14040#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:19,520 INFO L290 TraceCheckUtils]: 3: Hoare triple {14040#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14012#true} is VALID [2022-02-21 03:10:19,520 INFO L290 TraceCheckUtils]: 4: Hoare triple {14012#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {14012#true} is VALID [2022-02-21 03:10:19,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {14012#true} #res := ~__retres4~0; {14012#true} is VALID [2022-02-21 03:10:19,520 INFO L290 TraceCheckUtils]: 6: Hoare triple {14012#true} assume true; {14012#true} is VALID [2022-02-21 03:10:19,520 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14012#true} {14012#true} #354#return; {14012#true} is VALID [2022-02-21 03:10:19,521 INFO L290 TraceCheckUtils]: 8: Hoare triple {14012#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {14012#true} is VALID [2022-02-21 03:10:19,521 INFO L272 TraceCheckUtils]: 9: Hoare triple {14012#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {14040#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:19,521 INFO L290 TraceCheckUtils]: 10: Hoare triple {14040#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14012#true} is VALID [2022-02-21 03:10:19,522 INFO L290 TraceCheckUtils]: 11: Hoare triple {14012#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {14041#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:19,522 INFO L290 TraceCheckUtils]: 12: Hoare triple {14041#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {14042#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:19,523 INFO L290 TraceCheckUtils]: 13: Hoare triple {14042#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {14042#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:19,524 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {14042#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {14012#true} #356#return; {14024#(= |ULTIMATE.start_main_#t~ret23#1| 0)} is VALID [2022-02-21 03:10:19,524 INFO L290 TraceCheckUtils]: 15: Hoare triple {14024#(= |ULTIMATE.start_main_#t~ret23#1| 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {14025#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:19,525 INFO L272 TraceCheckUtils]: 16: Hoare triple {14025#(= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {14040#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:19,525 INFO L290 TraceCheckUtils]: 17: Hoare triple {14040#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14012#true} is VALID [2022-02-21 03:10:19,525 INFO L290 TraceCheckUtils]: 18: Hoare triple {14012#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {14012#true} is VALID [2022-02-21 03:10:19,525 INFO L290 TraceCheckUtils]: 19: Hoare triple {14012#true} #res := ~__retres4~0; {14012#true} is VALID [2022-02-21 03:10:19,525 INFO L290 TraceCheckUtils]: 20: Hoare triple {14012#true} assume true; {14012#true} is VALID [2022-02-21 03:10:19,526 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14012#true} {14025#(= |ULTIMATE.start_main_~a~0#1| 0)} #358#return; {14025#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:19,526 INFO L290 TraceCheckUtils]: 22: Hoare triple {14025#(= |ULTIMATE.start_main_~a~0#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {14025#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:19,527 INFO L272 TraceCheckUtils]: 23: Hoare triple {14025#(= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {14043#(and (= abs_142 |old(abs_142)|) (= abs_114 |old(abs_114)|) (= abs_111 |old(abs_111)|) (= abs_141 |old(abs_141)|) (= abs_109 |old(abs_109)|) (= abs_112 |old(abs_112)|))} is VALID [2022-02-21 03:10:19,527 INFO L290 TraceCheckUtils]: 24: Hoare triple {14043#(and (= abs_142 |old(abs_142)|) (= abs_114 |old(abs_114)|) (= abs_111 |old(abs_111)|) (= abs_141 |old(abs_141)|) (= abs_109 |old(abs_109)|) (= abs_112 |old(abs_112)|))} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {14012#true} is VALID [2022-02-21 03:10:19,527 INFO L290 TraceCheckUtils]: 25: Hoare triple {14012#true} assume !(~a % 4294967296 < ~b % 4294967296); {14012#true} is VALID [2022-02-21 03:10:19,528 INFO L290 TraceCheckUtils]: 26: Hoare triple {14012#true} assume 0 == ~b % 4294967296;~__retres10~0 := ~a; {14012#true} is VALID [2022-02-21 03:10:19,528 INFO L290 TraceCheckUtils]: 27: Hoare triple {14012#true} #res := ~__retres10~0; {14012#true} is VALID [2022-02-21 03:10:19,528 INFO L290 TraceCheckUtils]: 28: Hoare triple {14012#true} assume true; {14012#true} is VALID [2022-02-21 03:10:19,529 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {14012#true} {14025#(= |ULTIMATE.start_main_~a~0#1| 0)} #360#return; {14025#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:19,529 INFO L290 TraceCheckUtils]: 30: Hoare triple {14025#(= |ULTIMATE.start_main_~a~0#1| 0)} main_~r_add1~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {14025#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:19,530 INFO L272 TraceCheckUtils]: 31: Hoare triple {14025#(= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret26#1 := addflt(main_~b~0#1, main_~a~0#1); {14037#(= |addflt_#in~b| 0)} is VALID [2022-02-21 03:10:19,530 INFO L290 TraceCheckUtils]: 32: Hoare triple {14037#(= |addflt_#in~b| 0)} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {14038#(= addflt_~b 0)} is VALID [2022-02-21 03:10:19,530 INFO L290 TraceCheckUtils]: 33: Hoare triple {14038#(= addflt_~b 0)} assume ~a % 4294967296 < ~b % 4294967296;~tmp~0 := ~a;~a := ~b;~b := ~tmp~0; {14039#(= addflt_~a 0)} is VALID [2022-02-21 03:10:19,531 INFO L290 TraceCheckUtils]: 34: Hoare triple {14039#(= addflt_~a 0)} assume !(0 == ~b % 4294967296); {14039#(= addflt_~a 0)} is VALID [2022-02-21 03:10:19,531 INFO L290 TraceCheckUtils]: 35: Hoare triple {14039#(= addflt_~a 0)} assume !(0 == ~a); {14013#false} is VALID [2022-02-21 03:10:19,531 INFO L290 TraceCheckUtils]: 36: Hoare triple {14013#false} assume !false; {14013#false} is VALID [2022-02-21 03:10:19,531 INFO L290 TraceCheckUtils]: 37: Hoare triple {14013#false} assume !false; {14013#false} is VALID [2022-02-21 03:10:19,532 INFO L290 TraceCheckUtils]: 38: Hoare triple {14013#false} assume ~a >= 0;abs_109 := (if ~a < 16777215 then ~a else 16777215);assume ~a >= 0;assume ~ma~0 < abs_109; {14013#false} is VALID [2022-02-21 03:10:19,532 INFO L290 TraceCheckUtils]: 39: Hoare triple {14013#false} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {14013#false} is VALID [2022-02-21 03:10:19,532 INFO L290 TraceCheckUtils]: 40: Hoare triple {14013#false} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {14013#false} is VALID [2022-02-21 03:10:19,532 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-21 03:10:19,532 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:19,532 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672139436] [2022-02-21 03:10:19,533 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672139436] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:19,533 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395369650] [2022-02-21 03:10:19,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:19,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:19,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:19,534 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:19,555 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:19,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:19,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-21 03:10:19,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:19,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:19,940 INFO L290 TraceCheckUtils]: 0: Hoare triple {14012#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(24, 2);call #Ultimate.allocInit(12, 3); {14012#true} is VALID [2022-02-21 03:10:19,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {14012#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {14012#true} is VALID [2022-02-21 03:10:19,940 INFO L272 TraceCheckUtils]: 2: Hoare triple {14012#true} call main_#t~ret22#1 := base2flt(0, 0); {14012#true} is VALID [2022-02-21 03:10:19,940 INFO L290 TraceCheckUtils]: 3: Hoare triple {14012#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14012#true} is VALID [2022-02-21 03:10:19,940 INFO L290 TraceCheckUtils]: 4: Hoare triple {14012#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {14012#true} is VALID [2022-02-21 03:10:19,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {14012#true} #res := ~__retres4~0; {14012#true} is VALID [2022-02-21 03:10:19,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {14012#true} assume true; {14012#true} is VALID [2022-02-21 03:10:19,941 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14012#true} {14012#true} #354#return; {14012#true} is VALID [2022-02-21 03:10:19,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {14012#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {14012#true} is VALID [2022-02-21 03:10:19,941 INFO L272 TraceCheckUtils]: 9: Hoare triple {14012#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {14012#true} is VALID [2022-02-21 03:10:19,941 INFO L290 TraceCheckUtils]: 10: Hoare triple {14012#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14012#true} is VALID [2022-02-21 03:10:19,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {14012#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {14080#(<= base2flt_~__retres4~0 0)} is VALID [2022-02-21 03:10:19,942 INFO L290 TraceCheckUtils]: 12: Hoare triple {14080#(<= base2flt_~__retres4~0 0)} #res := ~__retres4~0; {14084#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:10:19,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {14084#(<= |base2flt_#res| 0)} assume true; {14084#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:10:19,943 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {14084#(<= |base2flt_#res| 0)} {14012#true} #356#return; {14091#(<= |ULTIMATE.start_main_#t~ret23#1| 0)} is VALID [2022-02-21 03:10:19,944 INFO L290 TraceCheckUtils]: 15: Hoare triple {14091#(<= |ULTIMATE.start_main_#t~ret23#1| 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {14095#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:19,944 INFO L272 TraceCheckUtils]: 16: Hoare triple {14095#(<= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {14012#true} is VALID [2022-02-21 03:10:19,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {14012#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14012#true} is VALID [2022-02-21 03:10:19,944 INFO L290 TraceCheckUtils]: 18: Hoare triple {14012#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {14012#true} is VALID [2022-02-21 03:10:19,944 INFO L290 TraceCheckUtils]: 19: Hoare triple {14012#true} #res := ~__retres4~0; {14012#true} is VALID [2022-02-21 03:10:19,944 INFO L290 TraceCheckUtils]: 20: Hoare triple {14012#true} assume true; {14012#true} is VALID [2022-02-21 03:10:19,945 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14012#true} {14095#(<= |ULTIMATE.start_main_~a~0#1| 0)} #358#return; {14095#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:19,945 INFO L290 TraceCheckUtils]: 22: Hoare triple {14095#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {14095#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:19,945 INFO L272 TraceCheckUtils]: 23: Hoare triple {14095#(<= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {14012#true} is VALID [2022-02-21 03:10:19,946 INFO L290 TraceCheckUtils]: 24: Hoare triple {14012#true} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {14012#true} is VALID [2022-02-21 03:10:19,946 INFO L290 TraceCheckUtils]: 25: Hoare triple {14012#true} assume !(~a % 4294967296 < ~b % 4294967296); {14012#true} is VALID [2022-02-21 03:10:19,946 INFO L290 TraceCheckUtils]: 26: Hoare triple {14012#true} assume 0 == ~b % 4294967296;~__retres10~0 := ~a; {14012#true} is VALID [2022-02-21 03:10:19,946 INFO L290 TraceCheckUtils]: 27: Hoare triple {14012#true} #res := ~__retres10~0; {14012#true} is VALID [2022-02-21 03:10:19,946 INFO L290 TraceCheckUtils]: 28: Hoare triple {14012#true} assume true; {14012#true} is VALID [2022-02-21 03:10:19,947 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {14012#true} {14095#(<= |ULTIMATE.start_main_~a~0#1| 0)} #360#return; {14095#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:19,947 INFO L290 TraceCheckUtils]: 30: Hoare triple {14095#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_~r_add1~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {14095#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:19,948 INFO L272 TraceCheckUtils]: 31: Hoare triple {14095#(<= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret26#1 := addflt(main_~b~0#1, main_~a~0#1); {14144#(<= |addflt_#in~b| 0)} is VALID [2022-02-21 03:10:19,948 INFO L290 TraceCheckUtils]: 32: Hoare triple {14144#(<= |addflt_#in~b| 0)} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {14148#(<= addflt_~b 0)} is VALID [2022-02-21 03:10:19,949 INFO L290 TraceCheckUtils]: 33: Hoare triple {14148#(<= addflt_~b 0)} assume ~a % 4294967296 < ~b % 4294967296;~tmp~0 := ~a;~a := ~b;~b := ~tmp~0; {14152#(<= addflt_~a 0)} is VALID [2022-02-21 03:10:19,949 INFO L290 TraceCheckUtils]: 34: Hoare triple {14152#(<= addflt_~a 0)} assume !(0 == ~b % 4294967296); {14152#(<= addflt_~a 0)} is VALID [2022-02-21 03:10:19,950 INFO L290 TraceCheckUtils]: 35: Hoare triple {14152#(<= addflt_~a 0)} assume !(0 == ~a); {14159#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} is VALID [2022-02-21 03:10:19,950 INFO L290 TraceCheckUtils]: 36: Hoare triple {14159#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} assume !false; {14159#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} is VALID [2022-02-21 03:10:19,950 INFO L290 TraceCheckUtils]: 37: Hoare triple {14159#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} assume !false; {14159#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} is VALID [2022-02-21 03:10:19,951 INFO L290 TraceCheckUtils]: 38: Hoare triple {14159#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} assume ~a >= 0;abs_109 := (if ~a < 16777215 then ~a else 16777215);assume ~a >= 0;assume ~ma~0 < abs_109; {14013#false} is VALID [2022-02-21 03:10:19,951 INFO L290 TraceCheckUtils]: 39: Hoare triple {14013#false} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {14013#false} is VALID [2022-02-21 03:10:19,951 INFO L290 TraceCheckUtils]: 40: Hoare triple {14013#false} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {14013#false} is VALID [2022-02-21 03:10:19,952 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-21 03:10:19,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:10:20,225 INFO L290 TraceCheckUtils]: 40: Hoare triple {14013#false} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {14013#false} is VALID [2022-02-21 03:10:20,225 INFO L290 TraceCheckUtils]: 39: Hoare triple {14013#false} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {14013#false} is VALID [2022-02-21 03:10:20,226 INFO L290 TraceCheckUtils]: 38: Hoare triple {14159#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} assume ~a >= 0;abs_109 := (if ~a < 16777215 then ~a else 16777215);assume ~a >= 0;assume ~ma~0 < abs_109; {14013#false} is VALID [2022-02-21 03:10:20,226 INFO L290 TraceCheckUtils]: 37: Hoare triple {14159#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} assume !false; {14159#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} is VALID [2022-02-21 03:10:20,227 INFO L290 TraceCheckUtils]: 36: Hoare triple {14159#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} assume !false; {14159#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} is VALID [2022-02-21 03:10:20,227 INFO L290 TraceCheckUtils]: 35: Hoare triple {14152#(<= addflt_~a 0)} assume !(0 == ~a); {14159#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} is VALID [2022-02-21 03:10:20,228 INFO L290 TraceCheckUtils]: 34: Hoare triple {14152#(<= addflt_~a 0)} assume !(0 == ~b % 4294967296); {14152#(<= addflt_~a 0)} is VALID [2022-02-21 03:10:20,228 INFO L290 TraceCheckUtils]: 33: Hoare triple {14148#(<= addflt_~b 0)} assume ~a % 4294967296 < ~b % 4294967296;~tmp~0 := ~a;~a := ~b;~b := ~tmp~0; {14152#(<= addflt_~a 0)} is VALID [2022-02-21 03:10:20,229 INFO L290 TraceCheckUtils]: 32: Hoare triple {14144#(<= |addflt_#in~b| 0)} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {14148#(<= addflt_~b 0)} is VALID [2022-02-21 03:10:20,229 INFO L272 TraceCheckUtils]: 31: Hoare triple {14095#(<= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret26#1 := addflt(main_~b~0#1, main_~a~0#1); {14144#(<= |addflt_#in~b| 0)} is VALID [2022-02-21 03:10:20,230 INFO L290 TraceCheckUtils]: 30: Hoare triple {14095#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_~r_add1~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {14095#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:20,230 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {14012#true} {14095#(<= |ULTIMATE.start_main_~a~0#1| 0)} #360#return; {14095#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:20,230 INFO L290 TraceCheckUtils]: 28: Hoare triple {14012#true} assume true; {14012#true} is VALID [2022-02-21 03:10:20,230 INFO L290 TraceCheckUtils]: 27: Hoare triple {14012#true} #res := ~__retres10~0; {14012#true} is VALID [2022-02-21 03:10:20,231 INFO L290 TraceCheckUtils]: 26: Hoare triple {14012#true} assume 0 == ~b % 4294967296;~__retres10~0 := ~a; {14012#true} is VALID [2022-02-21 03:10:20,231 INFO L290 TraceCheckUtils]: 25: Hoare triple {14012#true} assume !(~a % 4294967296 < ~b % 4294967296); {14012#true} is VALID [2022-02-21 03:10:20,231 INFO L290 TraceCheckUtils]: 24: Hoare triple {14012#true} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {14012#true} is VALID [2022-02-21 03:10:20,231 INFO L272 TraceCheckUtils]: 23: Hoare triple {14095#(<= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {14012#true} is VALID [2022-02-21 03:10:20,231 INFO L290 TraceCheckUtils]: 22: Hoare triple {14095#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {14095#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:20,232 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14012#true} {14095#(<= |ULTIMATE.start_main_~a~0#1| 0)} #358#return; {14095#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:20,232 INFO L290 TraceCheckUtils]: 20: Hoare triple {14012#true} assume true; {14012#true} is VALID [2022-02-21 03:10:20,232 INFO L290 TraceCheckUtils]: 19: Hoare triple {14012#true} #res := ~__retres4~0; {14012#true} is VALID [2022-02-21 03:10:20,233 INFO L290 TraceCheckUtils]: 18: Hoare triple {14012#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {14012#true} is VALID [2022-02-21 03:10:20,233 INFO L290 TraceCheckUtils]: 17: Hoare triple {14012#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14012#true} is VALID [2022-02-21 03:10:20,233 INFO L272 TraceCheckUtils]: 16: Hoare triple {14095#(<= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {14012#true} is VALID [2022-02-21 03:10:20,233 INFO L290 TraceCheckUtils]: 15: Hoare triple {14091#(<= |ULTIMATE.start_main_#t~ret23#1| 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {14095#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:20,234 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {14084#(<= |base2flt_#res| 0)} {14012#true} #356#return; {14091#(<= |ULTIMATE.start_main_#t~ret23#1| 0)} is VALID [2022-02-21 03:10:20,234 INFO L290 TraceCheckUtils]: 13: Hoare triple {14084#(<= |base2flt_#res| 0)} assume true; {14084#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:10:20,235 INFO L290 TraceCheckUtils]: 12: Hoare triple {14080#(<= base2flt_~__retres4~0 0)} #res := ~__retres4~0; {14084#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:10:20,235 INFO L290 TraceCheckUtils]: 11: Hoare triple {14012#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {14080#(<= base2flt_~__retres4~0 0)} is VALID [2022-02-21 03:10:20,235 INFO L290 TraceCheckUtils]: 10: Hoare triple {14012#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14012#true} is VALID [2022-02-21 03:10:20,235 INFO L272 TraceCheckUtils]: 9: Hoare triple {14012#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {14012#true} is VALID [2022-02-21 03:10:20,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {14012#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {14012#true} is VALID [2022-02-21 03:10:20,236 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14012#true} {14012#true} #354#return; {14012#true} is VALID [2022-02-21 03:10:20,237 INFO L290 TraceCheckUtils]: 6: Hoare triple {14012#true} assume true; {14012#true} is VALID [2022-02-21 03:10:20,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {14012#true} #res := ~__retres4~0; {14012#true} is VALID [2022-02-21 03:10:20,237 INFO L290 TraceCheckUtils]: 4: Hoare triple {14012#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {14012#true} is VALID [2022-02-21 03:10:20,237 INFO L290 TraceCheckUtils]: 3: Hoare triple {14012#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14012#true} is VALID [2022-02-21 03:10:20,237 INFO L272 TraceCheckUtils]: 2: Hoare triple {14012#true} call main_#t~ret22#1 := base2flt(0, 0); {14012#true} is VALID [2022-02-21 03:10:20,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {14012#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {14012#true} is VALID [2022-02-21 03:10:20,238 INFO L290 TraceCheckUtils]: 0: Hoare triple {14012#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(24, 2);call #Ultimate.allocInit(12, 3); {14012#true} is VALID [2022-02-21 03:10:20,238 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-21 03:10:20,238 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395369650] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:10:20,238 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:10:20,238 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 19 [2022-02-21 03:10:20,239 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891336058] [2022-02-21 03:10:20,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:10:20,239 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 41 [2022-02-21 03:10:20,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:20,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-21 03:10:20,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:20,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-21 03:10:20,288 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:20,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-21 03:10:20,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2022-02-21 03:10:20,288 INFO L87 Difference]: Start difference. First operand 166 states and 214 transitions. Second operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-21 03:10:27,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:27,298 INFO L93 Difference]: Finished difference Result 793 states and 1009 transitions. [2022-02-21 03:10:27,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-21 03:10:27,299 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 41 [2022-02-21 03:10:27,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:27,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-21 03:10:27,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 925 transitions. [2022-02-21 03:10:27,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-21 03:10:27,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 925 transitions. [2022-02-21 03:10:27,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 925 transitions. [2022-02-21 03:10:28,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 925 edges. 925 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:28,209 INFO L225 Difference]: With dead ends: 793 [2022-02-21 03:10:28,209 INFO L226 Difference]: Without dead ends: 704 [2022-02-21 03:10:28,210 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=213, Invalid=1193, Unknown=0, NotChecked=0, Total=1406 [2022-02-21 03:10:28,211 INFO L933 BasicCegarLoop]: 234 mSDtfsCounter, 1845 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 3086 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1847 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 3230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 3086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:28,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1847 Valid, 338 Invalid, 3230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 3086 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-02-21 03:10:28,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2022-02-21 03:10:28,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 153. [2022-02-21 03:10:28,278 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:28,278 INFO L82 GeneralOperation]: Start isEquivalent. First operand 704 states. Second operand has 153 states, 128 states have (on average 1.40625) internal successors, (180), 139 states have internal predecessors, (180), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-21 03:10:28,278 INFO L74 IsIncluded]: Start isIncluded. First operand 704 states. Second operand has 153 states, 128 states have (on average 1.40625) internal successors, (180), 139 states have internal predecessors, (180), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-21 03:10:28,279 INFO L87 Difference]: Start difference. First operand 704 states. Second operand has 153 states, 128 states have (on average 1.40625) internal successors, (180), 139 states have internal predecessors, (180), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-21 03:10:28,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:28,306 INFO L93 Difference]: Finished difference Result 704 states and 897 transitions. [2022-02-21 03:10:28,306 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 897 transitions. [2022-02-21 03:10:28,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:28,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:28,309 INFO L74 IsIncluded]: Start isIncluded. First operand has 153 states, 128 states have (on average 1.40625) internal successors, (180), 139 states have internal predecessors, (180), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Second operand 704 states. [2022-02-21 03:10:28,309 INFO L87 Difference]: Start difference. First operand has 153 states, 128 states have (on average 1.40625) internal successors, (180), 139 states have internal predecessors, (180), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Second operand 704 states. [2022-02-21 03:10:28,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:28,337 INFO L93 Difference]: Finished difference Result 704 states and 897 transitions. [2022-02-21 03:10:28,337 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 897 transitions. [2022-02-21 03:10:28,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:28,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:28,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:28,339 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:28,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 128 states have (on average 1.40625) internal successors, (180), 139 states have internal predecessors, (180), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-21 03:10:28,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 196 transitions. [2022-02-21 03:10:28,343 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 196 transitions. Word has length 41 [2022-02-21 03:10:28,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:28,343 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 196 transitions. [2022-02-21 03:10:28,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-21 03:10:28,344 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 196 transitions. [2022-02-21 03:10:28,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-21 03:10:28,344 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:28,344 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2022-02-21 03:10:28,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:10:28,559 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,SelfDestructingSolverStorable13 [2022-02-21 03:10:28,559 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:28,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:28,560 INFO L85 PathProgramCache]: Analyzing trace with hash -264308223, now seen corresponding path program 2 times [2022-02-21 03:10:28,560 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:28,560 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712190556] [2022-02-21 03:10:28,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:28,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:28,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:28,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:28,741 INFO L290 TraceCheckUtils]: 0: Hoare triple {16835#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {16804#true} is VALID [2022-02-21 03:10:28,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {16804#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {16804#true} is VALID [2022-02-21 03:10:28,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {16804#true} #res := ~__retres4~0; {16804#true} is VALID [2022-02-21 03:10:28,742 INFO L290 TraceCheckUtils]: 3: Hoare triple {16804#true} assume true; {16804#true} is VALID [2022-02-21 03:10:28,742 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {16804#true} {16804#true} #354#return; {16804#true} is VALID [2022-02-21 03:10:28,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:28,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:28,750 INFO L290 TraceCheckUtils]: 0: Hoare triple {16835#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {16804#true} is VALID [2022-02-21 03:10:28,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {16804#true} assume !(0 == ~m % 4294967296); {16804#true} is VALID [2022-02-21 03:10:28,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {16804#true} assume !(~m % 4294967296 < 16777216); {16804#true} is VALID [2022-02-21 03:10:28,751 INFO L290 TraceCheckUtils]: 3: Hoare triple {16804#true} assume !false; {16804#true} is VALID [2022-02-21 03:10:28,751 INFO L290 TraceCheckUtils]: 4: Hoare triple {16804#true} assume ~m % 4294967296 >= 33554432; {16804#true} is VALID [2022-02-21 03:10:28,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {16804#true} assume ~e >= 127;~__retres4~0 := 4294967295; {16804#true} is VALID [2022-02-21 03:10:28,751 INFO L290 TraceCheckUtils]: 6: Hoare triple {16804#true} #res := ~__retres4~0; {16804#true} is VALID [2022-02-21 03:10:28,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {16804#true} assume true; {16804#true} is VALID [2022-02-21 03:10:28,751 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {16804#true} {16804#true} #356#return; {16804#true} is VALID [2022-02-21 03:10:28,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-21 03:10:28,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:28,795 INFO L290 TraceCheckUtils]: 0: Hoare triple {16835#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {16804#true} is VALID [2022-02-21 03:10:28,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {16804#true} assume !(0 == ~m % 4294967296); {16804#true} is VALID [2022-02-21 03:10:28,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {16804#true} assume !(~m % 4294967296 < 16777216); {16804#true} is VALID [2022-02-21 03:10:28,796 INFO L290 TraceCheckUtils]: 3: Hoare triple {16804#true} assume !false; {16804#true} is VALID [2022-02-21 03:10:28,796 INFO L290 TraceCheckUtils]: 4: Hoare triple {16804#true} assume ~m % 4294967296 >= 33554432; {16804#true} is VALID [2022-02-21 03:10:28,796 INFO L290 TraceCheckUtils]: 5: Hoare triple {16804#true} assume ~e >= 127;~__retres4~0 := 4294967295; {16836#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:28,797 INFO L290 TraceCheckUtils]: 6: Hoare triple {16836#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} #res := ~__retres4~0; {16837#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:28,797 INFO L290 TraceCheckUtils]: 7: Hoare triple {16837#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} assume true; {16837#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:28,798 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {16837#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} {16804#true} #358#return; {16829#(and (<= 4294967295 |ULTIMATE.start_main_#t~ret24#1|) (<= |ULTIMATE.start_main_#t~ret24#1| 4294967295))} is VALID [2022-02-21 03:10:28,798 INFO L290 TraceCheckUtils]: 0: Hoare triple {16804#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(24, 2);call #Ultimate.allocInit(12, 3); {16804#true} is VALID [2022-02-21 03:10:28,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {16804#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {16804#true} is VALID [2022-02-21 03:10:28,799 INFO L272 TraceCheckUtils]: 2: Hoare triple {16804#true} call main_#t~ret22#1 := base2flt(0, 0); {16835#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:28,799 INFO L290 TraceCheckUtils]: 3: Hoare triple {16835#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {16804#true} is VALID [2022-02-21 03:10:28,799 INFO L290 TraceCheckUtils]: 4: Hoare triple {16804#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {16804#true} is VALID [2022-02-21 03:10:28,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {16804#true} #res := ~__retres4~0; {16804#true} is VALID [2022-02-21 03:10:28,800 INFO L290 TraceCheckUtils]: 6: Hoare triple {16804#true} assume true; {16804#true} is VALID [2022-02-21 03:10:28,800 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {16804#true} {16804#true} #354#return; {16804#true} is VALID [2022-02-21 03:10:28,800 INFO L290 TraceCheckUtils]: 8: Hoare triple {16804#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {16804#true} is VALID [2022-02-21 03:10:28,801 INFO L272 TraceCheckUtils]: 9: Hoare triple {16804#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {16835#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:28,801 INFO L290 TraceCheckUtils]: 10: Hoare triple {16835#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {16804#true} is VALID [2022-02-21 03:10:28,804 INFO L290 TraceCheckUtils]: 11: Hoare triple {16804#true} assume !(0 == ~m % 4294967296); {16804#true} is VALID [2022-02-21 03:10:28,804 INFO L290 TraceCheckUtils]: 12: Hoare triple {16804#true} assume !(~m % 4294967296 < 16777216); {16804#true} is VALID [2022-02-21 03:10:28,804 INFO L290 TraceCheckUtils]: 13: Hoare triple {16804#true} assume !false; {16804#true} is VALID [2022-02-21 03:10:28,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {16804#true} assume ~m % 4294967296 >= 33554432; {16804#true} is VALID [2022-02-21 03:10:28,804 INFO L290 TraceCheckUtils]: 15: Hoare triple {16804#true} assume ~e >= 127;~__retres4~0 := 4294967295; {16804#true} is VALID [2022-02-21 03:10:28,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {16804#true} #res := ~__retres4~0; {16804#true} is VALID [2022-02-21 03:10:28,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {16804#true} assume true; {16804#true} is VALID [2022-02-21 03:10:28,805 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {16804#true} {16804#true} #356#return; {16804#true} is VALID [2022-02-21 03:10:28,805 INFO L290 TraceCheckUtils]: 19: Hoare triple {16804#true} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {16804#true} is VALID [2022-02-21 03:10:28,806 INFO L272 TraceCheckUtils]: 20: Hoare triple {16804#true} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {16835#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:28,806 INFO L290 TraceCheckUtils]: 21: Hoare triple {16835#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {16804#true} is VALID [2022-02-21 03:10:28,806 INFO L290 TraceCheckUtils]: 22: Hoare triple {16804#true} assume !(0 == ~m % 4294967296); {16804#true} is VALID [2022-02-21 03:10:28,806 INFO L290 TraceCheckUtils]: 23: Hoare triple {16804#true} assume !(~m % 4294967296 < 16777216); {16804#true} is VALID [2022-02-21 03:10:28,806 INFO L290 TraceCheckUtils]: 24: Hoare triple {16804#true} assume !false; {16804#true} is VALID [2022-02-21 03:10:28,806 INFO L290 TraceCheckUtils]: 25: Hoare triple {16804#true} assume ~m % 4294967296 >= 33554432; {16804#true} is VALID [2022-02-21 03:10:28,807 INFO L290 TraceCheckUtils]: 26: Hoare triple {16804#true} assume ~e >= 127;~__retres4~0 := 4294967295; {16836#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:28,807 INFO L290 TraceCheckUtils]: 27: Hoare triple {16836#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} #res := ~__retres4~0; {16837#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:28,808 INFO L290 TraceCheckUtils]: 28: Hoare triple {16837#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} assume true; {16837#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:28,808 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {16837#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} {16804#true} #358#return; {16829#(and (<= 4294967295 |ULTIMATE.start_main_#t~ret24#1|) (<= |ULTIMATE.start_main_#t~ret24#1| 4294967295))} is VALID [2022-02-21 03:10:28,809 INFO L290 TraceCheckUtils]: 30: Hoare triple {16829#(and (<= 4294967295 |ULTIMATE.start_main_#t~ret24#1|) (<= |ULTIMATE.start_main_#t~ret24#1| 4294967295))} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {16830#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} is VALID [2022-02-21 03:10:28,810 INFO L272 TraceCheckUtils]: 31: Hoare triple {16830#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {16831#(and (<= 4294967295 |addflt_#in~b|) (<= |addflt_#in~b| 4294967295))} is VALID [2022-02-21 03:10:28,810 INFO L290 TraceCheckUtils]: 32: Hoare triple {16831#(and (<= 4294967295 |addflt_#in~b|) (<= |addflt_#in~b| 4294967295))} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {16832#(and (<= addflt_~b 4294967295) (<= 4294967295 addflt_~b))} is VALID [2022-02-21 03:10:28,811 INFO L290 TraceCheckUtils]: 33: Hoare triple {16832#(and (<= addflt_~b 4294967295) (<= 4294967295 addflt_~b))} assume ~a % 4294967296 < ~b % 4294967296;~tmp~0 := ~a;~a := ~b;~b := ~tmp~0; {16833#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} is VALID [2022-02-21 03:10:28,811 INFO L290 TraceCheckUtils]: 34: Hoare triple {16833#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} assume !(0 == ~b % 4294967296); {16833#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} is VALID [2022-02-21 03:10:28,812 INFO L290 TraceCheckUtils]: 35: Hoare triple {16833#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} assume !(0 == ~a); {16833#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} is VALID [2022-02-21 03:10:28,812 INFO L290 TraceCheckUtils]: 36: Hoare triple {16833#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} assume !false; {16833#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} is VALID [2022-02-21 03:10:28,813 INFO L290 TraceCheckUtils]: 37: Hoare triple {16833#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} assume !false; {16833#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} is VALID [2022-02-21 03:10:28,813 INFO L290 TraceCheckUtils]: 38: Hoare triple {16833#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} assume ~a >= 0;abs_109 := (if ~a < 16777215 then ~a else 16777215);assume ~a >= 0;assume ~ma~0 < abs_109; {16833#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} is VALID [2022-02-21 03:10:28,814 INFO L290 TraceCheckUtils]: 39: Hoare triple {16833#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {16834#(and (< 0 (+ (div (div addflt_~a 16777216) 4294967296) 1)) (<= (div addflt_~a 16777216) (+ 2147483647 (* (div (div addflt_~a 16777216) 4294967296) 4294967296))))} is VALID [2022-02-21 03:10:28,815 INFO L290 TraceCheckUtils]: 40: Hoare triple {16834#(and (< 0 (+ (div (div addflt_~a 16777216) 4294967296) 1)) (<= (div addflt_~a 16777216) (+ 2147483647 (* (div (div addflt_~a 16777216) 4294967296) 4294967296))))} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {16805#false} is VALID [2022-02-21 03:10:28,815 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-21 03:10:28,815 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:28,815 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712190556] [2022-02-21 03:10:28,815 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712190556] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:28,816 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:10:28,816 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-21 03:10:28,816 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412670888] [2022-02-21 03:10:28,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:28,818 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2022-02-21 03:10:28,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:28,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:28,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:28,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-21 03:10:28,844 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:28,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-21 03:10:28,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-02-21 03:10:28,845 INFO L87 Difference]: Start difference. First operand 153 states and 196 transitions. Second operand has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:31,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:31,764 INFO L93 Difference]: Finished difference Result 480 states and 614 transitions. [2022-02-21 03:10:31,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 03:10:31,765 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2022-02-21 03:10:31,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:31,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:31,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 530 transitions. [2022-02-21 03:10:31,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:31,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 530 transitions. [2022-02-21 03:10:31,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 530 transitions. [2022-02-21 03:10:32,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 530 edges. 530 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:32,293 INFO L225 Difference]: With dead ends: 480 [2022-02-21 03:10:32,293 INFO L226 Difference]: Without dead ends: 410 [2022-02-21 03:10:32,294 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-02-21 03:10:32,294 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 643 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 1265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:32,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [647 Valid, 706 Invalid, 1265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1220 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-21 03:10:32,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-02-21 03:10:32,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 227. [2022-02-21 03:10:32,371 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:32,371 INFO L82 GeneralOperation]: Start isEquivalent. First operand 410 states. Second operand has 227 states, 197 states have (on average 1.4060913705583757) internal successors, (277), 209 states have internal predecessors, (277), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-02-21 03:10:32,372 INFO L74 IsIncluded]: Start isIncluded. First operand 410 states. Second operand has 227 states, 197 states have (on average 1.4060913705583757) internal successors, (277), 209 states have internal predecessors, (277), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-02-21 03:10:32,372 INFO L87 Difference]: Start difference. First operand 410 states. Second operand has 227 states, 197 states have (on average 1.4060913705583757) internal successors, (277), 209 states have internal predecessors, (277), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-02-21 03:10:32,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:32,383 INFO L93 Difference]: Finished difference Result 410 states and 518 transitions. [2022-02-21 03:10:32,383 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 518 transitions. [2022-02-21 03:10:32,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:32,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:32,385 INFO L74 IsIncluded]: Start isIncluded. First operand has 227 states, 197 states have (on average 1.4060913705583757) internal successors, (277), 209 states have internal predecessors, (277), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Second operand 410 states. [2022-02-21 03:10:32,385 INFO L87 Difference]: Start difference. First operand has 227 states, 197 states have (on average 1.4060913705583757) internal successors, (277), 209 states have internal predecessors, (277), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Second operand 410 states. [2022-02-21 03:10:32,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:32,395 INFO L93 Difference]: Finished difference Result 410 states and 518 transitions. [2022-02-21 03:10:32,396 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 518 transitions. [2022-02-21 03:10:32,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:32,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:32,397 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:32,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:32,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 197 states have (on average 1.4060913705583757) internal successors, (277), 209 states have internal predecessors, (277), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-02-21 03:10:32,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 300 transitions. [2022-02-21 03:10:32,402 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 300 transitions. Word has length 41 [2022-02-21 03:10:32,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:32,402 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 300 transitions. [2022-02-21 03:10:32,402 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:32,403 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 300 transitions. [2022-02-21 03:10:32,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-21 03:10:32,403 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:32,404 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2022-02-21 03:10:32,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-21 03:10:32,404 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:32,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:32,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1073654849, now seen corresponding path program 1 times [2022-02-21 03:10:32,407 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:32,407 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655199021] [2022-02-21 03:10:32,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:32,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:32,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:32,537 INFO L290 TraceCheckUtils]: 0: Hoare triple {18494#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18464#true} is VALID [2022-02-21 03:10:32,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {18464#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {18464#true} is VALID [2022-02-21 03:10:32,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {18464#true} #res := ~__retres4~0; {18464#true} is VALID [2022-02-21 03:10:32,538 INFO L290 TraceCheckUtils]: 3: Hoare triple {18464#true} assume true; {18464#true} is VALID [2022-02-21 03:10:32,538 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {18464#true} {18464#true} #354#return; {18464#true} is VALID [2022-02-21 03:10:32,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:32,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:32,572 INFO L290 TraceCheckUtils]: 0: Hoare triple {18494#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18464#true} is VALID [2022-02-21 03:10:32,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {18464#true} assume !(0 == ~m % 4294967296); {18464#true} is VALID [2022-02-21 03:10:32,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {18464#true} assume !(~m % 4294967296 < 16777216); {18464#true} is VALID [2022-02-21 03:10:32,573 INFO L290 TraceCheckUtils]: 3: Hoare triple {18464#true} assume !false; {18464#true} is VALID [2022-02-21 03:10:32,573 INFO L290 TraceCheckUtils]: 4: Hoare triple {18464#true} assume ~m % 4294967296 >= 33554432; {18464#true} is VALID [2022-02-21 03:10:32,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {18464#true} assume ~e >= 127;~__retres4~0 := 4294967295; {18495#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:32,574 INFO L290 TraceCheckUtils]: 6: Hoare triple {18495#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} #res := ~__retres4~0; {18496#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:32,577 INFO L290 TraceCheckUtils]: 7: Hoare triple {18496#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} assume true; {18496#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:32,584 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {18496#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} {18464#true} #356#return; {18480#(and (<= 4294967295 |ULTIMATE.start_main_#t~ret23#1|) (<= |ULTIMATE.start_main_#t~ret23#1| 4294967295))} is VALID [2022-02-21 03:10:32,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-21 03:10:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:32,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {18494#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18464#true} is VALID [2022-02-21 03:10:32,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {18464#true} assume !(0 == ~m % 4294967296); {18464#true} is VALID [2022-02-21 03:10:32,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {18464#true} assume !(~m % 4294967296 < 16777216); {18464#true} is VALID [2022-02-21 03:10:32,591 INFO L290 TraceCheckUtils]: 3: Hoare triple {18464#true} assume !false; {18464#true} is VALID [2022-02-21 03:10:32,591 INFO L290 TraceCheckUtils]: 4: Hoare triple {18464#true} assume ~m % 4294967296 >= 33554432; {18464#true} is VALID [2022-02-21 03:10:32,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {18464#true} assume ~e >= 127;~__retres4~0 := 4294967295; {18464#true} is VALID [2022-02-21 03:10:32,591 INFO L290 TraceCheckUtils]: 6: Hoare triple {18464#true} #res := ~__retres4~0; {18464#true} is VALID [2022-02-21 03:10:32,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {18464#true} assume true; {18464#true} is VALID [2022-02-21 03:10:32,592 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {18464#true} {18481#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} #358#return; {18481#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:32,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {18464#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(24, 2);call #Ultimate.allocInit(12, 3); {18464#true} is VALID [2022-02-21 03:10:32,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {18464#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {18464#true} is VALID [2022-02-21 03:10:32,593 INFO L272 TraceCheckUtils]: 2: Hoare triple {18464#true} call main_#t~ret22#1 := base2flt(0, 0); {18494#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:32,593 INFO L290 TraceCheckUtils]: 3: Hoare triple {18494#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18464#true} is VALID [2022-02-21 03:10:32,593 INFO L290 TraceCheckUtils]: 4: Hoare triple {18464#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {18464#true} is VALID [2022-02-21 03:10:32,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {18464#true} #res := ~__retres4~0; {18464#true} is VALID [2022-02-21 03:10:32,594 INFO L290 TraceCheckUtils]: 6: Hoare triple {18464#true} assume true; {18464#true} is VALID [2022-02-21 03:10:32,594 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {18464#true} {18464#true} #354#return; {18464#true} is VALID [2022-02-21 03:10:32,594 INFO L290 TraceCheckUtils]: 8: Hoare triple {18464#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {18464#true} is VALID [2022-02-21 03:10:32,595 INFO L272 TraceCheckUtils]: 9: Hoare triple {18464#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {18494#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:32,595 INFO L290 TraceCheckUtils]: 10: Hoare triple {18494#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18464#true} is VALID [2022-02-21 03:10:32,595 INFO L290 TraceCheckUtils]: 11: Hoare triple {18464#true} assume !(0 == ~m % 4294967296); {18464#true} is VALID [2022-02-21 03:10:32,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {18464#true} assume !(~m % 4294967296 < 16777216); {18464#true} is VALID [2022-02-21 03:10:32,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {18464#true} assume !false; {18464#true} is VALID [2022-02-21 03:10:32,595 INFO L290 TraceCheckUtils]: 14: Hoare triple {18464#true} assume ~m % 4294967296 >= 33554432; {18464#true} is VALID [2022-02-21 03:10:32,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {18464#true} assume ~e >= 127;~__retres4~0 := 4294967295; {18495#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:32,596 INFO L290 TraceCheckUtils]: 16: Hoare triple {18495#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} #res := ~__retres4~0; {18496#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:32,597 INFO L290 TraceCheckUtils]: 17: Hoare triple {18496#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} assume true; {18496#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:32,597 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {18496#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} {18464#true} #356#return; {18480#(and (<= 4294967295 |ULTIMATE.start_main_#t~ret23#1|) (<= |ULTIMATE.start_main_#t~ret23#1| 4294967295))} is VALID [2022-02-21 03:10:32,598 INFO L290 TraceCheckUtils]: 19: Hoare triple {18480#(and (<= 4294967295 |ULTIMATE.start_main_#t~ret23#1|) (<= |ULTIMATE.start_main_#t~ret23#1| 4294967295))} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {18481#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:32,599 INFO L272 TraceCheckUtils]: 20: Hoare triple {18481#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {18494#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:32,599 INFO L290 TraceCheckUtils]: 21: Hoare triple {18494#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18464#true} is VALID [2022-02-21 03:10:32,599 INFO L290 TraceCheckUtils]: 22: Hoare triple {18464#true} assume !(0 == ~m % 4294967296); {18464#true} is VALID [2022-02-21 03:10:32,599 INFO L290 TraceCheckUtils]: 23: Hoare triple {18464#true} assume !(~m % 4294967296 < 16777216); {18464#true} is VALID [2022-02-21 03:10:32,599 INFO L290 TraceCheckUtils]: 24: Hoare triple {18464#true} assume !false; {18464#true} is VALID [2022-02-21 03:10:32,599 INFO L290 TraceCheckUtils]: 25: Hoare triple {18464#true} assume ~m % 4294967296 >= 33554432; {18464#true} is VALID [2022-02-21 03:10:32,599 INFO L290 TraceCheckUtils]: 26: Hoare triple {18464#true} assume ~e >= 127;~__retres4~0 := 4294967295; {18464#true} is VALID [2022-02-21 03:10:32,599 INFO L290 TraceCheckUtils]: 27: Hoare triple {18464#true} #res := ~__retres4~0; {18464#true} is VALID [2022-02-21 03:10:32,600 INFO L290 TraceCheckUtils]: 28: Hoare triple {18464#true} assume true; {18464#true} is VALID [2022-02-21 03:10:32,600 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {18464#true} {18481#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} #358#return; {18481#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:32,601 INFO L290 TraceCheckUtils]: 30: Hoare triple {18481#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {18481#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:32,601 INFO L272 TraceCheckUtils]: 31: Hoare triple {18481#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {18491#(and (<= 4294967295 |addflt_#in~a|) (<= |addflt_#in~a| 4294967295))} is VALID [2022-02-21 03:10:32,602 INFO L290 TraceCheckUtils]: 32: Hoare triple {18491#(and (<= 4294967295 |addflt_#in~a|) (<= |addflt_#in~a| 4294967295))} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {18492#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} is VALID [2022-02-21 03:10:32,603 INFO L290 TraceCheckUtils]: 33: Hoare triple {18492#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} assume !(~a % 4294967296 < ~b % 4294967296); {18492#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} is VALID [2022-02-21 03:10:32,603 INFO L290 TraceCheckUtils]: 34: Hoare triple {18492#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} assume !(0 == ~b % 4294967296); {18492#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} is VALID [2022-02-21 03:10:32,603 INFO L290 TraceCheckUtils]: 35: Hoare triple {18492#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} assume !(0 == ~a); {18492#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} is VALID [2022-02-21 03:10:32,604 INFO L290 TraceCheckUtils]: 36: Hoare triple {18492#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} assume !false; {18492#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} is VALID [2022-02-21 03:10:32,604 INFO L290 TraceCheckUtils]: 37: Hoare triple {18492#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} assume !false; {18492#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} is VALID [2022-02-21 03:10:32,605 INFO L290 TraceCheckUtils]: 38: Hoare triple {18492#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} assume ~a >= 0;abs_109 := (if ~a < 16777215 then ~a else 16777215);assume ~a >= 0;assume ~ma~0 < abs_109; {18492#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} is VALID [2022-02-21 03:10:32,606 INFO L290 TraceCheckUtils]: 39: Hoare triple {18492#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {18493#(<= (div addflt_~a 16777216) (+ 2147483647 (* (div (div addflt_~a 16777216) 4294967296) 4294967296)))} is VALID [2022-02-21 03:10:32,606 INFO L290 TraceCheckUtils]: 40: Hoare triple {18493#(<= (div addflt_~a 16777216) (+ 2147483647 (* (div (div addflt_~a 16777216) 4294967296) 4294967296)))} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {18465#false} is VALID [2022-02-21 03:10:32,607 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-21 03:10:32,607 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:32,607 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655199021] [2022-02-21 03:10:32,607 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655199021] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:32,607 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286404382] [2022-02-21 03:10:32,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:32,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:32,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:32,609 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:32,618 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:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:32,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-21 03:10:32,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:32,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:32,899 INFO L290 TraceCheckUtils]: 0: Hoare triple {18464#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(24, 2);call #Ultimate.allocInit(12, 3); {18464#true} is VALID [2022-02-21 03:10:32,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {18464#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {18464#true} is VALID [2022-02-21 03:10:32,899 INFO L272 TraceCheckUtils]: 2: Hoare triple {18464#true} call main_#t~ret22#1 := base2flt(0, 0); {18464#true} is VALID [2022-02-21 03:10:32,900 INFO L290 TraceCheckUtils]: 3: Hoare triple {18464#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18464#true} is VALID [2022-02-21 03:10:32,900 INFO L290 TraceCheckUtils]: 4: Hoare triple {18464#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {18464#true} is VALID [2022-02-21 03:10:32,900 INFO L290 TraceCheckUtils]: 5: Hoare triple {18464#true} #res := ~__retres4~0; {18464#true} is VALID [2022-02-21 03:10:32,900 INFO L290 TraceCheckUtils]: 6: Hoare triple {18464#true} assume true; {18464#true} is VALID [2022-02-21 03:10:32,900 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {18464#true} {18464#true} #354#return; {18464#true} is VALID [2022-02-21 03:10:32,900 INFO L290 TraceCheckUtils]: 8: Hoare triple {18464#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {18464#true} is VALID [2022-02-21 03:10:32,900 INFO L272 TraceCheckUtils]: 9: Hoare triple {18464#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {18464#true} is VALID [2022-02-21 03:10:32,901 INFO L290 TraceCheckUtils]: 10: Hoare triple {18464#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18464#true} is VALID [2022-02-21 03:10:32,901 INFO L290 TraceCheckUtils]: 11: Hoare triple {18464#true} assume !(0 == ~m % 4294967296); {18464#true} is VALID [2022-02-21 03:10:32,901 INFO L290 TraceCheckUtils]: 12: Hoare triple {18464#true} assume !(~m % 4294967296 < 16777216); {18464#true} is VALID [2022-02-21 03:10:32,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {18464#true} assume !false; {18464#true} is VALID [2022-02-21 03:10:32,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {18464#true} assume ~m % 4294967296 >= 33554432; {18464#true} is VALID [2022-02-21 03:10:32,902 INFO L290 TraceCheckUtils]: 15: Hoare triple {18464#true} assume ~e >= 127;~__retres4~0 := 4294967295; {18495#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:32,902 INFO L290 TraceCheckUtils]: 16: Hoare triple {18495#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} #res := ~__retres4~0; {18496#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:32,903 INFO L290 TraceCheckUtils]: 17: Hoare triple {18496#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} assume true; {18496#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:32,904 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {18496#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} {18464#true} #356#return; {18480#(and (<= 4294967295 |ULTIMATE.start_main_#t~ret23#1|) (<= |ULTIMATE.start_main_#t~ret23#1| 4294967295))} is VALID [2022-02-21 03:10:32,904 INFO L290 TraceCheckUtils]: 19: Hoare triple {18480#(and (<= 4294967295 |ULTIMATE.start_main_#t~ret23#1|) (<= |ULTIMATE.start_main_#t~ret23#1| 4294967295))} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {18481#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:32,904 INFO L272 TraceCheckUtils]: 20: Hoare triple {18481#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {18464#true} is VALID [2022-02-21 03:10:32,904 INFO L290 TraceCheckUtils]: 21: Hoare triple {18464#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18464#true} is VALID [2022-02-21 03:10:32,905 INFO L290 TraceCheckUtils]: 22: Hoare triple {18464#true} assume !(0 == ~m % 4294967296); {18464#true} is VALID [2022-02-21 03:10:32,905 INFO L290 TraceCheckUtils]: 23: Hoare triple {18464#true} assume !(~m % 4294967296 < 16777216); {18464#true} is VALID [2022-02-21 03:10:32,905 INFO L290 TraceCheckUtils]: 24: Hoare triple {18464#true} assume !false; {18464#true} is VALID [2022-02-21 03:10:32,905 INFO L290 TraceCheckUtils]: 25: Hoare triple {18464#true} assume ~m % 4294967296 >= 33554432; {18464#true} is VALID [2022-02-21 03:10:32,905 INFO L290 TraceCheckUtils]: 26: Hoare triple {18464#true} assume ~e >= 127;~__retres4~0 := 4294967295; {18464#true} is VALID [2022-02-21 03:10:32,905 INFO L290 TraceCheckUtils]: 27: Hoare triple {18464#true} #res := ~__retres4~0; {18464#true} is VALID [2022-02-21 03:10:32,905 INFO L290 TraceCheckUtils]: 28: Hoare triple {18464#true} assume true; {18464#true} is VALID [2022-02-21 03:10:32,906 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {18464#true} {18481#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} #358#return; {18481#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:32,907 INFO L290 TraceCheckUtils]: 30: Hoare triple {18481#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {18481#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:32,907 INFO L272 TraceCheckUtils]: 31: Hoare triple {18481#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {18491#(and (<= 4294967295 |addflt_#in~a|) (<= |addflt_#in~a| 4294967295))} is VALID [2022-02-21 03:10:32,908 INFO L290 TraceCheckUtils]: 32: Hoare triple {18491#(and (<= 4294967295 |addflt_#in~a|) (<= |addflt_#in~a| 4294967295))} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {18596#(and (<= addflt_~a 4294967295) (<= 4294967295 addflt_~a))} is VALID [2022-02-21 03:10:32,908 INFO L290 TraceCheckUtils]: 33: Hoare triple {18596#(and (<= addflt_~a 4294967295) (<= 4294967295 addflt_~a))} assume !(~a % 4294967296 < ~b % 4294967296); {18596#(and (<= addflt_~a 4294967295) (<= 4294967295 addflt_~a))} is VALID [2022-02-21 03:10:32,909 INFO L290 TraceCheckUtils]: 34: Hoare triple {18596#(and (<= addflt_~a 4294967295) (<= 4294967295 addflt_~a))} assume !(0 == ~b % 4294967296); {18596#(and (<= addflt_~a 4294967295) (<= 4294967295 addflt_~a))} is VALID [2022-02-21 03:10:32,909 INFO L290 TraceCheckUtils]: 35: Hoare triple {18596#(and (<= addflt_~a 4294967295) (<= 4294967295 addflt_~a))} assume !(0 == ~a); {18596#(and (<= addflt_~a 4294967295) (<= 4294967295 addflt_~a))} is VALID [2022-02-21 03:10:32,910 INFO L290 TraceCheckUtils]: 36: Hoare triple {18596#(and (<= addflt_~a 4294967295) (<= 4294967295 addflt_~a))} assume !false; {18596#(and (<= addflt_~a 4294967295) (<= 4294967295 addflt_~a))} is VALID [2022-02-21 03:10:32,910 INFO L290 TraceCheckUtils]: 37: Hoare triple {18596#(and (<= addflt_~a 4294967295) (<= 4294967295 addflt_~a))} assume !false; {18596#(and (<= addflt_~a 4294967295) (<= 4294967295 addflt_~a))} is VALID [2022-02-21 03:10:32,911 INFO L290 TraceCheckUtils]: 38: Hoare triple {18596#(and (<= addflt_~a 4294967295) (<= 4294967295 addflt_~a))} assume ~a >= 0;abs_109 := (if ~a < 16777215 then ~a else 16777215);assume ~a >= 0;assume ~ma~0 < abs_109; {18596#(and (<= addflt_~a 4294967295) (<= 4294967295 addflt_~a))} is VALID [2022-02-21 03:10:32,911 INFO L290 TraceCheckUtils]: 39: Hoare triple {18596#(and (<= addflt_~a 4294967295) (<= 4294967295 addflt_~a))} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {18596#(and (<= addflt_~a 4294967295) (<= 4294967295 addflt_~a))} is VALID [2022-02-21 03:10:32,912 INFO L290 TraceCheckUtils]: 40: Hoare triple {18596#(and (<= addflt_~a 4294967295) (<= 4294967295 addflt_~a))} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {18465#false} is VALID [2022-02-21 03:10:32,913 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-21 03:10:32,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:10:33,284 INFO L290 TraceCheckUtils]: 40: Hoare triple {18621#(or (<= (mod (div addflt_~a 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div addflt_~a 16777216) 4294967296)))} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {18465#false} is VALID [2022-02-21 03:10:33,285 INFO L290 TraceCheckUtils]: 39: Hoare triple {18621#(or (<= (mod (div addflt_~a 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div addflt_~a 16777216) 4294967296)))} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {18621#(or (<= (mod (div addflt_~a 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div addflt_~a 16777216) 4294967296)))} is VALID [2022-02-21 03:10:33,285 INFO L290 TraceCheckUtils]: 38: Hoare triple {18621#(or (<= (mod (div addflt_~a 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div addflt_~a 16777216) 4294967296)))} assume ~a >= 0;abs_109 := (if ~a < 16777215 then ~a else 16777215);assume ~a >= 0;assume ~ma~0 < abs_109; {18621#(or (<= (mod (div addflt_~a 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div addflt_~a 16777216) 4294967296)))} is VALID [2022-02-21 03:10:33,286 INFO L290 TraceCheckUtils]: 37: Hoare triple {18621#(or (<= (mod (div addflt_~a 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div addflt_~a 16777216) 4294967296)))} assume !false; {18621#(or (<= (mod (div addflt_~a 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div addflt_~a 16777216) 4294967296)))} is VALID [2022-02-21 03:10:33,286 INFO L290 TraceCheckUtils]: 36: Hoare triple {18621#(or (<= (mod (div addflt_~a 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div addflt_~a 16777216) 4294967296)))} assume !false; {18621#(or (<= (mod (div addflt_~a 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div addflt_~a 16777216) 4294967296)))} is VALID [2022-02-21 03:10:33,286 INFO L290 TraceCheckUtils]: 35: Hoare triple {18621#(or (<= (mod (div addflt_~a 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div addflt_~a 16777216) 4294967296)))} assume !(0 == ~a); {18621#(or (<= (mod (div addflt_~a 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div addflt_~a 16777216) 4294967296)))} is VALID [2022-02-21 03:10:33,287 INFO L290 TraceCheckUtils]: 34: Hoare triple {18621#(or (<= (mod (div addflt_~a 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div addflt_~a 16777216) 4294967296)))} assume !(0 == ~b % 4294967296); {18621#(or (<= (mod (div addflt_~a 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div addflt_~a 16777216) 4294967296)))} is VALID [2022-02-21 03:10:33,287 INFO L290 TraceCheckUtils]: 33: Hoare triple {18621#(or (<= (mod (div addflt_~a 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div addflt_~a 16777216) 4294967296)))} assume !(~a % 4294967296 < ~b % 4294967296); {18621#(or (<= (mod (div addflt_~a 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div addflt_~a 16777216) 4294967296)))} is VALID [2022-02-21 03:10:33,288 INFO L290 TraceCheckUtils]: 32: Hoare triple {18646#(or (<= 2147483776 (mod (div |addflt_#in~a| 16777216) 4294967296)) (<= (mod (div |addflt_#in~a| 16777216) 4294967296) 2147483647))} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {18621#(or (<= (mod (div addflt_~a 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div addflt_~a 16777216) 4294967296)))} is VALID [2022-02-21 03:10:33,288 INFO L272 TraceCheckUtils]: 31: Hoare triple {18650#(or (<= (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296)))} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {18646#(or (<= 2147483776 (mod (div |addflt_#in~a| 16777216) 4294967296)) (<= (mod (div |addflt_#in~a| 16777216) 4294967296) 2147483647))} is VALID [2022-02-21 03:10:33,289 INFO L290 TraceCheckUtils]: 30: Hoare triple {18650#(or (<= (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296)))} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {18650#(or (<= (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296)))} is VALID [2022-02-21 03:10:33,289 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {18464#true} {18650#(or (<= (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296)))} #358#return; {18650#(or (<= (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296)))} is VALID [2022-02-21 03:10:33,289 INFO L290 TraceCheckUtils]: 28: Hoare triple {18464#true} assume true; {18464#true} is VALID [2022-02-21 03:10:33,290 INFO L290 TraceCheckUtils]: 27: Hoare triple {18464#true} #res := ~__retres4~0; {18464#true} is VALID [2022-02-21 03:10:33,290 INFO L290 TraceCheckUtils]: 26: Hoare triple {18464#true} assume ~e >= 127;~__retres4~0 := 4294967295; {18464#true} is VALID [2022-02-21 03:10:33,290 INFO L290 TraceCheckUtils]: 25: Hoare triple {18464#true} assume ~m % 4294967296 >= 33554432; {18464#true} is VALID [2022-02-21 03:10:33,290 INFO L290 TraceCheckUtils]: 24: Hoare triple {18464#true} assume !false; {18464#true} is VALID [2022-02-21 03:10:33,290 INFO L290 TraceCheckUtils]: 23: Hoare triple {18464#true} assume !(~m % 4294967296 < 16777216); {18464#true} is VALID [2022-02-21 03:10:33,290 INFO L290 TraceCheckUtils]: 22: Hoare triple {18464#true} assume !(0 == ~m % 4294967296); {18464#true} is VALID [2022-02-21 03:10:33,290 INFO L290 TraceCheckUtils]: 21: Hoare triple {18464#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18464#true} is VALID [2022-02-21 03:10:33,290 INFO L272 TraceCheckUtils]: 20: Hoare triple {18650#(or (<= (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296)))} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {18464#true} is VALID [2022-02-21 03:10:33,290 INFO L290 TraceCheckUtils]: 19: Hoare triple {18687#(or (<= 2147483776 (mod (div |ULTIMATE.start_main_#t~ret23#1| 16777216) 4294967296)) (<= (mod (div |ULTIMATE.start_main_#t~ret23#1| 16777216) 4294967296) 2147483647))} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {18650#(or (<= (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296)))} is VALID [2022-02-21 03:10:33,291 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {18694#(or (<= (mod (div |base2flt_#res| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |base2flt_#res| 16777216) 4294967296)))} {18464#true} #356#return; {18687#(or (<= 2147483776 (mod (div |ULTIMATE.start_main_#t~ret23#1| 16777216) 4294967296)) (<= (mod (div |ULTIMATE.start_main_#t~ret23#1| 16777216) 4294967296) 2147483647))} is VALID [2022-02-21 03:10:33,292 INFO L290 TraceCheckUtils]: 17: Hoare triple {18694#(or (<= (mod (div |base2flt_#res| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |base2flt_#res| 16777216) 4294967296)))} assume true; {18694#(or (<= (mod (div |base2flt_#res| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |base2flt_#res| 16777216) 4294967296)))} is VALID [2022-02-21 03:10:33,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {18701#(or (<= 2147483776 (mod (div base2flt_~__retres4~0 16777216) 4294967296)) (<= (mod (div base2flt_~__retres4~0 16777216) 4294967296) 2147483647))} #res := ~__retres4~0; {18694#(or (<= (mod (div |base2flt_#res| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |base2flt_#res| 16777216) 4294967296)))} is VALID [2022-02-21 03:10:33,292 INFO L290 TraceCheckUtils]: 15: Hoare triple {18464#true} assume ~e >= 127;~__retres4~0 := 4294967295; {18701#(or (<= 2147483776 (mod (div base2flt_~__retres4~0 16777216) 4294967296)) (<= (mod (div base2flt_~__retres4~0 16777216) 4294967296) 2147483647))} is VALID [2022-02-21 03:10:33,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {18464#true} assume ~m % 4294967296 >= 33554432; {18464#true} is VALID [2022-02-21 03:10:33,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {18464#true} assume !false; {18464#true} is VALID [2022-02-21 03:10:33,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {18464#true} assume !(~m % 4294967296 < 16777216); {18464#true} is VALID [2022-02-21 03:10:33,293 INFO L290 TraceCheckUtils]: 11: Hoare triple {18464#true} assume !(0 == ~m % 4294967296); {18464#true} is VALID [2022-02-21 03:10:33,293 INFO L290 TraceCheckUtils]: 10: Hoare triple {18464#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18464#true} is VALID [2022-02-21 03:10:33,293 INFO L272 TraceCheckUtils]: 9: Hoare triple {18464#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {18464#true} is VALID [2022-02-21 03:10:33,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {18464#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {18464#true} is VALID [2022-02-21 03:10:33,293 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {18464#true} {18464#true} #354#return; {18464#true} is VALID [2022-02-21 03:10:33,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {18464#true} assume true; {18464#true} is VALID [2022-02-21 03:10:33,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {18464#true} #res := ~__retres4~0; {18464#true} is VALID [2022-02-21 03:10:33,293 INFO L290 TraceCheckUtils]: 4: Hoare triple {18464#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {18464#true} is VALID [2022-02-21 03:10:33,293 INFO L290 TraceCheckUtils]: 3: Hoare triple {18464#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18464#true} is VALID [2022-02-21 03:10:33,293 INFO L272 TraceCheckUtils]: 2: Hoare triple {18464#true} call main_#t~ret22#1 := base2flt(0, 0); {18464#true} is VALID [2022-02-21 03:10:33,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {18464#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {18464#true} is VALID [2022-02-21 03:10:33,293 INFO L290 TraceCheckUtils]: 0: Hoare triple {18464#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(24, 2);call #Ultimate.allocInit(12, 3); {18464#true} is VALID [2022-02-21 03:10:33,294 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-21 03:10:33,294 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286404382] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:10:33,294 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:10:33,294 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 16 [2022-02-21 03:10:33,294 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211046828] [2022-02-21 03:10:33,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:10:33,294 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.125) internal successors, (50), 12 states have internal predecessors, (50), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-02-21 03:10:33,295 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:33,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 3.125) internal successors, (50), 12 states have internal predecessors, (50), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:10:33,363 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:33,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-21 03:10:33,363 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:33,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-21 03:10:33,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2022-02-21 03:10:33,364 INFO L87 Difference]: Start difference. First operand 227 states and 300 transitions. Second operand has 17 states, 16 states have (on average 3.125) internal successors, (50), 12 states have internal predecessors, (50), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:10:36,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:36,068 INFO L93 Difference]: Finished difference Result 624 states and 834 transitions. [2022-02-21 03:10:36,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-21 03:10:36,069 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.125) internal successors, (50), 12 states have internal predecessors, (50), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-02-21 03:10:36,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:36,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 3.125) internal successors, (50), 12 states have internal predecessors, (50), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:10:36,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 401 transitions. [2022-02-21 03:10:36,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 3.125) internal successors, (50), 12 states have internal predecessors, (50), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:10:36,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 401 transitions. [2022-02-21 03:10:36,076 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 401 transitions. [2022-02-21 03:10:36,446 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 401 edges. 401 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:36,459 INFO L225 Difference]: With dead ends: 624 [2022-02-21 03:10:36,460 INFO L226 Difference]: Without dead ends: 492 [2022-02-21 03:10:36,461 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2022-02-21 03:10:36,461 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 615 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:36,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [616 Valid, 590 Invalid, 1085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-21 03:10:36,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-02-21 03:10:36,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 338. [2022-02-21 03:10:36,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:36,621 INFO L82 GeneralOperation]: Start isEquivalent. First operand 492 states. Second operand has 338 states, 298 states have (on average 1.4026845637583893) internal successors, (418), 311 states have internal predecessors, (418), 18 states have call successors, (18), 9 states have call predecessors, (18), 12 states have return successors, (22), 17 states have call predecessors, (22), 17 states have call successors, (22) [2022-02-21 03:10:36,622 INFO L74 IsIncluded]: Start isIncluded. First operand 492 states. Second operand has 338 states, 298 states have (on average 1.4026845637583893) internal successors, (418), 311 states have internal predecessors, (418), 18 states have call successors, (18), 9 states have call predecessors, (18), 12 states have return successors, (22), 17 states have call predecessors, (22), 17 states have call successors, (22) [2022-02-21 03:10:36,622 INFO L87 Difference]: Start difference. First operand 492 states. Second operand has 338 states, 298 states have (on average 1.4026845637583893) internal successors, (418), 311 states have internal predecessors, (418), 18 states have call successors, (18), 9 states have call predecessors, (18), 12 states have return successors, (22), 17 states have call predecessors, (22), 17 states have call successors, (22) [2022-02-21 03:10:36,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:36,636 INFO L93 Difference]: Finished difference Result 492 states and 650 transitions. [2022-02-21 03:10:36,636 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 650 transitions. [2022-02-21 03:10:36,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:36,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:36,638 INFO L74 IsIncluded]: Start isIncluded. First operand has 338 states, 298 states have (on average 1.4026845637583893) internal successors, (418), 311 states have internal predecessors, (418), 18 states have call successors, (18), 9 states have call predecessors, (18), 12 states have return successors, (22), 17 states have call predecessors, (22), 17 states have call successors, (22) Second operand 492 states. [2022-02-21 03:10:36,639 INFO L87 Difference]: Start difference. First operand has 338 states, 298 states have (on average 1.4026845637583893) internal successors, (418), 311 states have internal predecessors, (418), 18 states have call successors, (18), 9 states have call predecessors, (18), 12 states have return successors, (22), 17 states have call predecessors, (22), 17 states have call successors, (22) Second operand 492 states. [2022-02-21 03:10:36,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:36,653 INFO L93 Difference]: Finished difference Result 492 states and 650 transitions. [2022-02-21 03:10:36,653 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 650 transitions. [2022-02-21 03:10:36,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:36,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:36,654 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:36,654 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:36,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 298 states have (on average 1.4026845637583893) internal successors, (418), 311 states have internal predecessors, (418), 18 states have call successors, (18), 9 states have call predecessors, (18), 12 states have return successors, (22), 17 states have call predecessors, (22), 17 states have call successors, (22) [2022-02-21 03:10:36,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 458 transitions. [2022-02-21 03:10:36,663 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 458 transitions. Word has length 41 [2022-02-21 03:10:36,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:36,663 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 458 transitions. [2022-02-21 03:10:36,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.125) internal successors, (50), 12 states have internal predecessors, (50), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:10:36,664 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 458 transitions. [2022-02-21 03:10:36,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-21 03:10:36,665 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:36,665 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2022-02-21 03:10:36,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-02-21 03:10:36,879 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:36,880 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:36,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:36,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1708184769, now seen corresponding path program 1 times [2022-02-21 03:10:36,880 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:36,880 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464229730] [2022-02-21 03:10:36,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:36,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:36,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:36,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:36,959 INFO L290 TraceCheckUtils]: 0: Hoare triple {20852#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20820#true} is VALID [2022-02-21 03:10:36,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {20820#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {20820#true} is VALID [2022-02-21 03:10:36,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {20820#true} #res := ~__retres4~0; {20820#true} is VALID [2022-02-21 03:10:36,959 INFO L290 TraceCheckUtils]: 3: Hoare triple {20820#true} assume true; {20820#true} is VALID [2022-02-21 03:10:36,959 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {20820#true} {20820#true} #354#return; {20820#true} is VALID [2022-02-21 03:10:36,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:36,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:36,964 INFO L290 TraceCheckUtils]: 0: Hoare triple {20852#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20820#true} is VALID [2022-02-21 03:10:36,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {20820#true} assume !(0 == ~m % 4294967296); {20820#true} is VALID [2022-02-21 03:10:36,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {20820#true} assume !(~m % 4294967296 < 16777216); {20820#true} is VALID [2022-02-21 03:10:36,965 INFO L290 TraceCheckUtils]: 3: Hoare triple {20820#true} assume !false; {20820#true} is VALID [2022-02-21 03:10:36,965 INFO L290 TraceCheckUtils]: 4: Hoare triple {20820#true} assume ~m % 4294967296 >= 33554432; {20820#true} is VALID [2022-02-21 03:10:36,965 INFO L290 TraceCheckUtils]: 5: Hoare triple {20820#true} assume ~e >= 127;~__retres4~0 := 4294967295; {20820#true} is VALID [2022-02-21 03:10:36,965 INFO L290 TraceCheckUtils]: 6: Hoare triple {20820#true} #res := ~__retres4~0; {20820#true} is VALID [2022-02-21 03:10:36,966 INFO L290 TraceCheckUtils]: 7: Hoare triple {20820#true} assume true; {20820#true} is VALID [2022-02-21 03:10:36,966 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {20820#true} {20820#true} #356#return; {20820#true} is VALID [2022-02-21 03:10:36,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-21 03:10:36,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:36,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {20852#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20820#true} is VALID [2022-02-21 03:10:36,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {20820#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {20853#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:36,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {20853#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {20854#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:37,000 INFO L290 TraceCheckUtils]: 3: Hoare triple {20854#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {20854#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:37,001 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {20854#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {20820#true} #358#return; {20841#(= |ULTIMATE.start_main_#t~ret24#1| 0)} is VALID [2022-02-21 03:10:37,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-21 03:10:37,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:37,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {20855#(and (= abs_142 |old(abs_142)|) (= abs_114 |old(abs_114)|) (= abs_111 |old(abs_111)|) (= abs_141 |old(abs_141)|) (= abs_109 |old(abs_109)|) (= abs_112 |old(abs_112)|))} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {20820#true} is VALID [2022-02-21 03:10:37,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {20820#true} assume !(~a % 4294967296 < ~b % 4294967296); {20820#true} is VALID [2022-02-21 03:10:37,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {20820#true} assume 0 == ~b % 4294967296;~__retres10~0 := ~a; {20820#true} is VALID [2022-02-21 03:10:37,026 INFO L290 TraceCheckUtils]: 3: Hoare triple {20820#true} #res := ~__retres10~0; {20820#true} is VALID [2022-02-21 03:10:37,026 INFO L290 TraceCheckUtils]: 4: Hoare triple {20820#true} assume true; {20820#true} is VALID [2022-02-21 03:10:37,027 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {20820#true} {20842#(= |ULTIMATE.start_main_~b~0#1| 0)} #360#return; {20842#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-21 03:10:37,027 INFO L290 TraceCheckUtils]: 0: Hoare triple {20820#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(24, 2);call #Ultimate.allocInit(12, 3); {20820#true} is VALID [2022-02-21 03:10:37,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {20820#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {20820#true} is VALID [2022-02-21 03:10:37,028 INFO L272 TraceCheckUtils]: 2: Hoare triple {20820#true} call main_#t~ret22#1 := base2flt(0, 0); {20852#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:37,028 INFO L290 TraceCheckUtils]: 3: Hoare triple {20852#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20820#true} is VALID [2022-02-21 03:10:37,028 INFO L290 TraceCheckUtils]: 4: Hoare triple {20820#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {20820#true} is VALID [2022-02-21 03:10:37,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {20820#true} #res := ~__retres4~0; {20820#true} is VALID [2022-02-21 03:10:37,029 INFO L290 TraceCheckUtils]: 6: Hoare triple {20820#true} assume true; {20820#true} is VALID [2022-02-21 03:10:37,029 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {20820#true} {20820#true} #354#return; {20820#true} is VALID [2022-02-21 03:10:37,029 INFO L290 TraceCheckUtils]: 8: Hoare triple {20820#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {20820#true} is VALID [2022-02-21 03:10:37,030 INFO L272 TraceCheckUtils]: 9: Hoare triple {20820#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {20852#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:37,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {20852#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20820#true} is VALID [2022-02-21 03:10:37,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {20820#true} assume !(0 == ~m % 4294967296); {20820#true} is VALID [2022-02-21 03:10:37,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {20820#true} assume !(~m % 4294967296 < 16777216); {20820#true} is VALID [2022-02-21 03:10:37,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {20820#true} assume !false; {20820#true} is VALID [2022-02-21 03:10:37,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {20820#true} assume ~m % 4294967296 >= 33554432; {20820#true} is VALID [2022-02-21 03:10:37,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {20820#true} assume ~e >= 127;~__retres4~0 := 4294967295; {20820#true} is VALID [2022-02-21 03:10:37,031 INFO L290 TraceCheckUtils]: 16: Hoare triple {20820#true} #res := ~__retres4~0; {20820#true} is VALID [2022-02-21 03:10:37,031 INFO L290 TraceCheckUtils]: 17: Hoare triple {20820#true} assume true; {20820#true} is VALID [2022-02-21 03:10:37,031 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {20820#true} {20820#true} #356#return; {20820#true} is VALID [2022-02-21 03:10:37,031 INFO L290 TraceCheckUtils]: 19: Hoare triple {20820#true} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {20820#true} is VALID [2022-02-21 03:10:37,032 INFO L272 TraceCheckUtils]: 20: Hoare triple {20820#true} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {20852#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:37,032 INFO L290 TraceCheckUtils]: 21: Hoare triple {20852#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20820#true} is VALID [2022-02-21 03:10:37,032 INFO L290 TraceCheckUtils]: 22: Hoare triple {20820#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {20853#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:37,032 INFO L290 TraceCheckUtils]: 23: Hoare triple {20853#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {20854#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:37,033 INFO L290 TraceCheckUtils]: 24: Hoare triple {20854#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {20854#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:37,034 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {20854#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {20820#true} #358#return; {20841#(= |ULTIMATE.start_main_#t~ret24#1| 0)} is VALID [2022-02-21 03:10:37,034 INFO L290 TraceCheckUtils]: 26: Hoare triple {20841#(= |ULTIMATE.start_main_#t~ret24#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {20842#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-21 03:10:37,035 INFO L272 TraceCheckUtils]: 27: Hoare triple {20842#(= |ULTIMATE.start_main_~b~0#1| 0)} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {20855#(and (= abs_142 |old(abs_142)|) (= abs_114 |old(abs_114)|) (= abs_111 |old(abs_111)|) (= abs_141 |old(abs_141)|) (= abs_109 |old(abs_109)|) (= abs_112 |old(abs_112)|))} is VALID [2022-02-21 03:10:37,035 INFO L290 TraceCheckUtils]: 28: Hoare triple {20855#(and (= abs_142 |old(abs_142)|) (= abs_114 |old(abs_114)|) (= abs_111 |old(abs_111)|) (= abs_141 |old(abs_141)|) (= abs_109 |old(abs_109)|) (= abs_112 |old(abs_112)|))} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {20820#true} is VALID [2022-02-21 03:10:37,035 INFO L290 TraceCheckUtils]: 29: Hoare triple {20820#true} assume !(~a % 4294967296 < ~b % 4294967296); {20820#true} is VALID [2022-02-21 03:10:37,035 INFO L290 TraceCheckUtils]: 30: Hoare triple {20820#true} assume 0 == ~b % 4294967296;~__retres10~0 := ~a; {20820#true} is VALID [2022-02-21 03:10:37,035 INFO L290 TraceCheckUtils]: 31: Hoare triple {20820#true} #res := ~__retres10~0; {20820#true} is VALID [2022-02-21 03:10:37,035 INFO L290 TraceCheckUtils]: 32: Hoare triple {20820#true} assume true; {20820#true} is VALID [2022-02-21 03:10:37,036 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {20820#true} {20842#(= |ULTIMATE.start_main_~b~0#1| 0)} #360#return; {20842#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-21 03:10:37,036 INFO L290 TraceCheckUtils]: 34: Hoare triple {20842#(= |ULTIMATE.start_main_~b~0#1| 0)} main_~r_add1~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {20842#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-21 03:10:37,037 INFO L272 TraceCheckUtils]: 35: Hoare triple {20842#(= |ULTIMATE.start_main_~b~0#1| 0)} call main_#t~ret26#1 := addflt(main_~b~0#1, main_~a~0#1); {20849#(= |addflt_#in~a| 0)} is VALID [2022-02-21 03:10:37,037 INFO L290 TraceCheckUtils]: 36: Hoare triple {20849#(= |addflt_#in~a| 0)} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {20850#(= addflt_~a 0)} is VALID [2022-02-21 03:10:37,038 INFO L290 TraceCheckUtils]: 37: Hoare triple {20850#(= addflt_~a 0)} assume ~a % 4294967296 < ~b % 4294967296;~tmp~0 := ~a;~a := ~b;~b := ~tmp~0; {20851#(= addflt_~b 0)} is VALID [2022-02-21 03:10:37,038 INFO L290 TraceCheckUtils]: 38: Hoare triple {20851#(= addflt_~b 0)} assume !(0 == ~b % 4294967296); {20821#false} is VALID [2022-02-21 03:10:37,038 INFO L290 TraceCheckUtils]: 39: Hoare triple {20821#false} assume !(0 == ~a); {20821#false} is VALID [2022-02-21 03:10:37,038 INFO L290 TraceCheckUtils]: 40: Hoare triple {20821#false} assume !false; {20821#false} is VALID [2022-02-21 03:10:37,038 INFO L290 TraceCheckUtils]: 41: Hoare triple {20821#false} assume !false; {20821#false} is VALID [2022-02-21 03:10:37,039 INFO L290 TraceCheckUtils]: 42: Hoare triple {20821#false} assume ~a >= 0;abs_109 := (if ~a < 16777215 then ~a else 16777215);assume ~a >= 0;assume ~ma~0 < abs_109; {20821#false} is VALID [2022-02-21 03:10:37,039 INFO L290 TraceCheckUtils]: 43: Hoare triple {20821#false} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {20821#false} is VALID [2022-02-21 03:10:37,039 INFO L290 TraceCheckUtils]: 44: Hoare triple {20821#false} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {20821#false} is VALID [2022-02-21 03:10:37,039 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-21 03:10:37,040 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:37,040 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464229730] [2022-02-21 03:10:37,040 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464229730] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:37,040 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538591138] [2022-02-21 03:10:37,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:37,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:37,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:37,044 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:37,053 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:37,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:37,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-21 03:10:37,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:37,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:37,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {20820#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(24, 2);call #Ultimate.allocInit(12, 3); {20820#true} is VALID [2022-02-21 03:10:37,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {20820#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {20820#true} is VALID [2022-02-21 03:10:37,290 INFO L272 TraceCheckUtils]: 2: Hoare triple {20820#true} call main_#t~ret22#1 := base2flt(0, 0); {20820#true} is VALID [2022-02-21 03:10:37,290 INFO L290 TraceCheckUtils]: 3: Hoare triple {20820#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20868#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:37,290 INFO L290 TraceCheckUtils]: 4: Hoare triple {20868#(= base2flt_~m |base2flt_#in~m|)} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {20872#(<= (mod |base2flt_#in~m| 4294967296) 0)} is VALID [2022-02-21 03:10:37,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {20872#(<= (mod |base2flt_#in~m| 4294967296) 0)} #res := ~__retres4~0; {20872#(<= (mod |base2flt_#in~m| 4294967296) 0)} is VALID [2022-02-21 03:10:37,291 INFO L290 TraceCheckUtils]: 6: Hoare triple {20872#(<= (mod |base2flt_#in~m| 4294967296) 0)} assume true; {20872#(<= (mod |base2flt_#in~m| 4294967296) 0)} is VALID [2022-02-21 03:10:37,291 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {20872#(<= (mod |base2flt_#in~m| 4294967296) 0)} {20820#true} #354#return; {20820#true} is VALID [2022-02-21 03:10:37,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {20820#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {20820#true} is VALID [2022-02-21 03:10:37,291 INFO L272 TraceCheckUtils]: 9: Hoare triple {20820#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {20820#true} is VALID [2022-02-21 03:10:37,291 INFO L290 TraceCheckUtils]: 10: Hoare triple {20820#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20820#true} is VALID [2022-02-21 03:10:37,291 INFO L290 TraceCheckUtils]: 11: Hoare triple {20820#true} assume !(0 == ~m % 4294967296); {20820#true} is VALID [2022-02-21 03:10:37,291 INFO L290 TraceCheckUtils]: 12: Hoare triple {20820#true} assume !(~m % 4294967296 < 16777216); {20820#true} is VALID [2022-02-21 03:10:37,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {20820#true} assume !false; {20820#true} is VALID [2022-02-21 03:10:37,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {20820#true} assume ~m % 4294967296 >= 33554432; {20820#true} is VALID [2022-02-21 03:10:37,292 INFO L290 TraceCheckUtils]: 15: Hoare triple {20820#true} assume ~e >= 127;~__retres4~0 := 4294967295; {20820#true} is VALID [2022-02-21 03:10:37,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {20820#true} #res := ~__retres4~0; {20820#true} is VALID [2022-02-21 03:10:37,292 INFO L290 TraceCheckUtils]: 17: Hoare triple {20820#true} assume true; {20820#true} is VALID [2022-02-21 03:10:37,292 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {20820#true} {20820#true} #356#return; {20820#true} is VALID [2022-02-21 03:10:37,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {20820#true} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {20820#true} is VALID [2022-02-21 03:10:37,292 INFO L272 TraceCheckUtils]: 20: Hoare triple {20820#true} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {20820#true} is VALID [2022-02-21 03:10:37,292 INFO L290 TraceCheckUtils]: 21: Hoare triple {20820#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20820#true} is VALID [2022-02-21 03:10:37,303 INFO L290 TraceCheckUtils]: 22: Hoare triple {20820#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {20853#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:37,304 INFO L290 TraceCheckUtils]: 23: Hoare triple {20853#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {20854#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:37,304 INFO L290 TraceCheckUtils]: 24: Hoare triple {20854#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {20854#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:37,305 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {20854#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {20820#true} #358#return; {20841#(= |ULTIMATE.start_main_#t~ret24#1| 0)} is VALID [2022-02-21 03:10:37,305 INFO L290 TraceCheckUtils]: 26: Hoare triple {20841#(= |ULTIMATE.start_main_#t~ret24#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {20842#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-21 03:10:37,306 INFO L272 TraceCheckUtils]: 27: Hoare triple {20842#(= |ULTIMATE.start_main_~b~0#1| 0)} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {20820#true} is VALID [2022-02-21 03:10:37,306 INFO L290 TraceCheckUtils]: 28: Hoare triple {20820#true} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {20820#true} is VALID [2022-02-21 03:10:37,306 INFO L290 TraceCheckUtils]: 29: Hoare triple {20820#true} assume !(~a % 4294967296 < ~b % 4294967296); {20820#true} is VALID [2022-02-21 03:10:37,306 INFO L290 TraceCheckUtils]: 30: Hoare triple {20820#true} assume 0 == ~b % 4294967296;~__retres10~0 := ~a; {20820#true} is VALID [2022-02-21 03:10:37,306 INFO L290 TraceCheckUtils]: 31: Hoare triple {20820#true} #res := ~__retres10~0; {20820#true} is VALID [2022-02-21 03:10:37,306 INFO L290 TraceCheckUtils]: 32: Hoare triple {20820#true} assume true; {20820#true} is VALID [2022-02-21 03:10:37,307 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {20820#true} {20842#(= |ULTIMATE.start_main_~b~0#1| 0)} #360#return; {20842#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-21 03:10:37,307 INFO L290 TraceCheckUtils]: 34: Hoare triple {20842#(= |ULTIMATE.start_main_~b~0#1| 0)} main_~r_add1~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {20842#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-21 03:10:37,308 INFO L272 TraceCheckUtils]: 35: Hoare triple {20842#(= |ULTIMATE.start_main_~b~0#1| 0)} call main_#t~ret26#1 := addflt(main_~b~0#1, main_~a~0#1); {20849#(= |addflt_#in~a| 0)} is VALID [2022-02-21 03:10:37,308 INFO L290 TraceCheckUtils]: 36: Hoare triple {20849#(= |addflt_#in~a| 0)} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {20850#(= addflt_~a 0)} is VALID [2022-02-21 03:10:37,309 INFO L290 TraceCheckUtils]: 37: Hoare triple {20850#(= addflt_~a 0)} assume ~a % 4294967296 < ~b % 4294967296;~tmp~0 := ~a;~a := ~b;~b := ~tmp~0; {20851#(= addflt_~b 0)} is VALID [2022-02-21 03:10:37,309 INFO L290 TraceCheckUtils]: 38: Hoare triple {20851#(= addflt_~b 0)} assume !(0 == ~b % 4294967296); {20821#false} is VALID [2022-02-21 03:10:37,309 INFO L290 TraceCheckUtils]: 39: Hoare triple {20821#false} assume !(0 == ~a); {20821#false} is VALID [2022-02-21 03:10:37,309 INFO L290 TraceCheckUtils]: 40: Hoare triple {20821#false} assume !false; {20821#false} is VALID [2022-02-21 03:10:37,309 INFO L290 TraceCheckUtils]: 41: Hoare triple {20821#false} assume !false; {20821#false} is VALID [2022-02-21 03:10:37,309 INFO L290 TraceCheckUtils]: 42: Hoare triple {20821#false} assume ~a >= 0;abs_109 := (if ~a < 16777215 then ~a else 16777215);assume ~a >= 0;assume ~ma~0 < abs_109; {20821#false} is VALID [2022-02-21 03:10:37,309 INFO L290 TraceCheckUtils]: 43: Hoare triple {20821#false} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {20821#false} is VALID [2022-02-21 03:10:37,309 INFO L290 TraceCheckUtils]: 44: Hoare triple {20821#false} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {20821#false} is VALID [2022-02-21 03:10:37,310 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-21 03:10:37,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:10:37,561 INFO L290 TraceCheckUtils]: 44: Hoare triple {20821#false} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {20821#false} is VALID [2022-02-21 03:10:37,561 INFO L290 TraceCheckUtils]: 43: Hoare triple {20821#false} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {20821#false} is VALID [2022-02-21 03:10:37,561 INFO L290 TraceCheckUtils]: 42: Hoare triple {20821#false} assume ~a >= 0;abs_109 := (if ~a < 16777215 then ~a else 16777215);assume ~a >= 0;assume ~ma~0 < abs_109; {20821#false} is VALID [2022-02-21 03:10:37,561 INFO L290 TraceCheckUtils]: 41: Hoare triple {20821#false} assume !false; {20821#false} is VALID [2022-02-21 03:10:37,561 INFO L290 TraceCheckUtils]: 40: Hoare triple {20821#false} assume !false; {20821#false} is VALID [2022-02-21 03:10:37,561 INFO L290 TraceCheckUtils]: 39: Hoare triple {20821#false} assume !(0 == ~a); {20821#false} is VALID [2022-02-21 03:10:37,562 INFO L290 TraceCheckUtils]: 38: Hoare triple {21011#(= (mod addflt_~b 4294967296) 0)} assume !(0 == ~b % 4294967296); {20821#false} is VALID [2022-02-21 03:10:37,562 INFO L290 TraceCheckUtils]: 37: Hoare triple {21015#(= (mod addflt_~a 4294967296) 0)} assume ~a % 4294967296 < ~b % 4294967296;~tmp~0 := ~a;~a := ~b;~b := ~tmp~0; {21011#(= (mod addflt_~b 4294967296) 0)} is VALID [2022-02-21 03:10:37,563 INFO L290 TraceCheckUtils]: 36: Hoare triple {21019#(= (mod |addflt_#in~a| 4294967296) 0)} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {21015#(= (mod addflt_~a 4294967296) 0)} is VALID [2022-02-21 03:10:37,563 INFO L272 TraceCheckUtils]: 35: Hoare triple {21023#(= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} call main_#t~ret26#1 := addflt(main_~b~0#1, main_~a~0#1); {21019#(= (mod |addflt_#in~a| 4294967296) 0)} is VALID [2022-02-21 03:10:37,563 INFO L290 TraceCheckUtils]: 34: Hoare triple {21023#(= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} main_~r_add1~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {21023#(= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:37,564 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {20820#true} {21023#(= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} #360#return; {21023#(= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:37,564 INFO L290 TraceCheckUtils]: 32: Hoare triple {20820#true} assume true; {20820#true} is VALID [2022-02-21 03:10:37,564 INFO L290 TraceCheckUtils]: 31: Hoare triple {20820#true} #res := ~__retres10~0; {20820#true} is VALID [2022-02-21 03:10:37,564 INFO L290 TraceCheckUtils]: 30: Hoare triple {20820#true} assume 0 == ~b % 4294967296;~__retres10~0 := ~a; {20820#true} is VALID [2022-02-21 03:10:37,564 INFO L290 TraceCheckUtils]: 29: Hoare triple {20820#true} assume !(~a % 4294967296 < ~b % 4294967296); {20820#true} is VALID [2022-02-21 03:10:37,564 INFO L290 TraceCheckUtils]: 28: Hoare triple {20820#true} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {20820#true} is VALID [2022-02-21 03:10:37,564 INFO L272 TraceCheckUtils]: 27: Hoare triple {21023#(= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {20820#true} is VALID [2022-02-21 03:10:37,565 INFO L290 TraceCheckUtils]: 26: Hoare triple {21051#(= (mod |ULTIMATE.start_main_#t~ret24#1| 4294967296) 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {21023#(= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:37,565 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {21058#(= (mod |base2flt_#res| 4294967296) 0)} {20820#true} #358#return; {21051#(= (mod |ULTIMATE.start_main_#t~ret24#1| 4294967296) 0)} is VALID [2022-02-21 03:10:37,566 INFO L290 TraceCheckUtils]: 24: Hoare triple {21058#(= (mod |base2flt_#res| 4294967296) 0)} assume true; {21058#(= (mod |base2flt_#res| 4294967296) 0)} is VALID [2022-02-21 03:10:37,566 INFO L290 TraceCheckUtils]: 23: Hoare triple {21065#(= (mod base2flt_~__retres4~0 4294967296) 0)} #res := ~__retres4~0; {21058#(= (mod |base2flt_#res| 4294967296) 0)} is VALID [2022-02-21 03:10:37,566 INFO L290 TraceCheckUtils]: 22: Hoare triple {20820#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {21065#(= (mod base2flt_~__retres4~0 4294967296) 0)} is VALID [2022-02-21 03:10:37,567 INFO L290 TraceCheckUtils]: 21: Hoare triple {20820#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20820#true} is VALID [2022-02-21 03:10:37,567 INFO L272 TraceCheckUtils]: 20: Hoare triple {20820#true} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {20820#true} is VALID [2022-02-21 03:10:37,567 INFO L290 TraceCheckUtils]: 19: Hoare triple {20820#true} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {20820#true} is VALID [2022-02-21 03:10:37,567 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {20820#true} {20820#true} #356#return; {20820#true} is VALID [2022-02-21 03:10:37,567 INFO L290 TraceCheckUtils]: 17: Hoare triple {20820#true} assume true; {20820#true} is VALID [2022-02-21 03:10:37,567 INFO L290 TraceCheckUtils]: 16: Hoare triple {20820#true} #res := ~__retres4~0; {20820#true} is VALID [2022-02-21 03:10:37,567 INFO L290 TraceCheckUtils]: 15: Hoare triple {20820#true} assume ~e >= 127;~__retres4~0 := 4294967295; {20820#true} is VALID [2022-02-21 03:10:37,567 INFO L290 TraceCheckUtils]: 14: Hoare triple {20820#true} assume ~m % 4294967296 >= 33554432; {20820#true} is VALID [2022-02-21 03:10:37,567 INFO L290 TraceCheckUtils]: 13: Hoare triple {20820#true} assume !false; {20820#true} is VALID [2022-02-21 03:10:37,567 INFO L290 TraceCheckUtils]: 12: Hoare triple {20820#true} assume !(~m % 4294967296 < 16777216); {20820#true} is VALID [2022-02-21 03:10:37,567 INFO L290 TraceCheckUtils]: 11: Hoare triple {20820#true} assume !(0 == ~m % 4294967296); {20820#true} is VALID [2022-02-21 03:10:37,567 INFO L290 TraceCheckUtils]: 10: Hoare triple {20820#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20820#true} is VALID [2022-02-21 03:10:37,567 INFO L272 TraceCheckUtils]: 9: Hoare triple {20820#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {20820#true} is VALID [2022-02-21 03:10:37,567 INFO L290 TraceCheckUtils]: 8: Hoare triple {20820#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {20820#true} is VALID [2022-02-21 03:10:37,568 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {20820#true} {20820#true} #354#return; {20820#true} is VALID [2022-02-21 03:10:37,568 INFO L290 TraceCheckUtils]: 6: Hoare triple {20820#true} assume true; {20820#true} is VALID [2022-02-21 03:10:37,568 INFO L290 TraceCheckUtils]: 5: Hoare triple {20820#true} #res := ~__retres4~0; {20820#true} is VALID [2022-02-21 03:10:37,568 INFO L290 TraceCheckUtils]: 4: Hoare triple {20820#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {20820#true} is VALID [2022-02-21 03:10:37,568 INFO L290 TraceCheckUtils]: 3: Hoare triple {20820#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20820#true} is VALID [2022-02-21 03:10:37,568 INFO L272 TraceCheckUtils]: 2: Hoare triple {20820#true} call main_#t~ret22#1 := base2flt(0, 0); {20820#true} is VALID [2022-02-21 03:10:37,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {20820#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {20820#true} is VALID [2022-02-21 03:10:37,568 INFO L290 TraceCheckUtils]: 0: Hoare triple {20820#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(24, 2);call #Ultimate.allocInit(12, 3); {20820#true} is VALID [2022-02-21 03:10:37,568 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-21 03:10:37,568 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538591138] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:37,568 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-02-21 03:10:37,568 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 11] total 20 [2022-02-21 03:10:37,569 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772415764] [2022-02-21 03:10:37,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:37,569 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2022-02-21 03:10:37,569 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:37,569 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:10:37,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:37,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-21 03:10:37,597 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:37,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-21 03:10:37,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2022-02-21 03:10:37,598 INFO L87 Difference]: Start difference. First operand 338 states and 458 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:10:39,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:39,026 INFO L93 Difference]: Finished difference Result 695 states and 947 transitions. [2022-02-21 03:10:39,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-21 03:10:39,027 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2022-02-21 03:10:39,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:39,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:10:39,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 401 transitions. [2022-02-21 03:10:39,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:10:39,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 401 transitions. [2022-02-21 03:10:39,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 401 transitions. [2022-02-21 03:10:39,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 401 edges. 401 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:39,342 INFO L225 Difference]: With dead ends: 695 [2022-02-21 03:10:39,343 INFO L226 Difference]: Without dead ends: 607 [2022-02-21 03:10:39,344 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2022-02-21 03:10:39,344 INFO L933 BasicCegarLoop]: 248 mSDtfsCounter, 166 mSDsluCounter, 1587 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 1835 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:39,344 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 1835 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:10:39,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2022-02-21 03:10:39,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 327. [2022-02-21 03:10:39,468 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:39,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 607 states. Second operand has 327 states, 290 states have (on average 1.4068965517241379) internal successors, (408), 302 states have internal predecessors, (408), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (19), 16 states have call predecessors, (19), 16 states have call successors, (19) [2022-02-21 03:10:39,469 INFO L74 IsIncluded]: Start isIncluded. First operand 607 states. Second operand has 327 states, 290 states have (on average 1.4068965517241379) internal successors, (408), 302 states have internal predecessors, (408), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (19), 16 states have call predecessors, (19), 16 states have call successors, (19) [2022-02-21 03:10:39,470 INFO L87 Difference]: Start difference. First operand 607 states. Second operand has 327 states, 290 states have (on average 1.4068965517241379) internal successors, (408), 302 states have internal predecessors, (408), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (19), 16 states have call predecessors, (19), 16 states have call successors, (19) [2022-02-21 03:10:39,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:39,493 INFO L93 Difference]: Finished difference Result 607 states and 841 transitions. [2022-02-21 03:10:39,493 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 841 transitions. [2022-02-21 03:10:39,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:39,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:39,495 INFO L74 IsIncluded]: Start isIncluded. First operand has 327 states, 290 states have (on average 1.4068965517241379) internal successors, (408), 302 states have internal predecessors, (408), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (19), 16 states have call predecessors, (19), 16 states have call successors, (19) Second operand 607 states. [2022-02-21 03:10:39,496 INFO L87 Difference]: Start difference. First operand has 327 states, 290 states have (on average 1.4068965517241379) internal successors, (408), 302 states have internal predecessors, (408), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (19), 16 states have call predecessors, (19), 16 states have call successors, (19) Second operand 607 states. [2022-02-21 03:10:39,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:39,514 INFO L93 Difference]: Finished difference Result 607 states and 841 transitions. [2022-02-21 03:10:39,514 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 841 transitions. [2022-02-21 03:10:39,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:39,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:39,515 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:39,515 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:39,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 290 states have (on average 1.4068965517241379) internal successors, (408), 302 states have internal predecessors, (408), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (19), 16 states have call predecessors, (19), 16 states have call successors, (19) [2022-02-21 03:10:39,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 444 transitions. [2022-02-21 03:10:39,523 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 444 transitions. Word has length 45 [2022-02-21 03:10:39,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:39,523 INFO L470 AbstractCegarLoop]: Abstraction has 327 states and 444 transitions. [2022-02-21 03:10:39,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:10:39,524 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 444 transitions. [2022-02-21 03:10:39,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-21 03:10:39,525 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:39,525 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:39,549 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:39,739 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:39,739 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:39,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:39,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1609884674, now seen corresponding path program 1 times [2022-02-21 03:10:39,740 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:39,740 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227547033] [2022-02-21 03:10:39,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:39,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:39,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:39,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:39,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {23523#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {23492#true} is VALID [2022-02-21 03:10:39,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {23492#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {23492#true} is VALID [2022-02-21 03:10:39,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {23492#true} #res := ~__retres4~0; {23492#true} is VALID [2022-02-21 03:10:39,772 INFO L290 TraceCheckUtils]: 3: Hoare triple {23492#true} assume true; {23492#true} is VALID [2022-02-21 03:10:39,773 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {23492#true} {23492#true} #354#return; {23492#true} is VALID [2022-02-21 03:10:39,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:39,794 INFO L290 TraceCheckUtils]: 0: Hoare triple {23523#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {23492#true} is VALID [2022-02-21 03:10:39,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {23492#true} assume !(0 == ~m % 4294967296); {23492#true} is VALID [2022-02-21 03:10:39,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {23492#true} assume !(~m % 4294967296 < 16777216); {23492#true} is VALID [2022-02-21 03:10:39,794 INFO L290 TraceCheckUtils]: 3: Hoare triple {23492#true} assume !false; {23492#true} is VALID [2022-02-21 03:10:39,795 INFO L290 TraceCheckUtils]: 4: Hoare triple {23492#true} assume !(~m % 4294967296 >= 33554432); {23492#true} is VALID [2022-02-21 03:10:39,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {23492#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {23524#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:39,795 INFO L290 TraceCheckUtils]: 6: Hoare triple {23524#(<= base2flt_~m 0)} assume 128 + ~e <= 2147483647; {23524#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:39,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {23524#(<= base2flt_~m 0)} assume 128 + ~e >= -2147483648; {23524#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:39,796 INFO L290 TraceCheckUtils]: 8: Hoare triple {23524#(<= base2flt_~m 0)} assume 128 + ~e <= 2147483647; {23524#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:39,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {23524#(<= base2flt_~m 0)} assume 128 + ~e >= -2147483648; {23524#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:39,797 INFO L290 TraceCheckUtils]: 10: Hoare triple {23524#(<= base2flt_~m 0)} assume (1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e));~res~0 := 1; {23493#false} is VALID [2022-02-21 03:10:39,797 INFO L290 TraceCheckUtils]: 11: Hoare triple {23493#false} ~__retres4~0 := ~res~0; {23493#false} is VALID [2022-02-21 03:10:39,797 INFO L290 TraceCheckUtils]: 12: Hoare triple {23493#false} #res := ~__retres4~0; {23493#false} is VALID [2022-02-21 03:10:39,797 INFO L290 TraceCheckUtils]: 13: Hoare triple {23493#false} assume true; {23493#false} is VALID [2022-02-21 03:10:39,798 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {23493#false} {23492#true} #356#return; {23493#false} is VALID [2022-02-21 03:10:39,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-21 03:10:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:39,803 INFO L290 TraceCheckUtils]: 0: Hoare triple {23523#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {23492#true} is VALID [2022-02-21 03:10:39,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {23492#true} assume !(0 == ~m % 4294967296); {23492#true} is VALID [2022-02-21 03:10:39,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {23492#true} assume !(~m % 4294967296 < 16777216); {23492#true} is VALID [2022-02-21 03:10:39,804 INFO L290 TraceCheckUtils]: 3: Hoare triple {23492#true} assume !false; {23492#true} is VALID [2022-02-21 03:10:39,804 INFO L290 TraceCheckUtils]: 4: Hoare triple {23492#true} assume ~m % 4294967296 >= 33554432; {23492#true} is VALID [2022-02-21 03:10:39,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {23492#true} assume ~e >= 127;~__retres4~0 := 4294967295; {23492#true} is VALID [2022-02-21 03:10:39,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {23492#true} #res := ~__retres4~0; {23492#true} is VALID [2022-02-21 03:10:39,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {23492#true} assume true; {23492#true} is VALID [2022-02-21 03:10:39,805 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {23492#true} {23493#false} #358#return; {23493#false} is VALID [2022-02-21 03:10:39,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {23492#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(24, 2);call #Ultimate.allocInit(12, 3); {23492#true} is VALID [2022-02-21 03:10:39,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {23492#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {23492#true} is VALID [2022-02-21 03:10:39,806 INFO L272 TraceCheckUtils]: 2: Hoare triple {23492#true} call main_#t~ret22#1 := base2flt(0, 0); {23523#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:39,806 INFO L290 TraceCheckUtils]: 3: Hoare triple {23523#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {23492#true} is VALID [2022-02-21 03:10:39,806 INFO L290 TraceCheckUtils]: 4: Hoare triple {23492#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {23492#true} is VALID [2022-02-21 03:10:39,806 INFO L290 TraceCheckUtils]: 5: Hoare triple {23492#true} #res := ~__retres4~0; {23492#true} is VALID [2022-02-21 03:10:39,806 INFO L290 TraceCheckUtils]: 6: Hoare triple {23492#true} assume true; {23492#true} is VALID [2022-02-21 03:10:39,806 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {23492#true} {23492#true} #354#return; {23492#true} is VALID [2022-02-21 03:10:39,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {23492#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {23492#true} is VALID [2022-02-21 03:10:39,807 INFO L272 TraceCheckUtils]: 9: Hoare triple {23492#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {23523#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:39,807 INFO L290 TraceCheckUtils]: 10: Hoare triple {23523#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {23492#true} is VALID [2022-02-21 03:10:39,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {23492#true} assume !(0 == ~m % 4294967296); {23492#true} is VALID [2022-02-21 03:10:39,808 INFO L290 TraceCheckUtils]: 12: Hoare triple {23492#true} assume !(~m % 4294967296 < 16777216); {23492#true} is VALID [2022-02-21 03:10:39,808 INFO L290 TraceCheckUtils]: 13: Hoare triple {23492#true} assume !false; {23492#true} is VALID [2022-02-21 03:10:39,808 INFO L290 TraceCheckUtils]: 14: Hoare triple {23492#true} assume !(~m % 4294967296 >= 33554432); {23492#true} is VALID [2022-02-21 03:10:39,808 INFO L290 TraceCheckUtils]: 15: Hoare triple {23492#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {23524#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:39,809 INFO L290 TraceCheckUtils]: 16: Hoare triple {23524#(<= base2flt_~m 0)} assume 128 + ~e <= 2147483647; {23524#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:39,809 INFO L290 TraceCheckUtils]: 17: Hoare triple {23524#(<= base2flt_~m 0)} assume 128 + ~e >= -2147483648; {23524#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:39,809 INFO L290 TraceCheckUtils]: 18: Hoare triple {23524#(<= base2flt_~m 0)} assume 128 + ~e <= 2147483647; {23524#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:39,810 INFO L290 TraceCheckUtils]: 19: Hoare triple {23524#(<= base2flt_~m 0)} assume 128 + ~e >= -2147483648; {23524#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:39,810 INFO L290 TraceCheckUtils]: 20: Hoare triple {23524#(<= base2flt_~m 0)} assume (1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e));~res~0 := 1; {23493#false} is VALID [2022-02-21 03:10:39,810 INFO L290 TraceCheckUtils]: 21: Hoare triple {23493#false} ~__retres4~0 := ~res~0; {23493#false} is VALID [2022-02-21 03:10:39,810 INFO L290 TraceCheckUtils]: 22: Hoare triple {23493#false} #res := ~__retres4~0; {23493#false} is VALID [2022-02-21 03:10:39,811 INFO L290 TraceCheckUtils]: 23: Hoare triple {23493#false} assume true; {23493#false} is VALID [2022-02-21 03:10:39,811 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {23493#false} {23492#true} #356#return; {23493#false} is VALID [2022-02-21 03:10:39,811 INFO L290 TraceCheckUtils]: 25: Hoare triple {23493#false} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {23493#false} is VALID [2022-02-21 03:10:39,811 INFO L272 TraceCheckUtils]: 26: Hoare triple {23493#false} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {23523#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:39,811 INFO L290 TraceCheckUtils]: 27: Hoare triple {23523#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {23492#true} is VALID [2022-02-21 03:10:39,811 INFO L290 TraceCheckUtils]: 28: Hoare triple {23492#true} assume !(0 == ~m % 4294967296); {23492#true} is VALID [2022-02-21 03:10:39,811 INFO L290 TraceCheckUtils]: 29: Hoare triple {23492#true} assume !(~m % 4294967296 < 16777216); {23492#true} is VALID [2022-02-21 03:10:39,812 INFO L290 TraceCheckUtils]: 30: Hoare triple {23492#true} assume !false; {23492#true} is VALID [2022-02-21 03:10:39,812 INFO L290 TraceCheckUtils]: 31: Hoare triple {23492#true} assume ~m % 4294967296 >= 33554432; {23492#true} is VALID [2022-02-21 03:10:39,812 INFO L290 TraceCheckUtils]: 32: Hoare triple {23492#true} assume ~e >= 127;~__retres4~0 := 4294967295; {23492#true} is VALID [2022-02-21 03:10:39,812 INFO L290 TraceCheckUtils]: 33: Hoare triple {23492#true} #res := ~__retres4~0; {23492#true} is VALID [2022-02-21 03:10:39,812 INFO L290 TraceCheckUtils]: 34: Hoare triple {23492#true} assume true; {23492#true} is VALID [2022-02-21 03:10:39,812 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {23492#true} {23493#false} #358#return; {23493#false} is VALID [2022-02-21 03:10:39,812 INFO L290 TraceCheckUtils]: 36: Hoare triple {23493#false} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {23493#false} is VALID [2022-02-21 03:10:39,812 INFO L272 TraceCheckUtils]: 37: Hoare triple {23493#false} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {23493#false} is VALID [2022-02-21 03:10:39,813 INFO L290 TraceCheckUtils]: 38: Hoare triple {23493#false} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {23493#false} is VALID [2022-02-21 03:10:39,813 INFO L290 TraceCheckUtils]: 39: Hoare triple {23493#false} assume !(~a % 4294967296 < ~b % 4294967296); {23493#false} is VALID [2022-02-21 03:10:39,813 INFO L290 TraceCheckUtils]: 40: Hoare triple {23493#false} assume !(0 == ~b % 4294967296); {23493#false} is VALID [2022-02-21 03:10:39,813 INFO L290 TraceCheckUtils]: 41: Hoare triple {23493#false} assume !(0 == ~a); {23493#false} is VALID [2022-02-21 03:10:39,813 INFO L290 TraceCheckUtils]: 42: Hoare triple {23493#false} assume !false; {23493#false} is VALID [2022-02-21 03:10:39,813 INFO L290 TraceCheckUtils]: 43: Hoare triple {23493#false} assume !false; {23493#false} is VALID [2022-02-21 03:10:39,813 INFO L290 TraceCheckUtils]: 44: Hoare triple {23493#false} assume ~a >= 0;abs_109 := (if ~a < 16777215 then ~a else 16777215);assume ~a >= 0;assume ~ma~0 < abs_109; {23493#false} is VALID [2022-02-21 03:10:39,814 INFO L290 TraceCheckUtils]: 45: Hoare triple {23493#false} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {23493#false} is VALID [2022-02-21 03:10:39,814 INFO L290 TraceCheckUtils]: 46: Hoare triple {23493#false} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {23493#false} is VALID [2022-02-21 03:10:39,814 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-21 03:10:39,814 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:39,814 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227547033] [2022-02-21 03:10:39,814 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227547033] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:39,815 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88138938] [2022-02-21 03:10:39,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:39,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:39,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:39,816 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:39,841 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:39,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:39,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:10:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:39,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:40,022 INFO L290 TraceCheckUtils]: 0: Hoare triple {23492#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(24, 2);call #Ultimate.allocInit(12, 3); {23492#true} is VALID [2022-02-21 03:10:40,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {23492#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {23492#true} is VALID [2022-02-21 03:10:40,022 INFO L272 TraceCheckUtils]: 2: Hoare triple {23492#true} call main_#t~ret22#1 := base2flt(0, 0); {23492#true} is VALID [2022-02-21 03:10:40,022 INFO L290 TraceCheckUtils]: 3: Hoare triple {23492#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {23492#true} is VALID [2022-02-21 03:10:40,022 INFO L290 TraceCheckUtils]: 4: Hoare triple {23492#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {23492#true} is VALID [2022-02-21 03:10:40,022 INFO L290 TraceCheckUtils]: 5: Hoare triple {23492#true} #res := ~__retres4~0; {23492#true} is VALID [2022-02-21 03:10:40,023 INFO L290 TraceCheckUtils]: 6: Hoare triple {23492#true} assume true; {23492#true} is VALID [2022-02-21 03:10:40,023 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {23492#true} {23492#true} #354#return; {23492#true} is VALID [2022-02-21 03:10:40,023 INFO L290 TraceCheckUtils]: 8: Hoare triple {23492#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {23492#true} is VALID [2022-02-21 03:10:40,023 INFO L272 TraceCheckUtils]: 9: Hoare triple {23492#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {23492#true} is VALID [2022-02-21 03:10:40,023 INFO L290 TraceCheckUtils]: 10: Hoare triple {23492#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {23492#true} is VALID [2022-02-21 03:10:40,023 INFO L290 TraceCheckUtils]: 11: Hoare triple {23492#true} assume !(0 == ~m % 4294967296); {23492#true} is VALID [2022-02-21 03:10:40,023 INFO L290 TraceCheckUtils]: 12: Hoare triple {23492#true} assume !(~m % 4294967296 < 16777216); {23492#true} is VALID [2022-02-21 03:10:40,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {23492#true} assume !false; {23492#true} is VALID [2022-02-21 03:10:40,023 INFO L290 TraceCheckUtils]: 14: Hoare triple {23492#true} assume !(~m % 4294967296 >= 33554432); {23492#true} is VALID [2022-02-21 03:10:40,024 INFO L290 TraceCheckUtils]: 15: Hoare triple {23492#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {23524#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:40,024 INFO L290 TraceCheckUtils]: 16: Hoare triple {23524#(<= base2flt_~m 0)} assume 128 + ~e <= 2147483647; {23524#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:40,024 INFO L290 TraceCheckUtils]: 17: Hoare triple {23524#(<= base2flt_~m 0)} assume 128 + ~e >= -2147483648; {23524#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:40,025 INFO L290 TraceCheckUtils]: 18: Hoare triple {23524#(<= base2flt_~m 0)} assume 128 + ~e <= 2147483647; {23524#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:40,025 INFO L290 TraceCheckUtils]: 19: Hoare triple {23524#(<= base2flt_~m 0)} assume 128 + ~e >= -2147483648; {23524#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:40,026 INFO L290 TraceCheckUtils]: 20: Hoare triple {23524#(<= base2flt_~m 0)} assume (1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e));~res~0 := 1; {23493#false} is VALID [2022-02-21 03:10:40,026 INFO L290 TraceCheckUtils]: 21: Hoare triple {23493#false} ~__retres4~0 := ~res~0; {23493#false} is VALID [2022-02-21 03:10:40,026 INFO L290 TraceCheckUtils]: 22: Hoare triple {23493#false} #res := ~__retres4~0; {23493#false} is VALID [2022-02-21 03:10:40,026 INFO L290 TraceCheckUtils]: 23: Hoare triple {23493#false} assume true; {23493#false} is VALID [2022-02-21 03:10:40,026 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {23493#false} {23492#true} #356#return; {23493#false} is VALID [2022-02-21 03:10:40,026 INFO L290 TraceCheckUtils]: 25: Hoare triple {23493#false} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {23493#false} is VALID [2022-02-21 03:10:40,026 INFO L272 TraceCheckUtils]: 26: Hoare triple {23493#false} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {23493#false} is VALID [2022-02-21 03:10:40,026 INFO L290 TraceCheckUtils]: 27: Hoare triple {23493#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {23493#false} is VALID [2022-02-21 03:10:40,026 INFO L290 TraceCheckUtils]: 28: Hoare triple {23493#false} assume !(0 == ~m % 4294967296); {23493#false} is VALID [2022-02-21 03:10:40,026 INFO L290 TraceCheckUtils]: 29: Hoare triple {23493#false} assume !(~m % 4294967296 < 16777216); {23493#false} is VALID [2022-02-21 03:10:40,027 INFO L290 TraceCheckUtils]: 30: Hoare triple {23493#false} assume !false; {23493#false} is VALID [2022-02-21 03:10:40,027 INFO L290 TraceCheckUtils]: 31: Hoare triple {23493#false} assume ~m % 4294967296 >= 33554432; {23493#false} is VALID [2022-02-21 03:10:40,027 INFO L290 TraceCheckUtils]: 32: Hoare triple {23493#false} assume ~e >= 127;~__retres4~0 := 4294967295; {23493#false} is VALID [2022-02-21 03:10:40,027 INFO L290 TraceCheckUtils]: 33: Hoare triple {23493#false} #res := ~__retres4~0; {23493#false} is VALID [2022-02-21 03:10:40,027 INFO L290 TraceCheckUtils]: 34: Hoare triple {23493#false} assume true; {23493#false} is VALID [2022-02-21 03:10:40,027 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {23493#false} {23493#false} #358#return; {23493#false} is VALID [2022-02-21 03:10:40,027 INFO L290 TraceCheckUtils]: 36: Hoare triple {23493#false} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {23493#false} is VALID [2022-02-21 03:10:40,027 INFO L272 TraceCheckUtils]: 37: Hoare triple {23493#false} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {23493#false} is VALID [2022-02-21 03:10:40,027 INFO L290 TraceCheckUtils]: 38: Hoare triple {23493#false} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {23493#false} is VALID [2022-02-21 03:10:40,027 INFO L290 TraceCheckUtils]: 39: Hoare triple {23493#false} assume !(~a % 4294967296 < ~b % 4294967296); {23493#false} is VALID [2022-02-21 03:10:40,027 INFO L290 TraceCheckUtils]: 40: Hoare triple {23493#false} assume !(0 == ~b % 4294967296); {23493#false} is VALID [2022-02-21 03:10:40,028 INFO L290 TraceCheckUtils]: 41: Hoare triple {23493#false} assume !(0 == ~a); {23493#false} is VALID [2022-02-21 03:10:40,028 INFO L290 TraceCheckUtils]: 42: Hoare triple {23493#false} assume !false; {23493#false} is VALID [2022-02-21 03:10:40,028 INFO L290 TraceCheckUtils]: 43: Hoare triple {23493#false} assume !false; {23493#false} is VALID [2022-02-21 03:10:40,028 INFO L290 TraceCheckUtils]: 44: Hoare triple {23493#false} assume ~a >= 0;abs_109 := (if ~a < 16777215 then ~a else 16777215);assume ~a >= 0;assume ~ma~0 < abs_109; {23493#false} is VALID [2022-02-21 03:10:40,028 INFO L290 TraceCheckUtils]: 45: Hoare triple {23493#false} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {23493#false} is VALID [2022-02-21 03:10:40,028 INFO L290 TraceCheckUtils]: 46: Hoare triple {23493#false} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {23493#false} is VALID [2022-02-21 03:10:40,028 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-21 03:10:40,028 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:10:40,028 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88138938] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:40,029 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:10:40,029 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2022-02-21 03:10:40,029 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523763428] [2022-02-21 03:10:40,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:40,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 47 [2022-02-21 03:10:40,029 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:40,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:40,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:40,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:10:40,063 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:40,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:10:40,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:10:40,064 INFO L87 Difference]: Start difference. First operand 327 states and 444 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:40,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:40,350 INFO L93 Difference]: Finished difference Result 586 states and 797 transitions. [2022-02-21 03:10:40,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:10:40,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 47 [2022-02-21 03:10:40,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:40,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:40,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 283 transitions. [2022-02-21 03:10:40,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:40,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 283 transitions. [2022-02-21 03:10:40,355 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 283 transitions. [2022-02-21 03:10:40,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 283 edges. 283 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:40,532 INFO L225 Difference]: With dead ends: 586 [2022-02-21 03:10:40,532 INFO L226 Difference]: Without dead ends: 351 [2022-02-21 03:10:40,532 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:10:40,533 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 10 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:40,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 244 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:10:40,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-02-21 03:10:40,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 337. [2022-02-21 03:10:40,663 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:40,664 INFO L82 GeneralOperation]: Start isEquivalent. First operand 351 states. Second operand has 337 states, 300 states have (on average 1.3933333333333333) internal successors, (418), 312 states have internal predecessors, (418), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (19), 16 states have call predecessors, (19), 16 states have call successors, (19) [2022-02-21 03:10:40,664 INFO L74 IsIncluded]: Start isIncluded. First operand 351 states. Second operand has 337 states, 300 states have (on average 1.3933333333333333) internal successors, (418), 312 states have internal predecessors, (418), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (19), 16 states have call predecessors, (19), 16 states have call successors, (19) [2022-02-21 03:10:40,665 INFO L87 Difference]: Start difference. First operand 351 states. Second operand has 337 states, 300 states have (on average 1.3933333333333333) internal successors, (418), 312 states have internal predecessors, (418), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (19), 16 states have call predecessors, (19), 16 states have call successors, (19) [2022-02-21 03:10:40,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:40,672 INFO L93 Difference]: Finished difference Result 351 states and 475 transitions. [2022-02-21 03:10:40,672 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 475 transitions. [2022-02-21 03:10:40,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:40,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:40,674 INFO L74 IsIncluded]: Start isIncluded. First operand has 337 states, 300 states have (on average 1.3933333333333333) internal successors, (418), 312 states have internal predecessors, (418), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (19), 16 states have call predecessors, (19), 16 states have call successors, (19) Second operand 351 states. [2022-02-21 03:10:40,674 INFO L87 Difference]: Start difference. First operand has 337 states, 300 states have (on average 1.3933333333333333) internal successors, (418), 312 states have internal predecessors, (418), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (19), 16 states have call predecessors, (19), 16 states have call successors, (19) Second operand 351 states. [2022-02-21 03:10:40,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:40,682 INFO L93 Difference]: Finished difference Result 351 states and 475 transitions. [2022-02-21 03:10:40,682 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 475 transitions. [2022-02-21 03:10:40,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:40,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:40,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:40,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:40,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 300 states have (on average 1.3933333333333333) internal successors, (418), 312 states have internal predecessors, (418), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (19), 16 states have call predecessors, (19), 16 states have call successors, (19) [2022-02-21 03:10:40,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 454 transitions. [2022-02-21 03:10:40,691 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 454 transitions. Word has length 47 [2022-02-21 03:10:40,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:40,691 INFO L470 AbstractCegarLoop]: Abstraction has 337 states and 454 transitions. [2022-02-21 03:10:40,691 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:40,692 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 454 transitions. [2022-02-21 03:10:40,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-21 03:10:40,692 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:40,692 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:40,722 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:40,907 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:40,908 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:40,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:40,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1216283857, now seen corresponding path program 1 times [2022-02-21 03:10:40,908 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:40,908 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471607440] [2022-02-21 03:10:40,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:40,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:40,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:40,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:40,984 INFO L290 TraceCheckUtils]: 0: Hoare triple {25434#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {25397#true} is VALID [2022-02-21 03:10:40,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {25397#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {25397#true} is VALID [2022-02-21 03:10:40,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {25397#true} #res := ~__retres4~0; {25397#true} is VALID [2022-02-21 03:10:40,985 INFO L290 TraceCheckUtils]: 3: Hoare triple {25397#true} assume true; {25397#true} is VALID [2022-02-21 03:10:40,985 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {25397#true} {25397#true} #354#return; {25397#true} is VALID [2022-02-21 03:10:40,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:40,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:41,019 INFO L290 TraceCheckUtils]: 0: Hoare triple {25434#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {25397#true} is VALID [2022-02-21 03:10:41,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {25397#true} assume !(0 == ~m % 4294967296); {25397#true} is VALID [2022-02-21 03:10:41,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {25397#true} assume !(~m % 4294967296 < 16777216); {25397#true} is VALID [2022-02-21 03:10:41,020 INFO L290 TraceCheckUtils]: 3: Hoare triple {25397#true} assume !false; {25397#true} is VALID [2022-02-21 03:10:41,020 INFO L290 TraceCheckUtils]: 4: Hoare triple {25397#true} assume !(~m % 4294967296 >= 33554432); {25397#true} is VALID [2022-02-21 03:10:41,020 INFO L290 TraceCheckUtils]: 5: Hoare triple {25397#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {25397#true} is VALID [2022-02-21 03:10:41,020 INFO L290 TraceCheckUtils]: 6: Hoare triple {25397#true} assume 128 + ~e <= 2147483647; {25397#true} is VALID [2022-02-21 03:10:41,021 INFO L290 TraceCheckUtils]: 7: Hoare triple {25397#true} assume 128 + ~e >= -2147483648; {25397#true} is VALID [2022-02-21 03:10:41,021 INFO L290 TraceCheckUtils]: 8: Hoare triple {25397#true} assume 128 + ~e <= 2147483647; {25397#true} is VALID [2022-02-21 03:10:41,021 INFO L290 TraceCheckUtils]: 9: Hoare triple {25397#true} assume 128 + ~e >= -2147483648; {25397#true} is VALID [2022-02-21 03:10:41,021 INFO L290 TraceCheckUtils]: 10: Hoare triple {25397#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {25397#true} is VALID [2022-02-21 03:10:41,022 INFO L290 TraceCheckUtils]: 11: Hoare triple {25397#true} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {25435#(<= base2flt_~res~0 0)} is VALID [2022-02-21 03:10:41,022 INFO L290 TraceCheckUtils]: 12: Hoare triple {25435#(<= base2flt_~res~0 0)} ~__retres4~0 := ~res~0; {25436#(<= base2flt_~__retres4~0 0)} is VALID [2022-02-21 03:10:41,022 INFO L290 TraceCheckUtils]: 13: Hoare triple {25436#(<= base2flt_~__retres4~0 0)} #res := ~__retres4~0; {25437#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:10:41,023 INFO L290 TraceCheckUtils]: 14: Hoare triple {25437#(<= |base2flt_#res| 0)} assume true; {25437#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:10:41,023 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {25437#(<= |base2flt_#res| 0)} {25397#true} #356#return; {25420#(<= |ULTIMATE.start_main_#t~ret23#1| 0)} is VALID [2022-02-21 03:10:41,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-21 03:10:41,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:41,030 INFO L290 TraceCheckUtils]: 0: Hoare triple {25434#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {25397#true} is VALID [2022-02-21 03:10:41,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {25397#true} assume !(0 == ~m % 4294967296); {25397#true} is VALID [2022-02-21 03:10:41,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {25397#true} assume !(~m % 4294967296 < 16777216); {25397#true} is VALID [2022-02-21 03:10:41,030 INFO L290 TraceCheckUtils]: 3: Hoare triple {25397#true} assume !false; {25397#true} is VALID [2022-02-21 03:10:41,031 INFO L290 TraceCheckUtils]: 4: Hoare triple {25397#true} assume ~m % 4294967296 >= 33554432; {25397#true} is VALID [2022-02-21 03:10:41,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {25397#true} assume ~e >= 127;~__retres4~0 := 4294967295; {25397#true} is VALID [2022-02-21 03:10:41,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {25397#true} #res := ~__retres4~0; {25397#true} is VALID [2022-02-21 03:10:41,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {25397#true} assume true; {25397#true} is VALID [2022-02-21 03:10:41,032 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {25397#true} {25421#(<= |ULTIMATE.start_main_~a~0#1| 0)} #358#return; {25421#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:41,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {25397#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(24, 2);call #Ultimate.allocInit(12, 3); {25397#true} is VALID [2022-02-21 03:10:41,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {25397#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {25397#true} is VALID [2022-02-21 03:10:41,033 INFO L272 TraceCheckUtils]: 2: Hoare triple {25397#true} call main_#t~ret22#1 := base2flt(0, 0); {25434#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:41,033 INFO L290 TraceCheckUtils]: 3: Hoare triple {25434#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {25397#true} is VALID [2022-02-21 03:10:41,033 INFO L290 TraceCheckUtils]: 4: Hoare triple {25397#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {25397#true} is VALID [2022-02-21 03:10:41,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {25397#true} #res := ~__retres4~0; {25397#true} is VALID [2022-02-21 03:10:41,033 INFO L290 TraceCheckUtils]: 6: Hoare triple {25397#true} assume true; {25397#true} is VALID [2022-02-21 03:10:41,033 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {25397#true} {25397#true} #354#return; {25397#true} is VALID [2022-02-21 03:10:41,033 INFO L290 TraceCheckUtils]: 8: Hoare triple {25397#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {25397#true} is VALID [2022-02-21 03:10:41,034 INFO L272 TraceCheckUtils]: 9: Hoare triple {25397#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {25434#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:41,034 INFO L290 TraceCheckUtils]: 10: Hoare triple {25434#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {25397#true} is VALID [2022-02-21 03:10:41,034 INFO L290 TraceCheckUtils]: 11: Hoare triple {25397#true} assume !(0 == ~m % 4294967296); {25397#true} is VALID [2022-02-21 03:10:41,034 INFO L290 TraceCheckUtils]: 12: Hoare triple {25397#true} assume !(~m % 4294967296 < 16777216); {25397#true} is VALID [2022-02-21 03:10:41,035 INFO L290 TraceCheckUtils]: 13: Hoare triple {25397#true} assume !false; {25397#true} is VALID [2022-02-21 03:10:41,035 INFO L290 TraceCheckUtils]: 14: Hoare triple {25397#true} assume !(~m % 4294967296 >= 33554432); {25397#true} is VALID [2022-02-21 03:10:41,035 INFO L290 TraceCheckUtils]: 15: Hoare triple {25397#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {25397#true} is VALID [2022-02-21 03:10:41,035 INFO L290 TraceCheckUtils]: 16: Hoare triple {25397#true} assume 128 + ~e <= 2147483647; {25397#true} is VALID [2022-02-21 03:10:41,035 INFO L290 TraceCheckUtils]: 17: Hoare triple {25397#true} assume 128 + ~e >= -2147483648; {25397#true} is VALID [2022-02-21 03:10:41,035 INFO L290 TraceCheckUtils]: 18: Hoare triple {25397#true} assume 128 + ~e <= 2147483647; {25397#true} is VALID [2022-02-21 03:10:41,035 INFO L290 TraceCheckUtils]: 19: Hoare triple {25397#true} assume 128 + ~e >= -2147483648; {25397#true} is VALID [2022-02-21 03:10:41,035 INFO L290 TraceCheckUtils]: 20: Hoare triple {25397#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {25397#true} is VALID [2022-02-21 03:10:41,036 INFO L290 TraceCheckUtils]: 21: Hoare triple {25397#true} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {25435#(<= base2flt_~res~0 0)} is VALID [2022-02-21 03:10:41,036 INFO L290 TraceCheckUtils]: 22: Hoare triple {25435#(<= base2flt_~res~0 0)} ~__retres4~0 := ~res~0; {25436#(<= base2flt_~__retres4~0 0)} is VALID [2022-02-21 03:10:41,037 INFO L290 TraceCheckUtils]: 23: Hoare triple {25436#(<= base2flt_~__retres4~0 0)} #res := ~__retres4~0; {25437#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:10:41,037 INFO L290 TraceCheckUtils]: 24: Hoare triple {25437#(<= |base2flt_#res| 0)} assume true; {25437#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:10:41,038 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {25437#(<= |base2flt_#res| 0)} {25397#true} #356#return; {25420#(<= |ULTIMATE.start_main_#t~ret23#1| 0)} is VALID [2022-02-21 03:10:41,038 INFO L290 TraceCheckUtils]: 26: Hoare triple {25420#(<= |ULTIMATE.start_main_#t~ret23#1| 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {25421#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:41,039 INFO L272 TraceCheckUtils]: 27: Hoare triple {25421#(<= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {25434#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:41,039 INFO L290 TraceCheckUtils]: 28: Hoare triple {25434#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {25397#true} is VALID [2022-02-21 03:10:41,039 INFO L290 TraceCheckUtils]: 29: Hoare triple {25397#true} assume !(0 == ~m % 4294967296); {25397#true} is VALID [2022-02-21 03:10:41,039 INFO L290 TraceCheckUtils]: 30: Hoare triple {25397#true} assume !(~m % 4294967296 < 16777216); {25397#true} is VALID [2022-02-21 03:10:41,039 INFO L290 TraceCheckUtils]: 31: Hoare triple {25397#true} assume !false; {25397#true} is VALID [2022-02-21 03:10:41,039 INFO L290 TraceCheckUtils]: 32: Hoare triple {25397#true} assume ~m % 4294967296 >= 33554432; {25397#true} is VALID [2022-02-21 03:10:41,040 INFO L290 TraceCheckUtils]: 33: Hoare triple {25397#true} assume ~e >= 127;~__retres4~0 := 4294967295; {25397#true} is VALID [2022-02-21 03:10:41,040 INFO L290 TraceCheckUtils]: 34: Hoare triple {25397#true} #res := ~__retres4~0; {25397#true} is VALID [2022-02-21 03:10:41,040 INFO L290 TraceCheckUtils]: 35: Hoare triple {25397#true} assume true; {25397#true} is VALID [2022-02-21 03:10:41,041 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {25397#true} {25421#(<= |ULTIMATE.start_main_~a~0#1| 0)} #358#return; {25421#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:41,041 INFO L290 TraceCheckUtils]: 37: Hoare triple {25421#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {25421#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:41,041 INFO L272 TraceCheckUtils]: 38: Hoare triple {25421#(<= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {25431#(<= |addflt_#in~a| 0)} is VALID [2022-02-21 03:10:41,042 INFO L290 TraceCheckUtils]: 39: Hoare triple {25431#(<= |addflt_#in~a| 0)} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {25432#(<= addflt_~a 0)} is VALID [2022-02-21 03:10:41,042 INFO L290 TraceCheckUtils]: 40: Hoare triple {25432#(<= addflt_~a 0)} assume !(~a % 4294967296 < ~b % 4294967296); {25432#(<= addflt_~a 0)} is VALID [2022-02-21 03:10:41,043 INFO L290 TraceCheckUtils]: 41: Hoare triple {25432#(<= addflt_~a 0)} assume !(0 == ~b % 4294967296); {25432#(<= addflt_~a 0)} is VALID [2022-02-21 03:10:41,043 INFO L290 TraceCheckUtils]: 42: Hoare triple {25432#(<= addflt_~a 0)} assume !(0 == ~a); {25433#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} is VALID [2022-02-21 03:10:41,043 INFO L290 TraceCheckUtils]: 43: Hoare triple {25433#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} assume !false; {25433#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} is VALID [2022-02-21 03:10:41,044 INFO L290 TraceCheckUtils]: 44: Hoare triple {25433#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} assume !false; {25433#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} is VALID [2022-02-21 03:10:41,044 INFO L290 TraceCheckUtils]: 45: Hoare triple {25433#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} assume ~a >= 0;abs_109 := (if ~a < 16777215 then ~a else 16777215);assume ~a >= 0;assume ~ma~0 < abs_109; {25398#false} is VALID [2022-02-21 03:10:41,044 INFO L290 TraceCheckUtils]: 46: Hoare triple {25398#false} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {25398#false} is VALID [2022-02-21 03:10:41,045 INFO L290 TraceCheckUtils]: 47: Hoare triple {25398#false} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {25398#false} is VALID [2022-02-21 03:10:41,045 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-21 03:10:41,045 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:41,045 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471607440] [2022-02-21 03:10:41,045 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471607440] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:41,045 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188836878] [2022-02-21 03:10:41,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:41,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:41,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:41,047 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:41,053 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:41,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:41,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:10:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:41,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:41,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {25397#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(24, 2);call #Ultimate.allocInit(12, 3); {25397#true} is VALID [2022-02-21 03:10:41,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {25397#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {25397#true} is VALID [2022-02-21 03:10:41,412 INFO L272 TraceCheckUtils]: 2: Hoare triple {25397#true} call main_#t~ret22#1 := base2flt(0, 0); {25397#true} is VALID [2022-02-21 03:10:41,412 INFO L290 TraceCheckUtils]: 3: Hoare triple {25397#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {25397#true} is VALID [2022-02-21 03:10:41,412 INFO L290 TraceCheckUtils]: 4: Hoare triple {25397#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {25397#true} is VALID [2022-02-21 03:10:41,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {25397#true} #res := ~__retres4~0; {25397#true} is VALID [2022-02-21 03:10:41,412 INFO L290 TraceCheckUtils]: 6: Hoare triple {25397#true} assume true; {25397#true} is VALID [2022-02-21 03:10:41,412 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {25397#true} {25397#true} #354#return; {25397#true} is VALID [2022-02-21 03:10:41,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {25397#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {25397#true} is VALID [2022-02-21 03:10:41,413 INFO L272 TraceCheckUtils]: 9: Hoare triple {25397#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {25397#true} is VALID [2022-02-21 03:10:41,413 INFO L290 TraceCheckUtils]: 10: Hoare triple {25397#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {25397#true} is VALID [2022-02-21 03:10:41,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {25397#true} assume !(0 == ~m % 4294967296); {25397#true} is VALID [2022-02-21 03:10:41,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {25397#true} assume !(~m % 4294967296 < 16777216); {25397#true} is VALID [2022-02-21 03:10:41,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {25397#true} assume !false; {25397#true} is VALID [2022-02-21 03:10:41,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {25397#true} assume !(~m % 4294967296 >= 33554432); {25397#true} is VALID [2022-02-21 03:10:41,413 INFO L290 TraceCheckUtils]: 15: Hoare triple {25397#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {25397#true} is VALID [2022-02-21 03:10:41,413 INFO L290 TraceCheckUtils]: 16: Hoare triple {25397#true} assume 128 + ~e <= 2147483647; {25397#true} is VALID [2022-02-21 03:10:41,413 INFO L290 TraceCheckUtils]: 17: Hoare triple {25397#true} assume 128 + ~e >= -2147483648; {25397#true} is VALID [2022-02-21 03:10:41,413 INFO L290 TraceCheckUtils]: 18: Hoare triple {25397#true} assume 128 + ~e <= 2147483647; {25397#true} is VALID [2022-02-21 03:10:41,413 INFO L290 TraceCheckUtils]: 19: Hoare triple {25397#true} assume 128 + ~e >= -2147483648; {25397#true} is VALID [2022-02-21 03:10:41,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {25397#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {25397#true} is VALID [2022-02-21 03:10:41,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {25397#true} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {25435#(<= base2flt_~res~0 0)} is VALID [2022-02-21 03:10:41,414 INFO L290 TraceCheckUtils]: 22: Hoare triple {25435#(<= base2flt_~res~0 0)} ~__retres4~0 := ~res~0; {25436#(<= base2flt_~__retres4~0 0)} is VALID [2022-02-21 03:10:41,415 INFO L290 TraceCheckUtils]: 23: Hoare triple {25436#(<= base2flt_~__retres4~0 0)} #res := ~__retres4~0; {25437#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:10:41,415 INFO L290 TraceCheckUtils]: 24: Hoare triple {25437#(<= |base2flt_#res| 0)} assume true; {25437#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:10:41,416 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {25437#(<= |base2flt_#res| 0)} {25397#true} #356#return; {25420#(<= |ULTIMATE.start_main_#t~ret23#1| 0)} is VALID [2022-02-21 03:10:41,416 INFO L290 TraceCheckUtils]: 26: Hoare triple {25420#(<= |ULTIMATE.start_main_#t~ret23#1| 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {25421#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:41,416 INFO L272 TraceCheckUtils]: 27: Hoare triple {25421#(<= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {25397#true} is VALID [2022-02-21 03:10:41,417 INFO L290 TraceCheckUtils]: 28: Hoare triple {25397#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {25397#true} is VALID [2022-02-21 03:10:41,417 INFO L290 TraceCheckUtils]: 29: Hoare triple {25397#true} assume !(0 == ~m % 4294967296); {25397#true} is VALID [2022-02-21 03:10:41,417 INFO L290 TraceCheckUtils]: 30: Hoare triple {25397#true} assume !(~m % 4294967296 < 16777216); {25397#true} is VALID [2022-02-21 03:10:41,417 INFO L290 TraceCheckUtils]: 31: Hoare triple {25397#true} assume !false; {25397#true} is VALID [2022-02-21 03:10:41,417 INFO L290 TraceCheckUtils]: 32: Hoare triple {25397#true} assume ~m % 4294967296 >= 33554432; {25397#true} is VALID [2022-02-21 03:10:41,417 INFO L290 TraceCheckUtils]: 33: Hoare triple {25397#true} assume ~e >= 127;~__retres4~0 := 4294967295; {25397#true} is VALID [2022-02-21 03:10:41,417 INFO L290 TraceCheckUtils]: 34: Hoare triple {25397#true} #res := ~__retres4~0; {25397#true} is VALID [2022-02-21 03:10:41,417 INFO L290 TraceCheckUtils]: 35: Hoare triple {25397#true} assume true; {25397#true} is VALID [2022-02-21 03:10:41,418 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {25397#true} {25421#(<= |ULTIMATE.start_main_~a~0#1| 0)} #358#return; {25421#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:41,418 INFO L290 TraceCheckUtils]: 37: Hoare triple {25421#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {25421#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:41,419 INFO L272 TraceCheckUtils]: 38: Hoare triple {25421#(<= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {25431#(<= |addflt_#in~a| 0)} is VALID [2022-02-21 03:10:41,419 INFO L290 TraceCheckUtils]: 39: Hoare triple {25431#(<= |addflt_#in~a| 0)} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {25432#(<= addflt_~a 0)} is VALID [2022-02-21 03:10:41,419 INFO L290 TraceCheckUtils]: 40: Hoare triple {25432#(<= addflt_~a 0)} assume !(~a % 4294967296 < ~b % 4294967296); {25432#(<= addflt_~a 0)} is VALID [2022-02-21 03:10:41,420 INFO L290 TraceCheckUtils]: 41: Hoare triple {25432#(<= addflt_~a 0)} assume !(0 == ~b % 4294967296); {25432#(<= addflt_~a 0)} is VALID [2022-02-21 03:10:41,420 INFO L290 TraceCheckUtils]: 42: Hoare triple {25432#(<= addflt_~a 0)} assume !(0 == ~a); {25433#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} is VALID [2022-02-21 03:10:41,420 INFO L290 TraceCheckUtils]: 43: Hoare triple {25433#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} assume !false; {25433#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} is VALID [2022-02-21 03:10:41,421 INFO L290 TraceCheckUtils]: 44: Hoare triple {25433#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} assume !false; {25433#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} is VALID [2022-02-21 03:10:41,421 INFO L290 TraceCheckUtils]: 45: Hoare triple {25433#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} assume ~a >= 0;abs_109 := (if ~a < 16777215 then ~a else 16777215);assume ~a >= 0;assume ~ma~0 < abs_109; {25398#false} is VALID [2022-02-21 03:10:41,421 INFO L290 TraceCheckUtils]: 46: Hoare triple {25398#false} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {25398#false} is VALID [2022-02-21 03:10:41,422 INFO L290 TraceCheckUtils]: 47: Hoare triple {25398#false} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {25398#false} is VALID [2022-02-21 03:10:41,422 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-21 03:10:41,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:10:41,799 INFO L290 TraceCheckUtils]: 47: Hoare triple {25398#false} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {25398#false} is VALID [2022-02-21 03:10:41,800 INFO L290 TraceCheckUtils]: 46: Hoare triple {25398#false} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {25398#false} is VALID [2022-02-21 03:10:41,800 INFO L290 TraceCheckUtils]: 45: Hoare triple {25433#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} assume ~a >= 0;abs_109 := (if ~a < 16777215 then ~a else 16777215);assume ~a >= 0;assume ~ma~0 < abs_109; {25398#false} is VALID [2022-02-21 03:10:41,800 INFO L290 TraceCheckUtils]: 44: Hoare triple {25433#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} assume !false; {25433#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} is VALID [2022-02-21 03:10:41,801 INFO L290 TraceCheckUtils]: 43: Hoare triple {25433#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} assume !false; {25433#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} is VALID [2022-02-21 03:10:41,801 INFO L290 TraceCheckUtils]: 42: Hoare triple {25432#(<= addflt_~a 0)} assume !(0 == ~a); {25433#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} is VALID [2022-02-21 03:10:41,801 INFO L290 TraceCheckUtils]: 41: Hoare triple {25432#(<= addflt_~a 0)} assume !(0 == ~b % 4294967296); {25432#(<= addflt_~a 0)} is VALID [2022-02-21 03:10:41,802 INFO L290 TraceCheckUtils]: 40: Hoare triple {25432#(<= addflt_~a 0)} assume !(~a % 4294967296 < ~b % 4294967296); {25432#(<= addflt_~a 0)} is VALID [2022-02-21 03:10:41,802 INFO L290 TraceCheckUtils]: 39: Hoare triple {25431#(<= |addflt_#in~a| 0)} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {25432#(<= addflt_~a 0)} is VALID [2022-02-21 03:10:41,803 INFO L272 TraceCheckUtils]: 38: Hoare triple {25421#(<= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {25431#(<= |addflt_#in~a| 0)} is VALID [2022-02-21 03:10:41,803 INFO L290 TraceCheckUtils]: 37: Hoare triple {25421#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {25421#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:41,803 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {25397#true} {25421#(<= |ULTIMATE.start_main_~a~0#1| 0)} #358#return; {25421#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:41,804 INFO L290 TraceCheckUtils]: 35: Hoare triple {25397#true} assume true; {25397#true} is VALID [2022-02-21 03:10:41,804 INFO L290 TraceCheckUtils]: 34: Hoare triple {25397#true} #res := ~__retres4~0; {25397#true} is VALID [2022-02-21 03:10:41,804 INFO L290 TraceCheckUtils]: 33: Hoare triple {25397#true} assume ~e >= 127;~__retres4~0 := 4294967295; {25397#true} is VALID [2022-02-21 03:10:41,804 INFO L290 TraceCheckUtils]: 32: Hoare triple {25397#true} assume ~m % 4294967296 >= 33554432; {25397#true} is VALID [2022-02-21 03:10:41,804 INFO L290 TraceCheckUtils]: 31: Hoare triple {25397#true} assume !false; {25397#true} is VALID [2022-02-21 03:10:41,804 INFO L290 TraceCheckUtils]: 30: Hoare triple {25397#true} assume !(~m % 4294967296 < 16777216); {25397#true} is VALID [2022-02-21 03:10:41,804 INFO L290 TraceCheckUtils]: 29: Hoare triple {25397#true} assume !(0 == ~m % 4294967296); {25397#true} is VALID [2022-02-21 03:10:41,804 INFO L290 TraceCheckUtils]: 28: Hoare triple {25397#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {25397#true} is VALID [2022-02-21 03:10:41,804 INFO L272 TraceCheckUtils]: 27: Hoare triple {25421#(<= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {25397#true} is VALID [2022-02-21 03:10:41,804 INFO L290 TraceCheckUtils]: 26: Hoare triple {25420#(<= |ULTIMATE.start_main_#t~ret23#1| 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {25421#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:41,819 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {25437#(<= |base2flt_#res| 0)} {25397#true} #356#return; {25420#(<= |ULTIMATE.start_main_#t~ret23#1| 0)} is VALID [2022-02-21 03:10:41,820 INFO L290 TraceCheckUtils]: 24: Hoare triple {25437#(<= |base2flt_#res| 0)} assume true; {25437#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:10:41,820 INFO L290 TraceCheckUtils]: 23: Hoare triple {25436#(<= base2flt_~__retres4~0 0)} #res := ~__retres4~0; {25437#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:10:41,820 INFO L290 TraceCheckUtils]: 22: Hoare triple {25435#(<= base2flt_~res~0 0)} ~__retres4~0 := ~res~0; {25436#(<= base2flt_~__retres4~0 0)} is VALID [2022-02-21 03:10:41,821 INFO L290 TraceCheckUtils]: 21: Hoare triple {25397#true} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {25435#(<= base2flt_~res~0 0)} is VALID [2022-02-21 03:10:41,821 INFO L290 TraceCheckUtils]: 20: Hoare triple {25397#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {25397#true} is VALID [2022-02-21 03:10:41,821 INFO L290 TraceCheckUtils]: 19: Hoare triple {25397#true} assume 128 + ~e >= -2147483648; {25397#true} is VALID [2022-02-21 03:10:41,821 INFO L290 TraceCheckUtils]: 18: Hoare triple {25397#true} assume 128 + ~e <= 2147483647; {25397#true} is VALID [2022-02-21 03:10:41,821 INFO L290 TraceCheckUtils]: 17: Hoare triple {25397#true} assume 128 + ~e >= -2147483648; {25397#true} is VALID [2022-02-21 03:10:41,821 INFO L290 TraceCheckUtils]: 16: Hoare triple {25397#true} assume 128 + ~e <= 2147483647; {25397#true} is VALID [2022-02-21 03:10:41,822 INFO L290 TraceCheckUtils]: 15: Hoare triple {25397#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {25397#true} is VALID [2022-02-21 03:10:41,822 INFO L290 TraceCheckUtils]: 14: Hoare triple {25397#true} assume !(~m % 4294967296 >= 33554432); {25397#true} is VALID [2022-02-21 03:10:41,822 INFO L290 TraceCheckUtils]: 13: Hoare triple {25397#true} assume !false; {25397#true} is VALID [2022-02-21 03:10:41,822 INFO L290 TraceCheckUtils]: 12: Hoare triple {25397#true} assume !(~m % 4294967296 < 16777216); {25397#true} is VALID [2022-02-21 03:10:41,822 INFO L290 TraceCheckUtils]: 11: Hoare triple {25397#true} assume !(0 == ~m % 4294967296); {25397#true} is VALID [2022-02-21 03:10:41,822 INFO L290 TraceCheckUtils]: 10: Hoare triple {25397#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {25397#true} is VALID [2022-02-21 03:10:41,822 INFO L272 TraceCheckUtils]: 9: Hoare triple {25397#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {25397#true} is VALID [2022-02-21 03:10:41,822 INFO L290 TraceCheckUtils]: 8: Hoare triple {25397#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {25397#true} is VALID [2022-02-21 03:10:41,822 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {25397#true} {25397#true} #354#return; {25397#true} is VALID [2022-02-21 03:10:41,822 INFO L290 TraceCheckUtils]: 6: Hoare triple {25397#true} assume true; {25397#true} is VALID [2022-02-21 03:10:41,822 INFO L290 TraceCheckUtils]: 5: Hoare triple {25397#true} #res := ~__retres4~0; {25397#true} is VALID [2022-02-21 03:10:41,823 INFO L290 TraceCheckUtils]: 4: Hoare triple {25397#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {25397#true} is VALID [2022-02-21 03:10:41,823 INFO L290 TraceCheckUtils]: 3: Hoare triple {25397#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {25397#true} is VALID [2022-02-21 03:10:41,823 INFO L272 TraceCheckUtils]: 2: Hoare triple {25397#true} call main_#t~ret22#1 := base2flt(0, 0); {25397#true} is VALID [2022-02-21 03:10:41,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {25397#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {25397#true} is VALID [2022-02-21 03:10:41,823 INFO L290 TraceCheckUtils]: 0: Hoare triple {25397#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(24, 2);call #Ultimate.allocInit(12, 3); {25397#true} is VALID [2022-02-21 03:10:41,823 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-21 03:10:41,823 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188836878] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:10:41,823 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:10:41,824 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 11 [2022-02-21 03:10:41,824 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624350954] [2022-02-21 03:10:41,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:10:41,824 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2022-02-21 03:10:41,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:41,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:41,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:41,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-21 03:10:41,857 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:41,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-21 03:10:41,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-02-21 03:10:41,857 INFO L87 Difference]: Start difference. First operand 337 states and 454 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:45,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:45,614 INFO L93 Difference]: Finished difference Result 1032 states and 1398 transitions. [2022-02-21 03:10:45,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-21 03:10:45,619 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2022-02-21 03:10:45,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:45,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:45,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 610 transitions. [2022-02-21 03:10:45,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:45,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 610 transitions. [2022-02-21 03:10:45,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 610 transitions. [2022-02-21 03:10:46,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 610 edges. 610 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:46,087 INFO L225 Difference]: With dead ends: 1032 [2022-02-21 03:10:46,087 INFO L226 Difference]: Without dead ends: 919 [2022-02-21 03:10:46,088 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2022-02-21 03:10:46,088 INFO L933 BasicCegarLoop]: 352 mSDtfsCounter, 434 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 2213 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 2251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:46,088 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [437 Valid, 791 Invalid, 2251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2213 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-02-21 03:10:46,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2022-02-21 03:10:46,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 475. [2022-02-21 03:10:46,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:46,318 INFO L82 GeneralOperation]: Start isEquivalent. First operand 919 states. Second operand has 475 states, 428 states have (on average 1.4042056074766356) internal successors, (601), 441 states have internal predecessors, (601), 24 states have call successors, (24), 10 states have call predecessors, (24), 13 states have return successors, (28), 23 states have call predecessors, (28), 23 states have call successors, (28) [2022-02-21 03:10:46,318 INFO L74 IsIncluded]: Start isIncluded. First operand 919 states. Second operand has 475 states, 428 states have (on average 1.4042056074766356) internal successors, (601), 441 states have internal predecessors, (601), 24 states have call successors, (24), 10 states have call predecessors, (24), 13 states have return successors, (28), 23 states have call predecessors, (28), 23 states have call successors, (28) [2022-02-21 03:10:46,319 INFO L87 Difference]: Start difference. First operand 919 states. Second operand has 475 states, 428 states have (on average 1.4042056074766356) internal successors, (601), 441 states have internal predecessors, (601), 24 states have call successors, (24), 10 states have call predecessors, (24), 13 states have return successors, (28), 23 states have call predecessors, (28), 23 states have call successors, (28) [2022-02-21 03:10:46,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:46,357 INFO L93 Difference]: Finished difference Result 919 states and 1245 transitions. [2022-02-21 03:10:46,357 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1245 transitions. [2022-02-21 03:10:46,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:46,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:46,360 INFO L74 IsIncluded]: Start isIncluded. First operand has 475 states, 428 states have (on average 1.4042056074766356) internal successors, (601), 441 states have internal predecessors, (601), 24 states have call successors, (24), 10 states have call predecessors, (24), 13 states have return successors, (28), 23 states have call predecessors, (28), 23 states have call successors, (28) Second operand 919 states. [2022-02-21 03:10:46,360 INFO L87 Difference]: Start difference. First operand has 475 states, 428 states have (on average 1.4042056074766356) internal successors, (601), 441 states have internal predecessors, (601), 24 states have call successors, (24), 10 states have call predecessors, (24), 13 states have return successors, (28), 23 states have call predecessors, (28), 23 states have call successors, (28) Second operand 919 states. [2022-02-21 03:10:46,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:46,400 INFO L93 Difference]: Finished difference Result 919 states and 1245 transitions. [2022-02-21 03:10:46,400 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1245 transitions. [2022-02-21 03:10:46,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:46,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:46,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:46,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:46,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 428 states have (on average 1.4042056074766356) internal successors, (601), 441 states have internal predecessors, (601), 24 states have call successors, (24), 10 states have call predecessors, (24), 13 states have return successors, (28), 23 states have call predecessors, (28), 23 states have call successors, (28) [2022-02-21 03:10:46,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 653 transitions. [2022-02-21 03:10:46,417 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 653 transitions. Word has length 48 [2022-02-21 03:10:46,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:46,418 INFO L470 AbstractCegarLoop]: Abstraction has 475 states and 653 transitions. [2022-02-21 03:10:46,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:46,418 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 653 transitions. [2022-02-21 03:10:46,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-21 03:10:46,420 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:46,420 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:46,446 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:46,635 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:46,635 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:46,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:46,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1216281935, now seen corresponding path program 1 times [2022-02-21 03:10:46,636 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:46,636 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869484813] [2022-02-21 03:10:46,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:46,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:46,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:46,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:46,698 INFO L290 TraceCheckUtils]: 0: Hoare triple {29270#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {29234#true} is VALID [2022-02-21 03:10:46,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {29234#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {29234#true} is VALID [2022-02-21 03:10:46,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {29234#true} #res := ~__retres4~0; {29234#true} is VALID [2022-02-21 03:10:46,698 INFO L290 TraceCheckUtils]: 3: Hoare triple {29234#true} assume true; {29234#true} is VALID [2022-02-21 03:10:46,699 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {29234#true} {29234#true} #354#return; {29234#true} is VALID [2022-02-21 03:10:46,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:46,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:46,736 INFO L290 TraceCheckUtils]: 0: Hoare triple {29270#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {29234#true} is VALID [2022-02-21 03:10:46,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {29234#true} assume !(0 == ~m % 4294967296); {29234#true} is VALID [2022-02-21 03:10:46,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {29234#true} assume !(~m % 4294967296 < 16777216); {29234#true} is VALID [2022-02-21 03:10:46,736 INFO L290 TraceCheckUtils]: 3: Hoare triple {29234#true} assume !false; {29234#true} is VALID [2022-02-21 03:10:46,736 INFO L290 TraceCheckUtils]: 4: Hoare triple {29234#true} assume !(~m % 4294967296 >= 33554432); {29234#true} is VALID [2022-02-21 03:10:46,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {29234#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {29234#true} is VALID [2022-02-21 03:10:46,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {29234#true} assume 128 + ~e <= 2147483647; {29234#true} is VALID [2022-02-21 03:10:46,736 INFO L290 TraceCheckUtils]: 7: Hoare triple {29234#true} assume 128 + ~e >= -2147483648; {29234#true} is VALID [2022-02-21 03:10:46,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {29234#true} assume 128 + ~e <= 2147483647; {29234#true} is VALID [2022-02-21 03:10:46,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {29234#true} assume 128 + ~e >= -2147483648; {29234#true} is VALID [2022-02-21 03:10:46,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {29234#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {29234#true} is VALID [2022-02-21 03:10:46,737 INFO L290 TraceCheckUtils]: 11: Hoare triple {29234#true} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {29271#(<= 0 base2flt_~res~0)} is VALID [2022-02-21 03:10:46,737 INFO L290 TraceCheckUtils]: 12: Hoare triple {29271#(<= 0 base2flt_~res~0)} ~__retres4~0 := ~res~0; {29272#(<= 0 base2flt_~__retres4~0)} is VALID [2022-02-21 03:10:46,738 INFO L290 TraceCheckUtils]: 13: Hoare triple {29272#(<= 0 base2flt_~__retres4~0)} #res := ~__retres4~0; {29273#(<= 0 |base2flt_#res|)} is VALID [2022-02-21 03:10:46,738 INFO L290 TraceCheckUtils]: 14: Hoare triple {29273#(<= 0 |base2flt_#res|)} assume true; {29273#(<= 0 |base2flt_#res|)} is VALID [2022-02-21 03:10:46,739 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {29273#(<= 0 |base2flt_#res|)} {29234#true} #356#return; {29257#(<= 0 |ULTIMATE.start_main_#t~ret23#1|)} is VALID [2022-02-21 03:10:46,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-21 03:10:46,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:46,744 INFO L290 TraceCheckUtils]: 0: Hoare triple {29270#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {29234#true} is VALID [2022-02-21 03:10:46,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {29234#true} assume !(0 == ~m % 4294967296); {29234#true} is VALID [2022-02-21 03:10:46,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {29234#true} assume !(~m % 4294967296 < 16777216); {29234#true} is VALID [2022-02-21 03:10:46,744 INFO L290 TraceCheckUtils]: 3: Hoare triple {29234#true} assume !false; {29234#true} is VALID [2022-02-21 03:10:46,744 INFO L290 TraceCheckUtils]: 4: Hoare triple {29234#true} assume ~m % 4294967296 >= 33554432; {29234#true} is VALID [2022-02-21 03:10:46,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {29234#true} assume ~e >= 127;~__retres4~0 := 4294967295; {29234#true} is VALID [2022-02-21 03:10:46,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {29234#true} #res := ~__retres4~0; {29234#true} is VALID [2022-02-21 03:10:46,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {29234#true} assume true; {29234#true} is VALID [2022-02-21 03:10:46,745 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {29234#true} {29258#(<= 0 |ULTIMATE.start_main_~a~0#1|)} #358#return; {29258#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:46,745 INFO L290 TraceCheckUtils]: 0: Hoare triple {29234#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(24, 2);call #Ultimate.allocInit(12, 3); {29234#true} is VALID [2022-02-21 03:10:46,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {29234#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {29234#true} is VALID [2022-02-21 03:10:46,745 INFO L272 TraceCheckUtils]: 2: Hoare triple {29234#true} call main_#t~ret22#1 := base2flt(0, 0); {29270#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:46,746 INFO L290 TraceCheckUtils]: 3: Hoare triple {29270#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {29234#true} is VALID [2022-02-21 03:10:46,746 INFO L290 TraceCheckUtils]: 4: Hoare triple {29234#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {29234#true} is VALID [2022-02-21 03:10:46,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {29234#true} #res := ~__retres4~0; {29234#true} is VALID [2022-02-21 03:10:46,746 INFO L290 TraceCheckUtils]: 6: Hoare triple {29234#true} assume true; {29234#true} is VALID [2022-02-21 03:10:46,746 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {29234#true} {29234#true} #354#return; {29234#true} is VALID [2022-02-21 03:10:46,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {29234#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {29234#true} is VALID [2022-02-21 03:10:46,747 INFO L272 TraceCheckUtils]: 9: Hoare triple {29234#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {29270#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:46,747 INFO L290 TraceCheckUtils]: 10: Hoare triple {29270#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {29234#true} is VALID [2022-02-21 03:10:46,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {29234#true} assume !(0 == ~m % 4294967296); {29234#true} is VALID [2022-02-21 03:10:46,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {29234#true} assume !(~m % 4294967296 < 16777216); {29234#true} is VALID [2022-02-21 03:10:46,747 INFO L290 TraceCheckUtils]: 13: Hoare triple {29234#true} assume !false; {29234#true} is VALID [2022-02-21 03:10:46,747 INFO L290 TraceCheckUtils]: 14: Hoare triple {29234#true} assume !(~m % 4294967296 >= 33554432); {29234#true} is VALID [2022-02-21 03:10:46,747 INFO L290 TraceCheckUtils]: 15: Hoare triple {29234#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {29234#true} is VALID [2022-02-21 03:10:46,747 INFO L290 TraceCheckUtils]: 16: Hoare triple {29234#true} assume 128 + ~e <= 2147483647; {29234#true} is VALID [2022-02-21 03:10:46,747 INFO L290 TraceCheckUtils]: 17: Hoare triple {29234#true} assume 128 + ~e >= -2147483648; {29234#true} is VALID [2022-02-21 03:10:46,747 INFO L290 TraceCheckUtils]: 18: Hoare triple {29234#true} assume 128 + ~e <= 2147483647; {29234#true} is VALID [2022-02-21 03:10:46,747 INFO L290 TraceCheckUtils]: 19: Hoare triple {29234#true} assume 128 + ~e >= -2147483648; {29234#true} is VALID [2022-02-21 03:10:46,748 INFO L290 TraceCheckUtils]: 20: Hoare triple {29234#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {29234#true} is VALID [2022-02-21 03:10:46,748 INFO L290 TraceCheckUtils]: 21: Hoare triple {29234#true} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {29271#(<= 0 base2flt_~res~0)} is VALID [2022-02-21 03:10:46,748 INFO L290 TraceCheckUtils]: 22: Hoare triple {29271#(<= 0 base2flt_~res~0)} ~__retres4~0 := ~res~0; {29272#(<= 0 base2flt_~__retres4~0)} is VALID [2022-02-21 03:10:46,749 INFO L290 TraceCheckUtils]: 23: Hoare triple {29272#(<= 0 base2flt_~__retres4~0)} #res := ~__retres4~0; {29273#(<= 0 |base2flt_#res|)} is VALID [2022-02-21 03:10:46,749 INFO L290 TraceCheckUtils]: 24: Hoare triple {29273#(<= 0 |base2flt_#res|)} assume true; {29273#(<= 0 |base2flt_#res|)} is VALID [2022-02-21 03:10:46,750 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {29273#(<= 0 |base2flt_#res|)} {29234#true} #356#return; {29257#(<= 0 |ULTIMATE.start_main_#t~ret23#1|)} is VALID [2022-02-21 03:10:46,750 INFO L290 TraceCheckUtils]: 26: Hoare triple {29257#(<= 0 |ULTIMATE.start_main_#t~ret23#1|)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {29258#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:46,751 INFO L272 TraceCheckUtils]: 27: Hoare triple {29258#(<= 0 |ULTIMATE.start_main_~a~0#1|)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {29270#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:46,751 INFO L290 TraceCheckUtils]: 28: Hoare triple {29270#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {29234#true} is VALID [2022-02-21 03:10:46,751 INFO L290 TraceCheckUtils]: 29: Hoare triple {29234#true} assume !(0 == ~m % 4294967296); {29234#true} is VALID [2022-02-21 03:10:46,751 INFO L290 TraceCheckUtils]: 30: Hoare triple {29234#true} assume !(~m % 4294967296 < 16777216); {29234#true} is VALID [2022-02-21 03:10:46,751 INFO L290 TraceCheckUtils]: 31: Hoare triple {29234#true} assume !false; {29234#true} is VALID [2022-02-21 03:10:46,751 INFO L290 TraceCheckUtils]: 32: Hoare triple {29234#true} assume ~m % 4294967296 >= 33554432; {29234#true} is VALID [2022-02-21 03:10:46,751 INFO L290 TraceCheckUtils]: 33: Hoare triple {29234#true} assume ~e >= 127;~__retres4~0 := 4294967295; {29234#true} is VALID [2022-02-21 03:10:46,751 INFO L290 TraceCheckUtils]: 34: Hoare triple {29234#true} #res := ~__retres4~0; {29234#true} is VALID [2022-02-21 03:10:46,751 INFO L290 TraceCheckUtils]: 35: Hoare triple {29234#true} assume true; {29234#true} is VALID [2022-02-21 03:10:46,752 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {29234#true} {29258#(<= 0 |ULTIMATE.start_main_~a~0#1|)} #358#return; {29258#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:46,752 INFO L290 TraceCheckUtils]: 37: Hoare triple {29258#(<= 0 |ULTIMATE.start_main_~a~0#1|)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {29258#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:46,753 INFO L272 TraceCheckUtils]: 38: Hoare triple {29258#(<= 0 |ULTIMATE.start_main_~a~0#1|)} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {29268#(<= 0 |addflt_#in~a|)} is VALID [2022-02-21 03:10:46,753 INFO L290 TraceCheckUtils]: 39: Hoare triple {29268#(<= 0 |addflt_#in~a|)} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {29269#(<= 0 addflt_~a)} is VALID [2022-02-21 03:10:46,753 INFO L290 TraceCheckUtils]: 40: Hoare triple {29269#(<= 0 addflt_~a)} assume !(~a % 4294967296 < ~b % 4294967296); {29269#(<= 0 addflt_~a)} is VALID [2022-02-21 03:10:46,754 INFO L290 TraceCheckUtils]: 41: Hoare triple {29269#(<= 0 addflt_~a)} assume !(0 == ~b % 4294967296); {29269#(<= 0 addflt_~a)} is VALID [2022-02-21 03:10:46,754 INFO L290 TraceCheckUtils]: 42: Hoare triple {29269#(<= 0 addflt_~a)} assume !(0 == ~a); {29269#(<= 0 addflt_~a)} is VALID [2022-02-21 03:10:46,754 INFO L290 TraceCheckUtils]: 43: Hoare triple {29269#(<= 0 addflt_~a)} assume !false; {29269#(<= 0 addflt_~a)} is VALID [2022-02-21 03:10:46,754 INFO L290 TraceCheckUtils]: 44: Hoare triple {29269#(<= 0 addflt_~a)} assume !false; {29269#(<= 0 addflt_~a)} is VALID [2022-02-21 03:10:46,755 INFO L290 TraceCheckUtils]: 45: Hoare triple {29269#(<= 0 addflt_~a)} assume !(~a >= 0);~ma~0 := #t~nondet6;havoc #t~nondet6; {29235#false} is VALID [2022-02-21 03:10:46,755 INFO L290 TraceCheckUtils]: 46: Hoare triple {29235#false} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {29235#false} is VALID [2022-02-21 03:10:46,755 INFO L290 TraceCheckUtils]: 47: Hoare triple {29235#false} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {29235#false} is VALID [2022-02-21 03:10:46,755 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-21 03:10:46,755 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:46,755 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869484813] [2022-02-21 03:10:46,755 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869484813] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:46,756 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833206592] [2022-02-21 03:10:46,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:46,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:46,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:46,760 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:46,795 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:46,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:46,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 03:10:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:46,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:47,550 INFO L290 TraceCheckUtils]: 0: Hoare triple {29234#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(24, 2);call #Ultimate.allocInit(12, 3); {29234#true} is VALID [2022-02-21 03:10:47,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {29234#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {29280#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:47,551 INFO L272 TraceCheckUtils]: 2: Hoare triple {29280#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret22#1 := base2flt(0, 0); {29234#true} is VALID [2022-02-21 03:10:47,551 INFO L290 TraceCheckUtils]: 3: Hoare triple {29234#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {29234#true} is VALID [2022-02-21 03:10:47,551 INFO L290 TraceCheckUtils]: 4: Hoare triple {29234#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {29234#true} is VALID [2022-02-21 03:10:47,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {29234#true} #res := ~__retres4~0; {29234#true} is VALID [2022-02-21 03:10:47,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {29234#true} assume true; {29234#true} is VALID [2022-02-21 03:10:47,552 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {29234#true} {29280#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} #354#return; {29280#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:47,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {29280#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {29280#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:47,552 INFO L272 TraceCheckUtils]: 9: Hoare triple {29280#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {29234#true} is VALID [2022-02-21 03:10:47,553 INFO L290 TraceCheckUtils]: 10: Hoare triple {29234#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {29308#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:47,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {29308#(<= |base2flt_#in~e| base2flt_~e)} assume !(0 == ~m % 4294967296); {29308#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:47,553 INFO L290 TraceCheckUtils]: 12: Hoare triple {29308#(<= |base2flt_#in~e| base2flt_~e)} assume !(~m % 4294967296 < 16777216); {29308#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:47,553 INFO L290 TraceCheckUtils]: 13: Hoare triple {29308#(<= |base2flt_#in~e| base2flt_~e)} assume !false; {29308#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:47,554 INFO L290 TraceCheckUtils]: 14: Hoare triple {29308#(<= |base2flt_#in~e| base2flt_~e)} assume !(~m % 4294967296 >= 33554432); {29308#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:47,554 INFO L290 TraceCheckUtils]: 15: Hoare triple {29308#(<= |base2flt_#in~e| base2flt_~e)} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {29308#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:47,554 INFO L290 TraceCheckUtils]: 16: Hoare triple {29308#(<= |base2flt_#in~e| base2flt_~e)} assume 128 + ~e <= 2147483647; {29308#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:47,555 INFO L290 TraceCheckUtils]: 17: Hoare triple {29308#(<= |base2flt_#in~e| base2flt_~e)} assume 128 + ~e >= -2147483648; {29308#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:47,555 INFO L290 TraceCheckUtils]: 18: Hoare triple {29308#(<= |base2flt_#in~e| base2flt_~e)} assume 128 + ~e <= 2147483647; {29308#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:47,555 INFO L290 TraceCheckUtils]: 19: Hoare triple {29308#(<= |base2flt_#in~e| base2flt_~e)} assume 128 + ~e >= -2147483648; {29308#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:47,555 INFO L290 TraceCheckUtils]: 20: Hoare triple {29308#(<= |base2flt_#in~e| base2flt_~e)} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {29308#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:47,556 INFO L290 TraceCheckUtils]: 21: Hoare triple {29308#(<= |base2flt_#in~e| base2flt_~e)} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {29342#(<= |base2flt_#in~e| (div (+ (- 2147483648) base2flt_~res~0) 16777216))} is VALID [2022-02-21 03:10:47,556 INFO L290 TraceCheckUtils]: 22: Hoare triple {29342#(<= |base2flt_#in~e| (div (+ (- 2147483648) base2flt_~res~0) 16777216))} ~__retres4~0 := ~res~0; {29346#(<= |base2flt_#in~e| (div (+ (- 2147483648) base2flt_~__retres4~0) 16777216))} is VALID [2022-02-21 03:10:47,557 INFO L290 TraceCheckUtils]: 23: Hoare triple {29346#(<= |base2flt_#in~e| (div (+ (- 2147483648) base2flt_~__retres4~0) 16777216))} #res := ~__retres4~0; {29350#(<= |base2flt_#in~e| (div (+ (- 2147483648) |base2flt_#res|) 16777216))} is VALID [2022-02-21 03:10:47,557 INFO L290 TraceCheckUtils]: 24: Hoare triple {29350#(<= |base2flt_#in~e| (div (+ (- 2147483648) |base2flt_#res|) 16777216))} assume true; {29350#(<= |base2flt_#in~e| (div (+ (- 2147483648) |base2flt_#res|) 16777216))} is VALID [2022-02-21 03:10:47,558 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {29350#(<= |base2flt_#in~e| (div (+ (- 2147483648) |base2flt_#res|) 16777216))} {29280#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} #356#return; {29257#(<= 0 |ULTIMATE.start_main_#t~ret23#1|)} is VALID [2022-02-21 03:10:47,558 INFO L290 TraceCheckUtils]: 26: Hoare triple {29257#(<= 0 |ULTIMATE.start_main_#t~ret23#1|)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {29258#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:47,558 INFO L272 TraceCheckUtils]: 27: Hoare triple {29258#(<= 0 |ULTIMATE.start_main_~a~0#1|)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {29234#true} is VALID [2022-02-21 03:10:47,558 INFO L290 TraceCheckUtils]: 28: Hoare triple {29234#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {29234#true} is VALID [2022-02-21 03:10:47,558 INFO L290 TraceCheckUtils]: 29: Hoare triple {29234#true} assume !(0 == ~m % 4294967296); {29234#true} is VALID [2022-02-21 03:10:47,558 INFO L290 TraceCheckUtils]: 30: Hoare triple {29234#true} assume !(~m % 4294967296 < 16777216); {29234#true} is VALID [2022-02-21 03:10:47,558 INFO L290 TraceCheckUtils]: 31: Hoare triple {29234#true} assume !false; {29234#true} is VALID [2022-02-21 03:10:47,558 INFO L290 TraceCheckUtils]: 32: Hoare triple {29234#true} assume ~m % 4294967296 >= 33554432; {29234#true} is VALID [2022-02-21 03:10:47,558 INFO L290 TraceCheckUtils]: 33: Hoare triple {29234#true} assume ~e >= 127;~__retres4~0 := 4294967295; {29234#true} is VALID [2022-02-21 03:10:47,558 INFO L290 TraceCheckUtils]: 34: Hoare triple {29234#true} #res := ~__retres4~0; {29234#true} is VALID [2022-02-21 03:10:47,559 INFO L290 TraceCheckUtils]: 35: Hoare triple {29234#true} assume true; {29234#true} is VALID [2022-02-21 03:10:47,559 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {29234#true} {29258#(<= 0 |ULTIMATE.start_main_~a~0#1|)} #358#return; {29258#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:47,559 INFO L290 TraceCheckUtils]: 37: Hoare triple {29258#(<= 0 |ULTIMATE.start_main_~a~0#1|)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {29258#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:47,560 INFO L272 TraceCheckUtils]: 38: Hoare triple {29258#(<= 0 |ULTIMATE.start_main_~a~0#1|)} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {29268#(<= 0 |addflt_#in~a|)} is VALID [2022-02-21 03:10:47,560 INFO L290 TraceCheckUtils]: 39: Hoare triple {29268#(<= 0 |addflt_#in~a|)} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {29269#(<= 0 addflt_~a)} is VALID [2022-02-21 03:10:47,560 INFO L290 TraceCheckUtils]: 40: Hoare triple {29269#(<= 0 addflt_~a)} assume !(~a % 4294967296 < ~b % 4294967296); {29269#(<= 0 addflt_~a)} is VALID [2022-02-21 03:10:47,561 INFO L290 TraceCheckUtils]: 41: Hoare triple {29269#(<= 0 addflt_~a)} assume !(0 == ~b % 4294967296); {29269#(<= 0 addflt_~a)} is VALID [2022-02-21 03:10:47,561 INFO L290 TraceCheckUtils]: 42: Hoare triple {29269#(<= 0 addflt_~a)} assume !(0 == ~a); {29269#(<= 0 addflt_~a)} is VALID [2022-02-21 03:10:47,561 INFO L290 TraceCheckUtils]: 43: Hoare triple {29269#(<= 0 addflt_~a)} assume !false; {29269#(<= 0 addflt_~a)} is VALID [2022-02-21 03:10:47,574 INFO L290 TraceCheckUtils]: 44: Hoare triple {29269#(<= 0 addflt_~a)} assume !false; {29269#(<= 0 addflt_~a)} is VALID [2022-02-21 03:10:47,575 INFO L290 TraceCheckUtils]: 45: Hoare triple {29269#(<= 0 addflt_~a)} assume !(~a >= 0);~ma~0 := #t~nondet6;havoc #t~nondet6; {29235#false} is VALID [2022-02-21 03:10:47,575 INFO L290 TraceCheckUtils]: 46: Hoare triple {29235#false} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {29235#false} is VALID [2022-02-21 03:10:47,575 INFO L290 TraceCheckUtils]: 47: Hoare triple {29235#false} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {29235#false} is VALID [2022-02-21 03:10:47,575 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-21 03:10:47,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:10:48,084 INFO L290 TraceCheckUtils]: 47: Hoare triple {29235#false} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {29235#false} is VALID [2022-02-21 03:10:48,084 INFO L290 TraceCheckUtils]: 46: Hoare triple {29235#false} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {29235#false} is VALID [2022-02-21 03:10:48,085 INFO L290 TraceCheckUtils]: 45: Hoare triple {29269#(<= 0 addflt_~a)} assume !(~a >= 0);~ma~0 := #t~nondet6;havoc #t~nondet6; {29235#false} is VALID [2022-02-21 03:10:48,085 INFO L290 TraceCheckUtils]: 44: Hoare triple {29269#(<= 0 addflt_~a)} assume !false; {29269#(<= 0 addflt_~a)} is VALID [2022-02-21 03:10:48,085 INFO L290 TraceCheckUtils]: 43: Hoare triple {29269#(<= 0 addflt_~a)} assume !false; {29269#(<= 0 addflt_~a)} is VALID [2022-02-21 03:10:48,086 INFO L290 TraceCheckUtils]: 42: Hoare triple {29269#(<= 0 addflt_~a)} assume !(0 == ~a); {29269#(<= 0 addflt_~a)} is VALID [2022-02-21 03:10:48,086 INFO L290 TraceCheckUtils]: 41: Hoare triple {29269#(<= 0 addflt_~a)} assume !(0 == ~b % 4294967296); {29269#(<= 0 addflt_~a)} is VALID [2022-02-21 03:10:48,086 INFO L290 TraceCheckUtils]: 40: Hoare triple {29269#(<= 0 addflt_~a)} assume !(~a % 4294967296 < ~b % 4294967296); {29269#(<= 0 addflt_~a)} is VALID [2022-02-21 03:10:48,086 INFO L290 TraceCheckUtils]: 39: Hoare triple {29268#(<= 0 |addflt_#in~a|)} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {29269#(<= 0 addflt_~a)} is VALID [2022-02-21 03:10:48,087 INFO L272 TraceCheckUtils]: 38: Hoare triple {29258#(<= 0 |ULTIMATE.start_main_~a~0#1|)} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {29268#(<= 0 |addflt_#in~a|)} is VALID [2022-02-21 03:10:48,087 INFO L290 TraceCheckUtils]: 37: Hoare triple {29258#(<= 0 |ULTIMATE.start_main_~a~0#1|)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {29258#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:48,088 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {29234#true} {29258#(<= 0 |ULTIMATE.start_main_~a~0#1|)} #358#return; {29258#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:48,088 INFO L290 TraceCheckUtils]: 35: Hoare triple {29234#true} assume true; {29234#true} is VALID [2022-02-21 03:10:48,088 INFO L290 TraceCheckUtils]: 34: Hoare triple {29234#true} #res := ~__retres4~0; {29234#true} is VALID [2022-02-21 03:10:48,088 INFO L290 TraceCheckUtils]: 33: Hoare triple {29234#true} assume ~e >= 127;~__retres4~0 := 4294967295; {29234#true} is VALID [2022-02-21 03:10:48,088 INFO L290 TraceCheckUtils]: 32: Hoare triple {29234#true} assume ~m % 4294967296 >= 33554432; {29234#true} is VALID [2022-02-21 03:10:48,088 INFO L290 TraceCheckUtils]: 31: Hoare triple {29234#true} assume !false; {29234#true} is VALID [2022-02-21 03:10:48,088 INFO L290 TraceCheckUtils]: 30: Hoare triple {29234#true} assume !(~m % 4294967296 < 16777216); {29234#true} is VALID [2022-02-21 03:10:48,088 INFO L290 TraceCheckUtils]: 29: Hoare triple {29234#true} assume !(0 == ~m % 4294967296); {29234#true} is VALID [2022-02-21 03:10:48,088 INFO L290 TraceCheckUtils]: 28: Hoare triple {29234#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {29234#true} is VALID [2022-02-21 03:10:48,088 INFO L272 TraceCheckUtils]: 27: Hoare triple {29258#(<= 0 |ULTIMATE.start_main_~a~0#1|)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {29234#true} is VALID [2022-02-21 03:10:48,089 INFO L290 TraceCheckUtils]: 26: Hoare triple {29257#(<= 0 |ULTIMATE.start_main_#t~ret23#1|)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {29258#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:48,089 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {29492#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 |base2flt_#res|))} {29280#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} #356#return; {29257#(<= 0 |ULTIMATE.start_main_#t~ret23#1|)} is VALID [2022-02-21 03:10:48,090 INFO L290 TraceCheckUtils]: 24: Hoare triple {29492#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 |base2flt_#res|))} assume true; {29492#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:48,090 INFO L290 TraceCheckUtils]: 23: Hoare triple {29499#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {29492#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:48,090 INFO L290 TraceCheckUtils]: 22: Hoare triple {29503#(or (<= 0 base2flt_~res~0) (< (+ 128 |base2flt_#in~e|) 0))} ~__retres4~0 := ~res~0; {29499#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:48,091 INFO L290 TraceCheckUtils]: 21: Hoare triple {29507#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {29503#(or (<= 0 base2flt_~res~0) (< (+ 128 |base2flt_#in~e|) 0))} is VALID [2022-02-21 03:10:48,091 INFO L290 TraceCheckUtils]: 20: Hoare triple {29507#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {29507#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} is VALID [2022-02-21 03:10:48,092 INFO L290 TraceCheckUtils]: 19: Hoare triple {29507#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} assume 128 + ~e >= -2147483648; {29507#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} is VALID [2022-02-21 03:10:48,092 INFO L290 TraceCheckUtils]: 18: Hoare triple {29507#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} assume 128 + ~e <= 2147483647; {29507#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} is VALID [2022-02-21 03:10:48,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {29507#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} assume 128 + ~e >= -2147483648; {29507#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} is VALID [2022-02-21 03:10:48,093 INFO L290 TraceCheckUtils]: 16: Hoare triple {29507#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} assume 128 + ~e <= 2147483647; {29507#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} is VALID [2022-02-21 03:10:48,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {29507#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {29507#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} is VALID [2022-02-21 03:10:48,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {29507#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} assume !(~m % 4294967296 >= 33554432); {29507#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} is VALID [2022-02-21 03:10:48,094 INFO L290 TraceCheckUtils]: 13: Hoare triple {29507#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} assume !false; {29507#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} is VALID [2022-02-21 03:10:48,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {29507#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} assume !(~m % 4294967296 < 16777216); {29507#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} is VALID [2022-02-21 03:10:48,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {29507#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} assume !(0 == ~m % 4294967296); {29507#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} is VALID [2022-02-21 03:10:48,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {29234#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {29507#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} is VALID [2022-02-21 03:10:48,095 INFO L272 TraceCheckUtils]: 9: Hoare triple {29280#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {29234#true} is VALID [2022-02-21 03:10:48,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {29280#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {29280#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:48,096 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {29234#true} {29280#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} #354#return; {29280#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:48,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {29234#true} assume true; {29234#true} is VALID [2022-02-21 03:10:48,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {29234#true} #res := ~__retres4~0; {29234#true} is VALID [2022-02-21 03:10:48,096 INFO L290 TraceCheckUtils]: 4: Hoare triple {29234#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {29234#true} is VALID [2022-02-21 03:10:48,096 INFO L290 TraceCheckUtils]: 3: Hoare triple {29234#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {29234#true} is VALID [2022-02-21 03:10:48,096 INFO L272 TraceCheckUtils]: 2: Hoare triple {29280#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret22#1 := base2flt(0, 0); {29234#true} is VALID [2022-02-21 03:10:48,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {29234#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {29280#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:48,096 INFO L290 TraceCheckUtils]: 0: Hoare triple {29234#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(24, 2);call #Ultimate.allocInit(12, 3); {29234#true} is VALID [2022-02-21 03:10:48,097 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-21 03:10:48,097 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833206592] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:10:48,097 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:10:48,097 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 19 [2022-02-21 03:10:48,097 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685091813] [2022-02-21 03:10:48,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:10:48,098 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 16 states have internal predecessors, (67), 3 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 48 [2022-02-21 03:10:48,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:48,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 16 states have internal predecessors, (67), 3 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:48,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:48,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-21 03:10:48,155 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:48,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-21 03:10:48,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2022-02-21 03:10:48,155 INFO L87 Difference]: Start difference. First operand 475 states and 653 transitions. Second operand has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 16 states have internal predecessors, (67), 3 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6)