./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_1-3a.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_1-3a.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 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:09:46,546 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:09:46,548 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:09:46,573 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:09:46,578 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:09:46,579 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:09:46,580 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:09:46,584 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:09:46,586 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:09:46,587 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:09:46,588 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:09:46,588 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:09:46,589 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:09:46,591 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:09:46,592 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:09:46,594 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:09:46,595 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:09:46,598 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:09:46,599 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:09:46,604 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:09:46,607 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:09:46,608 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:09:46,608 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:09:46,610 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:09:46,611 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:09:46,612 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:09:46,613 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:09:46,613 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:09:46,615 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:09:46,615 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:09:46,615 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:09:46,616 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:09:46,617 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:09:46,618 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:09:46,619 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:09:46,619 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:09:46,620 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:09:46,620 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:09:46,620 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:09:46,621 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:09:46,622 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:09:46,623 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-02-21 03:09:46,645 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:09:46,645 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:09:46,646 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:09:46,646 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:09:46,647 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:09:46,647 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:09:46,647 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:09:46,648 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:09:46,648 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:09:46,648 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:09:46,649 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:09:46,649 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:09:46,649 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:09:46,649 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:09:46,649 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:09:46,650 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:09:46,650 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:09:46,650 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:09:46,650 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:09:46,650 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:09:46,650 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:09:46,650 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:09:46,651 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:09:46,651 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:09:46,651 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:09:46,651 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:09:46,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:09:46,652 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:09:46,652 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:09:46,653 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:09:46,653 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:09:46,653 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:09:46,653 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:09:46,653 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 -> 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f [2022-02-21 03:09:46,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:09:46,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:09:46,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:09:46,908 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:09:46,908 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:09:46,910 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2022-02-21 03:09:46,976 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65d2acb53/00888c816f6f49939039b73d94ca09c0/FLAGf955dd722 [2022-02-21 03:09:47,313 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:09:47,314 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2022-02-21 03:09:47,319 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65d2acb53/00888c816f6f49939039b73d94ca09c0/FLAGf955dd722 [2022-02-21 03:09:47,720 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65d2acb53/00888c816f6f49939039b73d94ca09c0 [2022-02-21 03:09:47,722 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:09:47,723 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:09:47,724 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:09:47,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:09:47,741 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:09:47,743 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:09:47" (1/1) ... [2022-02-21 03:09:47,745 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fdb2d8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:09:47, skipping insertion in model container [2022-02-21 03:09:47,745 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:09:47" (1/1) ... [2022-02-21 03:09:47,750 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:09:47,776 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:09:47,904 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_1-3a.c.cil.c[730,743] [2022-02-21 03:09:47,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:09:47,961 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:09:47,969 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_1-3a.c.cil.c[730,743] [2022-02-21 03:09:48,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:09:48,024 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:09:48,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:09:48 WrapperNode [2022-02-21 03:09:48,024 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:09:48,025 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:09:48,025 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:09:48,025 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:09:48,035 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:48" (1/1) ... [2022-02-21 03:09:48,051 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:48" (1/1) ... [2022-02-21 03:09:48,080 INFO L137 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 225 [2022-02-21 03:09:48,081 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:09:48,082 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:09:48,082 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:09:48,082 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:09:48,088 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:48" (1/1) ... [2022-02-21 03:09:48,103 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:48" (1/1) ... [2022-02-21 03:09:48,106 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:48" (1/1) ... [2022-02-21 03:09:48,106 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:48" (1/1) ... [2022-02-21 03:09:48,114 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:48" (1/1) ... [2022-02-21 03:09:48,119 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:48" (1/1) ... [2022-02-21 03:09:48,136 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:48" (1/1) ... [2022-02-21 03:09:48,139 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:09:48,139 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:09:48,140 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:09:48,140 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:09:48,141 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:09:48" (1/1) ... [2022-02-21 03:09:48,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:09:48,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:09:48,187 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-21 03:09:48,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-21 03:09:48,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:09:48,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:09:48,236 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-02-21 03:09:48,239 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-02-21 03:09:48,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:09:48,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:09:48,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-21 03:09:48,243 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-21 03:09:48,308 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:09:48,309 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:09:48,804 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:09:48,812 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:09:48,813 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:09:48,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:09:48 BoogieIcfgContainer [2022-02-21 03:09:48,816 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:09:48,817 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:09:48,817 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:09:48,819 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:09:48,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:09:47" (1/3) ... [2022-02-21 03:09:48,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a0d4304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:09:48, skipping insertion in model container [2022-02-21 03:09:48,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:09:48" (2/3) ... [2022-02-21 03:09:48,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a0d4304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:09:48, skipping insertion in model container [2022-02-21 03:09:48,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:09:48" (3/3) ... [2022-02-21 03:09:48,821 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_1-3a.c.cil.c [2022-02-21 03:09:48,827 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:09:48,827 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2022-02-21 03:09:48,869 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:09:48,874 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-21 03:09:48,874 INFO L340 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2022-02-21 03:09:48,893 INFO L276 IsEmpty]: Start isEmpty. Operand has 142 states, 110 states have (on average 1.7818181818181817) internal successors, (196), 132 states have internal predecessors, (196), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-21 03:09:48,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-21 03:09:48,896 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:09:48,896 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:09:48,897 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:09:48,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:09:48,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1345103503, now seen corresponding path program 1 times [2022-02-21 03:09:48,907 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:09:48,908 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141515665] [2022-02-21 03:09:48,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:48,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:09:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:49,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {145#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); {145#true} is VALID [2022-02-21 03:09:49,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {145#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {145#true} is VALID [2022-02-21 03:09:49,062 INFO L272 TraceCheckUtils]: 2: Hoare triple {145#true} call main_#t~ret22#1 := base2flt(0, 0); {145#true} is VALID [2022-02-21 03:09:49,062 INFO L290 TraceCheckUtils]: 3: Hoare triple {145#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {145#true} is VALID [2022-02-21 03:09:49,062 INFO L290 TraceCheckUtils]: 4: Hoare triple {145#true} assume !(0 == ~m % 4294967296); {145#true} is VALID [2022-02-21 03:09:49,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {145#true} assume !(~m % 4294967296 < 16777216); {145#true} is VALID [2022-02-21 03:09:49,063 INFO L290 TraceCheckUtils]: 6: Hoare triple {145#true} assume !true; {146#false} is VALID [2022-02-21 03:09:49,063 INFO L290 TraceCheckUtils]: 7: Hoare triple {146#false} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {146#false} is VALID [2022-02-21 03:09:49,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {146#false} assume !(128 + ~e <= 2147483647); {146#false} is VALID [2022-02-21 03:09:49,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:09:49,065 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:09:49,065 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141515665] [2022-02-21 03:09:49,066 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141515665] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:09:49,066 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:09:49,067 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:09:49,069 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715377071] [2022-02-21 03:09:49,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:09:49,073 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-21 03:09:49,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:09:49,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:09:49,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:49,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-21 03:09:49,086 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:09:49,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 03:09:49,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 03:09:49,114 INFO L87 Difference]: Start difference. First operand has 142 states, 110 states have (on average 1.7818181818181817) internal successors, (196), 132 states have internal predecessors, (196), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:09:49,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:49,288 INFO L93 Difference]: Finished difference Result 279 states and 433 transitions. [2022-02-21 03:09:49,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 03:09:49,288 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-21 03:09:49,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:09:49,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:09:49,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 433 transitions. [2022-02-21 03:09:49,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:09:49,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 433 transitions. [2022-02-21 03:09:49,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 433 transitions. [2022-02-21 03:09:49,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 433 edges. 433 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:49,657 INFO L225 Difference]: With dead ends: 279 [2022-02-21 03:09:49,658 INFO L226 Difference]: Without dead ends: 107 [2022-02-21 03:09:49,662 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 03:09:49,665 INFO L933 BasicCegarLoop]: 194 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, 194 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:09:49,666 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:09:49,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-02-21 03:09:49,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-02-21 03:09:49,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:09:49,697 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 107 states, 81 states have (on average 1.5432098765432098) internal successors, (125), 98 states have internal predecessors, (125), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:49,701 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 107 states, 81 states have (on average 1.5432098765432098) internal successors, (125), 98 states have internal predecessors, (125), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:49,702 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 107 states, 81 states have (on average 1.5432098765432098) internal successors, (125), 98 states have internal predecessors, (125), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:49,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:49,711 INFO L93 Difference]: Finished difference Result 107 states and 137 transitions. [2022-02-21 03:09:49,711 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 137 transitions. [2022-02-21 03:09:49,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:49,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:49,714 INFO L74 IsIncluded]: Start isIncluded. First operand has 107 states, 81 states have (on average 1.5432098765432098) internal successors, (125), 98 states have internal predecessors, (125), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 107 states. [2022-02-21 03:09:49,714 INFO L87 Difference]: Start difference. First operand has 107 states, 81 states have (on average 1.5432098765432098) internal successors, (125), 98 states have internal predecessors, (125), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 107 states. [2022-02-21 03:09:49,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:49,719 INFO L93 Difference]: Finished difference Result 107 states and 137 transitions. [2022-02-21 03:09:49,719 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 137 transitions. [2022-02-21 03:09:49,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:49,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:49,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:09:49,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:09:49,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 81 states have (on average 1.5432098765432098) internal successors, (125), 98 states have internal predecessors, (125), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:49,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 137 transitions. [2022-02-21 03:09:49,732 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 137 transitions. Word has length 9 [2022-02-21 03:09:49,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:09:49,733 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 137 transitions. [2022-02-21 03:09:49,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:09:49,733 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 137 transitions. [2022-02-21 03:09:49,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-21 03:09:49,734 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:09:49,734 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:09:49,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:09:49,735 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:09:49,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:09:49,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1344162155, now seen corresponding path program 1 times [2022-02-21 03:09:49,740 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:09:49,741 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233025124] [2022-02-21 03:09:49,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:49,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:09:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:49,781 INFO L290 TraceCheckUtils]: 0: Hoare triple {798#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); {798#true} is VALID [2022-02-21 03:09:49,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {798#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {798#true} is VALID [2022-02-21 03:09:49,782 INFO L272 TraceCheckUtils]: 2: Hoare triple {798#true} call main_#t~ret22#1 := base2flt(0, 0); {800#(= |base2flt_#in~e| 0)} is VALID [2022-02-21 03:09:49,783 INFO L290 TraceCheckUtils]: 3: Hoare triple {800#(= |base2flt_#in~e| 0)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {801#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:49,783 INFO L290 TraceCheckUtils]: 4: Hoare triple {801#(= base2flt_~e 0)} assume !(0 == ~m % 4294967296); {801#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:49,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {801#(= base2flt_~e 0)} assume ~m % 4294967296 < 16777216; {801#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:49,784 INFO L290 TraceCheckUtils]: 6: Hoare triple {801#(= base2flt_~e 0)} assume !false; {801#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:49,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {801#(= base2flt_~e 0)} assume !(~e <= -128); {801#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:49,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {801#(= base2flt_~e 0)} assume !(~e - 1 <= 2147483647); {799#false} is VALID [2022-02-21 03:09:49,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:09:49,785 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:09:49,786 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233025124] [2022-02-21 03:09:49,786 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233025124] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:09:49,786 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:09:49,786 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:09:49,786 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068958467] [2022-02-21 03:09:49,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:09:49,787 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-21 03:09:49,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:09:49,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:09:49,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:49,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:09:49,795 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:09:49,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:09:49,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:09:49,795 INFO L87 Difference]: Start difference. First operand 107 states and 137 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:09:50,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:50,046 INFO L93 Difference]: Finished difference Result 273 states and 365 transitions. [2022-02-21 03:09:50,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:09:50,047 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-21 03:09:50,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:09:50,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:09:50,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 365 transitions. [2022-02-21 03:09:50,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:09:50,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 365 transitions. [2022-02-21 03:09:50,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 365 transitions. [2022-02-21 03:09:50,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 365 edges. 365 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:50,304 INFO L225 Difference]: With dead ends: 273 [2022-02-21 03:09:50,304 INFO L226 Difference]: Without dead ends: 169 [2022-02-21 03:09:50,305 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:09:50,306 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 106 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 361 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.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:09:50,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 361 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:09:50,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-02-21 03:09:50,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 156. [2022-02-21 03:09:50,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:09:50,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand has 156 states, 129 states have (on average 1.550387596899225) internal successors, (200), 146 states have internal predecessors, (200), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:50,314 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand has 156 states, 129 states have (on average 1.550387596899225) internal successors, (200), 146 states have internal predecessors, (200), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:50,314 INFO L87 Difference]: Start difference. First operand 169 states. Second operand has 156 states, 129 states have (on average 1.550387596899225) internal successors, (200), 146 states have internal predecessors, (200), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:50,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:50,319 INFO L93 Difference]: Finished difference Result 169 states and 218 transitions. [2022-02-21 03:09:50,319 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 218 transitions. [2022-02-21 03:09:50,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:50,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:50,320 INFO L74 IsIncluded]: Start isIncluded. First operand has 156 states, 129 states have (on average 1.550387596899225) internal successors, (200), 146 states have internal predecessors, (200), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 169 states. [2022-02-21 03:09:50,320 INFO L87 Difference]: Start difference. First operand has 156 states, 129 states have (on average 1.550387596899225) internal successors, (200), 146 states have internal predecessors, (200), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 169 states. [2022-02-21 03:09:50,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:50,324 INFO L93 Difference]: Finished difference Result 169 states and 218 transitions. [2022-02-21 03:09:50,324 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 218 transitions. [2022-02-21 03:09:50,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:50,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:50,325 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:09:50,325 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:09:50,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 129 states have (on average 1.550387596899225) internal successors, (200), 146 states have internal predecessors, (200), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:50,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 212 transitions. [2022-02-21 03:09:50,330 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 212 transitions. Word has length 9 [2022-02-21 03:09:50,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:09:50,330 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 212 transitions. [2022-02-21 03:09:50,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:09:50,330 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 212 transitions. [2022-02-21 03:09:50,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-21 03:09:50,331 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:09:50,331 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:09:50,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 03:09:50,331 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:09:50,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:09:50,332 INFO L85 PathProgramCache]: Analyzing trace with hash 466647620, now seen corresponding path program 1 times [2022-02-21 03:09:50,332 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:09:50,332 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061585859] [2022-02-21 03:09:50,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:50,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:09:50,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:50,374 INFO L290 TraceCheckUtils]: 0: Hoare triple {1625#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); {1625#true} is VALID [2022-02-21 03:09:50,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {1625#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {1625#true} is VALID [2022-02-21 03:09:50,375 INFO L272 TraceCheckUtils]: 2: Hoare triple {1625#true} call main_#t~ret22#1 := base2flt(0, 0); {1627#(= |base2flt_#in~e| 0)} is VALID [2022-02-21 03:09:50,375 INFO L290 TraceCheckUtils]: 3: Hoare triple {1627#(= |base2flt_#in~e| 0)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {1628#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:50,376 INFO L290 TraceCheckUtils]: 4: Hoare triple {1628#(= base2flt_~e 0)} assume !(0 == ~m % 4294967296); {1628#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:50,376 INFO L290 TraceCheckUtils]: 5: Hoare triple {1628#(= base2flt_~e 0)} assume ~m % 4294967296 < 16777216; {1628#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:50,376 INFO L290 TraceCheckUtils]: 6: Hoare triple {1628#(= base2flt_~e 0)} assume !false; {1628#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:50,377 INFO L290 TraceCheckUtils]: 7: Hoare triple {1628#(= base2flt_~e 0)} assume !(~e <= -128); {1628#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:50,377 INFO L290 TraceCheckUtils]: 8: Hoare triple {1628#(= base2flt_~e 0)} assume ~e - 1 <= 2147483647; {1628#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:50,378 INFO L290 TraceCheckUtils]: 9: Hoare triple {1628#(= base2flt_~e 0)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {1629#(<= (+ base2flt_~e 1) 0)} is VALID [2022-02-21 03:09:50,378 INFO L290 TraceCheckUtils]: 10: Hoare triple {1629#(<= (+ base2flt_~e 1) 0)} assume !(~m % 4294967296 < 16777216); {1629#(<= (+ base2flt_~e 1) 0)} is VALID [2022-02-21 03:09:50,378 INFO L290 TraceCheckUtils]: 11: Hoare triple {1629#(<= (+ base2flt_~e 1) 0)} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {1629#(<= (+ base2flt_~e 1) 0)} is VALID [2022-02-21 03:09:50,379 INFO L290 TraceCheckUtils]: 12: Hoare triple {1629#(<= (+ base2flt_~e 1) 0)} assume !(128 + ~e <= 2147483647); {1626#false} is VALID [2022-02-21 03:09:50,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:09:50,379 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:09:50,380 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061585859] [2022-02-21 03:09:50,380 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061585859] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:09:50,380 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:09:50,380 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:09:50,380 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278694551] [2022-02-21 03:09:50,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:09:50,381 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:09:50,381 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:09:50,381 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:09:50,389 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:09:50,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:09:50,389 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:09:50,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:09:50,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:09:50,390 INFO L87 Difference]: Start difference. First operand 156 states and 212 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:09:50,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:50,725 INFO L93 Difference]: Finished difference Result 191 states and 251 transitions. [2022-02-21 03:09:50,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:09:50,725 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:09:50,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:09:50,725 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:09:50,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 251 transitions. [2022-02-21 03:09:50,732 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:09:50,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 251 transitions. [2022-02-21 03:09:50,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 251 transitions. [2022-02-21 03:09:50,885 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 251 edges. 251 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:50,891 INFO L225 Difference]: With dead ends: 191 [2022-02-21 03:09:50,891 INFO L226 Difference]: Without dead ends: 188 [2022-02-21 03:09:50,892 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:09:50,898 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 161 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 483 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:09:50,900 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 483 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:09:50,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-02-21 03:09:50,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 163. [2022-02-21 03:09:50,922 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:09:50,926 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states. Second operand has 163 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 153 states have internal predecessors, (211), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:50,927 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand has 163 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 153 states have internal predecessors, (211), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:50,931 INFO L87 Difference]: Start difference. First operand 188 states. Second operand has 163 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 153 states have internal predecessors, (211), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:50,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:50,937 INFO L93 Difference]: Finished difference Result 188 states and 248 transitions. [2022-02-21 03:09:50,938 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 248 transitions. [2022-02-21 03:09:50,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:50,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:50,939 INFO L74 IsIncluded]: Start isIncluded. First operand has 163 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 153 states have internal predecessors, (211), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 188 states. [2022-02-21 03:09:50,940 INFO L87 Difference]: Start difference. First operand has 163 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 153 states have internal predecessors, (211), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 188 states. [2022-02-21 03:09:50,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:50,947 INFO L93 Difference]: Finished difference Result 188 states and 248 transitions. [2022-02-21 03:09:50,947 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 248 transitions. [2022-02-21 03:09:50,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:50,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:50,948 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:09:50,948 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:09:50,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 153 states have internal predecessors, (211), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:50,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 223 transitions. [2022-02-21 03:09:50,955 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 223 transitions. Word has length 13 [2022-02-21 03:09:50,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:09:50,955 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 223 transitions. [2022-02-21 03:09:50,955 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:09:50,956 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 223 transitions. [2022-02-21 03:09:50,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-21 03:09:50,956 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:09:50,956 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:09:50,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 03:09:50,957 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:09:50,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:09:50,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1581174453, now seen corresponding path program 1 times [2022-02-21 03:09:50,958 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:09:50,958 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220928133] [2022-02-21 03:09:50,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:50,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:09:50,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:50,996 INFO L290 TraceCheckUtils]: 0: Hoare triple {2411#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); {2411#true} is VALID [2022-02-21 03:09:50,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {2411#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {2411#true} is VALID [2022-02-21 03:09:50,997 INFO L272 TraceCheckUtils]: 2: Hoare triple {2411#true} call main_#t~ret22#1 := base2flt(0, 0); {2413#(= |base2flt_#in~e| 0)} is VALID [2022-02-21 03:09:50,998 INFO L290 TraceCheckUtils]: 3: Hoare triple {2413#(= |base2flt_#in~e| 0)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {2414#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:50,998 INFO L290 TraceCheckUtils]: 4: Hoare triple {2414#(= base2flt_~e 0)} assume !(0 == ~m % 4294967296); {2414#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:50,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {2414#(= base2flt_~e 0)} assume ~m % 4294967296 < 16777216; {2414#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:50,999 INFO L290 TraceCheckUtils]: 6: Hoare triple {2414#(= base2flt_~e 0)} assume !false; {2414#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:50,999 INFO L290 TraceCheckUtils]: 7: Hoare triple {2414#(= base2flt_~e 0)} assume !(~e <= -128); {2414#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:51,000 INFO L290 TraceCheckUtils]: 8: Hoare triple {2414#(= base2flt_~e 0)} assume ~e - 1 <= 2147483647; {2414#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:51,000 INFO L290 TraceCheckUtils]: 9: Hoare triple {2414#(= base2flt_~e 0)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {2415#(<= 0 (+ base2flt_~e 1))} is VALID [2022-02-21 03:09:51,001 INFO L290 TraceCheckUtils]: 10: Hoare triple {2415#(<= 0 (+ base2flt_~e 1))} assume !(~m % 4294967296 < 16777216); {2415#(<= 0 (+ base2flt_~e 1))} is VALID [2022-02-21 03:09:51,001 INFO L290 TraceCheckUtils]: 11: Hoare triple {2415#(<= 0 (+ base2flt_~e 1))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {2415#(<= 0 (+ base2flt_~e 1))} is VALID [2022-02-21 03:09:51,001 INFO L290 TraceCheckUtils]: 12: Hoare triple {2415#(<= 0 (+ base2flt_~e 1))} assume 128 + ~e <= 2147483647; {2415#(<= 0 (+ base2flt_~e 1))} is VALID [2022-02-21 03:09:51,002 INFO L290 TraceCheckUtils]: 13: Hoare triple {2415#(<= 0 (+ base2flt_~e 1))} assume !(128 + ~e >= -2147483648); {2412#false} is VALID [2022-02-21 03:09:51,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:09:51,002 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:09:51,002 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220928133] [2022-02-21 03:09:51,003 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220928133] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:09:51,003 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:09:51,003 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:09:51,003 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811054613] [2022-02-21 03:09:51,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:09:51,004 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:09:51,004 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:09:51,004 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:09:51,012 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:09:51,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:09:51,013 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:09:51,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:09:51,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:09:51,014 INFO L87 Difference]: Start difference. First operand 163 states and 223 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:09:51,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:51,408 INFO L93 Difference]: Finished difference Result 306 states and 404 transitions. [2022-02-21 03:09:51,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:09:51,409 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:09:51,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:09:51,409 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:09:51,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 389 transitions. [2022-02-21 03:09:51,413 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:09:51,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 389 transitions. [2022-02-21 03:09:51,417 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 389 transitions. [2022-02-21 03:09:51,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 389 edges. 389 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:51,667 INFO L225 Difference]: With dead ends: 306 [2022-02-21 03:09:51,667 INFO L226 Difference]: Without dead ends: 198 [2022-02-21 03:09:51,668 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:09:51,668 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 165 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 493 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:09:51,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 493 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:09:51,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-02-21 03:09:51,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 167. [2022-02-21 03:09:51,686 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:09:51,686 INFO L82 GeneralOperation]: Start isEquivalent. First operand 198 states. Second operand has 167 states, 140 states have (on average 1.5285714285714285) internal successors, (214), 157 states have internal predecessors, (214), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:51,687 INFO L74 IsIncluded]: Start isIncluded. First operand 198 states. Second operand has 167 states, 140 states have (on average 1.5285714285714285) internal successors, (214), 157 states have internal predecessors, (214), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:51,687 INFO L87 Difference]: Start difference. First operand 198 states. Second operand has 167 states, 140 states have (on average 1.5285714285714285) internal successors, (214), 157 states have internal predecessors, (214), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:51,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:51,693 INFO L93 Difference]: Finished difference Result 198 states and 258 transitions. [2022-02-21 03:09:51,693 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 258 transitions. [2022-02-21 03:09:51,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:51,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:51,694 INFO L74 IsIncluded]: Start isIncluded. First operand has 167 states, 140 states have (on average 1.5285714285714285) internal successors, (214), 157 states have internal predecessors, (214), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 198 states. [2022-02-21 03:09:51,694 INFO L87 Difference]: Start difference. First operand has 167 states, 140 states have (on average 1.5285714285714285) internal successors, (214), 157 states have internal predecessors, (214), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 198 states. [2022-02-21 03:09:51,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:51,699 INFO L93 Difference]: Finished difference Result 198 states and 258 transitions. [2022-02-21 03:09:51,699 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 258 transitions. [2022-02-21 03:09:51,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:51,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:51,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:09:51,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:09:51,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 140 states have (on average 1.5285714285714285) internal successors, (214), 157 states have internal predecessors, (214), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:51,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 226 transitions. [2022-02-21 03:09:51,705 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 226 transitions. Word has length 14 [2022-02-21 03:09:51,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:09:51,705 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 226 transitions. [2022-02-21 03:09:51,705 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:09:51,705 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 226 transitions. [2022-02-21 03:09:51,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-21 03:09:51,706 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:09:51,706 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:09:51,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 03:09:51,707 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:09:51,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:09:51,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1172920179, now seen corresponding path program 1 times [2022-02-21 03:09:51,707 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:09:51,708 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572760827] [2022-02-21 03:09:51,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:51,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:09:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:51,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:09:51,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:51,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {3361#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {3351#true} is VALID [2022-02-21 03:09:51,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {3351#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {3351#true} is VALID [2022-02-21 03:09:51,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {3351#true} #res := ~__retres4~0; {3351#true} is VALID [2022-02-21 03:09:51,753 INFO L290 TraceCheckUtils]: 3: Hoare triple {3351#true} assume true; {3351#true} is VALID [2022-02-21 03:09:51,754 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3351#true} {3353#(<= |ULTIMATE.start_main_~ea~2#1| 127)} #448#return; {3353#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:09:51,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {3351#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); {3351#true} is VALID [2022-02-21 03:09:51,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {3351#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {3353#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:09:51,755 INFO L272 TraceCheckUtils]: 2: Hoare triple {3353#(<= |ULTIMATE.start_main_~ea~2#1| 127)} call main_#t~ret22#1 := base2flt(0, 0); {3361#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:09:51,755 INFO L290 TraceCheckUtils]: 3: Hoare triple {3361#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {3351#true} is VALID [2022-02-21 03:09:51,755 INFO L290 TraceCheckUtils]: 4: Hoare triple {3351#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {3351#true} is VALID [2022-02-21 03:09:51,756 INFO L290 TraceCheckUtils]: 5: Hoare triple {3351#true} #res := ~__retres4~0; {3351#true} is VALID [2022-02-21 03:09:51,756 INFO L290 TraceCheckUtils]: 6: Hoare triple {3351#true} assume true; {3351#true} is VALID [2022-02-21 03:09:51,756 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3351#true} {3353#(<= |ULTIMATE.start_main_~ea~2#1| 127)} #448#return; {3353#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:09:51,757 INFO L290 TraceCheckUtils]: 8: Hoare triple {3353#(<= |ULTIMATE.start_main_~ea~2#1| 127)} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {3353#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:09:51,757 INFO L272 TraceCheckUtils]: 9: Hoare triple {3353#(<= |ULTIMATE.start_main_~ea~2#1| 127)} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {3359#(<= |base2flt_#in~e| 127)} is VALID [2022-02-21 03:09:51,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {3359#(<= |base2flt_#in~e| 127)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {3360#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:51,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {3360#(<= base2flt_~e 127)} assume !(0 == ~m % 4294967296); {3360#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:51,758 INFO L290 TraceCheckUtils]: 12: Hoare triple {3360#(<= base2flt_~e 127)} assume ~m % 4294967296 < 16777216; {3360#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:51,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {3360#(<= base2flt_~e 127)} assume !false; {3360#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:51,759 INFO L290 TraceCheckUtils]: 14: Hoare triple {3360#(<= base2flt_~e 127)} assume !(~e <= -128); {3360#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:51,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {3360#(<= base2flt_~e 127)} assume !(~e - 1 <= 2147483647); {3352#false} is VALID [2022-02-21 03:09:51,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:09:51,760 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:09:51,760 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572760827] [2022-02-21 03:09:51,760 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572760827] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:09:51,760 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543703553] [2022-02-21 03:09:51,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:51,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:09:51,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:09:51,762 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:09:51,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-21 03:09:51,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:51,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:09:51,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:51,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:09:51,921 INFO L290 TraceCheckUtils]: 0: Hoare triple {3351#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); {3351#true} is VALID [2022-02-21 03:09:51,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {3351#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {3353#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:09:51,922 INFO L272 TraceCheckUtils]: 2: Hoare triple {3353#(<= |ULTIMATE.start_main_~ea~2#1| 127)} call main_#t~ret22#1 := base2flt(0, 0); {3351#true} is VALID [2022-02-21 03:09:51,922 INFO L290 TraceCheckUtils]: 3: Hoare triple {3351#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {3351#true} is VALID [2022-02-21 03:09:51,922 INFO L290 TraceCheckUtils]: 4: Hoare triple {3351#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {3351#true} is VALID [2022-02-21 03:09:51,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {3351#true} #res := ~__retres4~0; {3351#true} is VALID [2022-02-21 03:09:51,923 INFO L290 TraceCheckUtils]: 6: Hoare triple {3351#true} assume true; {3351#true} is VALID [2022-02-21 03:09:51,923 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3351#true} {3353#(<= |ULTIMATE.start_main_~ea~2#1| 127)} #448#return; {3353#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:09:51,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {3353#(<= |ULTIMATE.start_main_~ea~2#1| 127)} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {3353#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:09:51,925 INFO L272 TraceCheckUtils]: 9: Hoare triple {3353#(<= |ULTIMATE.start_main_~ea~2#1| 127)} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {3359#(<= |base2flt_#in~e| 127)} is VALID [2022-02-21 03:09:51,925 INFO L290 TraceCheckUtils]: 10: Hoare triple {3359#(<= |base2flt_#in~e| 127)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {3360#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:51,925 INFO L290 TraceCheckUtils]: 11: Hoare triple {3360#(<= base2flt_~e 127)} assume !(0 == ~m % 4294967296); {3360#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:51,926 INFO L290 TraceCheckUtils]: 12: Hoare triple {3360#(<= base2flt_~e 127)} assume ~m % 4294967296 < 16777216; {3360#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:51,926 INFO L290 TraceCheckUtils]: 13: Hoare triple {3360#(<= base2flt_~e 127)} assume !false; {3360#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:51,927 INFO L290 TraceCheckUtils]: 14: Hoare triple {3360#(<= base2flt_~e 127)} assume !(~e <= -128); {3360#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:51,927 INFO L290 TraceCheckUtils]: 15: Hoare triple {3360#(<= base2flt_~e 127)} assume !(~e - 1 <= 2147483647); {3352#false} is VALID [2022-02-21 03:09:51,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:09:51,928 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:09:51,928 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543703553] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:09:51,928 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:09:51,928 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-02-21 03:09:51,929 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566285384] [2022-02-21 03:09:51,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:09:51,929 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:09:51,929 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:09:51,930 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:09:51,939 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:09:51,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:09:51,940 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:09:51,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:09:51,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:09:51,941 INFO L87 Difference]: Start difference. First operand 167 states and 226 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:09:52,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:52,276 INFO L93 Difference]: Finished difference Result 237 states and 323 transitions. [2022-02-21 03:09:52,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:09:52,276 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:09:52,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:09:52,276 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:09:52,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 225 transitions. [2022-02-21 03:09:52,279 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:09:52,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 225 transitions. [2022-02-21 03:09:52,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 225 transitions. [2022-02-21 03:09:52,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:52,425 INFO L225 Difference]: With dead ends: 237 [2022-02-21 03:09:52,426 INFO L226 Difference]: Without dead ends: 233 [2022-02-21 03:09:52,426 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:09:52,426 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 188 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 383 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:09:52,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 383 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:09:52,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-02-21 03:09:52,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 203. [2022-02-21 03:09:52,453 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:09:52,454 INFO L82 GeneralOperation]: Start isEquivalent. First operand 233 states. Second operand has 203 states, 176 states have (on average 1.5568181818181819) internal successors, (274), 192 states have internal predecessors, (274), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:52,454 INFO L74 IsIncluded]: Start isIncluded. First operand 233 states. Second operand has 203 states, 176 states have (on average 1.5568181818181819) internal successors, (274), 192 states have internal predecessors, (274), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:52,455 INFO L87 Difference]: Start difference. First operand 233 states. Second operand has 203 states, 176 states have (on average 1.5568181818181819) internal successors, (274), 192 states have internal predecessors, (274), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:52,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:52,461 INFO L93 Difference]: Finished difference Result 233 states and 317 transitions. [2022-02-21 03:09:52,461 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 317 transitions. [2022-02-21 03:09:52,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:52,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:52,462 INFO L74 IsIncluded]: Start isIncluded. First operand has 203 states, 176 states have (on average 1.5568181818181819) internal successors, (274), 192 states have internal predecessors, (274), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 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:09:52,462 INFO L87 Difference]: Start difference. First operand has 203 states, 176 states have (on average 1.5568181818181819) internal successors, (274), 192 states have internal predecessors, (274), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 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:09:52,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:52,468 INFO L93 Difference]: Finished difference Result 233 states and 317 transitions. [2022-02-21 03:09:52,468 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 317 transitions. [2022-02-21 03:09:52,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:52,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:52,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:09:52,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:09:52,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 176 states have (on average 1.5568181818181819) internal successors, (274), 192 states have internal predecessors, (274), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:52,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 286 transitions. [2022-02-21 03:09:52,475 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 286 transitions. Word has length 16 [2022-02-21 03:09:52,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:09:52,475 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 286 transitions. [2022-02-21 03:09:52,475 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:09:52,475 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 286 transitions. [2022-02-21 03:09:52,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-21 03:09:52,476 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:09:52,476 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:09:52,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:09:52,697 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:09:52,697 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:09:52,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:09:52,698 INFO L85 PathProgramCache]: Analyzing trace with hash 153036525, now seen corresponding path program 1 times [2022-02-21 03:09:52,698 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:09:52,698 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642768907] [2022-02-21 03:09:52,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:52,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:09:52,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:52,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {4379#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); {4379#true} is VALID [2022-02-21 03:09:52,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {4379#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {4379#true} is VALID [2022-02-21 03:09:52,753 INFO L272 TraceCheckUtils]: 2: Hoare triple {4379#true} call main_#t~ret22#1 := base2flt(0, 0); {4381#(= |base2flt_#in~e| 0)} is VALID [2022-02-21 03:09:52,753 INFO L290 TraceCheckUtils]: 3: Hoare triple {4381#(= |base2flt_#in~e| 0)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {4382#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:52,753 INFO L290 TraceCheckUtils]: 4: Hoare triple {4382#(= base2flt_~e 0)} assume !(0 == ~m % 4294967296); {4382#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:52,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {4382#(= base2flt_~e 0)} assume !(~m % 4294967296 < 16777216); {4382#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:52,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {4382#(= base2flt_~e 0)} assume !false; {4382#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:52,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {4382#(= base2flt_~e 0)} assume ~m % 4294967296 >= 33554432; {4382#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:52,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {4382#(= base2flt_~e 0)} assume !(~e >= 127); {4382#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:52,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {4382#(= base2flt_~e 0)} assume 1 + ~e <= 2147483647; {4382#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:52,756 INFO L290 TraceCheckUtils]: 10: Hoare triple {4382#(= base2flt_~e 0)} assume 1 + ~e >= -2147483648;~e := 1 + ~e;~m := ~m / 2; {4383#(<= base2flt_~e 1)} is VALID [2022-02-21 03:09:52,756 INFO L290 TraceCheckUtils]: 11: Hoare triple {4383#(<= base2flt_~e 1)} assume !false; {4383#(<= base2flt_~e 1)} is VALID [2022-02-21 03:09:52,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {4383#(<= base2flt_~e 1)} assume !(~m % 4294967296 >= 33554432); {4383#(<= base2flt_~e 1)} is VALID [2022-02-21 03:09:52,757 INFO L290 TraceCheckUtils]: 13: Hoare triple {4383#(<= base2flt_~e 1)} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {4383#(<= base2flt_~e 1)} is VALID [2022-02-21 03:09:52,757 INFO L290 TraceCheckUtils]: 14: Hoare triple {4383#(<= base2flt_~e 1)} assume !(128 + ~e <= 2147483647); {4380#false} is VALID [2022-02-21 03:09:52,757 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:09:52,758 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:09:52,758 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642768907] [2022-02-21 03:09:52,758 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642768907] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:09:52,758 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812547072] [2022-02-21 03:09:52,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:52,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:09:52,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:09:52,766 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:09:52,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-21 03:09:52,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:52,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:09:52,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:52,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:09:52,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {4379#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); {4379#true} is VALID [2022-02-21 03:09:52,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {4379#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {4379#true} is VALID [2022-02-21 03:09:52,857 INFO L272 TraceCheckUtils]: 2: Hoare triple {4379#true} call main_#t~ret22#1 := base2flt(0, 0); {4379#true} is VALID [2022-02-21 03:09:52,857 INFO L290 TraceCheckUtils]: 3: Hoare triple {4379#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {4379#true} is VALID [2022-02-21 03:09:52,858 INFO L290 TraceCheckUtils]: 4: Hoare triple {4379#true} assume !(0 == ~m % 4294967296); {4379#true} is VALID [2022-02-21 03:09:52,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {4379#true} assume !(~m % 4294967296 < 16777216); {4379#true} is VALID [2022-02-21 03:09:52,858 INFO L290 TraceCheckUtils]: 6: Hoare triple {4379#true} assume !false; {4379#true} is VALID [2022-02-21 03:09:52,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {4379#true} assume ~m % 4294967296 >= 33554432; {4379#true} is VALID [2022-02-21 03:09:52,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {4379#true} assume !(~e >= 127); {4411#(not (<= 127 base2flt_~e))} is VALID [2022-02-21 03:09:52,859 INFO L290 TraceCheckUtils]: 9: Hoare triple {4411#(not (<= 127 base2flt_~e))} assume 1 + ~e <= 2147483647; {4411#(not (<= 127 base2flt_~e))} is VALID [2022-02-21 03:09:52,859 INFO L290 TraceCheckUtils]: 10: Hoare triple {4411#(not (<= 127 base2flt_~e))} assume 1 + ~e >= -2147483648;~e := 1 + ~e;~m := ~m / 2; {4418#(< base2flt_~e 128)} is VALID [2022-02-21 03:09:52,860 INFO L290 TraceCheckUtils]: 11: Hoare triple {4418#(< base2flt_~e 128)} assume !false; {4418#(< base2flt_~e 128)} is VALID [2022-02-21 03:09:52,860 INFO L290 TraceCheckUtils]: 12: Hoare triple {4418#(< base2flt_~e 128)} assume !(~m % 4294967296 >= 33554432); {4418#(< base2flt_~e 128)} is VALID [2022-02-21 03:09:52,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {4418#(< base2flt_~e 128)} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {4418#(< base2flt_~e 128)} is VALID [2022-02-21 03:09:52,861 INFO L290 TraceCheckUtils]: 14: Hoare triple {4418#(< base2flt_~e 128)} assume !(128 + ~e <= 2147483647); {4380#false} is VALID [2022-02-21 03:09:52,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:09:52,861 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:09:52,861 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812547072] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:09:52,861 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:09:52,862 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-02-21 03:09:52,862 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416458584] [2022-02-21 03:09:52,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:09:52,862 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:09:52,863 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:09:52,863 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:09:52,871 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:09:52,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:09:52,872 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:09:52,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:09:52,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:09:52,872 INFO L87 Difference]: Start difference. First operand 203 states and 286 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:09:53,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:53,140 INFO L93 Difference]: Finished difference Result 255 states and 357 transitions. [2022-02-21 03:09:53,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:09:53,140 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:09:53,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:09:53,141 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:09:53,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 177 transitions. [2022-02-21 03:09:53,142 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:09:53,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 177 transitions. [2022-02-21 03:09:53,143 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 177 transitions. [2022-02-21 03:09:53,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:53,263 INFO L225 Difference]: With dead ends: 255 [2022-02-21 03:09:53,263 INFO L226 Difference]: Without dead ends: 253 [2022-02-21 03:09:53,263 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:09:53,264 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 26 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:09:53,264 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 390 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:09:53,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-02-21 03:09:53,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 196. [2022-02-21 03:09:53,295 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:09:53,295 INFO L82 GeneralOperation]: Start isEquivalent. First operand 253 states. Second operand has 196 states, 169 states have (on average 1.532544378698225) internal successors, (259), 185 states have internal predecessors, (259), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:53,297 INFO L74 IsIncluded]: Start isIncluded. First operand 253 states. Second operand has 196 states, 169 states have (on average 1.532544378698225) internal successors, (259), 185 states have internal predecessors, (259), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:53,297 INFO L87 Difference]: Start difference. First operand 253 states. Second operand has 196 states, 169 states have (on average 1.532544378698225) internal successors, (259), 185 states have internal predecessors, (259), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:53,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:53,303 INFO L93 Difference]: Finished difference Result 253 states and 351 transitions. [2022-02-21 03:09:53,303 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 351 transitions. [2022-02-21 03:09:53,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:53,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:53,305 INFO L74 IsIncluded]: Start isIncluded. First operand has 196 states, 169 states have (on average 1.532544378698225) internal successors, (259), 185 states have internal predecessors, (259), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 253 states. [2022-02-21 03:09:53,305 INFO L87 Difference]: Start difference. First operand has 196 states, 169 states have (on average 1.532544378698225) internal successors, (259), 185 states have internal predecessors, (259), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 253 states. [2022-02-21 03:09:53,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:53,310 INFO L93 Difference]: Finished difference Result 253 states and 351 transitions. [2022-02-21 03:09:53,310 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 351 transitions. [2022-02-21 03:09:53,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:53,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:53,311 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:09:53,311 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:09:53,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 169 states have (on average 1.532544378698225) internal successors, (259), 185 states have internal predecessors, (259), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:53,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 271 transitions. [2022-02-21 03:09:53,314 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 271 transitions. Word has length 15 [2022-02-21 03:09:53,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:09:53,315 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 271 transitions. [2022-02-21 03:09:53,315 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:09:53,315 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 271 transitions. [2022-02-21 03:09:53,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-21 03:09:53,315 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:09:53,315 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:09:53,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:09:53,531 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:09:53,532 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:09:53,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:09:53,532 INFO L85 PathProgramCache]: Analyzing trace with hash 2000787238, now seen corresponding path program 1 times [2022-02-21 03:09:53,533 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:09:53,533 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280366662] [2022-02-21 03:09:53,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:53,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:09:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:53,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:09:53,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:53,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {5460#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5452#true} is VALID [2022-02-21 03:09:53,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {5452#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {5452#true} is VALID [2022-02-21 03:09:53,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {5452#true} #res := ~__retres4~0; {5452#true} is VALID [2022-02-21 03:09:53,591 INFO L290 TraceCheckUtils]: 3: Hoare triple {5452#true} assume true; {5452#true} is VALID [2022-02-21 03:09:53,591 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5452#true} {5452#true} #448#return; {5452#true} is VALID [2022-02-21 03:09:53,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {5452#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); {5452#true} is VALID [2022-02-21 03:09:53,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {5452#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {5452#true} is VALID [2022-02-21 03:09:53,592 INFO L272 TraceCheckUtils]: 2: Hoare triple {5452#true} call main_#t~ret22#1 := base2flt(0, 0); {5460#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:09:53,592 INFO L290 TraceCheckUtils]: 3: Hoare triple {5460#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5452#true} is VALID [2022-02-21 03:09:53,592 INFO L290 TraceCheckUtils]: 4: Hoare triple {5452#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {5452#true} is VALID [2022-02-21 03:09:53,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {5452#true} #res := ~__retres4~0; {5452#true} is VALID [2022-02-21 03:09:53,593 INFO L290 TraceCheckUtils]: 6: Hoare triple {5452#true} assume true; {5452#true} is VALID [2022-02-21 03:09:53,593 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5452#true} {5452#true} #448#return; {5452#true} is VALID [2022-02-21 03:09:53,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {5452#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {5452#true} is VALID [2022-02-21 03:09:53,593 INFO L272 TraceCheckUtils]: 9: Hoare triple {5452#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {5452#true} is VALID [2022-02-21 03:09:53,593 INFO L290 TraceCheckUtils]: 10: Hoare triple {5452#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5452#true} is VALID [2022-02-21 03:09:53,594 INFO L290 TraceCheckUtils]: 11: Hoare triple {5452#true} assume !(0 == ~m % 4294967296); {5452#true} is VALID [2022-02-21 03:09:53,594 INFO L290 TraceCheckUtils]: 12: Hoare triple {5452#true} assume ~m % 4294967296 < 16777216; {5452#true} is VALID [2022-02-21 03:09:53,594 INFO L290 TraceCheckUtils]: 13: Hoare triple {5452#true} assume !false; {5452#true} is VALID [2022-02-21 03:09:53,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {5452#true} assume !(~e <= -128); {5459#(<= 0 (+ base2flt_~e 127))} is VALID [2022-02-21 03:09:53,595 INFO L290 TraceCheckUtils]: 15: Hoare triple {5459#(<= 0 (+ base2flt_~e 127))} assume ~e - 1 <= 2147483647; {5459#(<= 0 (+ base2flt_~e 127))} is VALID [2022-02-21 03:09:53,595 INFO L290 TraceCheckUtils]: 16: Hoare triple {5459#(<= 0 (+ base2flt_~e 127))} assume !(~e - 1 >= -2147483648); {5453#false} is VALID [2022-02-21 03:09:53,595 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:09:53,596 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:09:53,596 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280366662] [2022-02-21 03:09:53,596 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280366662] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:09:53,596 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334139693] [2022-02-21 03:09:53,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:53,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:09:53,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:09:53,597 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:09:53,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-21 03:09:53,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:53,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:09:53,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:53,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:09:53,678 INFO L290 TraceCheckUtils]: 0: Hoare triple {5452#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); {5452#true} is VALID [2022-02-21 03:09:53,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {5452#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {5452#true} is VALID [2022-02-21 03:09:53,678 INFO L272 TraceCheckUtils]: 2: Hoare triple {5452#true} call main_#t~ret22#1 := base2flt(0, 0); {5452#true} is VALID [2022-02-21 03:09:53,679 INFO L290 TraceCheckUtils]: 3: Hoare triple {5452#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5452#true} is VALID [2022-02-21 03:09:53,679 INFO L290 TraceCheckUtils]: 4: Hoare triple {5452#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {5452#true} is VALID [2022-02-21 03:09:53,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {5452#true} #res := ~__retres4~0; {5452#true} is VALID [2022-02-21 03:09:53,679 INFO L290 TraceCheckUtils]: 6: Hoare triple {5452#true} assume true; {5452#true} is VALID [2022-02-21 03:09:53,679 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5452#true} {5452#true} #448#return; {5452#true} is VALID [2022-02-21 03:09:53,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {5452#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {5452#true} is VALID [2022-02-21 03:09:53,680 INFO L272 TraceCheckUtils]: 9: Hoare triple {5452#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {5452#true} is VALID [2022-02-21 03:09:53,680 INFO L290 TraceCheckUtils]: 10: Hoare triple {5452#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5452#true} is VALID [2022-02-21 03:09:53,680 INFO L290 TraceCheckUtils]: 11: Hoare triple {5452#true} assume !(0 == ~m % 4294967296); {5452#true} is VALID [2022-02-21 03:09:53,680 INFO L290 TraceCheckUtils]: 12: Hoare triple {5452#true} assume ~m % 4294967296 < 16777216; {5452#true} is VALID [2022-02-21 03:09:53,680 INFO L290 TraceCheckUtils]: 13: Hoare triple {5452#true} assume !false; {5452#true} is VALID [2022-02-21 03:09:53,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {5452#true} assume !(~e <= -128); {5459#(<= 0 (+ base2flt_~e 127))} is VALID [2022-02-21 03:09:53,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {5459#(<= 0 (+ base2flt_~e 127))} assume ~e - 1 <= 2147483647; {5459#(<= 0 (+ base2flt_~e 127))} is VALID [2022-02-21 03:09:53,681 INFO L290 TraceCheckUtils]: 16: Hoare triple {5459#(<= 0 (+ base2flt_~e 127))} assume !(~e - 1 >= -2147483648); {5453#false} is VALID [2022-02-21 03:09:53,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:09:53,682 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:09:53,682 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334139693] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:09:53,682 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:09:53,682 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2022-02-21 03:09:53,682 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690602354] [2022-02-21 03:09:53,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:09:53,683 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:09:53,683 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:09:53,683 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:09:53,692 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:09:53,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:09:53,692 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:09:53,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:09:53,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:09:53,693 INFO L87 Difference]: Start difference. First operand 196 states and 271 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:09:53,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:53,837 INFO L93 Difference]: Finished difference Result 205 states and 280 transitions. [2022-02-21 03:09:53,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:09:53,838 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:09:53,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:09:53,838 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:09:53,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2022-02-21 03:09:53,839 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:09:53,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2022-02-21 03:09:53,840 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 141 transitions. [2022-02-21 03:09:53,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:53,950 INFO L225 Difference]: With dead ends: 205 [2022-02-21 03:09:53,950 INFO L226 Difference]: Without dead ends: 204 [2022-02-21 03:09:53,950 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:09:53,952 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 3 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 248 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:09:53,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 248 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:09:53,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-02-21 03:09:53,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 193. [2022-02-21 03:09:53,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:09:53,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 204 states. Second operand has 193 states, 167 states have (on average 1.5209580838323353) internal successors, (254), 182 states have internal predecessors, (254), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:53,998 INFO L74 IsIncluded]: Start isIncluded. First operand 204 states. Second operand has 193 states, 167 states have (on average 1.5209580838323353) internal successors, (254), 182 states have internal predecessors, (254), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:53,998 INFO L87 Difference]: Start difference. First operand 204 states. Second operand has 193 states, 167 states have (on average 1.5209580838323353) internal successors, (254), 182 states have internal predecessors, (254), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:54,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:54,002 INFO L93 Difference]: Finished difference Result 204 states and 277 transitions. [2022-02-21 03:09:54,002 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 277 transitions. [2022-02-21 03:09:54,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:54,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:54,003 INFO L74 IsIncluded]: Start isIncluded. First operand has 193 states, 167 states have (on average 1.5209580838323353) internal successors, (254), 182 states have internal predecessors, (254), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 204 states. [2022-02-21 03:09:54,003 INFO L87 Difference]: Start difference. First operand has 193 states, 167 states have (on average 1.5209580838323353) internal successors, (254), 182 states have internal predecessors, (254), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 204 states. [2022-02-21 03:09:54,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:54,007 INFO L93 Difference]: Finished difference Result 204 states and 277 transitions. [2022-02-21 03:09:54,007 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 277 transitions. [2022-02-21 03:09:54,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:54,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:54,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:09:54,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:09:54,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 167 states have (on average 1.5209580838323353) internal successors, (254), 182 states have internal predecessors, (254), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:54,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 266 transitions. [2022-02-21 03:09:54,012 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 266 transitions. Word has length 17 [2022-02-21 03:09:54,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:09:54,012 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 266 transitions. [2022-02-21 03:09:54,012 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:09:54,012 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 266 transitions. [2022-02-21 03:09:54,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-21 03:09:54,013 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:09:54,013 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:09:54,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:09:54,229 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:09:54,229 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:09:54,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:09:54,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1512656933, now seen corresponding path program 1 times [2022-02-21 03:09:54,229 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:09:54,230 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589781664] [2022-02-21 03:09:54,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:54,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:09:54,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:54,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:09:54,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:54,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {6386#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {6376#true} is VALID [2022-02-21 03:09:54,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {6376#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {6376#true} is VALID [2022-02-21 03:09:54,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {6376#true} #res := ~__retres4~0; {6376#true} is VALID [2022-02-21 03:09:54,279 INFO L290 TraceCheckUtils]: 3: Hoare triple {6376#true} assume true; {6376#true} is VALID [2022-02-21 03:09:54,284 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6376#true} {6378#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} #448#return; {6378#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:09:54,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {6376#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); {6376#true} is VALID [2022-02-21 03:09:54,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {6376#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {6378#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:09:54,286 INFO L272 TraceCheckUtils]: 2: Hoare triple {6378#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret22#1 := base2flt(0, 0); {6386#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:09:54,286 INFO L290 TraceCheckUtils]: 3: Hoare triple {6386#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {6376#true} is VALID [2022-02-21 03:09:54,286 INFO L290 TraceCheckUtils]: 4: Hoare triple {6376#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {6376#true} is VALID [2022-02-21 03:09:54,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {6376#true} #res := ~__retres4~0; {6376#true} is VALID [2022-02-21 03:09:54,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {6376#true} assume true; {6376#true} is VALID [2022-02-21 03:09:54,287 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6376#true} {6378#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} #448#return; {6378#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:09:54,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {6378#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {6378#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:09:54,288 INFO L272 TraceCheckUtils]: 9: Hoare triple {6378#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {6384#(<= 0 (+ 128 |base2flt_#in~e|))} is VALID [2022-02-21 03:09:54,289 INFO L290 TraceCheckUtils]: 10: Hoare triple {6384#(<= 0 (+ 128 |base2flt_#in~e|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {6385#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:54,289 INFO L290 TraceCheckUtils]: 11: Hoare triple {6385#(<= 0 (+ 128 base2flt_~e))} assume !(0 == ~m % 4294967296); {6385#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:54,289 INFO L290 TraceCheckUtils]: 12: Hoare triple {6385#(<= 0 (+ 128 base2flt_~e))} assume !(~m % 4294967296 < 16777216); {6385#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:54,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {6385#(<= 0 (+ 128 base2flt_~e))} assume !false; {6385#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:54,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {6385#(<= 0 (+ 128 base2flt_~e))} assume ~m % 4294967296 >= 33554432; {6385#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:54,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {6385#(<= 0 (+ 128 base2flt_~e))} assume !(~e >= 127); {6385#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:54,291 INFO L290 TraceCheckUtils]: 16: Hoare triple {6385#(<= 0 (+ 128 base2flt_~e))} assume 1 + ~e <= 2147483647; {6385#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:54,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {6385#(<= 0 (+ 128 base2flt_~e))} assume !(1 + ~e >= -2147483648); {6377#false} is VALID [2022-02-21 03:09:54,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:09:54,292 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:09:54,292 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589781664] [2022-02-21 03:09:54,292 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589781664] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:09:54,292 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361641081] [2022-02-21 03:09:54,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:54,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:09:54,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:09:54,332 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:09:54,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-21 03:09:54,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:54,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:09:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:54,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:09:54,457 INFO L290 TraceCheckUtils]: 0: Hoare triple {6376#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); {6376#true} is VALID [2022-02-21 03:09:54,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {6376#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {6378#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:09:54,458 INFO L272 TraceCheckUtils]: 2: Hoare triple {6378#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret22#1 := base2flt(0, 0); {6376#true} is VALID [2022-02-21 03:09:54,458 INFO L290 TraceCheckUtils]: 3: Hoare triple {6376#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {6376#true} is VALID [2022-02-21 03:09:54,458 INFO L290 TraceCheckUtils]: 4: Hoare triple {6376#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {6376#true} is VALID [2022-02-21 03:09:54,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {6376#true} #res := ~__retres4~0; {6376#true} is VALID [2022-02-21 03:09:54,459 INFO L290 TraceCheckUtils]: 6: Hoare triple {6376#true} assume true; {6376#true} is VALID [2022-02-21 03:09:54,459 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6376#true} {6378#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} #448#return; {6378#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:09:54,460 INFO L290 TraceCheckUtils]: 8: Hoare triple {6378#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {6378#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:09:54,461 INFO L272 TraceCheckUtils]: 9: Hoare triple {6378#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {6384#(<= 0 (+ 128 |base2flt_#in~e|))} is VALID [2022-02-21 03:09:54,461 INFO L290 TraceCheckUtils]: 10: Hoare triple {6384#(<= 0 (+ 128 |base2flt_#in~e|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {6385#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:54,462 INFO L290 TraceCheckUtils]: 11: Hoare triple {6385#(<= 0 (+ 128 base2flt_~e))} assume !(0 == ~m % 4294967296); {6385#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:54,463 INFO L290 TraceCheckUtils]: 12: Hoare triple {6385#(<= 0 (+ 128 base2flt_~e))} assume !(~m % 4294967296 < 16777216); {6385#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:54,463 INFO L290 TraceCheckUtils]: 13: Hoare triple {6385#(<= 0 (+ 128 base2flt_~e))} assume !false; {6385#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:54,467 INFO L290 TraceCheckUtils]: 14: Hoare triple {6385#(<= 0 (+ 128 base2flt_~e))} assume ~m % 4294967296 >= 33554432; {6385#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:54,467 INFO L290 TraceCheckUtils]: 15: Hoare triple {6385#(<= 0 (+ 128 base2flt_~e))} assume !(~e >= 127); {6385#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:54,468 INFO L290 TraceCheckUtils]: 16: Hoare triple {6385#(<= 0 (+ 128 base2flt_~e))} assume 1 + ~e <= 2147483647; {6385#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:54,468 INFO L290 TraceCheckUtils]: 17: Hoare triple {6385#(<= 0 (+ 128 base2flt_~e))} assume !(1 + ~e >= -2147483648); {6377#false} is VALID [2022-02-21 03:09:54,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:09:54,468 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:09:54,469 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361641081] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:09:54,469 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:09:54,469 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-02-21 03:09:54,469 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018828887] [2022-02-21 03:09:54,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:09:54,470 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:09:54,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:09:54,470 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:09:54,481 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:09:54,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:09:54,482 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:09:54,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:09:54,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:09:54,482 INFO L87 Difference]: Start difference. First operand 193 states and 266 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:09:54,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:54,857 INFO L93 Difference]: Finished difference Result 236 states and 320 transitions. [2022-02-21 03:09:54,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:09:54,858 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:09:54,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:09:54,858 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:09:54,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 214 transitions. [2022-02-21 03:09:54,859 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:09:54,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 214 transitions. [2022-02-21 03:09:54,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 214 transitions. [2022-02-21 03:09:55,003 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:09:55,007 INFO L225 Difference]: With dead ends: 236 [2022-02-21 03:09:55,007 INFO L226 Difference]: Without dead ends: 233 [2022-02-21 03:09:55,007 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:09:55,007 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 173 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 384 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:09:55,008 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 384 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:09:55,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-02-21 03:09:55,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 201. [2022-02-21 03:09:55,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:09:55,073 INFO L82 GeneralOperation]: Start isEquivalent. First operand 233 states. Second operand has 201 states, 175 states have (on average 1.5142857142857142) internal successors, (265), 190 states have internal predecessors, (265), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:55,075 INFO L74 IsIncluded]: Start isIncluded. First operand 233 states. Second operand has 201 states, 175 states have (on average 1.5142857142857142) internal successors, (265), 190 states have internal predecessors, (265), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:55,076 INFO L87 Difference]: Start difference. First operand 233 states. Second operand has 201 states, 175 states have (on average 1.5142857142857142) internal successors, (265), 190 states have internal predecessors, (265), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:55,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:55,081 INFO L93 Difference]: Finished difference Result 233 states and 317 transitions. [2022-02-21 03:09:55,081 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 317 transitions. [2022-02-21 03:09:55,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:55,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:55,082 INFO L74 IsIncluded]: Start isIncluded. First operand has 201 states, 175 states have (on average 1.5142857142857142) internal successors, (265), 190 states have internal predecessors, (265), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 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:09:55,083 INFO L87 Difference]: Start difference. First operand has 201 states, 175 states have (on average 1.5142857142857142) internal successors, (265), 190 states have internal predecessors, (265), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 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:09:55,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:55,087 INFO L93 Difference]: Finished difference Result 233 states and 317 transitions. [2022-02-21 03:09:55,088 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 317 transitions. [2022-02-21 03:09:55,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:55,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:55,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:09:55,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:09:55,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 175 states have (on average 1.5142857142857142) internal successors, (265), 190 states have internal predecessors, (265), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:55,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 277 transitions. [2022-02-21 03:09:55,093 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 277 transitions. Word has length 18 [2022-02-21 03:09:55,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:09:55,093 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 277 transitions. [2022-02-21 03:09:55,095 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:09:55,095 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 277 transitions. [2022-02-21 03:09:55,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-21 03:09:55,095 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:09:55,096 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:09:55,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:09:55,313 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:09:55,313 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:09:55,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:09:55,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1085205661, now seen corresponding path program 1 times [2022-02-21 03:09:55,314 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:09:55,314 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189799800] [2022-02-21 03:09:55,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:55,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:09:55,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:55,348 INFO L290 TraceCheckUtils]: 0: Hoare triple {7409#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); {7409#true} is VALID [2022-02-21 03:09:55,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {7409#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {7409#true} is VALID [2022-02-21 03:09:55,349 INFO L272 TraceCheckUtils]: 2: Hoare triple {7409#true} call main_#t~ret22#1 := base2flt(0, 0); {7409#true} is VALID [2022-02-21 03:09:55,349 INFO L290 TraceCheckUtils]: 3: Hoare triple {7409#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {7409#true} is VALID [2022-02-21 03:09:55,349 INFO L290 TraceCheckUtils]: 4: Hoare triple {7409#true} assume !(0 == ~m % 4294967296); {7409#true} is VALID [2022-02-21 03:09:55,350 INFO L290 TraceCheckUtils]: 5: Hoare triple {7409#true} assume ~m % 4294967296 < 16777216; {7409#true} is VALID [2022-02-21 03:09:55,350 INFO L290 TraceCheckUtils]: 6: Hoare triple {7409#true} assume !false; {7409#true} is VALID [2022-02-21 03:09:55,350 INFO L290 TraceCheckUtils]: 7: Hoare triple {7409#true} assume !(~e <= -128); {7409#true} is VALID [2022-02-21 03:09:55,350 INFO L290 TraceCheckUtils]: 8: Hoare triple {7409#true} assume ~e - 1 <= 2147483647; {7409#true} is VALID [2022-02-21 03:09:55,350 INFO L290 TraceCheckUtils]: 9: Hoare triple {7409#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {7409#true} is VALID [2022-02-21 03:09:55,351 INFO L290 TraceCheckUtils]: 10: Hoare triple {7409#true} assume ~m % 4294967296 < 16777216; {7409#true} is VALID [2022-02-21 03:09:55,351 INFO L290 TraceCheckUtils]: 11: Hoare triple {7409#true} assume !false; {7409#true} is VALID [2022-02-21 03:09:55,351 INFO L290 TraceCheckUtils]: 12: Hoare triple {7409#true} assume !(~e <= -128); {7411#(<= 0 (+ base2flt_~e 127))} is VALID [2022-02-21 03:09:55,352 INFO L290 TraceCheckUtils]: 13: Hoare triple {7411#(<= 0 (+ base2flt_~e 127))} assume ~e - 1 <= 2147483647; {7411#(<= 0 (+ base2flt_~e 127))} is VALID [2022-02-21 03:09:55,352 INFO L290 TraceCheckUtils]: 14: Hoare triple {7411#(<= 0 (+ base2flt_~e 127))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {7412#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:55,353 INFO L290 TraceCheckUtils]: 15: Hoare triple {7412#(<= 0 (+ 128 base2flt_~e))} assume !(~m % 4294967296 < 16777216); {7412#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:55,353 INFO L290 TraceCheckUtils]: 16: Hoare triple {7412#(<= 0 (+ 128 base2flt_~e))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {7412#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:55,354 INFO L290 TraceCheckUtils]: 17: Hoare triple {7412#(<= 0 (+ 128 base2flt_~e))} assume 128 + ~e <= 2147483647; {7412#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:55,354 INFO L290 TraceCheckUtils]: 18: Hoare triple {7412#(<= 0 (+ 128 base2flt_~e))} assume !(128 + ~e >= -2147483648); {7410#false} is VALID [2022-02-21 03:09:55,354 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:09:55,355 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:09:55,355 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189799800] [2022-02-21 03:09:55,355 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189799800] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:09:55,355 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:09:55,355 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:09:55,355 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135296881] [2022-02-21 03:09:55,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:09:55,356 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:09:55,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:09:55,356 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:09:55,367 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:09:55,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:09:55,367 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:09:55,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:09:55,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:09:55,368 INFO L87 Difference]: Start difference. First operand 201 states and 277 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:09:55,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:55,674 INFO L93 Difference]: Finished difference Result 256 states and 353 transitions. [2022-02-21 03:09:55,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:09:55,675 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:09:55,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:09:55,675 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:09:55,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 173 transitions. [2022-02-21 03:09:55,677 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:09:55,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 173 transitions. [2022-02-21 03:09:55,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 173 transitions. [2022-02-21 03:09:55,780 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:55,785 INFO L225 Difference]: With dead ends: 256 [2022-02-21 03:09:55,785 INFO L226 Difference]: Without dead ends: 254 [2022-02-21 03:09:55,785 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:09:55,786 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 24 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 377 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:09:55,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 377 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:09:55,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-02-21 03:09:55,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 201. [2022-02-21 03:09:55,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:09:55,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 254 states. Second operand has 201 states, 175 states have (on average 1.502857142857143) internal successors, (263), 190 states have internal predecessors, (263), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:55,828 INFO L74 IsIncluded]: Start isIncluded. First operand 254 states. Second operand has 201 states, 175 states have (on average 1.502857142857143) internal successors, (263), 190 states have internal predecessors, (263), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:55,828 INFO L87 Difference]: Start difference. First operand 254 states. Second operand has 201 states, 175 states have (on average 1.502857142857143) internal successors, (263), 190 states have internal predecessors, (263), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:55,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:55,833 INFO L93 Difference]: Finished difference Result 254 states and 347 transitions. [2022-02-21 03:09:55,833 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 347 transitions. [2022-02-21 03:09:55,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:55,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:55,834 INFO L74 IsIncluded]: Start isIncluded. First operand has 201 states, 175 states have (on average 1.502857142857143) internal successors, (263), 190 states have internal predecessors, (263), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 254 states. [2022-02-21 03:09:55,834 INFO L87 Difference]: Start difference. First operand has 201 states, 175 states have (on average 1.502857142857143) internal successors, (263), 190 states have internal predecessors, (263), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 254 states. [2022-02-21 03:09:55,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:55,839 INFO L93 Difference]: Finished difference Result 254 states and 347 transitions. [2022-02-21 03:09:55,839 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 347 transitions. [2022-02-21 03:09:55,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:55,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:55,840 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:09:55,840 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:09:55,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 175 states have (on average 1.502857142857143) internal successors, (263), 190 states have internal predecessors, (263), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:55,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 275 transitions. [2022-02-21 03:09:55,843 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 275 transitions. Word has length 19 [2022-02-21 03:09:55,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:09:55,844 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 275 transitions. [2022-02-21 03:09:55,844 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:09:55,844 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 275 transitions. [2022-02-21 03:09:55,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-21 03:09:55,844 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:09:55,845 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:09:55,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-21 03:09:55,845 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:09:55,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:09:55,845 INFO L85 PathProgramCache]: Analyzing trace with hash 928226989, now seen corresponding path program 1 times [2022-02-21 03:09:55,846 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:09:55,846 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937668849] [2022-02-21 03:09:55,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:55,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:09:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:55,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:09:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:55,888 INFO L290 TraceCheckUtils]: 0: Hoare triple {8463#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8448#true} is VALID [2022-02-21 03:09:55,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {8448#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {8448#true} is VALID [2022-02-21 03:09:55,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {8448#true} #res := ~__retres4~0; {8448#true} is VALID [2022-02-21 03:09:55,889 INFO L290 TraceCheckUtils]: 3: Hoare triple {8448#true} assume true; {8448#true} is VALID [2022-02-21 03:09:55,889 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {8448#true} {8450#(<= |ULTIMATE.start_main_~eb~2#1| 127)} #448#return; {8450#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:09:55,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:09:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:55,895 INFO L290 TraceCheckUtils]: 0: Hoare triple {8463#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8448#true} is VALID [2022-02-21 03:09:55,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {8448#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {8448#true} is VALID [2022-02-21 03:09:55,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {8448#true} #res := ~__retres4~0; {8448#true} is VALID [2022-02-21 03:09:55,896 INFO L290 TraceCheckUtils]: 3: Hoare triple {8448#true} assume true; {8448#true} is VALID [2022-02-21 03:09:55,897 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {8448#true} {8450#(<= |ULTIMATE.start_main_~eb~2#1| 127)} #450#return; {8450#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:09:55,897 INFO L290 TraceCheckUtils]: 0: Hoare triple {8448#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); {8448#true} is VALID [2022-02-21 03:09:55,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {8448#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {8450#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:09:55,898 INFO L272 TraceCheckUtils]: 2: Hoare triple {8450#(<= |ULTIMATE.start_main_~eb~2#1| 127)} call main_#t~ret22#1 := base2flt(0, 0); {8463#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:09:55,898 INFO L290 TraceCheckUtils]: 3: Hoare triple {8463#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8448#true} is VALID [2022-02-21 03:09:55,898 INFO L290 TraceCheckUtils]: 4: Hoare triple {8448#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {8448#true} is VALID [2022-02-21 03:09:55,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {8448#true} #res := ~__retres4~0; {8448#true} is VALID [2022-02-21 03:09:55,899 INFO L290 TraceCheckUtils]: 6: Hoare triple {8448#true} assume true; {8448#true} is VALID [2022-02-21 03:09:55,899 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {8448#true} {8450#(<= |ULTIMATE.start_main_~eb~2#1| 127)} #448#return; {8450#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:09:55,900 INFO L290 TraceCheckUtils]: 8: Hoare triple {8450#(<= |ULTIMATE.start_main_~eb~2#1| 127)} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {8450#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:09:55,900 INFO L272 TraceCheckUtils]: 9: Hoare triple {8450#(<= |ULTIMATE.start_main_~eb~2#1| 127)} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {8463#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:09:55,901 INFO L290 TraceCheckUtils]: 10: Hoare triple {8463#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8448#true} is VALID [2022-02-21 03:09:55,901 INFO L290 TraceCheckUtils]: 11: Hoare triple {8448#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {8448#true} is VALID [2022-02-21 03:09:55,901 INFO L290 TraceCheckUtils]: 12: Hoare triple {8448#true} #res := ~__retres4~0; {8448#true} is VALID [2022-02-21 03:09:55,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {8448#true} assume true; {8448#true} is VALID [2022-02-21 03:09:55,902 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {8448#true} {8450#(<= |ULTIMATE.start_main_~eb~2#1| 127)} #450#return; {8450#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:09:55,902 INFO L290 TraceCheckUtils]: 15: Hoare triple {8450#(<= |ULTIMATE.start_main_~eb~2#1| 127)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {8450#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:09:55,903 INFO L272 TraceCheckUtils]: 16: Hoare triple {8450#(<= |ULTIMATE.start_main_~eb~2#1| 127)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {8461#(<= |base2flt_#in~e| 127)} is VALID [2022-02-21 03:09:55,903 INFO L290 TraceCheckUtils]: 17: Hoare triple {8461#(<= |base2flt_#in~e| 127)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8462#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:55,903 INFO L290 TraceCheckUtils]: 18: Hoare triple {8462#(<= base2flt_~e 127)} assume !(0 == ~m % 4294967296); {8462#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:55,904 INFO L290 TraceCheckUtils]: 19: Hoare triple {8462#(<= base2flt_~e 127)} assume ~m % 4294967296 < 16777216; {8462#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:55,904 INFO L290 TraceCheckUtils]: 20: Hoare triple {8462#(<= base2flt_~e 127)} assume !false; {8462#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:55,904 INFO L290 TraceCheckUtils]: 21: Hoare triple {8462#(<= base2flt_~e 127)} assume !(~e <= -128); {8462#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:55,905 INFO L290 TraceCheckUtils]: 22: Hoare triple {8462#(<= base2flt_~e 127)} assume !(~e - 1 <= 2147483647); {8449#false} is VALID [2022-02-21 03:09:55,905 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:09:55,905 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:09:55,905 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937668849] [2022-02-21 03:09:55,905 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937668849] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:09:55,906 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794326524] [2022-02-21 03:09:55,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:55,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:09:55,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:09:55,920 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:09:55,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-21 03:09:55,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:55,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:09:55,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:55,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:09:56,116 INFO L290 TraceCheckUtils]: 0: Hoare triple {8448#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); {8448#true} is VALID [2022-02-21 03:09:56,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {8448#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {8450#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:09:56,117 INFO L272 TraceCheckUtils]: 2: Hoare triple {8450#(<= |ULTIMATE.start_main_~eb~2#1| 127)} call main_#t~ret22#1 := base2flt(0, 0); {8448#true} is VALID [2022-02-21 03:09:56,117 INFO L290 TraceCheckUtils]: 3: Hoare triple {8448#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8448#true} is VALID [2022-02-21 03:09:56,117 INFO L290 TraceCheckUtils]: 4: Hoare triple {8448#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {8448#true} is VALID [2022-02-21 03:09:56,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {8448#true} #res := ~__retres4~0; {8448#true} is VALID [2022-02-21 03:09:56,117 INFO L290 TraceCheckUtils]: 6: Hoare triple {8448#true} assume true; {8448#true} is VALID [2022-02-21 03:09:56,121 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {8448#true} {8450#(<= |ULTIMATE.start_main_~eb~2#1| 127)} #448#return; {8450#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:09:56,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {8450#(<= |ULTIMATE.start_main_~eb~2#1| 127)} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {8450#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:09:56,121 INFO L272 TraceCheckUtils]: 9: Hoare triple {8450#(<= |ULTIMATE.start_main_~eb~2#1| 127)} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {8448#true} is VALID [2022-02-21 03:09:56,121 INFO L290 TraceCheckUtils]: 10: Hoare triple {8448#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8448#true} is VALID [2022-02-21 03:09:56,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {8448#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {8448#true} is VALID [2022-02-21 03:09:56,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {8448#true} #res := ~__retres4~0; {8448#true} is VALID [2022-02-21 03:09:56,122 INFO L290 TraceCheckUtils]: 13: Hoare triple {8448#true} assume true; {8448#true} is VALID [2022-02-21 03:09:56,127 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {8448#true} {8450#(<= |ULTIMATE.start_main_~eb~2#1| 127)} #450#return; {8450#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:09:56,127 INFO L290 TraceCheckUtils]: 15: Hoare triple {8450#(<= |ULTIMATE.start_main_~eb~2#1| 127)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {8450#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:09:56,128 INFO L272 TraceCheckUtils]: 16: Hoare triple {8450#(<= |ULTIMATE.start_main_~eb~2#1| 127)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {8461#(<= |base2flt_#in~e| 127)} is VALID [2022-02-21 03:09:56,128 INFO L290 TraceCheckUtils]: 17: Hoare triple {8461#(<= |base2flt_#in~e| 127)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8462#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:56,128 INFO L290 TraceCheckUtils]: 18: Hoare triple {8462#(<= base2flt_~e 127)} assume !(0 == ~m % 4294967296); {8462#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:56,129 INFO L290 TraceCheckUtils]: 19: Hoare triple {8462#(<= base2flt_~e 127)} assume ~m % 4294967296 < 16777216; {8462#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:56,129 INFO L290 TraceCheckUtils]: 20: Hoare triple {8462#(<= base2flt_~e 127)} assume !false; {8462#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:56,129 INFO L290 TraceCheckUtils]: 21: Hoare triple {8462#(<= base2flt_~e 127)} assume !(~e <= -128); {8462#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:56,130 INFO L290 TraceCheckUtils]: 22: Hoare triple {8462#(<= base2flt_~e 127)} assume !(~e - 1 <= 2147483647); {8449#false} is VALID [2022-02-21 03:09:56,130 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:09:56,130 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:09:56,130 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794326524] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:09:56,130 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:09:56,130 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-02-21 03:09:56,131 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102371173] [2022-02-21 03:09:56,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:09:56,131 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:09:56,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:09:56,132 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:09:56,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:56,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:09:56,151 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:09:56,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:09:56,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:09:56,152 INFO L87 Difference]: Start difference. First operand 201 states and 275 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:09:56,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:56,562 INFO L93 Difference]: Finished difference Result 231 states and 316 transitions. [2022-02-21 03:09:56,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:09:56,562 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:09:56,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:09:56,563 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:09:56,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 213 transitions. [2022-02-21 03:09:56,565 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:09:56,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 213 transitions. [2022-02-21 03:09:56,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 213 transitions. [2022-02-21 03:09:56,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 213 edges. 213 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:56,767 INFO L225 Difference]: With dead ends: 231 [2022-02-21 03:09:56,767 INFO L226 Difference]: Without dead ends: 228 [2022-02-21 03:09:56,767 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:09:56,768 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 178 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 381 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.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:09:56,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 381 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:09:56,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-02-21 03:09:56,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 189. [2022-02-21 03:09:56,848 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:09:56,848 INFO L82 GeneralOperation]: Start isEquivalent. First operand 228 states. Second operand has 189 states, 166 states have (on average 1.463855421686747) internal successors, (243), 178 states have internal predecessors, (243), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:56,849 INFO L74 IsIncluded]: Start isIncluded. First operand 228 states. Second operand has 189 states, 166 states have (on average 1.463855421686747) internal successors, (243), 178 states have internal predecessors, (243), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:56,849 INFO L87 Difference]: Start difference. First operand 228 states. Second operand has 189 states, 166 states have (on average 1.463855421686747) internal successors, (243), 178 states have internal predecessors, (243), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:56,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:56,853 INFO L93 Difference]: Finished difference Result 228 states and 311 transitions. [2022-02-21 03:09:56,853 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 311 transitions. [2022-02-21 03:09:56,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:56,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:56,854 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 166 states have (on average 1.463855421686747) internal successors, (243), 178 states have internal predecessors, (243), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 228 states. [2022-02-21 03:09:56,854 INFO L87 Difference]: Start difference. First operand has 189 states, 166 states have (on average 1.463855421686747) internal successors, (243), 178 states have internal predecessors, (243), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 228 states. [2022-02-21 03:09:56,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:56,871 INFO L93 Difference]: Finished difference Result 228 states and 311 transitions. [2022-02-21 03:09:56,871 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 311 transitions. [2022-02-21 03:09:56,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:56,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:56,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:09:56,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:09:56,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 166 states have (on average 1.463855421686747) internal successors, (243), 178 states have internal predecessors, (243), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:56,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 255 transitions. [2022-02-21 03:09:56,876 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 255 transitions. Word has length 23 [2022-02-21 03:09:56,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:09:56,876 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 255 transitions. [2022-02-21 03:09:56,876 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:09:56,877 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 255 transitions. [2022-02-21 03:09:56,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-21 03:09:56,877 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:09:56,877 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:09:56,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:09:57,078 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:09:57,078 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:09:57,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:09:57,079 INFO L85 PathProgramCache]: Analyzing trace with hash -439611243, now seen corresponding path program 1 times [2022-02-21 03:09:57,079 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:09:57,079 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703217168] [2022-02-21 03:09:57,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:57,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:09:57,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:57,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:09:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:57,159 INFO L290 TraceCheckUtils]: 0: Hoare triple {9486#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9471#true} is VALID [2022-02-21 03:09:57,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {9471#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {9471#true} is VALID [2022-02-21 03:09:57,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {9471#true} #res := ~__retres4~0; {9471#true} is VALID [2022-02-21 03:09:57,159 INFO L290 TraceCheckUtils]: 3: Hoare triple {9471#true} assume true; {9471#true} is VALID [2022-02-21 03:09:57,160 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {9471#true} {9473#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} #448#return; {9473#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:09:57,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:09:57,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:57,176 INFO L290 TraceCheckUtils]: 0: Hoare triple {9486#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9471#true} is VALID [2022-02-21 03:09:57,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {9471#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {9471#true} is VALID [2022-02-21 03:09:57,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {9471#true} #res := ~__retres4~0; {9471#true} is VALID [2022-02-21 03:09:57,176 INFO L290 TraceCheckUtils]: 3: Hoare triple {9471#true} assume true; {9471#true} is VALID [2022-02-21 03:09:57,177 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {9471#true} {9473#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} #450#return; {9473#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:09:57,177 INFO L290 TraceCheckUtils]: 0: Hoare triple {9471#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); {9471#true} is VALID [2022-02-21 03:09:57,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {9471#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {9473#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:09:57,178 INFO L272 TraceCheckUtils]: 2: Hoare triple {9473#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} call main_#t~ret22#1 := base2flt(0, 0); {9486#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:09:57,178 INFO L290 TraceCheckUtils]: 3: Hoare triple {9486#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9471#true} is VALID [2022-02-21 03:09:57,178 INFO L290 TraceCheckUtils]: 4: Hoare triple {9471#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {9471#true} is VALID [2022-02-21 03:09:57,178 INFO L290 TraceCheckUtils]: 5: Hoare triple {9471#true} #res := ~__retres4~0; {9471#true} is VALID [2022-02-21 03:09:57,179 INFO L290 TraceCheckUtils]: 6: Hoare triple {9471#true} assume true; {9471#true} is VALID [2022-02-21 03:09:57,179 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {9471#true} {9473#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} #448#return; {9473#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:09:57,179 INFO L290 TraceCheckUtils]: 8: Hoare triple {9473#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {9473#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:09:57,180 INFO L272 TraceCheckUtils]: 9: Hoare triple {9473#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {9486#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:09:57,180 INFO L290 TraceCheckUtils]: 10: Hoare triple {9486#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9471#true} is VALID [2022-02-21 03:09:57,180 INFO L290 TraceCheckUtils]: 11: Hoare triple {9471#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {9471#true} is VALID [2022-02-21 03:09:57,180 INFO L290 TraceCheckUtils]: 12: Hoare triple {9471#true} #res := ~__retres4~0; {9471#true} is VALID [2022-02-21 03:09:57,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {9471#true} assume true; {9471#true} is VALID [2022-02-21 03:09:57,181 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {9471#true} {9473#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} #450#return; {9473#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:09:57,181 INFO L290 TraceCheckUtils]: 15: Hoare triple {9473#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {9473#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:09:57,182 INFO L272 TraceCheckUtils]: 16: Hoare triple {9473#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {9484#(<= 0 (+ 128 |base2flt_#in~e|))} is VALID [2022-02-21 03:09:57,182 INFO L290 TraceCheckUtils]: 17: Hoare triple {9484#(<= 0 (+ 128 |base2flt_#in~e|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9485#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:57,183 INFO L290 TraceCheckUtils]: 18: Hoare triple {9485#(<= 0 (+ 128 base2flt_~e))} assume !(0 == ~m % 4294967296); {9485#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:57,183 INFO L290 TraceCheckUtils]: 19: Hoare triple {9485#(<= 0 (+ 128 base2flt_~e))} assume !(~m % 4294967296 < 16777216); {9485#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:57,183 INFO L290 TraceCheckUtils]: 20: Hoare triple {9485#(<= 0 (+ 128 base2flt_~e))} assume !false; {9485#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:57,184 INFO L290 TraceCheckUtils]: 21: Hoare triple {9485#(<= 0 (+ 128 base2flt_~e))} assume ~m % 4294967296 >= 33554432; {9485#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:57,184 INFO L290 TraceCheckUtils]: 22: Hoare triple {9485#(<= 0 (+ 128 base2flt_~e))} assume !(~e >= 127); {9485#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:57,184 INFO L290 TraceCheckUtils]: 23: Hoare triple {9485#(<= 0 (+ 128 base2flt_~e))} assume 1 + ~e <= 2147483647; {9485#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:57,185 INFO L290 TraceCheckUtils]: 24: Hoare triple {9485#(<= 0 (+ 128 base2flt_~e))} assume !(1 + ~e >= -2147483648); {9472#false} is VALID [2022-02-21 03:09:57,185 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:09:57,185 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:09:57,185 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703217168] [2022-02-21 03:09:57,185 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703217168] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:09:57,185 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497409753] [2022-02-21 03:09:57,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:57,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:09:57,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:09:57,200 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:09:57,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-21 03:09:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:57,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:09:57,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:57,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:09:57,361 INFO L290 TraceCheckUtils]: 0: Hoare triple {9471#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); {9471#true} is VALID [2022-02-21 03:09:57,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {9471#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {9473#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:09:57,362 INFO L272 TraceCheckUtils]: 2: Hoare triple {9473#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} call main_#t~ret22#1 := base2flt(0, 0); {9471#true} is VALID [2022-02-21 03:09:57,362 INFO L290 TraceCheckUtils]: 3: Hoare triple {9471#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9471#true} is VALID [2022-02-21 03:09:57,362 INFO L290 TraceCheckUtils]: 4: Hoare triple {9471#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {9471#true} is VALID [2022-02-21 03:09:57,363 INFO L290 TraceCheckUtils]: 5: Hoare triple {9471#true} #res := ~__retres4~0; {9471#true} is VALID [2022-02-21 03:09:57,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {9471#true} assume true; {9471#true} is VALID [2022-02-21 03:09:57,363 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {9471#true} {9473#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} #448#return; {9473#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:09:57,364 INFO L290 TraceCheckUtils]: 8: Hoare triple {9473#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {9473#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:09:57,364 INFO L272 TraceCheckUtils]: 9: Hoare triple {9473#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {9471#true} is VALID [2022-02-21 03:09:57,364 INFO L290 TraceCheckUtils]: 10: Hoare triple {9471#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9471#true} is VALID [2022-02-21 03:09:57,364 INFO L290 TraceCheckUtils]: 11: Hoare triple {9471#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {9471#true} is VALID [2022-02-21 03:09:57,364 INFO L290 TraceCheckUtils]: 12: Hoare triple {9471#true} #res := ~__retres4~0; {9471#true} is VALID [2022-02-21 03:09:57,364 INFO L290 TraceCheckUtils]: 13: Hoare triple {9471#true} assume true; {9471#true} is VALID [2022-02-21 03:09:57,365 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {9471#true} {9473#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} #450#return; {9473#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:09:57,365 INFO L290 TraceCheckUtils]: 15: Hoare triple {9473#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {9473#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:09:57,366 INFO L272 TraceCheckUtils]: 16: Hoare triple {9473#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {9484#(<= 0 (+ 128 |base2flt_#in~e|))} is VALID [2022-02-21 03:09:57,366 INFO L290 TraceCheckUtils]: 17: Hoare triple {9484#(<= 0 (+ 128 |base2flt_#in~e|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9485#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:57,367 INFO L290 TraceCheckUtils]: 18: Hoare triple {9485#(<= 0 (+ 128 base2flt_~e))} assume !(0 == ~m % 4294967296); {9485#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:57,367 INFO L290 TraceCheckUtils]: 19: Hoare triple {9485#(<= 0 (+ 128 base2flt_~e))} assume !(~m % 4294967296 < 16777216); {9485#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:57,367 INFO L290 TraceCheckUtils]: 20: Hoare triple {9485#(<= 0 (+ 128 base2flt_~e))} assume !false; {9485#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:57,368 INFO L290 TraceCheckUtils]: 21: Hoare triple {9485#(<= 0 (+ 128 base2flt_~e))} assume ~m % 4294967296 >= 33554432; {9485#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:57,368 INFO L290 TraceCheckUtils]: 22: Hoare triple {9485#(<= 0 (+ 128 base2flt_~e))} assume !(~e >= 127); {9485#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:57,368 INFO L290 TraceCheckUtils]: 23: Hoare triple {9485#(<= 0 (+ 128 base2flt_~e))} assume 1 + ~e <= 2147483647; {9485#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:57,369 INFO L290 TraceCheckUtils]: 24: Hoare triple {9485#(<= 0 (+ 128 base2flt_~e))} assume !(1 + ~e >= -2147483648); {9472#false} is VALID [2022-02-21 03:09:57,369 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:09:57,369 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:09:57,369 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497409753] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:09:57,369 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:09:57,369 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-02-21 03:09:57,371 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165817094] [2022-02-21 03:09:57,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:09:57,371 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:09:57,371 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:09:57,372 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:09:57,384 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:09:57,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:09:57,384 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:09:57,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:09:57,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:09:57,385 INFO L87 Difference]: Start difference. First operand 189 states and 255 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:09:57,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:57,745 INFO L93 Difference]: Finished difference Result 219 states and 295 transitions. [2022-02-21 03:09:57,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:09:57,745 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:09:57,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:09:57,746 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:09:57,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 206 transitions. [2022-02-21 03:09:57,748 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:09:57,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 206 transitions. [2022-02-21 03:09:57,749 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 206 transitions. [2022-02-21 03:09:57,889 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 206 edges. 206 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:57,892 INFO L225 Difference]: With dead ends: 219 [2022-02-21 03:09:57,892 INFO L226 Difference]: Without dead ends: 216 [2022-02-21 03:09:57,893 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:09:57,893 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 162 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 387 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:09:57,893 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 387 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:09:57,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-02-21 03:09:57,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 178. [2022-02-21 03:09:57,947 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:09:57,947 INFO L82 GeneralOperation]: Start isEquivalent. First operand 216 states. Second operand has 178 states, 158 states have (on average 1.4430379746835442) internal successors, (228), 167 states have internal predecessors, (228), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:57,948 INFO L74 IsIncluded]: Start isIncluded. First operand 216 states. Second operand has 178 states, 158 states have (on average 1.4430379746835442) internal successors, (228), 167 states have internal predecessors, (228), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:57,948 INFO L87 Difference]: Start difference. First operand 216 states. Second operand has 178 states, 158 states have (on average 1.4430379746835442) internal successors, (228), 167 states have internal predecessors, (228), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:57,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:57,951 INFO L93 Difference]: Finished difference Result 216 states and 292 transitions. [2022-02-21 03:09:57,951 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 292 transitions. [2022-02-21 03:09:57,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:57,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:57,952 INFO L74 IsIncluded]: Start isIncluded. First operand has 178 states, 158 states have (on average 1.4430379746835442) internal successors, (228), 167 states have internal predecessors, (228), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 216 states. [2022-02-21 03:09:57,953 INFO L87 Difference]: Start difference. First operand has 178 states, 158 states have (on average 1.4430379746835442) internal successors, (228), 167 states have internal predecessors, (228), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 216 states. [2022-02-21 03:09:57,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:57,956 INFO L93 Difference]: Finished difference Result 216 states and 292 transitions. [2022-02-21 03:09:57,956 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 292 transitions. [2022-02-21 03:09:57,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:57,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:57,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:09:57,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:09:57,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 158 states have (on average 1.4430379746835442) internal successors, (228), 167 states have internal predecessors, (228), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:57,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 240 transitions. [2022-02-21 03:09:57,960 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 240 transitions. Word has length 25 [2022-02-21 03:09:57,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:09:57,960 INFO L470 AbstractCegarLoop]: Abstraction has 178 states and 240 transitions. [2022-02-21 03:09:57,960 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:09:57,960 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 240 transitions. [2022-02-21 03:09:57,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-21 03:09:57,961 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:09:57,961 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, 1] [2022-02-21 03:09:57,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:09:58,181 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:09:58,181 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:09:58,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:09:58,182 INFO L85 PathProgramCache]: Analyzing trace with hash -853587819, now seen corresponding path program 1 times [2022-02-21 03:09:58,182 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:09:58,182 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772487855] [2022-02-21 03:09:58,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:58,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:09:58,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:58,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:09:58,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:58,264 INFO L290 TraceCheckUtils]: 0: Hoare triple {10471#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {10451#true} is VALID [2022-02-21 03:09:58,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {10451#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {10451#true} is VALID [2022-02-21 03:09:58,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {10451#true} #res := ~__retres4~0; {10451#true} is VALID [2022-02-21 03:09:58,265 INFO L290 TraceCheckUtils]: 3: Hoare triple {10451#true} assume true; {10451#true} is VALID [2022-02-21 03:09:58,265 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10451#true} {10451#true} #448#return; {10451#true} is VALID [2022-02-21 03:09:58,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:09:58,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:58,269 INFO L290 TraceCheckUtils]: 0: Hoare triple {10471#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {10451#true} is VALID [2022-02-21 03:09:58,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {10451#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {10451#true} is VALID [2022-02-21 03:09:58,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {10451#true} #res := ~__retres4~0; {10451#true} is VALID [2022-02-21 03:09:58,270 INFO L290 TraceCheckUtils]: 3: Hoare triple {10451#true} assume true; {10451#true} is VALID [2022-02-21 03:09:58,270 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10451#true} {10451#true} #450#return; {10451#true} is VALID [2022-02-21 03:09:58,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-21 03:09:58,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:58,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {10471#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {10451#true} is VALID [2022-02-21 03:09:58,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {10451#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {10472#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:09:58,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {10472#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {10473#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:09:58,310 INFO L290 TraceCheckUtils]: 3: Hoare triple {10473#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {10473#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:09:58,311 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10473#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {10451#true} #452#return; {10468#(= |ULTIMATE.start_main_#t~ret24#1| 0)} is VALID [2022-02-21 03:09:58,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {10451#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); {10451#true} is VALID [2022-02-21 03:09:58,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {10451#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {10451#true} is VALID [2022-02-21 03:09:58,312 INFO L272 TraceCheckUtils]: 2: Hoare triple {10451#true} call main_#t~ret22#1 := base2flt(0, 0); {10471#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:09:58,312 INFO L290 TraceCheckUtils]: 3: Hoare triple {10471#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {10451#true} is VALID [2022-02-21 03:09:58,312 INFO L290 TraceCheckUtils]: 4: Hoare triple {10451#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {10451#true} is VALID [2022-02-21 03:09:58,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {10451#true} #res := ~__retres4~0; {10451#true} is VALID [2022-02-21 03:09:58,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {10451#true} assume true; {10451#true} is VALID [2022-02-21 03:09:58,313 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10451#true} {10451#true} #448#return; {10451#true} is VALID [2022-02-21 03:09:58,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {10451#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {10451#true} is VALID [2022-02-21 03:09:58,314 INFO L272 TraceCheckUtils]: 9: Hoare triple {10451#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {10471#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:09:58,316 INFO L290 TraceCheckUtils]: 10: Hoare triple {10471#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {10451#true} is VALID [2022-02-21 03:09:58,317 INFO L290 TraceCheckUtils]: 11: Hoare triple {10451#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {10451#true} is VALID [2022-02-21 03:09:58,317 INFO L290 TraceCheckUtils]: 12: Hoare triple {10451#true} #res := ~__retres4~0; {10451#true} is VALID [2022-02-21 03:09:58,317 INFO L290 TraceCheckUtils]: 13: Hoare triple {10451#true} assume true; {10451#true} is VALID [2022-02-21 03:09:58,317 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {10451#true} {10451#true} #450#return; {10451#true} is VALID [2022-02-21 03:09:58,317 INFO L290 TraceCheckUtils]: 15: Hoare triple {10451#true} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {10451#true} is VALID [2022-02-21 03:09:58,318 INFO L272 TraceCheckUtils]: 16: Hoare triple {10451#true} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {10471#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:09:58,318 INFO L290 TraceCheckUtils]: 17: Hoare triple {10471#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {10451#true} is VALID [2022-02-21 03:09:58,319 INFO L290 TraceCheckUtils]: 18: Hoare triple {10451#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {10472#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:09:58,319 INFO L290 TraceCheckUtils]: 19: Hoare triple {10472#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {10473#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:09:58,320 INFO L290 TraceCheckUtils]: 20: Hoare triple {10473#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {10473#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:09:58,320 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10473#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {10451#true} #452#return; {10468#(= |ULTIMATE.start_main_#t~ret24#1| 0)} is VALID [2022-02-21 03:09:58,321 INFO L290 TraceCheckUtils]: 22: Hoare triple {10468#(= |ULTIMATE.start_main_#t~ret24#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {10469#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-21 03:09:58,321 INFO L290 TraceCheckUtils]: 23: Hoare triple {10469#(= |ULTIMATE.start_main_~b~0#1| 0)} assume main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sa~0#1 := -1; {10469#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-21 03:09:58,321 INFO L290 TraceCheckUtils]: 24: Hoare triple {10469#(= |ULTIMATE.start_main_~b~0#1| 0)} assume main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sb~0#1 := -1; {10469#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-21 03:09:58,322 INFO L290 TraceCheckUtils]: 25: Hoare triple {10469#(= |ULTIMATE.start_main_~b~0#1| 0)} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {10470#(= |ULTIMATE.start_addflt_~b#1| 0)} is VALID [2022-02-21 03:09:58,322 INFO L290 TraceCheckUtils]: 26: Hoare triple {10470#(= |ULTIMATE.start_addflt_~b#1| 0)} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {10470#(= |ULTIMATE.start_addflt_~b#1| 0)} is VALID [2022-02-21 03:09:58,322 INFO L290 TraceCheckUtils]: 27: Hoare triple {10470#(= |ULTIMATE.start_addflt_~b#1| 0)} assume !(0 == addflt_~b#1 % 4294967296); {10452#false} is VALID [2022-02-21 03:09:58,323 INFO L290 TraceCheckUtils]: 28: Hoare triple {10452#false} assume 0 == addflt_~a#1;addflt_~ma~0#1 := 0; {10452#false} is VALID [2022-02-21 03:09:58,326 INFO L290 TraceCheckUtils]: 29: Hoare triple {10452#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {10452#false} is VALID [2022-02-21 03:09:58,326 INFO L290 TraceCheckUtils]: 30: Hoare triple {10452#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {10452#false} is VALID [2022-02-21 03:09:58,327 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:09:58,327 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:09:58,327 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772487855] [2022-02-21 03:09:58,327 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772487855] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:09:58,328 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:09:58,328 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-21 03:09:58,328 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492913329] [2022-02-21 03:09:58,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:09:58,328 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2022-02-21 03:09:58,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:09:58,329 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:09:58,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:58,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-21 03:09:58,345 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:09:58,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 03:09:58,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:09:58,346 INFO L87 Difference]: Start difference. First operand 178 states and 240 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:09:59,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:59,046 INFO L93 Difference]: Finished difference Result 330 states and 425 transitions. [2022-02-21 03:09:59,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-21 03:09:59,046 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2022-02-21 03:09:59,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:09:59,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:09:59,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 273 transitions. [2022-02-21 03:09:59,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:09:59,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 273 transitions. [2022-02-21 03:09:59,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 273 transitions. [2022-02-21 03:09:59,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 273 edges. 273 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:59,226 INFO L225 Difference]: With dead ends: 330 [2022-02-21 03:09:59,226 INFO L226 Difference]: Without dead ends: 260 [2022-02-21 03:09:59,227 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-02-21 03:09:59,227 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 88 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:09:59,228 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 762 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:09:59,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-02-21 03:09:59,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 180. [2022-02-21 03:09:59,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:09:59,282 INFO L82 GeneralOperation]: Start isEquivalent. First operand 260 states. Second operand has 180 states, 160 states have (on average 1.425) internal successors, (228), 169 states have internal predecessors, (228), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:59,282 INFO L74 IsIncluded]: Start isIncluded. First operand 260 states. Second operand has 180 states, 160 states have (on average 1.425) internal successors, (228), 169 states have internal predecessors, (228), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:59,283 INFO L87 Difference]: Start difference. First operand 260 states. Second operand has 180 states, 160 states have (on average 1.425) internal successors, (228), 169 states have internal predecessors, (228), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:59,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:59,288 INFO L93 Difference]: Finished difference Result 260 states and 337 transitions. [2022-02-21 03:09:59,288 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 337 transitions. [2022-02-21 03:09:59,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:59,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:59,289 INFO L74 IsIncluded]: Start isIncluded. First operand has 180 states, 160 states have (on average 1.425) internal successors, (228), 169 states have internal predecessors, (228), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 260 states. [2022-02-21 03:09:59,289 INFO L87 Difference]: Start difference. First operand has 180 states, 160 states have (on average 1.425) internal successors, (228), 169 states have internal predecessors, (228), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 260 states. [2022-02-21 03:09:59,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:59,294 INFO L93 Difference]: Finished difference Result 260 states and 337 transitions. [2022-02-21 03:09:59,294 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 337 transitions. [2022-02-21 03:09:59,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:59,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:59,295 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:09:59,295 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:09:59,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 160 states have (on average 1.425) internal successors, (228), 169 states have internal predecessors, (228), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:09:59,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 240 transitions. [2022-02-21 03:09:59,300 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 240 transitions. Word has length 31 [2022-02-21 03:09:59,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:09:59,300 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 240 transitions. [2022-02-21 03:09:59,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:09:59,301 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 240 transitions. [2022-02-21 03:09:59,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-21 03:09:59,302 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:09:59,303 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] [2022-02-21 03:09:59,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-21 03:09:59,303 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:09:59,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:09:59,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1244113542, now seen corresponding path program 1 times [2022-02-21 03:09:59,303 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:09:59,304 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249388085] [2022-02-21 03:09:59,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:59,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:09:59,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:59,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:09:59,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:59,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {11601#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {11578#true} is VALID [2022-02-21 03:09:59,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {11578#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {11602#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:09:59,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {11602#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {11603#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:09:59,386 INFO L290 TraceCheckUtils]: 3: Hoare triple {11603#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {11603#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:09:59,388 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {11603#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {11578#true} #448#return; {11585#(= |ULTIMATE.start_main_#t~ret22#1| 0)} is VALID [2022-02-21 03:09:59,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:09:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:59,398 INFO L290 TraceCheckUtils]: 0: Hoare triple {11601#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {11578#true} is VALID [2022-02-21 03:09:59,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {11578#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {11578#true} is VALID [2022-02-21 03:09:59,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {11578#true} #res := ~__retres4~0; {11578#true} is VALID [2022-02-21 03:09:59,404 INFO L290 TraceCheckUtils]: 3: Hoare triple {11578#true} assume true; {11578#true} is VALID [2022-02-21 03:09:59,404 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {11578#true} {11586#(= |ULTIMATE.start_main_~zero~0#1| 0)} #450#return; {11586#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:09:59,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-21 03:09:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:59,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {11601#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {11578#true} is VALID [2022-02-21 03:09:59,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {11578#true} assume !(0 == ~m % 4294967296); {11578#true} is VALID [2022-02-21 03:09:59,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {11578#true} assume !(~m % 4294967296 < 16777216); {11578#true} is VALID [2022-02-21 03:09:59,412 INFO L290 TraceCheckUtils]: 3: Hoare triple {11578#true} assume !false; {11578#true} is VALID [2022-02-21 03:09:59,412 INFO L290 TraceCheckUtils]: 4: Hoare triple {11578#true} assume ~m % 4294967296 >= 33554432; {11578#true} is VALID [2022-02-21 03:09:59,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {11578#true} assume ~e >= 127;~__retres4~0 := 4294967295; {11578#true} is VALID [2022-02-21 03:09:59,413 INFO L290 TraceCheckUtils]: 6: Hoare triple {11578#true} #res := ~__retres4~0; {11578#true} is VALID [2022-02-21 03:09:59,413 INFO L290 TraceCheckUtils]: 7: Hoare triple {11578#true} assume true; {11578#true} is VALID [2022-02-21 03:09:59,413 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {11578#true} {11586#(= |ULTIMATE.start_main_~zero~0#1| 0)} #452#return; {11586#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:09:59,414 INFO L290 TraceCheckUtils]: 0: Hoare triple {11578#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); {11578#true} is VALID [2022-02-21 03:09:59,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {11578#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {11578#true} is VALID [2022-02-21 03:09:59,414 INFO L272 TraceCheckUtils]: 2: Hoare triple {11578#true} call main_#t~ret22#1 := base2flt(0, 0); {11601#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:09:59,414 INFO L290 TraceCheckUtils]: 3: Hoare triple {11601#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {11578#true} is VALID [2022-02-21 03:09:59,415 INFO L290 TraceCheckUtils]: 4: Hoare triple {11578#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {11602#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:09:59,415 INFO L290 TraceCheckUtils]: 5: Hoare triple {11602#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {11603#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:09:59,415 INFO L290 TraceCheckUtils]: 6: Hoare triple {11603#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {11603#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:09:59,416 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11603#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {11578#true} #448#return; {11585#(= |ULTIMATE.start_main_#t~ret22#1| 0)} is VALID [2022-02-21 03:09:59,416 INFO L290 TraceCheckUtils]: 8: Hoare triple {11585#(= |ULTIMATE.start_main_#t~ret22#1| 0)} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {11586#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:09:59,417 INFO L272 TraceCheckUtils]: 9: Hoare triple {11586#(= |ULTIMATE.start_main_~zero~0#1| 0)} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {11601#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:09:59,417 INFO L290 TraceCheckUtils]: 10: Hoare triple {11601#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {11578#true} is VALID [2022-02-21 03:09:59,417 INFO L290 TraceCheckUtils]: 11: Hoare triple {11578#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {11578#true} is VALID [2022-02-21 03:09:59,417 INFO L290 TraceCheckUtils]: 12: Hoare triple {11578#true} #res := ~__retres4~0; {11578#true} is VALID [2022-02-21 03:09:59,418 INFO L290 TraceCheckUtils]: 13: Hoare triple {11578#true} assume true; {11578#true} is VALID [2022-02-21 03:09:59,418 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {11578#true} {11586#(= |ULTIMATE.start_main_~zero~0#1| 0)} #450#return; {11586#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:09:59,418 INFO L290 TraceCheckUtils]: 15: Hoare triple {11586#(= |ULTIMATE.start_main_~zero~0#1| 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {11586#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:09:59,419 INFO L272 TraceCheckUtils]: 16: Hoare triple {11586#(= |ULTIMATE.start_main_~zero~0#1| 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {11601#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:09:59,419 INFO L290 TraceCheckUtils]: 17: Hoare triple {11601#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {11578#true} is VALID [2022-02-21 03:09:59,419 INFO L290 TraceCheckUtils]: 18: Hoare triple {11578#true} assume !(0 == ~m % 4294967296); {11578#true} is VALID [2022-02-21 03:09:59,419 INFO L290 TraceCheckUtils]: 19: Hoare triple {11578#true} assume !(~m % 4294967296 < 16777216); {11578#true} is VALID [2022-02-21 03:09:59,419 INFO L290 TraceCheckUtils]: 20: Hoare triple {11578#true} assume !false; {11578#true} is VALID [2022-02-21 03:09:59,420 INFO L290 TraceCheckUtils]: 21: Hoare triple {11578#true} assume ~m % 4294967296 >= 33554432; {11578#true} is VALID [2022-02-21 03:09:59,420 INFO L290 TraceCheckUtils]: 22: Hoare triple {11578#true} assume ~e >= 127;~__retres4~0 := 4294967295; {11578#true} is VALID [2022-02-21 03:09:59,420 INFO L290 TraceCheckUtils]: 23: Hoare triple {11578#true} #res := ~__retres4~0; {11578#true} is VALID [2022-02-21 03:09:59,420 INFO L290 TraceCheckUtils]: 24: Hoare triple {11578#true} assume true; {11578#true} is VALID [2022-02-21 03:09:59,420 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {11578#true} {11586#(= |ULTIMATE.start_main_~zero~0#1| 0)} #452#return; {11586#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:09:59,421 INFO L290 TraceCheckUtils]: 26: Hoare triple {11586#(= |ULTIMATE.start_main_~zero~0#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {11586#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:09:59,421 INFO L290 TraceCheckUtils]: 27: Hoare triple {11586#(= |ULTIMATE.start_main_~zero~0#1| 0)} assume main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sa~0#1 := -1; {11579#false} is VALID [2022-02-21 03:09:59,421 INFO L290 TraceCheckUtils]: 28: Hoare triple {11579#false} assume main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sb~0#1 := -1; {11579#false} is VALID [2022-02-21 03:09:59,421 INFO L290 TraceCheckUtils]: 29: Hoare triple {11579#false} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {11579#false} is VALID [2022-02-21 03:09:59,422 INFO L290 TraceCheckUtils]: 30: Hoare triple {11579#false} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {11579#false} is VALID [2022-02-21 03:09:59,422 INFO L290 TraceCheckUtils]: 31: Hoare triple {11579#false} assume !(0 == addflt_~b#1 % 4294967296); {11579#false} is VALID [2022-02-21 03:09:59,422 INFO L290 TraceCheckUtils]: 32: Hoare triple {11579#false} assume 0 == addflt_~a#1;addflt_~ma~0#1 := 0; {11579#false} is VALID [2022-02-21 03:09:59,422 INFO L290 TraceCheckUtils]: 33: Hoare triple {11579#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {11579#false} is VALID [2022-02-21 03:09:59,422 INFO L290 TraceCheckUtils]: 34: Hoare triple {11579#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {11579#false} is VALID [2022-02-21 03:09:59,423 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-21 03:09:59,423 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:09:59,423 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249388085] [2022-02-21 03:09:59,424 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249388085] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:09:59,424 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551902038] [2022-02-21 03:09:59,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:59,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:09:59,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:09:59,425 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:09:59,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-21 03:09:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:59,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-21 03:09:59,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:59,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:09:59,818 INFO L290 TraceCheckUtils]: 0: Hoare triple {11578#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); {11578#true} is VALID [2022-02-21 03:09:59,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {11578#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {11578#true} is VALID [2022-02-21 03:09:59,819 INFO L272 TraceCheckUtils]: 2: Hoare triple {11578#true} call main_#t~ret22#1 := base2flt(0, 0); {11578#true} is VALID [2022-02-21 03:09:59,820 INFO L290 TraceCheckUtils]: 3: Hoare triple {11578#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {11616#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:09:59,820 INFO L290 TraceCheckUtils]: 4: Hoare triple {11616#(= base2flt_~m |base2flt_#in~m|)} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {11620#(<= (mod |base2flt_#in~m| 4294967296) 0)} is VALID [2022-02-21 03:09:59,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {11620#(<= (mod |base2flt_#in~m| 4294967296) 0)} #res := ~__retres4~0; {11620#(<= (mod |base2flt_#in~m| 4294967296) 0)} is VALID [2022-02-21 03:09:59,821 INFO L290 TraceCheckUtils]: 6: Hoare triple {11620#(<= (mod |base2flt_#in~m| 4294967296) 0)} assume true; {11620#(<= (mod |base2flt_#in~m| 4294967296) 0)} is VALID [2022-02-21 03:09:59,821 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11620#(<= (mod |base2flt_#in~m| 4294967296) 0)} {11578#true} #448#return; {11578#true} is VALID [2022-02-21 03:09:59,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {11578#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {11578#true} is VALID [2022-02-21 03:09:59,821 INFO L272 TraceCheckUtils]: 9: Hoare triple {11578#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {11578#true} is VALID [2022-02-21 03:09:59,821 INFO L290 TraceCheckUtils]: 10: Hoare triple {11578#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {11578#true} is VALID [2022-02-21 03:09:59,822 INFO L290 TraceCheckUtils]: 11: Hoare triple {11578#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {11578#true} is VALID [2022-02-21 03:09:59,822 INFO L290 TraceCheckUtils]: 12: Hoare triple {11578#true} #res := ~__retres4~0; {11578#true} is VALID [2022-02-21 03:09:59,822 INFO L290 TraceCheckUtils]: 13: Hoare triple {11578#true} assume true; {11578#true} is VALID [2022-02-21 03:09:59,822 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {11578#true} {11578#true} #450#return; {11578#true} is VALID [2022-02-21 03:09:59,822 INFO L290 TraceCheckUtils]: 15: Hoare triple {11578#true} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {11578#true} is VALID [2022-02-21 03:09:59,822 INFO L272 TraceCheckUtils]: 16: Hoare triple {11578#true} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {11578#true} is VALID [2022-02-21 03:09:59,822 INFO L290 TraceCheckUtils]: 17: Hoare triple {11578#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {11578#true} is VALID [2022-02-21 03:09:59,822 INFO L290 TraceCheckUtils]: 18: Hoare triple {11578#true} assume !(0 == ~m % 4294967296); {11578#true} is VALID [2022-02-21 03:09:59,823 INFO L290 TraceCheckUtils]: 19: Hoare triple {11578#true} assume !(~m % 4294967296 < 16777216); {11578#true} is VALID [2022-02-21 03:09:59,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {11578#true} assume !false; {11578#true} is VALID [2022-02-21 03:09:59,823 INFO L290 TraceCheckUtils]: 21: Hoare triple {11578#true} assume ~m % 4294967296 >= 33554432; {11578#true} is VALID [2022-02-21 03:09:59,823 INFO L290 TraceCheckUtils]: 22: Hoare triple {11578#true} assume ~e >= 127;~__retres4~0 := 4294967295; {11578#true} is VALID [2022-02-21 03:09:59,823 INFO L290 TraceCheckUtils]: 23: Hoare triple {11578#true} #res := ~__retres4~0; {11578#true} is VALID [2022-02-21 03:09:59,823 INFO L290 TraceCheckUtils]: 24: Hoare triple {11578#true} assume true; {11578#true} is VALID [2022-02-21 03:09:59,823 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {11578#true} {11578#true} #452#return; {11578#true} is VALID [2022-02-21 03:09:59,823 INFO L290 TraceCheckUtils]: 26: Hoare triple {11578#true} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {11578#true} is VALID [2022-02-21 03:09:59,824 INFO L290 TraceCheckUtils]: 27: Hoare triple {11578#true} assume main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sa~0#1 := -1; {11578#true} is VALID [2022-02-21 03:09:59,824 INFO L290 TraceCheckUtils]: 28: Hoare triple {11578#true} assume main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sb~0#1 := -1; {11578#true} is VALID [2022-02-21 03:09:59,824 INFO L290 TraceCheckUtils]: 29: Hoare triple {11578#true} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {11578#true} is VALID [2022-02-21 03:09:59,824 INFO L290 TraceCheckUtils]: 30: Hoare triple {11578#true} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {11699#(not (< (mod |ULTIMATE.start_addflt_~a#1| 4294967296) (mod |ULTIMATE.start_addflt_~b#1| 4294967296)))} is VALID [2022-02-21 03:09:59,825 INFO L290 TraceCheckUtils]: 31: Hoare triple {11699#(not (< (mod |ULTIMATE.start_addflt_~a#1| 4294967296) (mod |ULTIMATE.start_addflt_~b#1| 4294967296)))} assume !(0 == addflt_~b#1 % 4294967296); {11703#(< 0 (+ (div (+ (- 1) (mod |ULTIMATE.start_addflt_~a#1| 4294967296)) 4294967296) 1))} is VALID [2022-02-21 03:09:59,826 INFO L290 TraceCheckUtils]: 32: Hoare triple {11703#(< 0 (+ (div (+ (- 1) (mod |ULTIMATE.start_addflt_~a#1| 4294967296)) 4294967296) 1))} assume 0 == addflt_~a#1;addflt_~ma~0#1 := 0; {11579#false} is VALID [2022-02-21 03:09:59,826 INFO L290 TraceCheckUtils]: 33: Hoare triple {11579#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {11579#false} is VALID [2022-02-21 03:09:59,826 INFO L290 TraceCheckUtils]: 34: Hoare triple {11579#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {11579#false} is VALID [2022-02-21 03:09:59,827 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-21 03:09:59,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:10:00,215 INFO L290 TraceCheckUtils]: 34: Hoare triple {11579#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {11579#false} is VALID [2022-02-21 03:10:00,216 INFO L290 TraceCheckUtils]: 33: Hoare triple {11579#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {11579#false} is VALID [2022-02-21 03:10:00,216 INFO L290 TraceCheckUtils]: 32: Hoare triple {11719#(not (= |ULTIMATE.start_addflt_~a#1| 0))} assume 0 == addflt_~a#1;addflt_~ma~0#1 := 0; {11579#false} is VALID [2022-02-21 03:10:00,216 INFO L290 TraceCheckUtils]: 31: Hoare triple {11723#(or (not (= |ULTIMATE.start_addflt_~a#1| 0)) (= (mod |ULTIMATE.start_addflt_~b#1| 4294967296) 0))} assume !(0 == addflt_~b#1 % 4294967296); {11719#(not (= |ULTIMATE.start_addflt_~a#1| 0))} is VALID [2022-02-21 03:10:00,217 INFO L290 TraceCheckUtils]: 30: Hoare triple {11578#true} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {11723#(or (not (= |ULTIMATE.start_addflt_~a#1| 0)) (= (mod |ULTIMATE.start_addflt_~b#1| 4294967296) 0))} is VALID [2022-02-21 03:10:00,217 INFO L290 TraceCheckUtils]: 29: Hoare triple {11578#true} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {11578#true} is VALID [2022-02-21 03:10:00,218 INFO L290 TraceCheckUtils]: 28: Hoare triple {11578#true} assume main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sb~0#1 := -1; {11578#true} is VALID [2022-02-21 03:10:00,218 INFO L290 TraceCheckUtils]: 27: Hoare triple {11578#true} assume main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sa~0#1 := -1; {11578#true} is VALID [2022-02-21 03:10:00,218 INFO L290 TraceCheckUtils]: 26: Hoare triple {11578#true} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {11578#true} is VALID [2022-02-21 03:10:00,218 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {11578#true} {11578#true} #452#return; {11578#true} is VALID [2022-02-21 03:10:00,218 INFO L290 TraceCheckUtils]: 24: Hoare triple {11578#true} assume true; {11578#true} is VALID [2022-02-21 03:10:00,218 INFO L290 TraceCheckUtils]: 23: Hoare triple {11578#true} #res := ~__retres4~0; {11578#true} is VALID [2022-02-21 03:10:00,218 INFO L290 TraceCheckUtils]: 22: Hoare triple {11578#true} assume ~e >= 127;~__retres4~0 := 4294967295; {11578#true} is VALID [2022-02-21 03:10:00,219 INFO L290 TraceCheckUtils]: 21: Hoare triple {11578#true} assume ~m % 4294967296 >= 33554432; {11578#true} is VALID [2022-02-21 03:10:00,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {11578#true} assume !false; {11578#true} is VALID [2022-02-21 03:10:00,219 INFO L290 TraceCheckUtils]: 19: Hoare triple {11578#true} assume !(~m % 4294967296 < 16777216); {11578#true} is VALID [2022-02-21 03:10:00,219 INFO L290 TraceCheckUtils]: 18: Hoare triple {11578#true} assume !(0 == ~m % 4294967296); {11578#true} is VALID [2022-02-21 03:10:00,219 INFO L290 TraceCheckUtils]: 17: Hoare triple {11578#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {11578#true} is VALID [2022-02-21 03:10:00,219 INFO L272 TraceCheckUtils]: 16: Hoare triple {11578#true} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {11578#true} is VALID [2022-02-21 03:10:00,219 INFO L290 TraceCheckUtils]: 15: Hoare triple {11578#true} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {11578#true} is VALID [2022-02-21 03:10:00,219 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {11578#true} {11578#true} #450#return; {11578#true} is VALID [2022-02-21 03:10:00,220 INFO L290 TraceCheckUtils]: 13: Hoare triple {11578#true} assume true; {11578#true} is VALID [2022-02-21 03:10:00,220 INFO L290 TraceCheckUtils]: 12: Hoare triple {11578#true} #res := ~__retres4~0; {11578#true} is VALID [2022-02-21 03:10:00,220 INFO L290 TraceCheckUtils]: 11: Hoare triple {11578#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {11578#true} is VALID [2022-02-21 03:10:00,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {11578#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {11578#true} is VALID [2022-02-21 03:10:00,220 INFO L272 TraceCheckUtils]: 9: Hoare triple {11578#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {11578#true} is VALID [2022-02-21 03:10:00,220 INFO L290 TraceCheckUtils]: 8: Hoare triple {11578#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {11578#true} is VALID [2022-02-21 03:10:00,220 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11578#true} {11578#true} #448#return; {11578#true} is VALID [2022-02-21 03:10:00,221 INFO L290 TraceCheckUtils]: 6: Hoare triple {11578#true} assume true; {11578#true} is VALID [2022-02-21 03:10:00,221 INFO L290 TraceCheckUtils]: 5: Hoare triple {11578#true} #res := ~__retres4~0; {11578#true} is VALID [2022-02-21 03:10:00,221 INFO L290 TraceCheckUtils]: 4: Hoare triple {11578#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {11578#true} is VALID [2022-02-21 03:10:00,221 INFO L290 TraceCheckUtils]: 3: Hoare triple {11578#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {11578#true} is VALID [2022-02-21 03:10:00,221 INFO L272 TraceCheckUtils]: 2: Hoare triple {11578#true} call main_#t~ret22#1 := base2flt(0, 0); {11578#true} is VALID [2022-02-21 03:10:00,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {11578#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {11578#true} is VALID [2022-02-21 03:10:00,221 INFO L290 TraceCheckUtils]: 0: Hoare triple {11578#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); {11578#true} is VALID [2022-02-21 03:10:00,222 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-21 03:10:00,222 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551902038] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:00,222 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-02-21 03:10:00,222 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 6] total 13 [2022-02-21 03:10:00,222 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040440932] [2022-02-21 03:10:00,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:00,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2022-02-21 03:10:00,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:00,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:00,239 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:00,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:10:00,240 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:00,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:10:00,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-02-21 03:10:00,240 INFO L87 Difference]: Start difference. First operand 180 states and 240 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:00,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:00,441 INFO L93 Difference]: Finished difference Result 232 states and 299 transitions. [2022-02-21 03:10:00,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:10:00,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2022-02-21 03:10:00,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:00,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:00,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2022-02-21 03:10:00,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:00,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2022-02-21 03:10:00,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 186 transitions. [2022-02-21 03:10:00,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:00,561 INFO L225 Difference]: With dead ends: 232 [2022-02-21 03:10:00,562 INFO L226 Difference]: Without dead ends: 181 [2022-02-21 03:10:00,562 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-02-21 03:10:00,563 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 53 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:00,563 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 260 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:10:00,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-02-21 03:10:00,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2022-02-21 03:10:00,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:00,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 181 states. Second operand has 180 states, 160 states have (on average 1.41875) internal successors, (227), 169 states have internal predecessors, (227), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:00,620 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand has 180 states, 160 states have (on average 1.41875) internal successors, (227), 169 states have internal predecessors, (227), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:00,620 INFO L87 Difference]: Start difference. First operand 181 states. Second operand has 180 states, 160 states have (on average 1.41875) internal successors, (227), 169 states have internal predecessors, (227), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:00,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:00,623 INFO L93 Difference]: Finished difference Result 181 states and 240 transitions. [2022-02-21 03:10:00,623 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 240 transitions. [2022-02-21 03:10:00,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:00,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:00,624 INFO L74 IsIncluded]: Start isIncluded. First operand has 180 states, 160 states have (on average 1.41875) internal successors, (227), 169 states have internal predecessors, (227), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 181 states. [2022-02-21 03:10:00,625 INFO L87 Difference]: Start difference. First operand has 180 states, 160 states have (on average 1.41875) internal successors, (227), 169 states have internal predecessors, (227), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 181 states. [2022-02-21 03:10:00,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:00,627 INFO L93 Difference]: Finished difference Result 181 states and 240 transitions. [2022-02-21 03:10:00,627 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 240 transitions. [2022-02-21 03:10:00,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:00,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:00,628 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:00,628 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:00,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 160 states have (on average 1.41875) internal successors, (227), 169 states have internal predecessors, (227), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:00,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 239 transitions. [2022-02-21 03:10:00,630 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 239 transitions. Word has length 35 [2022-02-21 03:10:00,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:00,631 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 239 transitions. [2022-02-21 03:10:00,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:00,631 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 239 transitions. [2022-02-21 03:10:00,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-21 03:10:00,632 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:00,632 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, 1] [2022-02-21 03:10:00,669 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:00,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:00,848 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:00,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:00,848 INFO L85 PathProgramCache]: Analyzing trace with hash -2136066482, now seen corresponding path program 1 times [2022-02-21 03:10:00,848 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:00,848 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291993612] [2022-02-21 03:10:00,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:00,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:00,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:00,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:00,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:00,898 INFO L290 TraceCheckUtils]: 0: Hoare triple {12670#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12646#true} is VALID [2022-02-21 03:10:00,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {12646#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {12646#true} is VALID [2022-02-21 03:10:00,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {12646#true} #res := ~__retres4~0; {12646#true} is VALID [2022-02-21 03:10:00,899 INFO L290 TraceCheckUtils]: 3: Hoare triple {12646#true} assume true; {12646#true} is VALID [2022-02-21 03:10:00,899 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {12646#true} {12646#true} #448#return; {12646#true} is VALID [2022-02-21 03:10:00,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:00,926 INFO L290 TraceCheckUtils]: 0: Hoare triple {12670#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12646#true} is VALID [2022-02-21 03:10:00,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {12646#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {12671#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:00,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {12671#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {12672#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:00,929 INFO L290 TraceCheckUtils]: 3: Hoare triple {12672#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {12672#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:00,931 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {12672#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {12646#true} #450#return; {12658#(= |ULTIMATE.start_main_#t~ret23#1| 0)} is VALID [2022-02-21 03:10:00,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-21 03:10:00,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:00,937 INFO L290 TraceCheckUtils]: 0: Hoare triple {12670#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12646#true} is VALID [2022-02-21 03:10:00,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {12646#true} assume !(0 == ~m % 4294967296); {12646#true} is VALID [2022-02-21 03:10:00,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {12646#true} assume !(~m % 4294967296 < 16777216); {12646#true} is VALID [2022-02-21 03:10:00,938 INFO L290 TraceCheckUtils]: 3: Hoare triple {12646#true} assume !false; {12646#true} is VALID [2022-02-21 03:10:00,938 INFO L290 TraceCheckUtils]: 4: Hoare triple {12646#true} assume ~m % 4294967296 >= 33554432; {12646#true} is VALID [2022-02-21 03:10:00,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {12646#true} assume ~e >= 127;~__retres4~0 := 4294967295; {12646#true} is VALID [2022-02-21 03:10:00,938 INFO L290 TraceCheckUtils]: 6: Hoare triple {12646#true} #res := ~__retres4~0; {12646#true} is VALID [2022-02-21 03:10:00,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {12646#true} assume true; {12646#true} is VALID [2022-02-21 03:10:00,939 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {12646#true} {12659#(= |ULTIMATE.start_main_~a~0#1| 0)} #452#return; {12659#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:00,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {12646#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); {12646#true} is VALID [2022-02-21 03:10:00,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {12646#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {12646#true} is VALID [2022-02-21 03:10:00,940 INFO L272 TraceCheckUtils]: 2: Hoare triple {12646#true} call main_#t~ret22#1 := base2flt(0, 0); {12670#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:00,940 INFO L290 TraceCheckUtils]: 3: Hoare triple {12670#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12646#true} is VALID [2022-02-21 03:10:00,940 INFO L290 TraceCheckUtils]: 4: Hoare triple {12646#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {12646#true} is VALID [2022-02-21 03:10:00,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {12646#true} #res := ~__retres4~0; {12646#true} is VALID [2022-02-21 03:10:00,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {12646#true} assume true; {12646#true} is VALID [2022-02-21 03:10:00,940 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {12646#true} {12646#true} #448#return; {12646#true} is VALID [2022-02-21 03:10:00,940 INFO L290 TraceCheckUtils]: 8: Hoare triple {12646#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {12646#true} is VALID [2022-02-21 03:10:00,941 INFO L272 TraceCheckUtils]: 9: Hoare triple {12646#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {12670#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:00,941 INFO L290 TraceCheckUtils]: 10: Hoare triple {12670#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12646#true} is VALID [2022-02-21 03:10:00,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {12646#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {12671#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:00,942 INFO L290 TraceCheckUtils]: 12: Hoare triple {12671#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {12672#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:00,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {12672#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {12672#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:00,943 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {12672#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {12646#true} #450#return; {12658#(= |ULTIMATE.start_main_#t~ret23#1| 0)} is VALID [2022-02-21 03:10:00,943 INFO L290 TraceCheckUtils]: 15: Hoare triple {12658#(= |ULTIMATE.start_main_#t~ret23#1| 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {12659#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:00,944 INFO L272 TraceCheckUtils]: 16: Hoare triple {12659#(= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {12670#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:00,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {12670#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12646#true} is VALID [2022-02-21 03:10:00,944 INFO L290 TraceCheckUtils]: 18: Hoare triple {12646#true} assume !(0 == ~m % 4294967296); {12646#true} is VALID [2022-02-21 03:10:00,944 INFO L290 TraceCheckUtils]: 19: Hoare triple {12646#true} assume !(~m % 4294967296 < 16777216); {12646#true} is VALID [2022-02-21 03:10:00,944 INFO L290 TraceCheckUtils]: 20: Hoare triple {12646#true} assume !false; {12646#true} is VALID [2022-02-21 03:10:00,944 INFO L290 TraceCheckUtils]: 21: Hoare triple {12646#true} assume ~m % 4294967296 >= 33554432; {12646#true} is VALID [2022-02-21 03:10:00,944 INFO L290 TraceCheckUtils]: 22: Hoare triple {12646#true} assume ~e >= 127;~__retres4~0 := 4294967295; {12646#true} is VALID [2022-02-21 03:10:00,944 INFO L290 TraceCheckUtils]: 23: Hoare triple {12646#true} #res := ~__retres4~0; {12646#true} is VALID [2022-02-21 03:10:00,945 INFO L290 TraceCheckUtils]: 24: Hoare triple {12646#true} assume true; {12646#true} is VALID [2022-02-21 03:10:00,945 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {12646#true} {12659#(= |ULTIMATE.start_main_~a~0#1| 0)} #452#return; {12659#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:00,945 INFO L290 TraceCheckUtils]: 26: Hoare triple {12659#(= |ULTIMATE.start_main_~a~0#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {12659#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:00,946 INFO L290 TraceCheckUtils]: 27: Hoare triple {12659#(= |ULTIMATE.start_main_~a~0#1| 0)} assume main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sa~0#1 := -1; {12659#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:00,946 INFO L290 TraceCheckUtils]: 28: Hoare triple {12659#(= |ULTIMATE.start_main_~a~0#1| 0)} assume main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sb~0#1 := -1; {12659#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:00,946 INFO L290 TraceCheckUtils]: 29: Hoare triple {12659#(= |ULTIMATE.start_main_~a~0#1| 0)} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {12669#(= |ULTIMATE.start_addflt_~a#1| 0)} is VALID [2022-02-21 03:10:00,947 INFO L290 TraceCheckUtils]: 30: Hoare triple {12669#(= |ULTIMATE.start_addflt_~a#1| 0)} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {12669#(= |ULTIMATE.start_addflt_~a#1| 0)} is VALID [2022-02-21 03:10:00,947 INFO L290 TraceCheckUtils]: 31: Hoare triple {12669#(= |ULTIMATE.start_addflt_~a#1| 0)} assume !(0 == addflt_~b#1 % 4294967296); {12669#(= |ULTIMATE.start_addflt_~a#1| 0)} is VALID [2022-02-21 03:10:00,947 INFO L290 TraceCheckUtils]: 32: Hoare triple {12669#(= |ULTIMATE.start_addflt_~a#1| 0)} assume !(0 == addflt_~a#1); {12647#false} is VALID [2022-02-21 03:10:00,947 INFO L290 TraceCheckUtils]: 33: Hoare triple {12647#false} assume !false; {12647#false} is VALID [2022-02-21 03:10:00,948 INFO L290 TraceCheckUtils]: 34: Hoare triple {12647#false} assume !false; {12647#false} is VALID [2022-02-21 03:10:00,948 INFO L290 TraceCheckUtils]: 35: Hoare triple {12647#false} assume addflt_~a#1 >= 0;abs_108 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_108; {12647#false} is VALID [2022-02-21 03:10:00,948 INFO L290 TraceCheckUtils]: 36: Hoare triple {12647#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {12647#false} is VALID [2022-02-21 03:10:00,948 INFO L290 TraceCheckUtils]: 37: Hoare triple {12647#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {12647#false} is VALID [2022-02-21 03:10:00,949 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:00,949 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:00,949 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291993612] [2022-02-21 03:10:00,949 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291993612] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:00,949 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200595118] [2022-02-21 03:10:00,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:00,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:00,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:00,964 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:00,965 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:01,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:01,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:10:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:01,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:01,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {12646#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); {12646#true} is VALID [2022-02-21 03:10:01,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {12646#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {12646#true} is VALID [2022-02-21 03:10:01,225 INFO L272 TraceCheckUtils]: 2: Hoare triple {12646#true} call main_#t~ret22#1 := base2flt(0, 0); {12646#true} is VALID [2022-02-21 03:10:01,225 INFO L290 TraceCheckUtils]: 3: Hoare triple {12646#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12646#true} is VALID [2022-02-21 03:10:01,225 INFO L290 TraceCheckUtils]: 4: Hoare triple {12646#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {12646#true} is VALID [2022-02-21 03:10:01,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {12646#true} #res := ~__retres4~0; {12646#true} is VALID [2022-02-21 03:10:01,225 INFO L290 TraceCheckUtils]: 6: Hoare triple {12646#true} assume true; {12646#true} is VALID [2022-02-21 03:10:01,225 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {12646#true} {12646#true} #448#return; {12646#true} is VALID [2022-02-21 03:10:01,225 INFO L290 TraceCheckUtils]: 8: Hoare triple {12646#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {12646#true} is VALID [2022-02-21 03:10:01,225 INFO L272 TraceCheckUtils]: 9: Hoare triple {12646#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {12646#true} is VALID [2022-02-21 03:10:01,226 INFO L290 TraceCheckUtils]: 10: Hoare triple {12646#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12646#true} is VALID [2022-02-21 03:10:01,226 INFO L290 TraceCheckUtils]: 11: Hoare triple {12646#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {12709#(<= base2flt_~__retres4~0 0)} is VALID [2022-02-21 03:10:01,226 INFO L290 TraceCheckUtils]: 12: Hoare triple {12709#(<= base2flt_~__retres4~0 0)} #res := ~__retres4~0; {12713#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:10:01,226 INFO L290 TraceCheckUtils]: 13: Hoare triple {12713#(<= |base2flt_#res| 0)} assume true; {12713#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:10:01,227 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {12713#(<= |base2flt_#res| 0)} {12646#true} #450#return; {12720#(<= |ULTIMATE.start_main_#t~ret23#1| 0)} is VALID [2022-02-21 03:10:01,227 INFO L290 TraceCheckUtils]: 15: Hoare triple {12720#(<= |ULTIMATE.start_main_#t~ret23#1| 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {12724#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:01,228 INFO L272 TraceCheckUtils]: 16: Hoare triple {12724#(<= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {12646#true} is VALID [2022-02-21 03:10:01,228 INFO L290 TraceCheckUtils]: 17: Hoare triple {12646#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12646#true} is VALID [2022-02-21 03:10:01,228 INFO L290 TraceCheckUtils]: 18: Hoare triple {12646#true} assume !(0 == ~m % 4294967296); {12646#true} is VALID [2022-02-21 03:10:01,228 INFO L290 TraceCheckUtils]: 19: Hoare triple {12646#true} assume !(~m % 4294967296 < 16777216); {12646#true} is VALID [2022-02-21 03:10:01,228 INFO L290 TraceCheckUtils]: 20: Hoare triple {12646#true} assume !false; {12646#true} is VALID [2022-02-21 03:10:01,228 INFO L290 TraceCheckUtils]: 21: Hoare triple {12646#true} assume ~m % 4294967296 >= 33554432; {12646#true} is VALID [2022-02-21 03:10:01,228 INFO L290 TraceCheckUtils]: 22: Hoare triple {12646#true} assume ~e >= 127;~__retres4~0 := 4294967295; {12646#true} is VALID [2022-02-21 03:10:01,228 INFO L290 TraceCheckUtils]: 23: Hoare triple {12646#true} #res := ~__retres4~0; {12646#true} is VALID [2022-02-21 03:10:01,229 INFO L290 TraceCheckUtils]: 24: Hoare triple {12646#true} assume true; {12646#true} is VALID [2022-02-21 03:10:01,229 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {12646#true} {12724#(<= |ULTIMATE.start_main_~a~0#1| 0)} #452#return; {12724#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:01,229 INFO L290 TraceCheckUtils]: 26: Hoare triple {12724#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {12724#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:01,230 INFO L290 TraceCheckUtils]: 27: Hoare triple {12724#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sa~0#1 := -1; {12724#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:01,230 INFO L290 TraceCheckUtils]: 28: Hoare triple {12724#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sb~0#1 := -1; {12724#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:01,230 INFO L290 TraceCheckUtils]: 29: Hoare triple {12724#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {12767#(<= |ULTIMATE.start_addflt_~a#1| 0)} is VALID [2022-02-21 03:10:01,231 INFO L290 TraceCheckUtils]: 30: Hoare triple {12767#(<= |ULTIMATE.start_addflt_~a#1| 0)} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {12767#(<= |ULTIMATE.start_addflt_~a#1| 0)} is VALID [2022-02-21 03:10:01,231 INFO L290 TraceCheckUtils]: 31: Hoare triple {12767#(<= |ULTIMATE.start_addflt_~a#1| 0)} assume !(0 == addflt_~b#1 % 4294967296); {12767#(<= |ULTIMATE.start_addflt_~a#1| 0)} is VALID [2022-02-21 03:10:01,231 INFO L290 TraceCheckUtils]: 32: Hoare triple {12767#(<= |ULTIMATE.start_addflt_~a#1| 0)} assume !(0 == addflt_~a#1); {12777#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} is VALID [2022-02-21 03:10:01,232 INFO L290 TraceCheckUtils]: 33: Hoare triple {12777#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} assume !false; {12777#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} is VALID [2022-02-21 03:10:01,232 INFO L290 TraceCheckUtils]: 34: Hoare triple {12777#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} assume !false; {12777#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} is VALID [2022-02-21 03:10:01,232 INFO L290 TraceCheckUtils]: 35: Hoare triple {12777#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} assume addflt_~a#1 >= 0;abs_108 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_108; {12647#false} is VALID [2022-02-21 03:10:01,232 INFO L290 TraceCheckUtils]: 36: Hoare triple {12647#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {12647#false} is VALID [2022-02-21 03:10:01,233 INFO L290 TraceCheckUtils]: 37: Hoare triple {12647#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {12647#false} is VALID [2022-02-21 03:10:01,233 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:01,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:10:01,416 INFO L290 TraceCheckUtils]: 37: Hoare triple {12647#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {12647#false} is VALID [2022-02-21 03:10:01,417 INFO L290 TraceCheckUtils]: 36: Hoare triple {12647#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {12647#false} is VALID [2022-02-21 03:10:01,417 INFO L290 TraceCheckUtils]: 35: Hoare triple {12777#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} assume addflt_~a#1 >= 0;abs_108 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_108; {12647#false} is VALID [2022-02-21 03:10:01,417 INFO L290 TraceCheckUtils]: 34: Hoare triple {12777#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} assume !false; {12777#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} is VALID [2022-02-21 03:10:01,418 INFO L290 TraceCheckUtils]: 33: Hoare triple {12777#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} assume !false; {12777#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} is VALID [2022-02-21 03:10:01,418 INFO L290 TraceCheckUtils]: 32: Hoare triple {12767#(<= |ULTIMATE.start_addflt_~a#1| 0)} assume !(0 == addflt_~a#1); {12777#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} is VALID [2022-02-21 03:10:01,418 INFO L290 TraceCheckUtils]: 31: Hoare triple {12767#(<= |ULTIMATE.start_addflt_~a#1| 0)} assume !(0 == addflt_~b#1 % 4294967296); {12767#(<= |ULTIMATE.start_addflt_~a#1| 0)} is VALID [2022-02-21 03:10:01,419 INFO L290 TraceCheckUtils]: 30: Hoare triple {12767#(<= |ULTIMATE.start_addflt_~a#1| 0)} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {12767#(<= |ULTIMATE.start_addflt_~a#1| 0)} is VALID [2022-02-21 03:10:01,419 INFO L290 TraceCheckUtils]: 29: Hoare triple {12724#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {12767#(<= |ULTIMATE.start_addflt_~a#1| 0)} is VALID [2022-02-21 03:10:01,419 INFO L290 TraceCheckUtils]: 28: Hoare triple {12724#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sb~0#1 := -1; {12724#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:01,420 INFO L290 TraceCheckUtils]: 27: Hoare triple {12724#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sa~0#1 := -1; {12724#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:01,420 INFO L290 TraceCheckUtils]: 26: Hoare triple {12724#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {12724#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:01,421 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {12646#true} {12724#(<= |ULTIMATE.start_main_~a~0#1| 0)} #452#return; {12724#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:01,421 INFO L290 TraceCheckUtils]: 24: Hoare triple {12646#true} assume true; {12646#true} is VALID [2022-02-21 03:10:01,421 INFO L290 TraceCheckUtils]: 23: Hoare triple {12646#true} #res := ~__retres4~0; {12646#true} is VALID [2022-02-21 03:10:01,421 INFO L290 TraceCheckUtils]: 22: Hoare triple {12646#true} assume ~e >= 127;~__retres4~0 := 4294967295; {12646#true} is VALID [2022-02-21 03:10:01,421 INFO L290 TraceCheckUtils]: 21: Hoare triple {12646#true} assume ~m % 4294967296 >= 33554432; {12646#true} is VALID [2022-02-21 03:10:01,421 INFO L290 TraceCheckUtils]: 20: Hoare triple {12646#true} assume !false; {12646#true} is VALID [2022-02-21 03:10:01,422 INFO L290 TraceCheckUtils]: 19: Hoare triple {12646#true} assume !(~m % 4294967296 < 16777216); {12646#true} is VALID [2022-02-21 03:10:01,422 INFO L290 TraceCheckUtils]: 18: Hoare triple {12646#true} assume !(0 == ~m % 4294967296); {12646#true} is VALID [2022-02-21 03:10:01,422 INFO L290 TraceCheckUtils]: 17: Hoare triple {12646#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12646#true} is VALID [2022-02-21 03:10:01,422 INFO L272 TraceCheckUtils]: 16: Hoare triple {12724#(<= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {12646#true} is VALID [2022-02-21 03:10:01,422 INFO L290 TraceCheckUtils]: 15: Hoare triple {12720#(<= |ULTIMATE.start_main_#t~ret23#1| 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {12724#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:01,423 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {12713#(<= |base2flt_#res| 0)} {12646#true} #450#return; {12720#(<= |ULTIMATE.start_main_#t~ret23#1| 0)} is VALID [2022-02-21 03:10:01,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {12713#(<= |base2flt_#res| 0)} assume true; {12713#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:10:01,423 INFO L290 TraceCheckUtils]: 12: Hoare triple {12709#(<= base2flt_~__retres4~0 0)} #res := ~__retres4~0; {12713#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:10:01,424 INFO L290 TraceCheckUtils]: 11: Hoare triple {12646#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {12709#(<= base2flt_~__retres4~0 0)} is VALID [2022-02-21 03:10:01,424 INFO L290 TraceCheckUtils]: 10: Hoare triple {12646#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12646#true} is VALID [2022-02-21 03:10:01,424 INFO L272 TraceCheckUtils]: 9: Hoare triple {12646#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {12646#true} is VALID [2022-02-21 03:10:01,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {12646#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {12646#true} is VALID [2022-02-21 03:10:01,424 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {12646#true} {12646#true} #448#return; {12646#true} is VALID [2022-02-21 03:10:01,424 INFO L290 TraceCheckUtils]: 6: Hoare triple {12646#true} assume true; {12646#true} is VALID [2022-02-21 03:10:01,424 INFO L290 TraceCheckUtils]: 5: Hoare triple {12646#true} #res := ~__retres4~0; {12646#true} is VALID [2022-02-21 03:10:01,425 INFO L290 TraceCheckUtils]: 4: Hoare triple {12646#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {12646#true} is VALID [2022-02-21 03:10:01,425 INFO L290 TraceCheckUtils]: 3: Hoare triple {12646#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12646#true} is VALID [2022-02-21 03:10:01,425 INFO L272 TraceCheckUtils]: 2: Hoare triple {12646#true} call main_#t~ret22#1 := base2flt(0, 0); {12646#true} is VALID [2022-02-21 03:10:01,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {12646#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {12646#true} is VALID [2022-02-21 03:10:01,425 INFO L290 TraceCheckUtils]: 0: Hoare triple {12646#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); {12646#true} is VALID [2022-02-21 03:10:01,425 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:01,426 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200595118] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:10:01,426 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:10:01,426 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2022-02-21 03:10:01,426 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204673411] [2022-02-21 03:10:01,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:10:01,427 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2022-02-21 03:10:01,427 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:01,427 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:10:01,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:01,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-21 03:10:01,457 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:01,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-21 03:10:01,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-02-21 03:10:01,458 INFO L87 Difference]: Start difference. First operand 180 states and 239 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:10:02,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:02,752 INFO L93 Difference]: Finished difference Result 450 states and 564 transitions. [2022-02-21 03:10:02,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-21 03:10:02,755 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2022-02-21 03:10:02,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:02,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:10:02,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 406 transitions. [2022-02-21 03:10:02,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:10:02,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 406 transitions. [2022-02-21 03:10:02,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 406 transitions. [2022-02-21 03:10:03,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 406 edges. 406 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:03,058 INFO L225 Difference]: With dead ends: 450 [2022-02-21 03:10:03,058 INFO L226 Difference]: Without dead ends: 386 [2022-02-21 03:10:03,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-02-21 03:10:03,059 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 321 mSDsluCounter, 1209 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:03,060 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [327 Valid, 1365 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 03:10:03,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2022-02-21 03:10:03,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 194. [2022-02-21 03:10:03,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:03,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 386 states. Second operand has 194 states, 172 states have (on average 1.4069767441860466) internal successors, (242), 181 states have internal predecessors, (242), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-21 03:10:03,113 INFO L74 IsIncluded]: Start isIncluded. First operand 386 states. Second operand has 194 states, 172 states have (on average 1.4069767441860466) internal successors, (242), 181 states have internal predecessors, (242), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-21 03:10:03,113 INFO L87 Difference]: Start difference. First operand 386 states. Second operand has 194 states, 172 states have (on average 1.4069767441860466) internal successors, (242), 181 states have internal predecessors, (242), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-21 03:10:03,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:03,123 INFO L93 Difference]: Finished difference Result 386 states and 487 transitions. [2022-02-21 03:10:03,123 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 487 transitions. [2022-02-21 03:10:03,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:03,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:03,124 INFO L74 IsIncluded]: Start isIncluded. First operand has 194 states, 172 states have (on average 1.4069767441860466) internal successors, (242), 181 states have internal predecessors, (242), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Second operand 386 states. [2022-02-21 03:10:03,125 INFO L87 Difference]: Start difference. First operand has 194 states, 172 states have (on average 1.4069767441860466) internal successors, (242), 181 states have internal predecessors, (242), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Second operand 386 states. [2022-02-21 03:10:03,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:03,133 INFO L93 Difference]: Finished difference Result 386 states and 487 transitions. [2022-02-21 03:10:03,133 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 487 transitions. [2022-02-21 03:10:03,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:03,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:03,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:03,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:03,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 172 states have (on average 1.4069767441860466) internal successors, (242), 181 states have internal predecessors, (242), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-21 03:10:03,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 257 transitions. [2022-02-21 03:10:03,137 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 257 transitions. Word has length 38 [2022-02-21 03:10:03,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:03,137 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 257 transitions. [2022-02-21 03:10:03,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:10:03,138 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 257 transitions. [2022-02-21 03:10:03,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-21 03:10:03,138 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:03,138 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, 1] [2022-02-21 03:10:03,171 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:03,355 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:03,356 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:03,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:03,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1326719856, now seen corresponding path program 1 times [2022-02-21 03:10:03,357 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:03,357 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498899763] [2022-02-21 03:10:03,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:03,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:03,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:03,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:03,419 INFO L290 TraceCheckUtils]: 0: Hoare triple {14426#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14401#true} is VALID [2022-02-21 03:10:03,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {14401#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {14401#true} is VALID [2022-02-21 03:10:03,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {14401#true} #res := ~__retres4~0; {14401#true} is VALID [2022-02-21 03:10:03,419 INFO L290 TraceCheckUtils]: 3: Hoare triple {14401#true} assume true; {14401#true} is VALID [2022-02-21 03:10:03,419 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {14401#true} {14401#true} #448#return; {14401#true} is VALID [2022-02-21 03:10:03,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:03,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:03,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {14426#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14401#true} is VALID [2022-02-21 03:10:03,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {14401#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {14427#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:03,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {14427#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {14428#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:03,447 INFO L290 TraceCheckUtils]: 3: Hoare triple {14428#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {14428#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:03,447 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {14428#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {14401#true} #450#return; {14413#(= |ULTIMATE.start_main_#t~ret23#1| 0)} is VALID [2022-02-21 03:10:03,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-21 03:10:03,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:03,454 INFO L290 TraceCheckUtils]: 0: Hoare triple {14426#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14401#true} is VALID [2022-02-21 03:10:03,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {14401#true} assume !(0 == ~m % 4294967296); {14401#true} is VALID [2022-02-21 03:10:03,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {14401#true} assume !(~m % 4294967296 < 16777216); {14401#true} is VALID [2022-02-21 03:10:03,454 INFO L290 TraceCheckUtils]: 3: Hoare triple {14401#true} assume !false; {14401#true} is VALID [2022-02-21 03:10:03,454 INFO L290 TraceCheckUtils]: 4: Hoare triple {14401#true} assume ~m % 4294967296 >= 33554432; {14401#true} is VALID [2022-02-21 03:10:03,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {14401#true} assume ~e >= 127;~__retres4~0 := 4294967295; {14401#true} is VALID [2022-02-21 03:10:03,455 INFO L290 TraceCheckUtils]: 6: Hoare triple {14401#true} #res := ~__retres4~0; {14401#true} is VALID [2022-02-21 03:10:03,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {14401#true} assume true; {14401#true} is VALID [2022-02-21 03:10:03,455 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {14401#true} {14414#(= |ULTIMATE.start_main_~a~0#1| 0)} #452#return; {14414#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:03,456 INFO L290 TraceCheckUtils]: 0: Hoare triple {14401#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); {14401#true} is VALID [2022-02-21 03:10:03,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {14401#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {14401#true} is VALID [2022-02-21 03:10:03,456 INFO L272 TraceCheckUtils]: 2: Hoare triple {14401#true} call main_#t~ret22#1 := base2flt(0, 0); {14426#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:03,456 INFO L290 TraceCheckUtils]: 3: Hoare triple {14426#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14401#true} is VALID [2022-02-21 03:10:03,457 INFO L290 TraceCheckUtils]: 4: Hoare triple {14401#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {14401#true} is VALID [2022-02-21 03:10:03,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {14401#true} #res := ~__retres4~0; {14401#true} is VALID [2022-02-21 03:10:03,457 INFO L290 TraceCheckUtils]: 6: Hoare triple {14401#true} assume true; {14401#true} is VALID [2022-02-21 03:10:03,457 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14401#true} {14401#true} #448#return; {14401#true} is VALID [2022-02-21 03:10:03,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {14401#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {14401#true} is VALID [2022-02-21 03:10:03,458 INFO L272 TraceCheckUtils]: 9: Hoare triple {14401#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {14426#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:03,458 INFO L290 TraceCheckUtils]: 10: Hoare triple {14426#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14401#true} is VALID [2022-02-21 03:10:03,458 INFO L290 TraceCheckUtils]: 11: Hoare triple {14401#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {14427#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:03,459 INFO L290 TraceCheckUtils]: 12: Hoare triple {14427#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {14428#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:03,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {14428#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {14428#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:03,460 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {14428#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {14401#true} #450#return; {14413#(= |ULTIMATE.start_main_#t~ret23#1| 0)} is VALID [2022-02-21 03:10:03,460 INFO L290 TraceCheckUtils]: 15: Hoare triple {14413#(= |ULTIMATE.start_main_#t~ret23#1| 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {14414#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:03,461 INFO L272 TraceCheckUtils]: 16: Hoare triple {14414#(= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {14426#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:03,461 INFO L290 TraceCheckUtils]: 17: Hoare triple {14426#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14401#true} is VALID [2022-02-21 03:10:03,461 INFO L290 TraceCheckUtils]: 18: Hoare triple {14401#true} assume !(0 == ~m % 4294967296); {14401#true} is VALID [2022-02-21 03:10:03,462 INFO L290 TraceCheckUtils]: 19: Hoare triple {14401#true} assume !(~m % 4294967296 < 16777216); {14401#true} is VALID [2022-02-21 03:10:03,462 INFO L290 TraceCheckUtils]: 20: Hoare triple {14401#true} assume !false; {14401#true} is VALID [2022-02-21 03:10:03,462 INFO L290 TraceCheckUtils]: 21: Hoare triple {14401#true} assume ~m % 4294967296 >= 33554432; {14401#true} is VALID [2022-02-21 03:10:03,462 INFO L290 TraceCheckUtils]: 22: Hoare triple {14401#true} assume ~e >= 127;~__retres4~0 := 4294967295; {14401#true} is VALID [2022-02-21 03:10:03,462 INFO L290 TraceCheckUtils]: 23: Hoare triple {14401#true} #res := ~__retres4~0; {14401#true} is VALID [2022-02-21 03:10:03,462 INFO L290 TraceCheckUtils]: 24: Hoare triple {14401#true} assume true; {14401#true} is VALID [2022-02-21 03:10:03,463 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {14401#true} {14414#(= |ULTIMATE.start_main_~a~0#1| 0)} #452#return; {14414#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:03,463 INFO L290 TraceCheckUtils]: 26: Hoare triple {14414#(= |ULTIMATE.start_main_~a~0#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {14414#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:03,464 INFO L290 TraceCheckUtils]: 27: Hoare triple {14414#(= |ULTIMATE.start_main_~a~0#1| 0)} assume main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sa~0#1 := -1; {14414#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:03,464 INFO L290 TraceCheckUtils]: 28: Hoare triple {14414#(= |ULTIMATE.start_main_~a~0#1| 0)} assume main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sb~0#1 := -1; {14414#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:03,464 INFO L290 TraceCheckUtils]: 29: Hoare triple {14414#(= |ULTIMATE.start_main_~a~0#1| 0)} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {14424#(= |ULTIMATE.start_addflt_~a#1| 0)} is VALID [2022-02-21 03:10:03,465 INFO L290 TraceCheckUtils]: 30: Hoare triple {14424#(= |ULTIMATE.start_addflt_~a#1| 0)} assume addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296;addflt_~tmp~0#1 := addflt_~a#1;addflt_~a#1 := addflt_~b#1;addflt_~b#1 := addflt_~tmp~0#1; {14425#(= |ULTIMATE.start_addflt_~b#1| 0)} is VALID [2022-02-21 03:10:03,465 INFO L290 TraceCheckUtils]: 31: Hoare triple {14425#(= |ULTIMATE.start_addflt_~b#1| 0)} assume !(0 == addflt_~b#1 % 4294967296); {14402#false} is VALID [2022-02-21 03:10:03,466 INFO L290 TraceCheckUtils]: 32: Hoare triple {14402#false} assume !(0 == addflt_~a#1); {14402#false} is VALID [2022-02-21 03:10:03,466 INFO L290 TraceCheckUtils]: 33: Hoare triple {14402#false} assume !false; {14402#false} is VALID [2022-02-21 03:10:03,466 INFO L290 TraceCheckUtils]: 34: Hoare triple {14402#false} assume !false; {14402#false} is VALID [2022-02-21 03:10:03,466 INFO L290 TraceCheckUtils]: 35: Hoare triple {14402#false} assume addflt_~a#1 >= 0;abs_108 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_108; {14402#false} is VALID [2022-02-21 03:10:03,466 INFO L290 TraceCheckUtils]: 36: Hoare triple {14402#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {14402#false} is VALID [2022-02-21 03:10:03,466 INFO L290 TraceCheckUtils]: 37: Hoare triple {14402#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {14402#false} is VALID [2022-02-21 03:10:03,467 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:03,467 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:03,467 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498899763] [2022-02-21 03:10:03,467 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498899763] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:03,467 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651473333] [2022-02-21 03:10:03,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:03,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:03,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:03,484 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:03,499 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:03,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:03,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-21 03:10:03,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:03,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:03,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {14401#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); {14401#true} is VALID [2022-02-21 03:10:03,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {14401#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {14401#true} is VALID [2022-02-21 03:10:03,663 INFO L272 TraceCheckUtils]: 2: Hoare triple {14401#true} call main_#t~ret22#1 := base2flt(0, 0); {14401#true} is VALID [2022-02-21 03:10:03,664 INFO L290 TraceCheckUtils]: 3: Hoare triple {14401#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14441#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:03,664 INFO L290 TraceCheckUtils]: 4: Hoare triple {14441#(= base2flt_~m |base2flt_#in~m|)} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {14445#(<= (mod |base2flt_#in~m| 4294967296) 0)} is VALID [2022-02-21 03:10:03,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {14445#(<= (mod |base2flt_#in~m| 4294967296) 0)} #res := ~__retres4~0; {14445#(<= (mod |base2flt_#in~m| 4294967296) 0)} is VALID [2022-02-21 03:10:03,665 INFO L290 TraceCheckUtils]: 6: Hoare triple {14445#(<= (mod |base2flt_#in~m| 4294967296) 0)} assume true; {14445#(<= (mod |base2flt_#in~m| 4294967296) 0)} is VALID [2022-02-21 03:10:03,665 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14445#(<= (mod |base2flt_#in~m| 4294967296) 0)} {14401#true} #448#return; {14401#true} is VALID [2022-02-21 03:10:03,665 INFO L290 TraceCheckUtils]: 8: Hoare triple {14401#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {14401#true} is VALID [2022-02-21 03:10:03,665 INFO L272 TraceCheckUtils]: 9: Hoare triple {14401#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {14401#true} is VALID [2022-02-21 03:10:03,665 INFO L290 TraceCheckUtils]: 10: Hoare triple {14401#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14401#true} is VALID [2022-02-21 03:10:03,665 INFO L290 TraceCheckUtils]: 11: Hoare triple {14401#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {14427#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:03,666 INFO L290 TraceCheckUtils]: 12: Hoare triple {14427#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {14428#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:03,666 INFO L290 TraceCheckUtils]: 13: Hoare triple {14428#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {14428#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:03,667 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {14428#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {14401#true} #450#return; {14413#(= |ULTIMATE.start_main_#t~ret23#1| 0)} is VALID [2022-02-21 03:10:03,667 INFO L290 TraceCheckUtils]: 15: Hoare triple {14413#(= |ULTIMATE.start_main_#t~ret23#1| 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {14414#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:03,668 INFO L272 TraceCheckUtils]: 16: Hoare triple {14414#(= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {14401#true} is VALID [2022-02-21 03:10:03,668 INFO L290 TraceCheckUtils]: 17: Hoare triple {14401#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14401#true} is VALID [2022-02-21 03:10:03,668 INFO L290 TraceCheckUtils]: 18: Hoare triple {14401#true} assume !(0 == ~m % 4294967296); {14401#true} is VALID [2022-02-21 03:10:03,668 INFO L290 TraceCheckUtils]: 19: Hoare triple {14401#true} assume !(~m % 4294967296 < 16777216); {14401#true} is VALID [2022-02-21 03:10:03,668 INFO L290 TraceCheckUtils]: 20: Hoare triple {14401#true} assume !false; {14401#true} is VALID [2022-02-21 03:10:03,668 INFO L290 TraceCheckUtils]: 21: Hoare triple {14401#true} assume ~m % 4294967296 >= 33554432; {14401#true} is VALID [2022-02-21 03:10:03,668 INFO L290 TraceCheckUtils]: 22: Hoare triple {14401#true} assume ~e >= 127;~__retres4~0 := 4294967295; {14401#true} is VALID [2022-02-21 03:10:03,669 INFO L290 TraceCheckUtils]: 23: Hoare triple {14401#true} #res := ~__retres4~0; {14401#true} is VALID [2022-02-21 03:10:03,669 INFO L290 TraceCheckUtils]: 24: Hoare triple {14401#true} assume true; {14401#true} is VALID [2022-02-21 03:10:03,669 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {14401#true} {14414#(= |ULTIMATE.start_main_~a~0#1| 0)} #452#return; {14414#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:03,670 INFO L290 TraceCheckUtils]: 26: Hoare triple {14414#(= |ULTIMATE.start_main_~a~0#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {14414#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:03,670 INFO L290 TraceCheckUtils]: 27: Hoare triple {14414#(= |ULTIMATE.start_main_~a~0#1| 0)} assume main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sa~0#1 := -1; {14414#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:03,670 INFO L290 TraceCheckUtils]: 28: Hoare triple {14414#(= |ULTIMATE.start_main_~a~0#1| 0)} assume main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sb~0#1 := -1; {14414#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:03,671 INFO L290 TraceCheckUtils]: 29: Hoare triple {14414#(= |ULTIMATE.start_main_~a~0#1| 0)} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {14424#(= |ULTIMATE.start_addflt_~a#1| 0)} is VALID [2022-02-21 03:10:03,671 INFO L290 TraceCheckUtils]: 30: Hoare triple {14424#(= |ULTIMATE.start_addflt_~a#1| 0)} assume addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296;addflt_~tmp~0#1 := addflt_~a#1;addflt_~a#1 := addflt_~b#1;addflt_~b#1 := addflt_~tmp~0#1; {14425#(= |ULTIMATE.start_addflt_~b#1| 0)} is VALID [2022-02-21 03:10:03,672 INFO L290 TraceCheckUtils]: 31: Hoare triple {14425#(= |ULTIMATE.start_addflt_~b#1| 0)} assume !(0 == addflt_~b#1 % 4294967296); {14402#false} is VALID [2022-02-21 03:10:03,672 INFO L290 TraceCheckUtils]: 32: Hoare triple {14402#false} assume !(0 == addflt_~a#1); {14402#false} is VALID [2022-02-21 03:10:03,672 INFO L290 TraceCheckUtils]: 33: Hoare triple {14402#false} assume !false; {14402#false} is VALID [2022-02-21 03:10:03,672 INFO L290 TraceCheckUtils]: 34: Hoare triple {14402#false} assume !false; {14402#false} is VALID [2022-02-21 03:10:03,672 INFO L290 TraceCheckUtils]: 35: Hoare triple {14402#false} assume addflt_~a#1 >= 0;abs_108 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_108; {14402#false} is VALID [2022-02-21 03:10:03,672 INFO L290 TraceCheckUtils]: 36: Hoare triple {14402#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {14402#false} is VALID [2022-02-21 03:10:03,672 INFO L290 TraceCheckUtils]: 37: Hoare triple {14402#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {14402#false} is VALID [2022-02-21 03:10:03,673 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:03,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:10:03,836 INFO L290 TraceCheckUtils]: 37: Hoare triple {14402#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {14402#false} is VALID [2022-02-21 03:10:03,836 INFO L290 TraceCheckUtils]: 36: Hoare triple {14402#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {14402#false} is VALID [2022-02-21 03:10:03,836 INFO L290 TraceCheckUtils]: 35: Hoare triple {14402#false} assume addflt_~a#1 >= 0;abs_108 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_108; {14402#false} is VALID [2022-02-21 03:10:03,836 INFO L290 TraceCheckUtils]: 34: Hoare triple {14402#false} assume !false; {14402#false} is VALID [2022-02-21 03:10:03,836 INFO L290 TraceCheckUtils]: 33: Hoare triple {14402#false} assume !false; {14402#false} is VALID [2022-02-21 03:10:03,836 INFO L290 TraceCheckUtils]: 32: Hoare triple {14402#false} assume !(0 == addflt_~a#1); {14402#false} is VALID [2022-02-21 03:10:03,837 INFO L290 TraceCheckUtils]: 31: Hoare triple {14563#(= (mod |ULTIMATE.start_addflt_~b#1| 4294967296) 0)} assume !(0 == addflt_~b#1 % 4294967296); {14402#false} is VALID [2022-02-21 03:10:03,837 INFO L290 TraceCheckUtils]: 30: Hoare triple {14567#(= (mod |ULTIMATE.start_addflt_~a#1| 4294967296) 0)} assume addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296;addflt_~tmp~0#1 := addflt_~a#1;addflt_~a#1 := addflt_~b#1;addflt_~b#1 := addflt_~tmp~0#1; {14563#(= (mod |ULTIMATE.start_addflt_~b#1| 4294967296) 0)} is VALID [2022-02-21 03:10:03,838 INFO L290 TraceCheckUtils]: 29: Hoare triple {14571#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {14567#(= (mod |ULTIMATE.start_addflt_~a#1| 4294967296) 0)} is VALID [2022-02-21 03:10:03,838 INFO L290 TraceCheckUtils]: 28: Hoare triple {14571#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} assume main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sb~0#1 := -1; {14571#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:03,838 INFO L290 TraceCheckUtils]: 27: Hoare triple {14571#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} assume main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sa~0#1 := -1; {14571#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:03,839 INFO L290 TraceCheckUtils]: 26: Hoare triple {14571#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {14571#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:03,839 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {14401#true} {14571#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} #452#return; {14571#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:03,839 INFO L290 TraceCheckUtils]: 24: Hoare triple {14401#true} assume true; {14401#true} is VALID [2022-02-21 03:10:03,839 INFO L290 TraceCheckUtils]: 23: Hoare triple {14401#true} #res := ~__retres4~0; {14401#true} is VALID [2022-02-21 03:10:03,840 INFO L290 TraceCheckUtils]: 22: Hoare triple {14401#true} assume ~e >= 127;~__retres4~0 := 4294967295; {14401#true} is VALID [2022-02-21 03:10:03,840 INFO L290 TraceCheckUtils]: 21: Hoare triple {14401#true} assume ~m % 4294967296 >= 33554432; {14401#true} is VALID [2022-02-21 03:10:03,840 INFO L290 TraceCheckUtils]: 20: Hoare triple {14401#true} assume !false; {14401#true} is VALID [2022-02-21 03:10:03,840 INFO L290 TraceCheckUtils]: 19: Hoare triple {14401#true} assume !(~m % 4294967296 < 16777216); {14401#true} is VALID [2022-02-21 03:10:03,840 INFO L290 TraceCheckUtils]: 18: Hoare triple {14401#true} assume !(0 == ~m % 4294967296); {14401#true} is VALID [2022-02-21 03:10:03,840 INFO L290 TraceCheckUtils]: 17: Hoare triple {14401#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14401#true} is VALID [2022-02-21 03:10:03,840 INFO L272 TraceCheckUtils]: 16: Hoare triple {14571#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {14401#true} is VALID [2022-02-21 03:10:03,841 INFO L290 TraceCheckUtils]: 15: Hoare triple {14614#(= (mod |ULTIMATE.start_main_#t~ret23#1| 4294967296) 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {14571#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:03,841 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {14621#(= (mod |base2flt_#res| 4294967296) 0)} {14401#true} #450#return; {14614#(= (mod |ULTIMATE.start_main_#t~ret23#1| 4294967296) 0)} is VALID [2022-02-21 03:10:03,842 INFO L290 TraceCheckUtils]: 13: Hoare triple {14621#(= (mod |base2flt_#res| 4294967296) 0)} assume true; {14621#(= (mod |base2flt_#res| 4294967296) 0)} is VALID [2022-02-21 03:10:03,842 INFO L290 TraceCheckUtils]: 12: Hoare triple {14628#(= (mod base2flt_~__retres4~0 4294967296) 0)} #res := ~__retres4~0; {14621#(= (mod |base2flt_#res| 4294967296) 0)} is VALID [2022-02-21 03:10:03,842 INFO L290 TraceCheckUtils]: 11: Hoare triple {14401#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {14628#(= (mod base2flt_~__retres4~0 4294967296) 0)} is VALID [2022-02-21 03:10:03,842 INFO L290 TraceCheckUtils]: 10: Hoare triple {14401#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14401#true} is VALID [2022-02-21 03:10:03,842 INFO L272 TraceCheckUtils]: 9: Hoare triple {14401#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {14401#true} is VALID [2022-02-21 03:10:03,843 INFO L290 TraceCheckUtils]: 8: Hoare triple {14401#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {14401#true} is VALID [2022-02-21 03:10:03,843 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14401#true} {14401#true} #448#return; {14401#true} is VALID [2022-02-21 03:10:03,843 INFO L290 TraceCheckUtils]: 6: Hoare triple {14401#true} assume true; {14401#true} is VALID [2022-02-21 03:10:03,843 INFO L290 TraceCheckUtils]: 5: Hoare triple {14401#true} #res := ~__retres4~0; {14401#true} is VALID [2022-02-21 03:10:03,843 INFO L290 TraceCheckUtils]: 4: Hoare triple {14401#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {14401#true} is VALID [2022-02-21 03:10:03,843 INFO L290 TraceCheckUtils]: 3: Hoare triple {14401#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14401#true} is VALID [2022-02-21 03:10:03,843 INFO L272 TraceCheckUtils]: 2: Hoare triple {14401#true} call main_#t~ret22#1 := base2flt(0, 0); {14401#true} is VALID [2022-02-21 03:10:03,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {14401#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {14401#true} is VALID [2022-02-21 03:10:03,844 INFO L290 TraceCheckUtils]: 0: Hoare triple {14401#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); {14401#true} is VALID [2022-02-21 03:10:03,844 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:03,844 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651473333] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:10:03,844 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:10:03,844 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 17 [2022-02-21 03:10:03,845 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409152250] [2022-02-21 03:10:03,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:10:03,848 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 38 [2022-02-21 03:10:03,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:03,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:03,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:03,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-21 03:10:03,879 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:03,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-21 03:10:03,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2022-02-21 03:10:03,880 INFO L87 Difference]: Start difference. First operand 194 states and 257 transitions. Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:05,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:05,843 INFO L93 Difference]: Finished difference Result 490 states and 643 transitions. [2022-02-21 03:10:05,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-21 03:10:05,844 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 38 [2022-02-21 03:10:05,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:05,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:05,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 405 transitions. [2022-02-21 03:10:05,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:05,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 405 transitions. [2022-02-21 03:10:05,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 405 transitions. [2022-02-21 03:10:06,146 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:06,151 INFO L225 Difference]: With dead ends: 490 [2022-02-21 03:10:06,151 INFO L226 Difference]: Without dead ends: 280 [2022-02-21 03:10:06,152 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=679, Unknown=0, NotChecked=0, Total=812 [2022-02-21 03:10:06,152 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 206 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:06,153 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 1221 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-21 03:10:06,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-02-21 03:10:06,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 135. [2022-02-21 03:10:06,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:06,206 INFO L82 GeneralOperation]: Start isEquivalent. First operand 280 states. Second operand has 135 states, 115 states have (on average 1.391304347826087) internal successors, (160), 124 states have internal predecessors, (160), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:06,206 INFO L74 IsIncluded]: Start isIncluded. First operand 280 states. Second operand has 135 states, 115 states have (on average 1.391304347826087) internal successors, (160), 124 states have internal predecessors, (160), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:06,206 INFO L87 Difference]: Start difference. First operand 280 states. Second operand has 135 states, 115 states have (on average 1.391304347826087) internal successors, (160), 124 states have internal predecessors, (160), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:06,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:06,211 INFO L93 Difference]: Finished difference Result 280 states and 358 transitions. [2022-02-21 03:10:06,211 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 358 transitions. [2022-02-21 03:10:06,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:06,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:06,212 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 115 states have (on average 1.391304347826087) internal successors, (160), 124 states have internal predecessors, (160), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 280 states. [2022-02-21 03:10:06,212 INFO L87 Difference]: Start difference. First operand has 135 states, 115 states have (on average 1.391304347826087) internal successors, (160), 124 states have internal predecessors, (160), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 280 states. [2022-02-21 03:10:06,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:06,217 INFO L93 Difference]: Finished difference Result 280 states and 358 transitions. [2022-02-21 03:10:06,217 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 358 transitions. [2022-02-21 03:10:06,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:06,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:06,218 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:06,218 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:06,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 115 states have (on average 1.391304347826087) internal successors, (160), 124 states have internal predecessors, (160), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:06,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 172 transitions. [2022-02-21 03:10:06,220 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 172 transitions. Word has length 38 [2022-02-21 03:10:06,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:06,220 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 172 transitions. [2022-02-21 03:10:06,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:06,221 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 172 transitions. [2022-02-21 03:10:06,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-21 03:10:06,222 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:06,222 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, 1] [2022-02-21 03:10:06,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:10:06,436 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,SelfDestructingSolverStorable14 [2022-02-21 03:10:06,436 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:06,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:06,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1749175167, now seen corresponding path program 2 times [2022-02-21 03:10:06,437 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:06,437 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369550285] [2022-02-21 03:10:06,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:06,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:06,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:06,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {15987#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {15960#true} is VALID [2022-02-21 03:10:06,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {15960#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {15988#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:06,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {15988#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {15989#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:06,534 INFO L290 TraceCheckUtils]: 3: Hoare triple {15989#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {15989#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:06,534 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {15989#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {15960#true} #448#return; {15967#(= |ULTIMATE.start_main_#t~ret22#1| 0)} is VALID [2022-02-21 03:10:06,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:06,544 INFO L290 TraceCheckUtils]: 0: Hoare triple {15987#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {15960#true} is VALID [2022-02-21 03:10:06,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {15960#true} assume !(0 == ~m % 4294967296); {15960#true} is VALID [2022-02-21 03:10:06,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {15960#true} assume !(~m % 4294967296 < 16777216); {15960#true} is VALID [2022-02-21 03:10:06,545 INFO L290 TraceCheckUtils]: 3: Hoare triple {15960#true} assume !false; {15960#true} is VALID [2022-02-21 03:10:06,545 INFO L290 TraceCheckUtils]: 4: Hoare triple {15960#true} assume ~m % 4294967296 >= 33554432; {15960#true} is VALID [2022-02-21 03:10:06,545 INFO L290 TraceCheckUtils]: 5: Hoare triple {15960#true} assume ~e >= 127;~__retres4~0 := 4294967295; {15960#true} is VALID [2022-02-21 03:10:06,545 INFO L290 TraceCheckUtils]: 6: Hoare triple {15960#true} #res := ~__retres4~0; {15960#true} is VALID [2022-02-21 03:10:06,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {15960#true} assume true; {15960#true} is VALID [2022-02-21 03:10:06,546 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {15960#true} {15968#(= |ULTIMATE.start_main_~zero~0#1| 0)} #450#return; {15968#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:06,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-21 03:10:06,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:06,551 INFO L290 TraceCheckUtils]: 0: Hoare triple {15987#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {15960#true} is VALID [2022-02-21 03:10:06,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {15960#true} assume !(0 == ~m % 4294967296); {15960#true} is VALID [2022-02-21 03:10:06,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {15960#true} assume !(~m % 4294967296 < 16777216); {15960#true} is VALID [2022-02-21 03:10:06,552 INFO L290 TraceCheckUtils]: 3: Hoare triple {15960#true} assume !false; {15960#true} is VALID [2022-02-21 03:10:06,552 INFO L290 TraceCheckUtils]: 4: Hoare triple {15960#true} assume ~m % 4294967296 >= 33554432; {15960#true} is VALID [2022-02-21 03:10:06,552 INFO L290 TraceCheckUtils]: 5: Hoare triple {15960#true} assume ~e >= 127;~__retres4~0 := 4294967295; {15960#true} is VALID [2022-02-21 03:10:06,552 INFO L290 TraceCheckUtils]: 6: Hoare triple {15960#true} #res := ~__retres4~0; {15960#true} is VALID [2022-02-21 03:10:06,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {15960#true} assume true; {15960#true} is VALID [2022-02-21 03:10:06,553 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {15960#true} {15968#(= |ULTIMATE.start_main_~zero~0#1| 0)} #452#return; {15968#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:06,554 INFO L290 TraceCheckUtils]: 0: Hoare triple {15960#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); {15960#true} is VALID [2022-02-21 03:10:06,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {15960#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {15960#true} is VALID [2022-02-21 03:10:06,554 INFO L272 TraceCheckUtils]: 2: Hoare triple {15960#true} call main_#t~ret22#1 := base2flt(0, 0); {15987#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:06,554 INFO L290 TraceCheckUtils]: 3: Hoare triple {15987#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {15960#true} is VALID [2022-02-21 03:10:06,555 INFO L290 TraceCheckUtils]: 4: Hoare triple {15960#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {15988#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:06,555 INFO L290 TraceCheckUtils]: 5: Hoare triple {15988#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {15989#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:06,555 INFO L290 TraceCheckUtils]: 6: Hoare triple {15989#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {15989#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:06,556 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {15989#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {15960#true} #448#return; {15967#(= |ULTIMATE.start_main_#t~ret22#1| 0)} is VALID [2022-02-21 03:10:06,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {15967#(= |ULTIMATE.start_main_#t~ret22#1| 0)} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {15968#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:06,557 INFO L272 TraceCheckUtils]: 9: Hoare triple {15968#(= |ULTIMATE.start_main_~zero~0#1| 0)} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {15987#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:06,557 INFO L290 TraceCheckUtils]: 10: Hoare triple {15987#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {15960#true} is VALID [2022-02-21 03:10:06,557 INFO L290 TraceCheckUtils]: 11: Hoare triple {15960#true} assume !(0 == ~m % 4294967296); {15960#true} is VALID [2022-02-21 03:10:06,557 INFO L290 TraceCheckUtils]: 12: Hoare triple {15960#true} assume !(~m % 4294967296 < 16777216); {15960#true} is VALID [2022-02-21 03:10:06,558 INFO L290 TraceCheckUtils]: 13: Hoare triple {15960#true} assume !false; {15960#true} is VALID [2022-02-21 03:10:06,558 INFO L290 TraceCheckUtils]: 14: Hoare triple {15960#true} assume ~m % 4294967296 >= 33554432; {15960#true} is VALID [2022-02-21 03:10:06,558 INFO L290 TraceCheckUtils]: 15: Hoare triple {15960#true} assume ~e >= 127;~__retres4~0 := 4294967295; {15960#true} is VALID [2022-02-21 03:10:06,558 INFO L290 TraceCheckUtils]: 16: Hoare triple {15960#true} #res := ~__retres4~0; {15960#true} is VALID [2022-02-21 03:10:06,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {15960#true} assume true; {15960#true} is VALID [2022-02-21 03:10:06,559 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {15960#true} {15968#(= |ULTIMATE.start_main_~zero~0#1| 0)} #450#return; {15968#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:06,559 INFO L290 TraceCheckUtils]: 19: Hoare triple {15968#(= |ULTIMATE.start_main_~zero~0#1| 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {15968#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:06,560 INFO L272 TraceCheckUtils]: 20: Hoare triple {15968#(= |ULTIMATE.start_main_~zero~0#1| 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {15987#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:06,560 INFO L290 TraceCheckUtils]: 21: Hoare triple {15987#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {15960#true} is VALID [2022-02-21 03:10:06,560 INFO L290 TraceCheckUtils]: 22: Hoare triple {15960#true} assume !(0 == ~m % 4294967296); {15960#true} is VALID [2022-02-21 03:10:06,560 INFO L290 TraceCheckUtils]: 23: Hoare triple {15960#true} assume !(~m % 4294967296 < 16777216); {15960#true} is VALID [2022-02-21 03:10:06,560 INFO L290 TraceCheckUtils]: 24: Hoare triple {15960#true} assume !false; {15960#true} is VALID [2022-02-21 03:10:06,560 INFO L290 TraceCheckUtils]: 25: Hoare triple {15960#true} assume ~m % 4294967296 >= 33554432; {15960#true} is VALID [2022-02-21 03:10:06,560 INFO L290 TraceCheckUtils]: 26: Hoare triple {15960#true} assume ~e >= 127;~__retres4~0 := 4294967295; {15960#true} is VALID [2022-02-21 03:10:06,561 INFO L290 TraceCheckUtils]: 27: Hoare triple {15960#true} #res := ~__retres4~0; {15960#true} is VALID [2022-02-21 03:10:06,561 INFO L290 TraceCheckUtils]: 28: Hoare triple {15960#true} assume true; {15960#true} is VALID [2022-02-21 03:10:06,561 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {15960#true} {15968#(= |ULTIMATE.start_main_~zero~0#1| 0)} #452#return; {15968#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:06,562 INFO L290 TraceCheckUtils]: 30: Hoare triple {15968#(= |ULTIMATE.start_main_~zero~0#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {15968#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:06,562 INFO L290 TraceCheckUtils]: 31: Hoare triple {15968#(= |ULTIMATE.start_main_~zero~0#1| 0)} assume main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sa~0#1 := -1; {15961#false} is VALID [2022-02-21 03:10:06,562 INFO L290 TraceCheckUtils]: 32: Hoare triple {15961#false} assume main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sb~0#1 := -1; {15961#false} is VALID [2022-02-21 03:10:06,562 INFO L290 TraceCheckUtils]: 33: Hoare triple {15961#false} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {15961#false} is VALID [2022-02-21 03:10:06,562 INFO L290 TraceCheckUtils]: 34: Hoare triple {15961#false} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {15961#false} is VALID [2022-02-21 03:10:06,563 INFO L290 TraceCheckUtils]: 35: Hoare triple {15961#false} assume !(0 == addflt_~b#1 % 4294967296); {15961#false} is VALID [2022-02-21 03:10:06,563 INFO L290 TraceCheckUtils]: 36: Hoare triple {15961#false} assume !(0 == addflt_~a#1); {15961#false} is VALID [2022-02-21 03:10:06,563 INFO L290 TraceCheckUtils]: 37: Hoare triple {15961#false} assume !false; {15961#false} is VALID [2022-02-21 03:10:06,563 INFO L290 TraceCheckUtils]: 38: Hoare triple {15961#false} assume !false; {15961#false} is VALID [2022-02-21 03:10:06,563 INFO L290 TraceCheckUtils]: 39: Hoare triple {15961#false} assume addflt_~a#1 >= 0;abs_108 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_108; {15961#false} is VALID [2022-02-21 03:10:06,563 INFO L290 TraceCheckUtils]: 40: Hoare triple {15961#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {15961#false} is VALID [2022-02-21 03:10:06,563 INFO L290 TraceCheckUtils]: 41: Hoare triple {15961#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {15961#false} is VALID [2022-02-21 03:10:06,564 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-21 03:10:06,564 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:06,564 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369550285] [2022-02-21 03:10:06,564 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369550285] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:06,564 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149687904] [2022-02-21 03:10:06,564 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:10:06,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:06,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:06,566 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:06,598 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:06,622 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-21 03:10:06,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:10:06,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-21 03:10:06,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:06,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:06,753 INFO L290 TraceCheckUtils]: 0: Hoare triple {15960#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); {15960#true} is VALID [2022-02-21 03:10:06,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {15960#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {15960#true} is VALID [2022-02-21 03:10:06,754 INFO L272 TraceCheckUtils]: 2: Hoare triple {15960#true} call main_#t~ret22#1 := base2flt(0, 0); {15960#true} is VALID [2022-02-21 03:10:06,754 INFO L290 TraceCheckUtils]: 3: Hoare triple {15960#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {15960#true} is VALID [2022-02-21 03:10:06,754 INFO L290 TraceCheckUtils]: 4: Hoare triple {15960#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {15960#true} is VALID [2022-02-21 03:10:06,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {15960#true} #res := ~__retres4~0; {15960#true} is VALID [2022-02-21 03:10:06,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {15960#true} assume true; {15960#true} is VALID [2022-02-21 03:10:06,755 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {15960#true} {15960#true} #448#return; {15960#true} is VALID [2022-02-21 03:10:06,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {15960#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {15960#true} is VALID [2022-02-21 03:10:06,755 INFO L272 TraceCheckUtils]: 9: Hoare triple {15960#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {15960#true} is VALID [2022-02-21 03:10:06,755 INFO L290 TraceCheckUtils]: 10: Hoare triple {15960#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {15960#true} is VALID [2022-02-21 03:10:06,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {15960#true} assume !(0 == ~m % 4294967296); {15960#true} is VALID [2022-02-21 03:10:06,755 INFO L290 TraceCheckUtils]: 12: Hoare triple {15960#true} assume !(~m % 4294967296 < 16777216); {15960#true} is VALID [2022-02-21 03:10:06,755 INFO L290 TraceCheckUtils]: 13: Hoare triple {15960#true} assume !false; {15960#true} is VALID [2022-02-21 03:10:06,755 INFO L290 TraceCheckUtils]: 14: Hoare triple {15960#true} assume ~m % 4294967296 >= 33554432; {15960#true} is VALID [2022-02-21 03:10:06,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {15960#true} assume ~e >= 127;~__retres4~0 := 4294967295; {15960#true} is VALID [2022-02-21 03:10:06,756 INFO L290 TraceCheckUtils]: 16: Hoare triple {15960#true} #res := ~__retres4~0; {15960#true} is VALID [2022-02-21 03:10:06,756 INFO L290 TraceCheckUtils]: 17: Hoare triple {15960#true} assume true; {15960#true} is VALID [2022-02-21 03:10:06,756 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {15960#true} {15960#true} #450#return; {15960#true} is VALID [2022-02-21 03:10:06,756 INFO L290 TraceCheckUtils]: 19: Hoare triple {15960#true} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {15960#true} is VALID [2022-02-21 03:10:06,756 INFO L272 TraceCheckUtils]: 20: Hoare triple {15960#true} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {15960#true} is VALID [2022-02-21 03:10:06,756 INFO L290 TraceCheckUtils]: 21: Hoare triple {15960#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {15960#true} is VALID [2022-02-21 03:10:06,757 INFO L290 TraceCheckUtils]: 22: Hoare triple {15960#true} assume !(0 == ~m % 4294967296); {15960#true} is VALID [2022-02-21 03:10:06,757 INFO L290 TraceCheckUtils]: 23: Hoare triple {15960#true} assume !(~m % 4294967296 < 16777216); {15960#true} is VALID [2022-02-21 03:10:06,757 INFO L290 TraceCheckUtils]: 24: Hoare triple {15960#true} assume !false; {15960#true} is VALID [2022-02-21 03:10:06,757 INFO L290 TraceCheckUtils]: 25: Hoare triple {15960#true} assume ~m % 4294967296 >= 33554432; {15960#true} is VALID [2022-02-21 03:10:06,757 INFO L290 TraceCheckUtils]: 26: Hoare triple {15960#true} assume ~e >= 127;~__retres4~0 := 4294967295; {16071#(= 4294967295 base2flt_~__retres4~0)} is VALID [2022-02-21 03:10:06,758 INFO L290 TraceCheckUtils]: 27: Hoare triple {16071#(= 4294967295 base2flt_~__retres4~0)} #res := ~__retres4~0; {16075#(= |base2flt_#res| 4294967295)} is VALID [2022-02-21 03:10:06,758 INFO L290 TraceCheckUtils]: 28: Hoare triple {16075#(= |base2flt_#res| 4294967295)} assume true; {16075#(= |base2flt_#res| 4294967295)} is VALID [2022-02-21 03:10:06,759 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {16075#(= |base2flt_#res| 4294967295)} {15960#true} #452#return; {16082#(= 4294967295 |ULTIMATE.start_main_#t~ret24#1|)} is VALID [2022-02-21 03:10:06,759 INFO L290 TraceCheckUtils]: 30: Hoare triple {16082#(= 4294967295 |ULTIMATE.start_main_#t~ret24#1|)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {16086#(= 4294967295 |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-21 03:10:06,760 INFO L290 TraceCheckUtils]: 31: Hoare triple {16086#(= 4294967295 |ULTIMATE.start_main_~b~0#1|)} assume main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sa~0#1 := -1; {16086#(= 4294967295 |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-21 03:10:06,760 INFO L290 TraceCheckUtils]: 32: Hoare triple {16086#(= 4294967295 |ULTIMATE.start_main_~b~0#1|)} assume main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sb~0#1 := -1; {15961#false} is VALID [2022-02-21 03:10:06,760 INFO L290 TraceCheckUtils]: 33: Hoare triple {15961#false} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {15961#false} is VALID [2022-02-21 03:10:06,760 INFO L290 TraceCheckUtils]: 34: Hoare triple {15961#false} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {15961#false} is VALID [2022-02-21 03:10:06,761 INFO L290 TraceCheckUtils]: 35: Hoare triple {15961#false} assume !(0 == addflt_~b#1 % 4294967296); {15961#false} is VALID [2022-02-21 03:10:06,761 INFO L290 TraceCheckUtils]: 36: Hoare triple {15961#false} assume !(0 == addflt_~a#1); {15961#false} is VALID [2022-02-21 03:10:06,761 INFO L290 TraceCheckUtils]: 37: Hoare triple {15961#false} assume !false; {15961#false} is VALID [2022-02-21 03:10:06,761 INFO L290 TraceCheckUtils]: 38: Hoare triple {15961#false} assume !false; {15961#false} is VALID [2022-02-21 03:10:06,761 INFO L290 TraceCheckUtils]: 39: Hoare triple {15961#false} assume addflt_~a#1 >= 0;abs_108 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_108; {15961#false} is VALID [2022-02-21 03:10:06,761 INFO L290 TraceCheckUtils]: 40: Hoare triple {15961#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {15961#false} is VALID [2022-02-21 03:10:06,761 INFO L290 TraceCheckUtils]: 41: Hoare triple {15961#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {15961#false} is VALID [2022-02-21 03:10:06,762 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:06,762 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:10:06,762 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149687904] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:06,762 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:10:06,762 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2022-02-21 03:10:06,762 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602372508] [2022-02-21 03:10:06,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:06,763 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2022-02-21 03:10:06,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:06,763 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:06,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:06,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:10:06,788 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:06,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:10:06,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-02-21 03:10:06,789 INFO L87 Difference]: Start difference. First operand 135 states and 172 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:07,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:07,173 INFO L93 Difference]: Finished difference Result 260 states and 320 transitions. [2022-02-21 03:10:07,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:10:07,173 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2022-02-21 03:10:07,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:07,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:07,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 269 transitions. [2022-02-21 03:10:07,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:07,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 269 transitions. [2022-02-21 03:10:07,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 269 transitions. [2022-02-21 03:10:07,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 269 edges. 269 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:07,358 INFO L225 Difference]: With dead ends: 260 [2022-02-21 03:10:07,358 INFO L226 Difference]: Without dead ends: 202 [2022-02-21 03:10:07,358 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-02-21 03:10:07,359 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 66 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:07,359 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 616 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:10:07,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-02-21 03:10:07,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 143. [2022-02-21 03:10:07,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:07,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 202 states. Second operand has 143 states, 122 states have (on average 1.3852459016393444) internal successors, (169), 131 states have internal predecessors, (169), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-21 03:10:07,425 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand has 143 states, 122 states have (on average 1.3852459016393444) internal successors, (169), 131 states have internal predecessors, (169), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-21 03:10:07,425 INFO L87 Difference]: Start difference. First operand 202 states. Second operand has 143 states, 122 states have (on average 1.3852459016393444) internal successors, (169), 131 states have internal predecessors, (169), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-21 03:10:07,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:07,428 INFO L93 Difference]: Finished difference Result 202 states and 252 transitions. [2022-02-21 03:10:07,428 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 252 transitions. [2022-02-21 03:10:07,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:07,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:07,429 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 122 states have (on average 1.3852459016393444) internal successors, (169), 131 states have internal predecessors, (169), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Second operand 202 states. [2022-02-21 03:10:07,429 INFO L87 Difference]: Start difference. First operand has 143 states, 122 states have (on average 1.3852459016393444) internal successors, (169), 131 states have internal predecessors, (169), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Second operand 202 states. [2022-02-21 03:10:07,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:07,431 INFO L93 Difference]: Finished difference Result 202 states and 252 transitions. [2022-02-21 03:10:07,432 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 252 transitions. [2022-02-21 03:10:07,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:07,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:07,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:07,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:07,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 122 states have (on average 1.3852459016393444) internal successors, (169), 131 states have internal predecessors, (169), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-21 03:10:07,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 182 transitions. [2022-02-21 03:10:07,434 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 182 transitions. Word has length 42 [2022-02-21 03:10:07,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:07,434 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 182 transitions. [2022-02-21 03:10:07,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:07,435 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 182 transitions. [2022-02-21 03:10:07,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-21 03:10:07,435 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:07,435 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, 1, 1, 1] [2022-02-21 03:10:07,452 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:07,651 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,SelfDestructingSolverStorable15 [2022-02-21 03:10:07,651 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:07,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:07,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1287754489, now seen corresponding path program 1 times [2022-02-21 03:10:07,652 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:07,652 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27279102] [2022-02-21 03:10:07,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:07,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:07,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:07,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:07,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:07,750 INFO L290 TraceCheckUtils]: 0: Hoare triple {17003#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {16976#true} is VALID [2022-02-21 03:10:07,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {16976#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {17004#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:07,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {17004#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {17005#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:07,751 INFO L290 TraceCheckUtils]: 3: Hoare triple {17005#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {17005#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:07,752 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {17005#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {16976#true} #448#return; {16983#(= |ULTIMATE.start_main_#t~ret22#1| 0)} is VALID [2022-02-21 03:10:07,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:07,758 INFO L290 TraceCheckUtils]: 0: Hoare triple {17003#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {16976#true} is VALID [2022-02-21 03:10:07,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {16976#true} assume !(0 == ~m % 4294967296); {16976#true} is VALID [2022-02-21 03:10:07,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {16976#true} assume !(~m % 4294967296 < 16777216); {16976#true} is VALID [2022-02-21 03:10:07,758 INFO L290 TraceCheckUtils]: 3: Hoare triple {16976#true} assume !false; {16976#true} is VALID [2022-02-21 03:10:07,759 INFO L290 TraceCheckUtils]: 4: Hoare triple {16976#true} assume ~m % 4294967296 >= 33554432; {16976#true} is VALID [2022-02-21 03:10:07,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {16976#true} assume ~e >= 127;~__retres4~0 := 4294967295; {16976#true} is VALID [2022-02-21 03:10:07,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {16976#true} #res := ~__retres4~0; {16976#true} is VALID [2022-02-21 03:10:07,759 INFO L290 TraceCheckUtils]: 7: Hoare triple {16976#true} assume true; {16976#true} is VALID [2022-02-21 03:10:07,759 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {16976#true} {16984#(= |ULTIMATE.start_main_~zero~0#1| 0)} #450#return; {16984#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:07,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-21 03:10:07,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:07,767 INFO L290 TraceCheckUtils]: 0: Hoare triple {17003#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {16976#true} is VALID [2022-02-21 03:10:07,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {16976#true} assume !(0 == ~m % 4294967296); {16976#true} is VALID [2022-02-21 03:10:07,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {16976#true} assume !(~m % 4294967296 < 16777216); {16976#true} is VALID [2022-02-21 03:10:07,767 INFO L290 TraceCheckUtils]: 3: Hoare triple {16976#true} assume !false; {16976#true} is VALID [2022-02-21 03:10:07,767 INFO L290 TraceCheckUtils]: 4: Hoare triple {16976#true} assume ~m % 4294967296 >= 33554432; {16976#true} is VALID [2022-02-21 03:10:07,768 INFO L290 TraceCheckUtils]: 5: Hoare triple {16976#true} assume ~e >= 127;~__retres4~0 := 4294967295; {16976#true} is VALID [2022-02-21 03:10:07,768 INFO L290 TraceCheckUtils]: 6: Hoare triple {16976#true} #res := ~__retres4~0; {16976#true} is VALID [2022-02-21 03:10:07,768 INFO L290 TraceCheckUtils]: 7: Hoare triple {16976#true} assume true; {16976#true} is VALID [2022-02-21 03:10:07,768 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {16976#true} {16984#(= |ULTIMATE.start_main_~zero~0#1| 0)} #452#return; {16984#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:07,769 INFO L290 TraceCheckUtils]: 0: Hoare triple {16976#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); {16976#true} is VALID [2022-02-21 03:10:07,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {16976#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {16976#true} is VALID [2022-02-21 03:10:07,769 INFO L272 TraceCheckUtils]: 2: Hoare triple {16976#true} call main_#t~ret22#1 := base2flt(0, 0); {17003#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:07,769 INFO L290 TraceCheckUtils]: 3: Hoare triple {17003#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {16976#true} is VALID [2022-02-21 03:10:07,770 INFO L290 TraceCheckUtils]: 4: Hoare triple {16976#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {17004#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:07,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {17004#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {17005#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:07,770 INFO L290 TraceCheckUtils]: 6: Hoare triple {17005#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {17005#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:07,771 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {17005#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {16976#true} #448#return; {16983#(= |ULTIMATE.start_main_#t~ret22#1| 0)} is VALID [2022-02-21 03:10:07,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {16983#(= |ULTIMATE.start_main_#t~ret22#1| 0)} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {16984#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:07,772 INFO L272 TraceCheckUtils]: 9: Hoare triple {16984#(= |ULTIMATE.start_main_~zero~0#1| 0)} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {17003#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:07,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {17003#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {16976#true} is VALID [2022-02-21 03:10:07,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {16976#true} assume !(0 == ~m % 4294967296); {16976#true} is VALID [2022-02-21 03:10:07,772 INFO L290 TraceCheckUtils]: 12: Hoare triple {16976#true} assume !(~m % 4294967296 < 16777216); {16976#true} is VALID [2022-02-21 03:10:07,773 INFO L290 TraceCheckUtils]: 13: Hoare triple {16976#true} assume !false; {16976#true} is VALID [2022-02-21 03:10:07,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {16976#true} assume ~m % 4294967296 >= 33554432; {16976#true} is VALID [2022-02-21 03:10:07,773 INFO L290 TraceCheckUtils]: 15: Hoare triple {16976#true} assume ~e >= 127;~__retres4~0 := 4294967295; {16976#true} is VALID [2022-02-21 03:10:07,773 INFO L290 TraceCheckUtils]: 16: Hoare triple {16976#true} #res := ~__retres4~0; {16976#true} is VALID [2022-02-21 03:10:07,773 INFO L290 TraceCheckUtils]: 17: Hoare triple {16976#true} assume true; {16976#true} is VALID [2022-02-21 03:10:07,774 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {16976#true} {16984#(= |ULTIMATE.start_main_~zero~0#1| 0)} #450#return; {16984#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:07,774 INFO L290 TraceCheckUtils]: 19: Hoare triple {16984#(= |ULTIMATE.start_main_~zero~0#1| 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {16984#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:07,775 INFO L272 TraceCheckUtils]: 20: Hoare triple {16984#(= |ULTIMATE.start_main_~zero~0#1| 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {17003#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:07,775 INFO L290 TraceCheckUtils]: 21: Hoare triple {17003#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {16976#true} is VALID [2022-02-21 03:10:07,775 INFO L290 TraceCheckUtils]: 22: Hoare triple {16976#true} assume !(0 == ~m % 4294967296); {16976#true} is VALID [2022-02-21 03:10:07,775 INFO L290 TraceCheckUtils]: 23: Hoare triple {16976#true} assume !(~m % 4294967296 < 16777216); {16976#true} is VALID [2022-02-21 03:10:07,775 INFO L290 TraceCheckUtils]: 24: Hoare triple {16976#true} assume !false; {16976#true} is VALID [2022-02-21 03:10:07,775 INFO L290 TraceCheckUtils]: 25: Hoare triple {16976#true} assume ~m % 4294967296 >= 33554432; {16976#true} is VALID [2022-02-21 03:10:07,775 INFO L290 TraceCheckUtils]: 26: Hoare triple {16976#true} assume ~e >= 127;~__retres4~0 := 4294967295; {16976#true} is VALID [2022-02-21 03:10:07,775 INFO L290 TraceCheckUtils]: 27: Hoare triple {16976#true} #res := ~__retres4~0; {16976#true} is VALID [2022-02-21 03:10:07,775 INFO L290 TraceCheckUtils]: 28: Hoare triple {16976#true} assume true; {16976#true} is VALID [2022-02-21 03:10:07,776 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {16976#true} {16984#(= |ULTIMATE.start_main_~zero~0#1| 0)} #452#return; {16984#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:07,776 INFO L290 TraceCheckUtils]: 30: Hoare triple {16984#(= |ULTIMATE.start_main_~zero~0#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {16984#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:07,777 INFO L290 TraceCheckUtils]: 31: Hoare triple {16984#(= |ULTIMATE.start_main_~zero~0#1| 0)} assume main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sa~0#1 := -1; {16977#false} is VALID [2022-02-21 03:10:07,777 INFO L290 TraceCheckUtils]: 32: Hoare triple {16977#false} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {16977#false} is VALID [2022-02-21 03:10:07,777 INFO L290 TraceCheckUtils]: 33: Hoare triple {16977#false} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {16977#false} is VALID [2022-02-21 03:10:07,777 INFO L290 TraceCheckUtils]: 34: Hoare triple {16977#false} main_~sb~0#1 := main_~tmp___0~0#1; {16977#false} is VALID [2022-02-21 03:10:07,777 INFO L290 TraceCheckUtils]: 35: Hoare triple {16977#false} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {16977#false} is VALID [2022-02-21 03:10:07,777 INFO L290 TraceCheckUtils]: 36: Hoare triple {16977#false} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {16977#false} is VALID [2022-02-21 03:10:07,778 INFO L290 TraceCheckUtils]: 37: Hoare triple {16977#false} assume !(0 == addflt_~b#1 % 4294967296); {16977#false} is VALID [2022-02-21 03:10:07,778 INFO L290 TraceCheckUtils]: 38: Hoare triple {16977#false} assume !(0 == addflt_~a#1); {16977#false} is VALID [2022-02-21 03:10:07,778 INFO L290 TraceCheckUtils]: 39: Hoare triple {16977#false} assume !false; {16977#false} is VALID [2022-02-21 03:10:07,778 INFO L290 TraceCheckUtils]: 40: Hoare triple {16977#false} assume !false; {16977#false} is VALID [2022-02-21 03:10:07,778 INFO L290 TraceCheckUtils]: 41: Hoare triple {16977#false} assume addflt_~a#1 >= 0;abs_108 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_108; {16977#false} is VALID [2022-02-21 03:10:07,778 INFO L290 TraceCheckUtils]: 42: Hoare triple {16977#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {16977#false} is VALID [2022-02-21 03:10:07,778 INFO L290 TraceCheckUtils]: 43: Hoare triple {16977#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {16977#false} is VALID [2022-02-21 03:10:07,778 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-21 03:10:07,779 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:07,779 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27279102] [2022-02-21 03:10:07,779 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27279102] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:07,779 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902762086] [2022-02-21 03:10:07,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:07,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:07,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:07,788 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:07,789 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:07,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:07,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-21 03:10:07,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:07,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:07,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {16976#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); {16976#true} is VALID [2022-02-21 03:10:07,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {16976#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {16976#true} is VALID [2022-02-21 03:10:07,990 INFO L272 TraceCheckUtils]: 2: Hoare triple {16976#true} call main_#t~ret22#1 := base2flt(0, 0); {16976#true} is VALID [2022-02-21 03:10:07,990 INFO L290 TraceCheckUtils]: 3: Hoare triple {16976#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {17018#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:07,991 INFO L290 TraceCheckUtils]: 4: Hoare triple {17018#(= base2flt_~m |base2flt_#in~m|)} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {17022#(and (<= (mod |base2flt_#in~m| 4294967296) 0) (= base2flt_~__retres4~0 0))} is VALID [2022-02-21 03:10:07,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {17022#(and (<= (mod |base2flt_#in~m| 4294967296) 0) (= base2flt_~__retres4~0 0))} #res := ~__retres4~0; {17026#(and (= |base2flt_#res| 0) (<= (mod |base2flt_#in~m| 4294967296) 0))} is VALID [2022-02-21 03:10:07,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {17026#(and (= |base2flt_#res| 0) (<= (mod |base2flt_#in~m| 4294967296) 0))} assume true; {17026#(and (= |base2flt_#res| 0) (<= (mod |base2flt_#in~m| 4294967296) 0))} is VALID [2022-02-21 03:10:07,992 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {17026#(and (= |base2flt_#res| 0) (<= (mod |base2flt_#in~m| 4294967296) 0))} {16976#true} #448#return; {16983#(= |ULTIMATE.start_main_#t~ret22#1| 0)} is VALID [2022-02-21 03:10:07,993 INFO L290 TraceCheckUtils]: 8: Hoare triple {16983#(= |ULTIMATE.start_main_#t~ret22#1| 0)} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {16984#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:07,993 INFO L272 TraceCheckUtils]: 9: Hoare triple {16984#(= |ULTIMATE.start_main_~zero~0#1| 0)} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {16976#true} is VALID [2022-02-21 03:10:07,993 INFO L290 TraceCheckUtils]: 10: Hoare triple {16976#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {16976#true} is VALID [2022-02-21 03:10:07,993 INFO L290 TraceCheckUtils]: 11: Hoare triple {16976#true} assume !(0 == ~m % 4294967296); {16976#true} is VALID [2022-02-21 03:10:07,993 INFO L290 TraceCheckUtils]: 12: Hoare triple {16976#true} assume !(~m % 4294967296 < 16777216); {16976#true} is VALID [2022-02-21 03:10:07,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {16976#true} assume !false; {16976#true} is VALID [2022-02-21 03:10:07,994 INFO L290 TraceCheckUtils]: 14: Hoare triple {16976#true} assume ~m % 4294967296 >= 33554432; {16976#true} is VALID [2022-02-21 03:10:07,994 INFO L290 TraceCheckUtils]: 15: Hoare triple {16976#true} assume ~e >= 127;~__retres4~0 := 4294967295; {16976#true} is VALID [2022-02-21 03:10:07,994 INFO L290 TraceCheckUtils]: 16: Hoare triple {16976#true} #res := ~__retres4~0; {16976#true} is VALID [2022-02-21 03:10:07,994 INFO L290 TraceCheckUtils]: 17: Hoare triple {16976#true} assume true; {16976#true} is VALID [2022-02-21 03:10:07,995 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {16976#true} {16984#(= |ULTIMATE.start_main_~zero~0#1| 0)} #450#return; {16984#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:07,995 INFO L290 TraceCheckUtils]: 19: Hoare triple {16984#(= |ULTIMATE.start_main_~zero~0#1| 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {16984#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:07,995 INFO L272 TraceCheckUtils]: 20: Hoare triple {16984#(= |ULTIMATE.start_main_~zero~0#1| 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {16976#true} is VALID [2022-02-21 03:10:07,995 INFO L290 TraceCheckUtils]: 21: Hoare triple {16976#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {16976#true} is VALID [2022-02-21 03:10:07,995 INFO L290 TraceCheckUtils]: 22: Hoare triple {16976#true} assume !(0 == ~m % 4294967296); {16976#true} is VALID [2022-02-21 03:10:07,996 INFO L290 TraceCheckUtils]: 23: Hoare triple {16976#true} assume !(~m % 4294967296 < 16777216); {16976#true} is VALID [2022-02-21 03:10:07,996 INFO L290 TraceCheckUtils]: 24: Hoare triple {16976#true} assume !false; {16976#true} is VALID [2022-02-21 03:10:07,996 INFO L290 TraceCheckUtils]: 25: Hoare triple {16976#true} assume ~m % 4294967296 >= 33554432; {16976#true} is VALID [2022-02-21 03:10:07,996 INFO L290 TraceCheckUtils]: 26: Hoare triple {16976#true} assume ~e >= 127;~__retres4~0 := 4294967295; {16976#true} is VALID [2022-02-21 03:10:07,996 INFO L290 TraceCheckUtils]: 27: Hoare triple {16976#true} #res := ~__retres4~0; {16976#true} is VALID [2022-02-21 03:10:07,996 INFO L290 TraceCheckUtils]: 28: Hoare triple {16976#true} assume true; {16976#true} is VALID [2022-02-21 03:10:07,997 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {16976#true} {16984#(= |ULTIMATE.start_main_~zero~0#1| 0)} #452#return; {16984#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:07,997 INFO L290 TraceCheckUtils]: 30: Hoare triple {16984#(= |ULTIMATE.start_main_~zero~0#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {16984#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:07,998 INFO L290 TraceCheckUtils]: 31: Hoare triple {16984#(= |ULTIMATE.start_main_~zero~0#1| 0)} assume main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sa~0#1 := -1; {16977#false} is VALID [2022-02-21 03:10:07,998 INFO L290 TraceCheckUtils]: 32: Hoare triple {16977#false} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {16977#false} is VALID [2022-02-21 03:10:07,998 INFO L290 TraceCheckUtils]: 33: Hoare triple {16977#false} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {16977#false} is VALID [2022-02-21 03:10:07,998 INFO L290 TraceCheckUtils]: 34: Hoare triple {16977#false} main_~sb~0#1 := main_~tmp___0~0#1; {16977#false} is VALID [2022-02-21 03:10:07,998 INFO L290 TraceCheckUtils]: 35: Hoare triple {16977#false} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {16977#false} is VALID [2022-02-21 03:10:07,998 INFO L290 TraceCheckUtils]: 36: Hoare triple {16977#false} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {16977#false} is VALID [2022-02-21 03:10:07,998 INFO L290 TraceCheckUtils]: 37: Hoare triple {16977#false} assume !(0 == addflt_~b#1 % 4294967296); {16977#false} is VALID [2022-02-21 03:10:07,998 INFO L290 TraceCheckUtils]: 38: Hoare triple {16977#false} assume !(0 == addflt_~a#1); {16977#false} is VALID [2022-02-21 03:10:07,999 INFO L290 TraceCheckUtils]: 39: Hoare triple {16977#false} assume !false; {16977#false} is VALID [2022-02-21 03:10:07,999 INFO L290 TraceCheckUtils]: 40: Hoare triple {16977#false} assume !false; {16977#false} is VALID [2022-02-21 03:10:07,999 INFO L290 TraceCheckUtils]: 41: Hoare triple {16977#false} assume addflt_~a#1 >= 0;abs_108 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_108; {16977#false} is VALID [2022-02-21 03:10:07,999 INFO L290 TraceCheckUtils]: 42: Hoare triple {16977#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {16977#false} is VALID [2022-02-21 03:10:07,999 INFO L290 TraceCheckUtils]: 43: Hoare triple {16977#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {16977#false} is VALID [2022-02-21 03:10:07,999 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-21 03:10:07,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:10:08,270 INFO L290 TraceCheckUtils]: 43: Hoare triple {16977#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {16977#false} is VALID [2022-02-21 03:10:08,270 INFO L290 TraceCheckUtils]: 42: Hoare triple {16977#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {16977#false} is VALID [2022-02-21 03:10:08,270 INFO L290 TraceCheckUtils]: 41: Hoare triple {16977#false} assume addflt_~a#1 >= 0;abs_108 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_108; {16977#false} is VALID [2022-02-21 03:10:08,270 INFO L290 TraceCheckUtils]: 40: Hoare triple {16977#false} assume !false; {16977#false} is VALID [2022-02-21 03:10:08,270 INFO L290 TraceCheckUtils]: 39: Hoare triple {16977#false} assume !false; {16977#false} is VALID [2022-02-21 03:10:08,270 INFO L290 TraceCheckUtils]: 38: Hoare triple {16977#false} assume !(0 == addflt_~a#1); {16977#false} is VALID [2022-02-21 03:10:08,270 INFO L290 TraceCheckUtils]: 37: Hoare triple {16977#false} assume !(0 == addflt_~b#1 % 4294967296); {16977#false} is VALID [2022-02-21 03:10:08,270 INFO L290 TraceCheckUtils]: 36: Hoare triple {16977#false} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {16977#false} is VALID [2022-02-21 03:10:08,270 INFO L290 TraceCheckUtils]: 35: Hoare triple {16977#false} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {16977#false} is VALID [2022-02-21 03:10:08,271 INFO L290 TraceCheckUtils]: 34: Hoare triple {16977#false} main_~sb~0#1 := main_~tmp___0~0#1; {16977#false} is VALID [2022-02-21 03:10:08,271 INFO L290 TraceCheckUtils]: 33: Hoare triple {16977#false} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {16977#false} is VALID [2022-02-21 03:10:08,271 INFO L290 TraceCheckUtils]: 32: Hoare triple {16977#false} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {16977#false} is VALID [2022-02-21 03:10:08,271 INFO L290 TraceCheckUtils]: 31: Hoare triple {17177#(<= (mod |ULTIMATE.start_main_~zero~0#1| 4294967296) 0)} assume main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sa~0#1 := -1; {16977#false} is VALID [2022-02-21 03:10:08,272 INFO L290 TraceCheckUtils]: 30: Hoare triple {17177#(<= (mod |ULTIMATE.start_main_~zero~0#1| 4294967296) 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {17177#(<= (mod |ULTIMATE.start_main_~zero~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:08,272 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {16976#true} {17177#(<= (mod |ULTIMATE.start_main_~zero~0#1| 4294967296) 0)} #452#return; {17177#(<= (mod |ULTIMATE.start_main_~zero~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:08,273 INFO L290 TraceCheckUtils]: 28: Hoare triple {16976#true} assume true; {16976#true} is VALID [2022-02-21 03:10:08,273 INFO L290 TraceCheckUtils]: 27: Hoare triple {16976#true} #res := ~__retres4~0; {16976#true} is VALID [2022-02-21 03:10:08,273 INFO L290 TraceCheckUtils]: 26: Hoare triple {16976#true} assume ~e >= 127;~__retres4~0 := 4294967295; {16976#true} is VALID [2022-02-21 03:10:08,273 INFO L290 TraceCheckUtils]: 25: Hoare triple {16976#true} assume ~m % 4294967296 >= 33554432; {16976#true} is VALID [2022-02-21 03:10:08,273 INFO L290 TraceCheckUtils]: 24: Hoare triple {16976#true} assume !false; {16976#true} is VALID [2022-02-21 03:10:08,273 INFO L290 TraceCheckUtils]: 23: Hoare triple {16976#true} assume !(~m % 4294967296 < 16777216); {16976#true} is VALID [2022-02-21 03:10:08,273 INFO L290 TraceCheckUtils]: 22: Hoare triple {16976#true} assume !(0 == ~m % 4294967296); {16976#true} is VALID [2022-02-21 03:10:08,273 INFO L290 TraceCheckUtils]: 21: Hoare triple {16976#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {16976#true} is VALID [2022-02-21 03:10:08,273 INFO L272 TraceCheckUtils]: 20: Hoare triple {17177#(<= (mod |ULTIMATE.start_main_~zero~0#1| 4294967296) 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {16976#true} is VALID [2022-02-21 03:10:08,273 INFO L290 TraceCheckUtils]: 19: Hoare triple {17177#(<= (mod |ULTIMATE.start_main_~zero~0#1| 4294967296) 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {17177#(<= (mod |ULTIMATE.start_main_~zero~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:08,274 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {16976#true} {17177#(<= (mod |ULTIMATE.start_main_~zero~0#1| 4294967296) 0)} #450#return; {17177#(<= (mod |ULTIMATE.start_main_~zero~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:08,274 INFO L290 TraceCheckUtils]: 17: Hoare triple {16976#true} assume true; {16976#true} is VALID [2022-02-21 03:10:08,274 INFO L290 TraceCheckUtils]: 16: Hoare triple {16976#true} #res := ~__retres4~0; {16976#true} is VALID [2022-02-21 03:10:08,274 INFO L290 TraceCheckUtils]: 15: Hoare triple {16976#true} assume ~e >= 127;~__retres4~0 := 4294967295; {16976#true} is VALID [2022-02-21 03:10:08,274 INFO L290 TraceCheckUtils]: 14: Hoare triple {16976#true} assume ~m % 4294967296 >= 33554432; {16976#true} is VALID [2022-02-21 03:10:08,274 INFO L290 TraceCheckUtils]: 13: Hoare triple {16976#true} assume !false; {16976#true} is VALID [2022-02-21 03:10:08,275 INFO L290 TraceCheckUtils]: 12: Hoare triple {16976#true} assume !(~m % 4294967296 < 16777216); {16976#true} is VALID [2022-02-21 03:10:08,275 INFO L290 TraceCheckUtils]: 11: Hoare triple {16976#true} assume !(0 == ~m % 4294967296); {16976#true} is VALID [2022-02-21 03:10:08,275 INFO L290 TraceCheckUtils]: 10: Hoare triple {16976#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {16976#true} is VALID [2022-02-21 03:10:08,275 INFO L272 TraceCheckUtils]: 9: Hoare triple {17177#(<= (mod |ULTIMATE.start_main_~zero~0#1| 4294967296) 0)} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {16976#true} is VALID [2022-02-21 03:10:08,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {17247#(<= (mod |ULTIMATE.start_main_#t~ret22#1| 4294967296) 0)} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {17177#(<= (mod |ULTIMATE.start_main_~zero~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:08,276 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {17254#(or (not (= |base2flt_#in~m| 0)) (<= (mod |base2flt_#res| 4294967296) 0))} {16976#true} #448#return; {17247#(<= (mod |ULTIMATE.start_main_#t~ret22#1| 4294967296) 0)} is VALID [2022-02-21 03:10:08,276 INFO L290 TraceCheckUtils]: 6: Hoare triple {17254#(or (not (= |base2flt_#in~m| 0)) (<= (mod |base2flt_#res| 4294967296) 0))} assume true; {17254#(or (not (= |base2flt_#in~m| 0)) (<= (mod |base2flt_#res| 4294967296) 0))} is VALID [2022-02-21 03:10:08,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {17261#(or (<= (mod base2flt_~__retres4~0 4294967296) 0) (not (= |base2flt_#in~m| 0)))} #res := ~__retres4~0; {17254#(or (not (= |base2flt_#in~m| 0)) (<= (mod |base2flt_#res| 4294967296) 0))} is VALID [2022-02-21 03:10:08,277 INFO L290 TraceCheckUtils]: 4: Hoare triple {16976#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {17261#(or (<= (mod base2flt_~__retres4~0 4294967296) 0) (not (= |base2flt_#in~m| 0)))} is VALID [2022-02-21 03:10:08,277 INFO L290 TraceCheckUtils]: 3: Hoare triple {16976#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {16976#true} is VALID [2022-02-21 03:10:08,277 INFO L272 TraceCheckUtils]: 2: Hoare triple {16976#true} call main_#t~ret22#1 := base2flt(0, 0); {16976#true} is VALID [2022-02-21 03:10:08,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {16976#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {16976#true} is VALID [2022-02-21 03:10:08,277 INFO L290 TraceCheckUtils]: 0: Hoare triple {16976#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); {16976#true} is VALID [2022-02-21 03:10:08,277 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-21 03:10:08,278 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902762086] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:10:08,278 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:10:08,278 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 14 [2022-02-21 03:10:08,278 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530893630] [2022-02-21 03:10:08,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:10:08,278 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 44 [2022-02-21 03:10:08,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:08,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-21 03:10:08,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:08,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-21 03:10:08,318 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:08,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-21 03:10:08,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-02-21 03:10:08,319 INFO L87 Difference]: Start difference. First operand 143 states and 182 transitions. Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-21 03:10:09,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:09,410 INFO L93 Difference]: Finished difference Result 306 states and 392 transitions. [2022-02-21 03:10:09,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-21 03:10:09,410 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 44 [2022-02-21 03:10:09,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:09,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-21 03:10:09,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 269 transitions. [2022-02-21 03:10:09,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-21 03:10:09,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 269 transitions. [2022-02-21 03:10:09,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 269 transitions. [2022-02-21 03:10:09,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 269 edges. 269 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:09,619 INFO L225 Difference]: With dead ends: 306 [2022-02-21 03:10:09,619 INFO L226 Difference]: Without dead ends: 244 [2022-02-21 03:10:09,620 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2022-02-21 03:10:09,620 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 379 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:09,620 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [382 Valid, 641 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 03:10:09,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-02-21 03:10:09,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 135. [2022-02-21 03:10:09,677 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:09,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 244 states. Second operand has 135 states, 115 states have (on average 1.373913043478261) internal successors, (158), 124 states have internal predecessors, (158), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:09,678 INFO L74 IsIncluded]: Start isIncluded. First operand 244 states. Second operand has 135 states, 115 states have (on average 1.373913043478261) internal successors, (158), 124 states have internal predecessors, (158), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:09,678 INFO L87 Difference]: Start difference. First operand 244 states. Second operand has 135 states, 115 states have (on average 1.373913043478261) internal successors, (158), 124 states have internal predecessors, (158), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:09,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:09,682 INFO L93 Difference]: Finished difference Result 244 states and 316 transitions. [2022-02-21 03:10:09,682 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 316 transitions. [2022-02-21 03:10:09,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:09,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:09,683 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 115 states have (on average 1.373913043478261) internal successors, (158), 124 states have internal predecessors, (158), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 244 states. [2022-02-21 03:10:09,683 INFO L87 Difference]: Start difference. First operand has 135 states, 115 states have (on average 1.373913043478261) internal successors, (158), 124 states have internal predecessors, (158), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 244 states. [2022-02-21 03:10:09,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:09,686 INFO L93 Difference]: Finished difference Result 244 states and 316 transitions. [2022-02-21 03:10:09,687 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 316 transitions. [2022-02-21 03:10:09,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:09,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:09,687 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:09,687 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:09,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 115 states have (on average 1.373913043478261) internal successors, (158), 124 states have internal predecessors, (158), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:10:09,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 170 transitions. [2022-02-21 03:10:09,689 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 170 transitions. Word has length 44 [2022-02-21 03:10:09,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:09,689 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 170 transitions. [2022-02-21 03:10:09,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-21 03:10:09,690 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 170 transitions. [2022-02-21 03:10:09,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-21 03:10:09,690 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:09,690 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, 1, 1, 1, 1, 1] [2022-02-21 03:10:09,709 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:09,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,SelfDestructingSolverStorable16 [2022-02-21 03:10:09,907 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:09,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:09,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1203752287, now seen corresponding path program 1 times [2022-02-21 03:10:09,908 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:09,908 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137077349] [2022-02-21 03:10:09,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:09,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:10,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:10,023 INFO L290 TraceCheckUtils]: 0: Hoare triple {18311#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18282#true} is VALID [2022-02-21 03:10:10,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {18282#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {18282#true} is VALID [2022-02-21 03:10:10,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {18282#true} #res := ~__retres4~0; {18282#true} is VALID [2022-02-21 03:10:10,024 INFO L290 TraceCheckUtils]: 3: Hoare triple {18282#true} assume true; {18282#true} is VALID [2022-02-21 03:10:10,024 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {18282#true} {18282#true} #448#return; {18282#true} is VALID [2022-02-21 03:10:10,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:10,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:10,056 INFO L290 TraceCheckUtils]: 0: Hoare triple {18311#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18282#true} is VALID [2022-02-21 03:10:10,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {18282#true} assume !(0 == ~m % 4294967296); {18282#true} is VALID [2022-02-21 03:10:10,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {18282#true} assume !(~m % 4294967296 < 16777216); {18282#true} is VALID [2022-02-21 03:10:10,057 INFO L290 TraceCheckUtils]: 3: Hoare triple {18282#true} assume !false; {18282#true} is VALID [2022-02-21 03:10:10,057 INFO L290 TraceCheckUtils]: 4: Hoare triple {18282#true} assume ~m % 4294967296 >= 33554432; {18282#true} is VALID [2022-02-21 03:10:10,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {18282#true} assume ~e >= 127;~__retres4~0 := 4294967295; {18312#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:10,058 INFO L290 TraceCheckUtils]: 6: Hoare triple {18312#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} #res := ~__retres4~0; {18313#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:10,058 INFO L290 TraceCheckUtils]: 7: Hoare triple {18313#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} assume true; {18313#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:10,059 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {18313#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} {18282#true} #450#return; {18298#(and (<= 4294967295 |ULTIMATE.start_main_#t~ret23#1|) (<= |ULTIMATE.start_main_#t~ret23#1| 4294967295))} is VALID [2022-02-21 03:10:10,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-21 03:10:10,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:10,068 INFO L290 TraceCheckUtils]: 0: Hoare triple {18311#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18282#true} is VALID [2022-02-21 03:10:10,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {18282#true} assume !(0 == ~m % 4294967296); {18282#true} is VALID [2022-02-21 03:10:10,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {18282#true} assume !(~m % 4294967296 < 16777216); {18282#true} is VALID [2022-02-21 03:10:10,069 INFO L290 TraceCheckUtils]: 3: Hoare triple {18282#true} assume !false; {18282#true} is VALID [2022-02-21 03:10:10,069 INFO L290 TraceCheckUtils]: 4: Hoare triple {18282#true} assume ~m % 4294967296 >= 33554432; {18282#true} is VALID [2022-02-21 03:10:10,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {18282#true} assume ~e >= 127;~__retres4~0 := 4294967295; {18282#true} is VALID [2022-02-21 03:10:10,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {18282#true} #res := ~__retres4~0; {18282#true} is VALID [2022-02-21 03:10:10,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {18282#true} assume true; {18282#true} is VALID [2022-02-21 03:10:10,070 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {18282#true} {18299#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} #452#return; {18299#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:10,070 INFO L290 TraceCheckUtils]: 0: Hoare triple {18282#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); {18282#true} is VALID [2022-02-21 03:10:10,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {18282#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {18282#true} is VALID [2022-02-21 03:10:10,071 INFO L272 TraceCheckUtils]: 2: Hoare triple {18282#true} call main_#t~ret22#1 := base2flt(0, 0); {18311#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:10,071 INFO L290 TraceCheckUtils]: 3: Hoare triple {18311#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18282#true} is VALID [2022-02-21 03:10:10,071 INFO L290 TraceCheckUtils]: 4: Hoare triple {18282#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {18282#true} is VALID [2022-02-21 03:10:10,071 INFO L290 TraceCheckUtils]: 5: Hoare triple {18282#true} #res := ~__retres4~0; {18282#true} is VALID [2022-02-21 03:10:10,072 INFO L290 TraceCheckUtils]: 6: Hoare triple {18282#true} assume true; {18282#true} is VALID [2022-02-21 03:10:10,072 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {18282#true} {18282#true} #448#return; {18282#true} is VALID [2022-02-21 03:10:10,072 INFO L290 TraceCheckUtils]: 8: Hoare triple {18282#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {18282#true} is VALID [2022-02-21 03:10:10,072 INFO L272 TraceCheckUtils]: 9: Hoare triple {18282#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {18311#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:10,073 INFO L290 TraceCheckUtils]: 10: Hoare triple {18311#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18282#true} is VALID [2022-02-21 03:10:10,073 INFO L290 TraceCheckUtils]: 11: Hoare triple {18282#true} assume !(0 == ~m % 4294967296); {18282#true} is VALID [2022-02-21 03:10:10,073 INFO L290 TraceCheckUtils]: 12: Hoare triple {18282#true} assume !(~m % 4294967296 < 16777216); {18282#true} is VALID [2022-02-21 03:10:10,073 INFO L290 TraceCheckUtils]: 13: Hoare triple {18282#true} assume !false; {18282#true} is VALID [2022-02-21 03:10:10,073 INFO L290 TraceCheckUtils]: 14: Hoare triple {18282#true} assume ~m % 4294967296 >= 33554432; {18282#true} is VALID [2022-02-21 03:10:10,074 INFO L290 TraceCheckUtils]: 15: Hoare triple {18282#true} assume ~e >= 127;~__retres4~0 := 4294967295; {18312#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:10,074 INFO L290 TraceCheckUtils]: 16: Hoare triple {18312#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} #res := ~__retres4~0; {18313#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:10,074 INFO L290 TraceCheckUtils]: 17: Hoare triple {18313#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} assume true; {18313#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:10,075 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {18313#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} {18282#true} #450#return; {18298#(and (<= 4294967295 |ULTIMATE.start_main_#t~ret23#1|) (<= |ULTIMATE.start_main_#t~ret23#1| 4294967295))} is VALID [2022-02-21 03:10:10,076 INFO L290 TraceCheckUtils]: 19: Hoare triple {18298#(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; {18299#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:10,077 INFO L272 TraceCheckUtils]: 20: Hoare triple {18299#(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); {18311#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:10,077 INFO L290 TraceCheckUtils]: 21: Hoare triple {18311#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18282#true} is VALID [2022-02-21 03:10:10,077 INFO L290 TraceCheckUtils]: 22: Hoare triple {18282#true} assume !(0 == ~m % 4294967296); {18282#true} is VALID [2022-02-21 03:10:10,077 INFO L290 TraceCheckUtils]: 23: Hoare triple {18282#true} assume !(~m % 4294967296 < 16777216); {18282#true} is VALID [2022-02-21 03:10:10,077 INFO L290 TraceCheckUtils]: 24: Hoare triple {18282#true} assume !false; {18282#true} is VALID [2022-02-21 03:10:10,077 INFO L290 TraceCheckUtils]: 25: Hoare triple {18282#true} assume ~m % 4294967296 >= 33554432; {18282#true} is VALID [2022-02-21 03:10:10,078 INFO L290 TraceCheckUtils]: 26: Hoare triple {18282#true} assume ~e >= 127;~__retres4~0 := 4294967295; {18282#true} is VALID [2022-02-21 03:10:10,078 INFO L290 TraceCheckUtils]: 27: Hoare triple {18282#true} #res := ~__retres4~0; {18282#true} is VALID [2022-02-21 03:10:10,078 INFO L290 TraceCheckUtils]: 28: Hoare triple {18282#true} assume true; {18282#true} is VALID [2022-02-21 03:10:10,079 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {18282#true} {18299#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} #452#return; {18299#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:10,079 INFO L290 TraceCheckUtils]: 30: Hoare triple {18299#(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; {18299#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:10,080 INFO L290 TraceCheckUtils]: 31: Hoare triple {18299#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} assume !(main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {18299#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:10,080 INFO L290 TraceCheckUtils]: 32: Hoare triple {18299#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} assume main_~a~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {18299#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:10,081 INFO L290 TraceCheckUtils]: 33: Hoare triple {18299#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} main_~sa~0#1 := main_~tmp~2#1; {18299#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:10,081 INFO L290 TraceCheckUtils]: 34: Hoare triple {18299#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {18299#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:10,081 INFO L290 TraceCheckUtils]: 35: Hoare triple {18299#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {18299#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:10,082 INFO L290 TraceCheckUtils]: 36: Hoare triple {18299#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} main_~sb~0#1 := main_~tmp___0~0#1; {18299#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:10,083 INFO L290 TraceCheckUtils]: 37: Hoare triple {18299#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {18309#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} is VALID [2022-02-21 03:10:10,083 INFO L290 TraceCheckUtils]: 38: Hoare triple {18309#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {18309#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} is VALID [2022-02-21 03:10:10,083 INFO L290 TraceCheckUtils]: 39: Hoare triple {18309#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} assume !(0 == addflt_~b#1 % 4294967296); {18309#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} is VALID [2022-02-21 03:10:10,084 INFO L290 TraceCheckUtils]: 40: Hoare triple {18309#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} assume !(0 == addflt_~a#1); {18309#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} is VALID [2022-02-21 03:10:10,084 INFO L290 TraceCheckUtils]: 41: Hoare triple {18309#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} assume !false; {18309#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} is VALID [2022-02-21 03:10:10,084 INFO L290 TraceCheckUtils]: 42: Hoare triple {18309#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} assume !false; {18309#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} is VALID [2022-02-21 03:10:10,085 INFO L290 TraceCheckUtils]: 43: Hoare triple {18309#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} assume addflt_~a#1 >= 0;abs_108 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_108; {18309#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} is VALID [2022-02-21 03:10:10,086 INFO L290 TraceCheckUtils]: 44: Hoare triple {18309#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {18310#(<= (div |ULTIMATE.start_addflt_~a#1| 16777216) (+ 2147483647 (* 4294967296 (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296))))} is VALID [2022-02-21 03:10:10,086 INFO L290 TraceCheckUtils]: 45: Hoare triple {18310#(<= (div |ULTIMATE.start_addflt_~a#1| 16777216) (+ 2147483647 (* 4294967296 (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296))))} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {18283#false} is VALID [2022-02-21 03:10:10,087 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:10,087 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:10,087 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137077349] [2022-02-21 03:10:10,087 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137077349] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:10,087 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075796922] [2022-02-21 03:10:10,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:10,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:10,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:10,089 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:10,090 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:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:10,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-21 03:10:10,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:10,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:10,463 INFO L290 TraceCheckUtils]: 0: Hoare triple {18282#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); {18282#true} is VALID [2022-02-21 03:10:10,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {18282#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {18282#true} is VALID [2022-02-21 03:10:10,463 INFO L272 TraceCheckUtils]: 2: Hoare triple {18282#true} call main_#t~ret22#1 := base2flt(0, 0); {18282#true} is VALID [2022-02-21 03:10:10,464 INFO L290 TraceCheckUtils]: 3: Hoare triple {18282#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18282#true} is VALID [2022-02-21 03:10:10,464 INFO L290 TraceCheckUtils]: 4: Hoare triple {18282#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {18282#true} is VALID [2022-02-21 03:10:10,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {18282#true} #res := ~__retres4~0; {18282#true} is VALID [2022-02-21 03:10:10,464 INFO L290 TraceCheckUtils]: 6: Hoare triple {18282#true} assume true; {18282#true} is VALID [2022-02-21 03:10:10,464 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {18282#true} {18282#true} #448#return; {18282#true} is VALID [2022-02-21 03:10:10,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {18282#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {18282#true} is VALID [2022-02-21 03:10:10,464 INFO L272 TraceCheckUtils]: 9: Hoare triple {18282#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {18282#true} is VALID [2022-02-21 03:10:10,464 INFO L290 TraceCheckUtils]: 10: Hoare triple {18282#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18282#true} is VALID [2022-02-21 03:10:10,465 INFO L290 TraceCheckUtils]: 11: Hoare triple {18282#true} assume !(0 == ~m % 4294967296); {18282#true} is VALID [2022-02-21 03:10:10,465 INFO L290 TraceCheckUtils]: 12: Hoare triple {18282#true} assume !(~m % 4294967296 < 16777216); {18282#true} is VALID [2022-02-21 03:10:10,465 INFO L290 TraceCheckUtils]: 13: Hoare triple {18282#true} assume !false; {18282#true} is VALID [2022-02-21 03:10:10,465 INFO L290 TraceCheckUtils]: 14: Hoare triple {18282#true} assume ~m % 4294967296 >= 33554432; {18282#true} is VALID [2022-02-21 03:10:10,465 INFO L290 TraceCheckUtils]: 15: Hoare triple {18282#true} assume ~e >= 127;~__retres4~0 := 4294967295; {18312#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:10,466 INFO L290 TraceCheckUtils]: 16: Hoare triple {18312#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} #res := ~__retres4~0; {18313#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:10,466 INFO L290 TraceCheckUtils]: 17: Hoare triple {18313#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} assume true; {18313#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:10,467 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {18313#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} {18282#true} #450#return; {18298#(and (<= 4294967295 |ULTIMATE.start_main_#t~ret23#1|) (<= |ULTIMATE.start_main_#t~ret23#1| 4294967295))} is VALID [2022-02-21 03:10:10,467 INFO L290 TraceCheckUtils]: 19: Hoare triple {18298#(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; {18299#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:10,468 INFO L272 TraceCheckUtils]: 20: Hoare triple {18299#(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); {18282#true} is VALID [2022-02-21 03:10:10,468 INFO L290 TraceCheckUtils]: 21: Hoare triple {18282#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18282#true} is VALID [2022-02-21 03:10:10,468 INFO L290 TraceCheckUtils]: 22: Hoare triple {18282#true} assume !(0 == ~m % 4294967296); {18282#true} is VALID [2022-02-21 03:10:10,468 INFO L290 TraceCheckUtils]: 23: Hoare triple {18282#true} assume !(~m % 4294967296 < 16777216); {18282#true} is VALID [2022-02-21 03:10:10,468 INFO L290 TraceCheckUtils]: 24: Hoare triple {18282#true} assume !false; {18282#true} is VALID [2022-02-21 03:10:10,468 INFO L290 TraceCheckUtils]: 25: Hoare triple {18282#true} assume ~m % 4294967296 >= 33554432; {18282#true} is VALID [2022-02-21 03:10:10,468 INFO L290 TraceCheckUtils]: 26: Hoare triple {18282#true} assume ~e >= 127;~__retres4~0 := 4294967295; {18282#true} is VALID [2022-02-21 03:10:10,468 INFO L290 TraceCheckUtils]: 27: Hoare triple {18282#true} #res := ~__retres4~0; {18282#true} is VALID [2022-02-21 03:10:10,469 INFO L290 TraceCheckUtils]: 28: Hoare triple {18282#true} assume true; {18282#true} is VALID [2022-02-21 03:10:10,469 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {18282#true} {18299#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} #452#return; {18299#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:10,470 INFO L290 TraceCheckUtils]: 30: Hoare triple {18299#(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; {18299#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:10,470 INFO L290 TraceCheckUtils]: 31: Hoare triple {18299#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} assume !(main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {18299#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:10,471 INFO L290 TraceCheckUtils]: 32: Hoare triple {18299#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} assume main_~a~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {18299#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:10,471 INFO L290 TraceCheckUtils]: 33: Hoare triple {18299#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} main_~sa~0#1 := main_~tmp~2#1; {18299#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:10,471 INFO L290 TraceCheckUtils]: 34: Hoare triple {18299#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {18299#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:10,472 INFO L290 TraceCheckUtils]: 35: Hoare triple {18299#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {18299#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:10,472 INFO L290 TraceCheckUtils]: 36: Hoare triple {18299#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} main_~sb~0#1 := main_~tmp___0~0#1; {18299#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:10,473 INFO L290 TraceCheckUtils]: 37: Hoare triple {18299#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {18428#(and (<= 4294967295 |ULTIMATE.start_addflt_~a#1|) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} is VALID [2022-02-21 03:10:10,473 INFO L290 TraceCheckUtils]: 38: Hoare triple {18428#(and (<= 4294967295 |ULTIMATE.start_addflt_~a#1|) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {18428#(and (<= 4294967295 |ULTIMATE.start_addflt_~a#1|) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} is VALID [2022-02-21 03:10:10,474 INFO L290 TraceCheckUtils]: 39: Hoare triple {18428#(and (<= 4294967295 |ULTIMATE.start_addflt_~a#1|) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} assume !(0 == addflt_~b#1 % 4294967296); {18428#(and (<= 4294967295 |ULTIMATE.start_addflt_~a#1|) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} is VALID [2022-02-21 03:10:10,474 INFO L290 TraceCheckUtils]: 40: Hoare triple {18428#(and (<= 4294967295 |ULTIMATE.start_addflt_~a#1|) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} assume !(0 == addflt_~a#1); {18428#(and (<= 4294967295 |ULTIMATE.start_addflt_~a#1|) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} is VALID [2022-02-21 03:10:10,474 INFO L290 TraceCheckUtils]: 41: Hoare triple {18428#(and (<= 4294967295 |ULTIMATE.start_addflt_~a#1|) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} assume !false; {18428#(and (<= 4294967295 |ULTIMATE.start_addflt_~a#1|) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} is VALID [2022-02-21 03:10:10,475 INFO L290 TraceCheckUtils]: 42: Hoare triple {18428#(and (<= 4294967295 |ULTIMATE.start_addflt_~a#1|) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} assume !false; {18428#(and (<= 4294967295 |ULTIMATE.start_addflt_~a#1|) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} is VALID [2022-02-21 03:10:10,475 INFO L290 TraceCheckUtils]: 43: Hoare triple {18428#(and (<= 4294967295 |ULTIMATE.start_addflt_~a#1|) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} assume addflt_~a#1 >= 0;abs_108 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_108; {18428#(and (<= 4294967295 |ULTIMATE.start_addflt_~a#1|) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} is VALID [2022-02-21 03:10:10,483 INFO L290 TraceCheckUtils]: 44: Hoare triple {18428#(and (<= 4294967295 |ULTIMATE.start_addflt_~a#1|) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {18428#(and (<= 4294967295 |ULTIMATE.start_addflt_~a#1|) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} is VALID [2022-02-21 03:10:10,485 INFO L290 TraceCheckUtils]: 45: Hoare triple {18428#(and (<= 4294967295 |ULTIMATE.start_addflt_~a#1|) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {18283#false} is VALID [2022-02-21 03:10:10,485 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:10,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:10:10,823 INFO L290 TraceCheckUtils]: 45: Hoare triple {18453#(or (<= 2147483776 (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) (<= (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 2147483647))} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {18283#false} is VALID [2022-02-21 03:10:10,824 INFO L290 TraceCheckUtils]: 44: Hoare triple {18453#(or (<= 2147483776 (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) (<= (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 2147483647))} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {18453#(or (<= 2147483776 (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) (<= (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 2147483647))} is VALID [2022-02-21 03:10:10,825 INFO L290 TraceCheckUtils]: 43: Hoare triple {18453#(or (<= 2147483776 (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) (<= (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 2147483647))} assume addflt_~a#1 >= 0;abs_108 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_108; {18453#(or (<= 2147483776 (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) (<= (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 2147483647))} is VALID [2022-02-21 03:10:10,825 INFO L290 TraceCheckUtils]: 42: Hoare triple {18453#(or (<= 2147483776 (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) (<= (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 2147483647))} assume !false; {18453#(or (<= 2147483776 (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) (<= (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 2147483647))} is VALID [2022-02-21 03:10:10,825 INFO L290 TraceCheckUtils]: 41: Hoare triple {18453#(or (<= 2147483776 (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) (<= (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 2147483647))} assume !false; {18453#(or (<= 2147483776 (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) (<= (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 2147483647))} is VALID [2022-02-21 03:10:10,826 INFO L290 TraceCheckUtils]: 40: Hoare triple {18453#(or (<= 2147483776 (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) (<= (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 2147483647))} assume !(0 == addflt_~a#1); {18453#(or (<= 2147483776 (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) (<= (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 2147483647))} is VALID [2022-02-21 03:10:10,826 INFO L290 TraceCheckUtils]: 39: Hoare triple {18453#(or (<= 2147483776 (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) (<= (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 2147483647))} assume !(0 == addflt_~b#1 % 4294967296); {18453#(or (<= 2147483776 (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) (<= (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 2147483647))} is VALID [2022-02-21 03:10:10,827 INFO L290 TraceCheckUtils]: 38: Hoare triple {18453#(or (<= 2147483776 (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) (<= (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 2147483647))} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {18453#(or (<= 2147483776 (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) (<= (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 2147483647))} is VALID [2022-02-21 03:10:10,827 INFO L290 TraceCheckUtils]: 37: Hoare triple {18478#(or (<= (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296)))} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {18453#(or (<= 2147483776 (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) (<= (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 2147483647))} is VALID [2022-02-21 03:10:10,828 INFO L290 TraceCheckUtils]: 36: Hoare triple {18478#(or (<= (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296)))} main_~sb~0#1 := main_~tmp___0~0#1; {18478#(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:10,828 INFO L290 TraceCheckUtils]: 35: Hoare triple {18478#(or (<= (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296)))} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {18478#(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:10,828 INFO L290 TraceCheckUtils]: 34: Hoare triple {18478#(or (<= (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296)))} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {18478#(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:10,829 INFO L290 TraceCheckUtils]: 33: Hoare triple {18478#(or (<= (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296)))} main_~sa~0#1 := main_~tmp~2#1; {18478#(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:10,829 INFO L290 TraceCheckUtils]: 32: Hoare triple {18478#(or (<= (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296)))} assume main_~a~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {18478#(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:10,830 INFO L290 TraceCheckUtils]: 31: Hoare triple {18478#(or (<= (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296)))} assume !(main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {18478#(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:10,830 INFO L290 TraceCheckUtils]: 30: Hoare triple {18478#(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; {18478#(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:10,831 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {18282#true} {18478#(or (<= (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296)))} #452#return; {18478#(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:10,831 INFO L290 TraceCheckUtils]: 28: Hoare triple {18282#true} assume true; {18282#true} is VALID [2022-02-21 03:10:10,831 INFO L290 TraceCheckUtils]: 27: Hoare triple {18282#true} #res := ~__retres4~0; {18282#true} is VALID [2022-02-21 03:10:10,831 INFO L290 TraceCheckUtils]: 26: Hoare triple {18282#true} assume ~e >= 127;~__retres4~0 := 4294967295; {18282#true} is VALID [2022-02-21 03:10:10,831 INFO L290 TraceCheckUtils]: 25: Hoare triple {18282#true} assume ~m % 4294967296 >= 33554432; {18282#true} is VALID [2022-02-21 03:10:10,831 INFO L290 TraceCheckUtils]: 24: Hoare triple {18282#true} assume !false; {18282#true} is VALID [2022-02-21 03:10:10,831 INFO L290 TraceCheckUtils]: 23: Hoare triple {18282#true} assume !(~m % 4294967296 < 16777216); {18282#true} is VALID [2022-02-21 03:10:10,831 INFO L290 TraceCheckUtils]: 22: Hoare triple {18282#true} assume !(0 == ~m % 4294967296); {18282#true} is VALID [2022-02-21 03:10:10,831 INFO L290 TraceCheckUtils]: 21: Hoare triple {18282#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18282#true} is VALID [2022-02-21 03:10:10,831 INFO L272 TraceCheckUtils]: 20: Hoare triple {18478#(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); {18282#true} is VALID [2022-02-21 03:10:10,832 INFO L290 TraceCheckUtils]: 19: Hoare triple {18533#(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; {18478#(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:10,833 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {18540#(or (<= (mod (div |base2flt_#res| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |base2flt_#res| 16777216) 4294967296)))} {18282#true} #450#return; {18533#(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:10,833 INFO L290 TraceCheckUtils]: 17: Hoare triple {18540#(or (<= (mod (div |base2flt_#res| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |base2flt_#res| 16777216) 4294967296)))} assume true; {18540#(or (<= (mod (div |base2flt_#res| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |base2flt_#res| 16777216) 4294967296)))} is VALID [2022-02-21 03:10:10,834 INFO L290 TraceCheckUtils]: 16: Hoare triple {18547#(or (<= 2147483776 (mod (div base2flt_~__retres4~0 16777216) 4294967296)) (<= (mod (div base2flt_~__retres4~0 16777216) 4294967296) 2147483647))} #res := ~__retres4~0; {18540#(or (<= (mod (div |base2flt_#res| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |base2flt_#res| 16777216) 4294967296)))} is VALID [2022-02-21 03:10:10,834 INFO L290 TraceCheckUtils]: 15: Hoare triple {18282#true} assume ~e >= 127;~__retres4~0 := 4294967295; {18547#(or (<= 2147483776 (mod (div base2flt_~__retres4~0 16777216) 4294967296)) (<= (mod (div base2flt_~__retres4~0 16777216) 4294967296) 2147483647))} is VALID [2022-02-21 03:10:10,834 INFO L290 TraceCheckUtils]: 14: Hoare triple {18282#true} assume ~m % 4294967296 >= 33554432; {18282#true} is VALID [2022-02-21 03:10:10,834 INFO L290 TraceCheckUtils]: 13: Hoare triple {18282#true} assume !false; {18282#true} is VALID [2022-02-21 03:10:10,834 INFO L290 TraceCheckUtils]: 12: Hoare triple {18282#true} assume !(~m % 4294967296 < 16777216); {18282#true} is VALID [2022-02-21 03:10:10,834 INFO L290 TraceCheckUtils]: 11: Hoare triple {18282#true} assume !(0 == ~m % 4294967296); {18282#true} is VALID [2022-02-21 03:10:10,834 INFO L290 TraceCheckUtils]: 10: Hoare triple {18282#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18282#true} is VALID [2022-02-21 03:10:10,834 INFO L272 TraceCheckUtils]: 9: Hoare triple {18282#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {18282#true} is VALID [2022-02-21 03:10:10,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {18282#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {18282#true} is VALID [2022-02-21 03:10:10,835 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {18282#true} {18282#true} #448#return; {18282#true} is VALID [2022-02-21 03:10:10,835 INFO L290 TraceCheckUtils]: 6: Hoare triple {18282#true} assume true; {18282#true} is VALID [2022-02-21 03:10:10,835 INFO L290 TraceCheckUtils]: 5: Hoare triple {18282#true} #res := ~__retres4~0; {18282#true} is VALID [2022-02-21 03:10:10,835 INFO L290 TraceCheckUtils]: 4: Hoare triple {18282#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {18282#true} is VALID [2022-02-21 03:10:10,835 INFO L290 TraceCheckUtils]: 3: Hoare triple {18282#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18282#true} is VALID [2022-02-21 03:10:10,835 INFO L272 TraceCheckUtils]: 2: Hoare triple {18282#true} call main_#t~ret22#1 := base2flt(0, 0); {18282#true} is VALID [2022-02-21 03:10:10,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {18282#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {18282#true} is VALID [2022-02-21 03:10:10,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {18282#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); {18282#true} is VALID [2022-02-21 03:10:10,835 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:10,836 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075796922] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:10:10,836 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:10:10,836 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 14 [2022-02-21 03:10:10,836 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615798088] [2022-02-21 03:10:10,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:10:10,836 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 12 states have internal predecessors, (62), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 46 [2022-02-21 03:10:10,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:10,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 12 states have internal predecessors, (62), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:10:10,891 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:10,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-21 03:10:10,892 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:10,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-21 03:10:10,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-02-21 03:10:10,892 INFO L87 Difference]: Start difference. First operand 135 states and 170 transitions. Second operand has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 12 states have internal predecessors, (62), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:10:12,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:12,275 INFO L93 Difference]: Finished difference Result 283 states and 350 transitions. [2022-02-21 03:10:12,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 03:10:12,276 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 12 states have internal predecessors, (62), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 46 [2022-02-21 03:10:12,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:12,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 12 states have internal predecessors, (62), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:10:12,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 286 transitions. [2022-02-21 03:10:12,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 12 states have internal predecessors, (62), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:10:12,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 286 transitions. [2022-02-21 03:10:12,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 286 transitions. [2022-02-21 03:10:12,515 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 286 edges. 286 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:12,518 INFO L225 Difference]: With dead ends: 283 [2022-02-21 03:10:12,518 INFO L226 Difference]: Without dead ends: 227 [2022-02-21 03:10:12,519 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2022-02-21 03:10:12,519 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 244 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:12,519 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 1233 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 03:10:12,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-02-21 03:10:12,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 156. [2022-02-21 03:10:12,599 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:12,599 INFO L82 GeneralOperation]: Start isEquivalent. First operand 227 states. Second operand has 156 states, 134 states have (on average 1.335820895522388) internal successors, (179), 143 states have internal predecessors, (179), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-21 03:10:12,599 INFO L74 IsIncluded]: Start isIncluded. First operand 227 states. Second operand has 156 states, 134 states have (on average 1.335820895522388) internal successors, (179), 143 states have internal predecessors, (179), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-21 03:10:12,600 INFO L87 Difference]: Start difference. First operand 227 states. Second operand has 156 states, 134 states have (on average 1.335820895522388) internal successors, (179), 143 states have internal predecessors, (179), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-21 03:10:12,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:12,603 INFO L93 Difference]: Finished difference Result 227 states and 283 transitions. [2022-02-21 03:10:12,603 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 283 transitions. [2022-02-21 03:10:12,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:12,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:12,604 INFO L74 IsIncluded]: Start isIncluded. First operand has 156 states, 134 states have (on average 1.335820895522388) internal successors, (179), 143 states have internal predecessors, (179), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Second operand 227 states. [2022-02-21 03:10:12,604 INFO L87 Difference]: Start difference. First operand has 156 states, 134 states have (on average 1.335820895522388) internal successors, (179), 143 states have internal predecessors, (179), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Second operand 227 states. [2022-02-21 03:10:12,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:12,607 INFO L93 Difference]: Finished difference Result 227 states and 283 transitions. [2022-02-21 03:10:12,607 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 283 transitions. [2022-02-21 03:10:12,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:12,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:12,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:12,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:12,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 134 states have (on average 1.335820895522388) internal successors, (179), 143 states have internal predecessors, (179), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-21 03:10:12,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 194 transitions. [2022-02-21 03:10:12,610 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 194 transitions. Word has length 46 [2022-02-21 03:10:12,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:12,610 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 194 transitions. [2022-02-21 03:10:12,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 12 states have internal predecessors, (62), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:10:12,611 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 194 transitions. [2022-02-21 03:10:12,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-21 03:10:12,611 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:12,611 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, 1, 1, 1, 1] [2022-02-21 03:10:12,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-02-21 03:10:12,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-02-21 03:10:12,847 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:12,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:12,847 INFO L85 PathProgramCache]: Analyzing trace with hash -760986112, now seen corresponding path program 1 times [2022-02-21 03:10:12,848 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:12,848 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255872794] [2022-02-21 03:10:12,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:12,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:12,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:12,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:12,878 INFO L290 TraceCheckUtils]: 0: Hoare triple {19578#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {19547#true} is VALID [2022-02-21 03:10:12,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {19547#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {19547#true} is VALID [2022-02-21 03:10:12,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {19547#true} #res := ~__retres4~0; {19547#true} is VALID [2022-02-21 03:10:12,879 INFO L290 TraceCheckUtils]: 3: Hoare triple {19547#true} assume true; {19547#true} is VALID [2022-02-21 03:10:12,879 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {19547#true} {19547#true} #448#return; {19547#true} is VALID [2022-02-21 03:10:12,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:12,909 INFO L290 TraceCheckUtils]: 0: Hoare triple {19578#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {19547#true} is VALID [2022-02-21 03:10:12,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {19547#true} assume !(0 == ~m % 4294967296); {19547#true} is VALID [2022-02-21 03:10:12,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {19547#true} assume !(~m % 4294967296 < 16777216); {19547#true} is VALID [2022-02-21 03:10:12,909 INFO L290 TraceCheckUtils]: 3: Hoare triple {19547#true} assume !false; {19547#true} is VALID [2022-02-21 03:10:12,909 INFO L290 TraceCheckUtils]: 4: Hoare triple {19547#true} assume !(~m % 4294967296 >= 33554432); {19547#true} is VALID [2022-02-21 03:10:12,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {19547#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {19579#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:12,910 INFO L290 TraceCheckUtils]: 6: Hoare triple {19579#(<= base2flt_~m 0)} assume 128 + ~e <= 2147483647; {19579#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:12,910 INFO L290 TraceCheckUtils]: 7: Hoare triple {19579#(<= base2flt_~m 0)} assume 128 + ~e >= -2147483648; {19579#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:12,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {19579#(<= base2flt_~m 0)} assume 128 + ~e <= 2147483647; {19579#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:12,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {19579#(<= base2flt_~m 0)} assume 128 + ~e >= -2147483648; {19579#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:12,911 INFO L290 TraceCheckUtils]: 10: Hoare triple {19579#(<= 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; {19548#false} is VALID [2022-02-21 03:10:12,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {19548#false} ~__retres4~0 := ~res~0; {19548#false} is VALID [2022-02-21 03:10:12,911 INFO L290 TraceCheckUtils]: 12: Hoare triple {19548#false} #res := ~__retres4~0; {19548#false} is VALID [2022-02-21 03:10:12,911 INFO L290 TraceCheckUtils]: 13: Hoare triple {19548#false} assume true; {19548#false} is VALID [2022-02-21 03:10:12,911 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {19548#false} {19547#true} #450#return; {19548#false} is VALID [2022-02-21 03:10:12,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-21 03:10:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:12,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {19578#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {19547#true} is VALID [2022-02-21 03:10:12,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {19547#true} assume !(0 == ~m % 4294967296); {19547#true} is VALID [2022-02-21 03:10:12,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {19547#true} assume !(~m % 4294967296 < 16777216); {19547#true} is VALID [2022-02-21 03:10:12,916 INFO L290 TraceCheckUtils]: 3: Hoare triple {19547#true} assume !false; {19547#true} is VALID [2022-02-21 03:10:12,916 INFO L290 TraceCheckUtils]: 4: Hoare triple {19547#true} assume ~m % 4294967296 >= 33554432; {19547#true} is VALID [2022-02-21 03:10:12,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {19547#true} assume ~e >= 127;~__retres4~0 := 4294967295; {19547#true} is VALID [2022-02-21 03:10:12,916 INFO L290 TraceCheckUtils]: 6: Hoare triple {19547#true} #res := ~__retres4~0; {19547#true} is VALID [2022-02-21 03:10:12,916 INFO L290 TraceCheckUtils]: 7: Hoare triple {19547#true} assume true; {19547#true} is VALID [2022-02-21 03:10:12,916 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {19547#true} {19548#false} #452#return; {19548#false} is VALID [2022-02-21 03:10:12,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {19547#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); {19547#true} is VALID [2022-02-21 03:10:12,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {19547#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {19547#true} is VALID [2022-02-21 03:10:12,917 INFO L272 TraceCheckUtils]: 2: Hoare triple {19547#true} call main_#t~ret22#1 := base2flt(0, 0); {19578#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:12,917 INFO L290 TraceCheckUtils]: 3: Hoare triple {19578#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {19547#true} is VALID [2022-02-21 03:10:12,917 INFO L290 TraceCheckUtils]: 4: Hoare triple {19547#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {19547#true} is VALID [2022-02-21 03:10:12,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {19547#true} #res := ~__retres4~0; {19547#true} is VALID [2022-02-21 03:10:12,917 INFO L290 TraceCheckUtils]: 6: Hoare triple {19547#true} assume true; {19547#true} is VALID [2022-02-21 03:10:12,917 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {19547#true} {19547#true} #448#return; {19547#true} is VALID [2022-02-21 03:10:12,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {19547#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {19547#true} is VALID [2022-02-21 03:10:12,918 INFO L272 TraceCheckUtils]: 9: Hoare triple {19547#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {19578#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:12,918 INFO L290 TraceCheckUtils]: 10: Hoare triple {19578#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {19547#true} is VALID [2022-02-21 03:10:12,918 INFO L290 TraceCheckUtils]: 11: Hoare triple {19547#true} assume !(0 == ~m % 4294967296); {19547#true} is VALID [2022-02-21 03:10:12,918 INFO L290 TraceCheckUtils]: 12: Hoare triple {19547#true} assume !(~m % 4294967296 < 16777216); {19547#true} is VALID [2022-02-21 03:10:12,918 INFO L290 TraceCheckUtils]: 13: Hoare triple {19547#true} assume !false; {19547#true} is VALID [2022-02-21 03:10:12,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {19547#true} assume !(~m % 4294967296 >= 33554432); {19547#true} is VALID [2022-02-21 03:10:12,919 INFO L290 TraceCheckUtils]: 15: Hoare triple {19547#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {19579#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:12,919 INFO L290 TraceCheckUtils]: 16: Hoare triple {19579#(<= base2flt_~m 0)} assume 128 + ~e <= 2147483647; {19579#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:12,919 INFO L290 TraceCheckUtils]: 17: Hoare triple {19579#(<= base2flt_~m 0)} assume 128 + ~e >= -2147483648; {19579#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:12,920 INFO L290 TraceCheckUtils]: 18: Hoare triple {19579#(<= base2flt_~m 0)} assume 128 + ~e <= 2147483647; {19579#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:12,920 INFO L290 TraceCheckUtils]: 19: Hoare triple {19579#(<= base2flt_~m 0)} assume 128 + ~e >= -2147483648; {19579#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:12,920 INFO L290 TraceCheckUtils]: 20: Hoare triple {19579#(<= 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; {19548#false} is VALID [2022-02-21 03:10:12,920 INFO L290 TraceCheckUtils]: 21: Hoare triple {19548#false} ~__retres4~0 := ~res~0; {19548#false} is VALID [2022-02-21 03:10:12,920 INFO L290 TraceCheckUtils]: 22: Hoare triple {19548#false} #res := ~__retres4~0; {19548#false} is VALID [2022-02-21 03:10:12,920 INFO L290 TraceCheckUtils]: 23: Hoare triple {19548#false} assume true; {19548#false} is VALID [2022-02-21 03:10:12,921 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {19548#false} {19547#true} #450#return; {19548#false} is VALID [2022-02-21 03:10:12,921 INFO L290 TraceCheckUtils]: 25: Hoare triple {19548#false} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {19548#false} is VALID [2022-02-21 03:10:12,921 INFO L272 TraceCheckUtils]: 26: Hoare triple {19548#false} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {19578#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:12,921 INFO L290 TraceCheckUtils]: 27: Hoare triple {19578#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {19547#true} is VALID [2022-02-21 03:10:12,921 INFO L290 TraceCheckUtils]: 28: Hoare triple {19547#true} assume !(0 == ~m % 4294967296); {19547#true} is VALID [2022-02-21 03:10:12,921 INFO L290 TraceCheckUtils]: 29: Hoare triple {19547#true} assume !(~m % 4294967296 < 16777216); {19547#true} is VALID [2022-02-21 03:10:12,921 INFO L290 TraceCheckUtils]: 30: Hoare triple {19547#true} assume !false; {19547#true} is VALID [2022-02-21 03:10:12,921 INFO L290 TraceCheckUtils]: 31: Hoare triple {19547#true} assume ~m % 4294967296 >= 33554432; {19547#true} is VALID [2022-02-21 03:10:12,921 INFO L290 TraceCheckUtils]: 32: Hoare triple {19547#true} assume ~e >= 127;~__retres4~0 := 4294967295; {19547#true} is VALID [2022-02-21 03:10:12,921 INFO L290 TraceCheckUtils]: 33: Hoare triple {19547#true} #res := ~__retres4~0; {19547#true} is VALID [2022-02-21 03:10:12,921 INFO L290 TraceCheckUtils]: 34: Hoare triple {19547#true} assume true; {19547#true} is VALID [2022-02-21 03:10:12,921 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {19547#true} {19548#false} #452#return; {19548#false} is VALID [2022-02-21 03:10:12,921 INFO L290 TraceCheckUtils]: 36: Hoare triple {19548#false} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {19548#false} is VALID [2022-02-21 03:10:12,922 INFO L290 TraceCheckUtils]: 37: Hoare triple {19548#false} assume !(main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {19548#false} is VALID [2022-02-21 03:10:12,922 INFO L290 TraceCheckUtils]: 38: Hoare triple {19548#false} assume main_~a~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {19548#false} is VALID [2022-02-21 03:10:12,922 INFO L290 TraceCheckUtils]: 39: Hoare triple {19548#false} main_~sa~0#1 := main_~tmp~2#1; {19548#false} is VALID [2022-02-21 03:10:12,922 INFO L290 TraceCheckUtils]: 40: Hoare triple {19548#false} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {19548#false} is VALID [2022-02-21 03:10:12,922 INFO L290 TraceCheckUtils]: 41: Hoare triple {19548#false} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {19548#false} is VALID [2022-02-21 03:10:12,922 INFO L290 TraceCheckUtils]: 42: Hoare triple {19548#false} main_~sb~0#1 := main_~tmp___0~0#1; {19548#false} is VALID [2022-02-21 03:10:12,922 INFO L290 TraceCheckUtils]: 43: Hoare triple {19548#false} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {19548#false} is VALID [2022-02-21 03:10:12,922 INFO L290 TraceCheckUtils]: 44: Hoare triple {19548#false} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {19548#false} is VALID [2022-02-21 03:10:12,922 INFO L290 TraceCheckUtils]: 45: Hoare triple {19548#false} assume !(0 == addflt_~b#1 % 4294967296); {19548#false} is VALID [2022-02-21 03:10:12,922 INFO L290 TraceCheckUtils]: 46: Hoare triple {19548#false} assume !(0 == addflt_~a#1); {19548#false} is VALID [2022-02-21 03:10:12,922 INFO L290 TraceCheckUtils]: 47: Hoare triple {19548#false} assume !false; {19548#false} is VALID [2022-02-21 03:10:12,922 INFO L290 TraceCheckUtils]: 48: Hoare triple {19548#false} assume !false; {19548#false} is VALID [2022-02-21 03:10:12,923 INFO L290 TraceCheckUtils]: 49: Hoare triple {19548#false} assume addflt_~a#1 >= 0;abs_108 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_108; {19548#false} is VALID [2022-02-21 03:10:12,923 INFO L290 TraceCheckUtils]: 50: Hoare triple {19548#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {19548#false} is VALID [2022-02-21 03:10:12,923 INFO L290 TraceCheckUtils]: 51: Hoare triple {19548#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {19548#false} is VALID [2022-02-21 03:10:12,923 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:12,923 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:12,923 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255872794] [2022-02-21 03:10:12,923 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255872794] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:12,923 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163988026] [2022-02-21 03:10:12,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:12,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:12,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:12,925 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:12,927 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:12,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:12,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:10:12,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:12,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:13,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {19547#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); {19547#true} is VALID [2022-02-21 03:10:13,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {19547#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {19547#true} is VALID [2022-02-21 03:10:13,097 INFO L272 TraceCheckUtils]: 2: Hoare triple {19547#true} call main_#t~ret22#1 := base2flt(0, 0); {19547#true} is VALID [2022-02-21 03:10:13,097 INFO L290 TraceCheckUtils]: 3: Hoare triple {19547#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {19547#true} is VALID [2022-02-21 03:10:13,097 INFO L290 TraceCheckUtils]: 4: Hoare triple {19547#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {19547#true} is VALID [2022-02-21 03:10:13,098 INFO L290 TraceCheckUtils]: 5: Hoare triple {19547#true} #res := ~__retres4~0; {19547#true} is VALID [2022-02-21 03:10:13,098 INFO L290 TraceCheckUtils]: 6: Hoare triple {19547#true} assume true; {19547#true} is VALID [2022-02-21 03:10:13,098 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {19547#true} {19547#true} #448#return; {19547#true} is VALID [2022-02-21 03:10:13,098 INFO L290 TraceCheckUtils]: 8: Hoare triple {19547#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {19547#true} is VALID [2022-02-21 03:10:13,098 INFO L272 TraceCheckUtils]: 9: Hoare triple {19547#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {19547#true} is VALID [2022-02-21 03:10:13,098 INFO L290 TraceCheckUtils]: 10: Hoare triple {19547#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {19547#true} is VALID [2022-02-21 03:10:13,098 INFO L290 TraceCheckUtils]: 11: Hoare triple {19547#true} assume !(0 == ~m % 4294967296); {19547#true} is VALID [2022-02-21 03:10:13,098 INFO L290 TraceCheckUtils]: 12: Hoare triple {19547#true} assume !(~m % 4294967296 < 16777216); {19547#true} is VALID [2022-02-21 03:10:13,099 INFO L290 TraceCheckUtils]: 13: Hoare triple {19547#true} assume !false; {19547#true} is VALID [2022-02-21 03:10:13,099 INFO L290 TraceCheckUtils]: 14: Hoare triple {19547#true} assume !(~m % 4294967296 >= 33554432); {19547#true} is VALID [2022-02-21 03:10:13,099 INFO L290 TraceCheckUtils]: 15: Hoare triple {19547#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {19579#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:13,099 INFO L290 TraceCheckUtils]: 16: Hoare triple {19579#(<= base2flt_~m 0)} assume 128 + ~e <= 2147483647; {19579#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:13,100 INFO L290 TraceCheckUtils]: 17: Hoare triple {19579#(<= base2flt_~m 0)} assume 128 + ~e >= -2147483648; {19579#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:13,100 INFO L290 TraceCheckUtils]: 18: Hoare triple {19579#(<= base2flt_~m 0)} assume 128 + ~e <= 2147483647; {19579#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:13,100 INFO L290 TraceCheckUtils]: 19: Hoare triple {19579#(<= base2flt_~m 0)} assume 128 + ~e >= -2147483648; {19579#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:13,101 INFO L290 TraceCheckUtils]: 20: Hoare triple {19579#(<= 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; {19548#false} is VALID [2022-02-21 03:10:13,101 INFO L290 TraceCheckUtils]: 21: Hoare triple {19548#false} ~__retres4~0 := ~res~0; {19548#false} is VALID [2022-02-21 03:10:13,101 INFO L290 TraceCheckUtils]: 22: Hoare triple {19548#false} #res := ~__retres4~0; {19548#false} is VALID [2022-02-21 03:10:13,101 INFO L290 TraceCheckUtils]: 23: Hoare triple {19548#false} assume true; {19548#false} is VALID [2022-02-21 03:10:13,101 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {19548#false} {19547#true} #450#return; {19548#false} is VALID [2022-02-21 03:10:13,101 INFO L290 TraceCheckUtils]: 25: Hoare triple {19548#false} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {19548#false} is VALID [2022-02-21 03:10:13,102 INFO L272 TraceCheckUtils]: 26: Hoare triple {19548#false} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {19548#false} is VALID [2022-02-21 03:10:13,102 INFO L290 TraceCheckUtils]: 27: Hoare triple {19548#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {19548#false} is VALID [2022-02-21 03:10:13,102 INFO L290 TraceCheckUtils]: 28: Hoare triple {19548#false} assume !(0 == ~m % 4294967296); {19548#false} is VALID [2022-02-21 03:10:13,102 INFO L290 TraceCheckUtils]: 29: Hoare triple {19548#false} assume !(~m % 4294967296 < 16777216); {19548#false} is VALID [2022-02-21 03:10:13,102 INFO L290 TraceCheckUtils]: 30: Hoare triple {19548#false} assume !false; {19548#false} is VALID [2022-02-21 03:10:13,102 INFO L290 TraceCheckUtils]: 31: Hoare triple {19548#false} assume ~m % 4294967296 >= 33554432; {19548#false} is VALID [2022-02-21 03:10:13,102 INFO L290 TraceCheckUtils]: 32: Hoare triple {19548#false} assume ~e >= 127;~__retres4~0 := 4294967295; {19548#false} is VALID [2022-02-21 03:10:13,102 INFO L290 TraceCheckUtils]: 33: Hoare triple {19548#false} #res := ~__retres4~0; {19548#false} is VALID [2022-02-21 03:10:13,103 INFO L290 TraceCheckUtils]: 34: Hoare triple {19548#false} assume true; {19548#false} is VALID [2022-02-21 03:10:13,103 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {19548#false} {19548#false} #452#return; {19548#false} is VALID [2022-02-21 03:10:13,103 INFO L290 TraceCheckUtils]: 36: Hoare triple {19548#false} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {19548#false} is VALID [2022-02-21 03:10:13,103 INFO L290 TraceCheckUtils]: 37: Hoare triple {19548#false} assume !(main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {19548#false} is VALID [2022-02-21 03:10:13,103 INFO L290 TraceCheckUtils]: 38: Hoare triple {19548#false} assume main_~a~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {19548#false} is VALID [2022-02-21 03:10:13,103 INFO L290 TraceCheckUtils]: 39: Hoare triple {19548#false} main_~sa~0#1 := main_~tmp~2#1; {19548#false} is VALID [2022-02-21 03:10:13,103 INFO L290 TraceCheckUtils]: 40: Hoare triple {19548#false} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {19548#false} is VALID [2022-02-21 03:10:13,103 INFO L290 TraceCheckUtils]: 41: Hoare triple {19548#false} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {19548#false} is VALID [2022-02-21 03:10:13,103 INFO L290 TraceCheckUtils]: 42: Hoare triple {19548#false} main_~sb~0#1 := main_~tmp___0~0#1; {19548#false} is VALID [2022-02-21 03:10:13,104 INFO L290 TraceCheckUtils]: 43: Hoare triple {19548#false} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {19548#false} is VALID [2022-02-21 03:10:13,104 INFO L290 TraceCheckUtils]: 44: Hoare triple {19548#false} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {19548#false} is VALID [2022-02-21 03:10:13,104 INFO L290 TraceCheckUtils]: 45: Hoare triple {19548#false} assume !(0 == addflt_~b#1 % 4294967296); {19548#false} is VALID [2022-02-21 03:10:13,104 INFO L290 TraceCheckUtils]: 46: Hoare triple {19548#false} assume !(0 == addflt_~a#1); {19548#false} is VALID [2022-02-21 03:10:13,104 INFO L290 TraceCheckUtils]: 47: Hoare triple {19548#false} assume !false; {19548#false} is VALID [2022-02-21 03:10:13,104 INFO L290 TraceCheckUtils]: 48: Hoare triple {19548#false} assume !false; {19548#false} is VALID [2022-02-21 03:10:13,104 INFO L290 TraceCheckUtils]: 49: Hoare triple {19548#false} assume addflt_~a#1 >= 0;abs_108 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_108; {19548#false} is VALID [2022-02-21 03:10:13,104 INFO L290 TraceCheckUtils]: 50: Hoare triple {19548#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {19548#false} is VALID [2022-02-21 03:10:13,105 INFO L290 TraceCheckUtils]: 51: Hoare triple {19548#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {19548#false} is VALID [2022-02-21 03:10:13,105 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:13,105 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:10:13,105 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163988026] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:13,105 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:10:13,105 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2022-02-21 03:10:13,105 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901838726] [2022-02-21 03:10:13,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:13,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 52 [2022-02-21 03:10:13,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:13,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:13,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:13,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:10:13,147 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:13,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:10:13,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:10:13,147 INFO L87 Difference]: Start difference. First operand 156 states and 194 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:13,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:13,360 INFO L93 Difference]: Finished difference Result 296 states and 370 transitions. [2022-02-21 03:10:13,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:10:13,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 52 [2022-02-21 03:10:13,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:13,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:13,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 261 transitions. [2022-02-21 03:10:13,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:13,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 261 transitions. [2022-02-21 03:10:13,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 261 transitions. [2022-02-21 03:10:13,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:13,549 INFO L225 Difference]: With dead ends: 296 [2022-02-21 03:10:13,549 INFO L226 Difference]: Without dead ends: 180 [2022-02-21 03:10:13,550 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 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:13,551 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 10 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 222 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:13,551 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 222 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:13,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-02-21 03:10:13,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 166. [2022-02-21 03:10:13,614 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:13,615 INFO L82 GeneralOperation]: Start isEquivalent. First operand 180 states. Second operand has 166 states, 144 states have (on average 1.3125) internal successors, (189), 153 states have internal predecessors, (189), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-21 03:10:13,615 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand has 166 states, 144 states have (on average 1.3125) internal successors, (189), 153 states have internal predecessors, (189), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-21 03:10:13,615 INFO L87 Difference]: Start difference. First operand 180 states. Second operand has 166 states, 144 states have (on average 1.3125) internal successors, (189), 153 states have internal predecessors, (189), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-21 03:10:13,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:13,617 INFO L93 Difference]: Finished difference Result 180 states and 225 transitions. [2022-02-21 03:10:13,617 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 225 transitions. [2022-02-21 03:10:13,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:13,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:13,619 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 144 states have (on average 1.3125) internal successors, (189), 153 states have internal predecessors, (189), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Second operand 180 states. [2022-02-21 03:10:13,619 INFO L87 Difference]: Start difference. First operand has 166 states, 144 states have (on average 1.3125) internal successors, (189), 153 states have internal predecessors, (189), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Second operand 180 states. [2022-02-21 03:10:13,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:13,622 INFO L93 Difference]: Finished difference Result 180 states and 225 transitions. [2022-02-21 03:10:13,622 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 225 transitions. [2022-02-21 03:10:13,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:13,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:13,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:13,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:13,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 144 states have (on average 1.3125) internal successors, (189), 153 states have internal predecessors, (189), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-21 03:10:13,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 204 transitions. [2022-02-21 03:10:13,640 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 204 transitions. Word has length 52 [2022-02-21 03:10:13,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:13,640 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 204 transitions. [2022-02-21 03:10:13,640 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:13,641 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 204 transitions. [2022-02-21 03:10:13,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-21 03:10:13,642 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:13,642 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, 1, 1, 1, 1, 1] [2022-02-21 03:10:13,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-02-21 03:10:13,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:13,855 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:13,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:13,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1055930893, now seen corresponding path program 1 times [2022-02-21 03:10:13,856 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:13,856 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582998440] [2022-02-21 03:10:13,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:13,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:13,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:13,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:13,928 INFO L290 TraceCheckUtils]: 0: Hoare triple {20648#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20612#true} is VALID [2022-02-21 03:10:13,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {20612#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {20612#true} is VALID [2022-02-21 03:10:13,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {20612#true} #res := ~__retres4~0; {20612#true} is VALID [2022-02-21 03:10:13,928 INFO L290 TraceCheckUtils]: 3: Hoare triple {20612#true} assume true; {20612#true} is VALID [2022-02-21 03:10:13,928 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {20612#true} {20612#true} #448#return; {20612#true} is VALID [2022-02-21 03:10:13,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:13,966 INFO L290 TraceCheckUtils]: 0: Hoare triple {20648#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20612#true} is VALID [2022-02-21 03:10:13,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {20612#true} assume !(0 == ~m % 4294967296); {20612#true} is VALID [2022-02-21 03:10:13,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {20612#true} assume !(~m % 4294967296 < 16777216); {20612#true} is VALID [2022-02-21 03:10:13,967 INFO L290 TraceCheckUtils]: 3: Hoare triple {20612#true} assume !false; {20612#true} is VALID [2022-02-21 03:10:13,967 INFO L290 TraceCheckUtils]: 4: Hoare triple {20612#true} assume !(~m % 4294967296 >= 33554432); {20612#true} is VALID [2022-02-21 03:10:13,967 INFO L290 TraceCheckUtils]: 5: Hoare triple {20612#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {20612#true} is VALID [2022-02-21 03:10:13,967 INFO L290 TraceCheckUtils]: 6: Hoare triple {20612#true} assume 128 + ~e <= 2147483647; {20612#true} is VALID [2022-02-21 03:10:13,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {20612#true} assume 128 + ~e >= -2147483648; {20612#true} is VALID [2022-02-21 03:10:13,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {20612#true} assume 128 + ~e <= 2147483647; {20612#true} is VALID [2022-02-21 03:10:13,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {20612#true} assume 128 + ~e >= -2147483648; {20612#true} is VALID [2022-02-21 03:10:13,968 INFO L290 TraceCheckUtils]: 10: Hoare triple {20612#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {20612#true} is VALID [2022-02-21 03:10:13,968 INFO L290 TraceCheckUtils]: 11: Hoare triple {20612#true} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {20649#(<= base2flt_~res~0 0)} is VALID [2022-02-21 03:10:13,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {20649#(<= base2flt_~res~0 0)} ~__retres4~0 := ~res~0; {20650#(<= base2flt_~__retres4~0 0)} is VALID [2022-02-21 03:10:13,969 INFO L290 TraceCheckUtils]: 13: Hoare triple {20650#(<= base2flt_~__retres4~0 0)} #res := ~__retres4~0; {20651#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:10:13,969 INFO L290 TraceCheckUtils]: 14: Hoare triple {20651#(<= |base2flt_#res| 0)} assume true; {20651#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:10:13,970 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20651#(<= |base2flt_#res| 0)} {20612#true} #450#return; {20635#(<= |ULTIMATE.start_main_#t~ret23#1| 0)} is VALID [2022-02-21 03:10:13,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-21 03:10:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:13,976 INFO L290 TraceCheckUtils]: 0: Hoare triple {20648#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20612#true} is VALID [2022-02-21 03:10:13,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {20612#true} assume !(0 == ~m % 4294967296); {20612#true} is VALID [2022-02-21 03:10:13,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {20612#true} assume !(~m % 4294967296 < 16777216); {20612#true} is VALID [2022-02-21 03:10:13,977 INFO L290 TraceCheckUtils]: 3: Hoare triple {20612#true} assume !false; {20612#true} is VALID [2022-02-21 03:10:13,977 INFO L290 TraceCheckUtils]: 4: Hoare triple {20612#true} assume ~m % 4294967296 >= 33554432; {20612#true} is VALID [2022-02-21 03:10:13,977 INFO L290 TraceCheckUtils]: 5: Hoare triple {20612#true} assume ~e >= 127;~__retres4~0 := 4294967295; {20612#true} is VALID [2022-02-21 03:10:13,977 INFO L290 TraceCheckUtils]: 6: Hoare triple {20612#true} #res := ~__retres4~0; {20612#true} is VALID [2022-02-21 03:10:13,977 INFO L290 TraceCheckUtils]: 7: Hoare triple {20612#true} assume true; {20612#true} is VALID [2022-02-21 03:10:13,978 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {20612#true} {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} #452#return; {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:13,978 INFO L290 TraceCheckUtils]: 0: Hoare triple {20612#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); {20612#true} is VALID [2022-02-21 03:10:13,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {20612#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {20612#true} is VALID [2022-02-21 03:10:13,979 INFO L272 TraceCheckUtils]: 2: Hoare triple {20612#true} call main_#t~ret22#1 := base2flt(0, 0); {20648#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:13,979 INFO L290 TraceCheckUtils]: 3: Hoare triple {20648#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20612#true} is VALID [2022-02-21 03:10:13,979 INFO L290 TraceCheckUtils]: 4: Hoare triple {20612#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {20612#true} is VALID [2022-02-21 03:10:13,979 INFO L290 TraceCheckUtils]: 5: Hoare triple {20612#true} #res := ~__retres4~0; {20612#true} is VALID [2022-02-21 03:10:13,979 INFO L290 TraceCheckUtils]: 6: Hoare triple {20612#true} assume true; {20612#true} is VALID [2022-02-21 03:10:13,979 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {20612#true} {20612#true} #448#return; {20612#true} is VALID [2022-02-21 03:10:13,979 INFO L290 TraceCheckUtils]: 8: Hoare triple {20612#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {20612#true} is VALID [2022-02-21 03:10:13,980 INFO L272 TraceCheckUtils]: 9: Hoare triple {20612#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {20648#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:13,980 INFO L290 TraceCheckUtils]: 10: Hoare triple {20648#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20612#true} is VALID [2022-02-21 03:10:13,980 INFO L290 TraceCheckUtils]: 11: Hoare triple {20612#true} assume !(0 == ~m % 4294967296); {20612#true} is VALID [2022-02-21 03:10:13,980 INFO L290 TraceCheckUtils]: 12: Hoare triple {20612#true} assume !(~m % 4294967296 < 16777216); {20612#true} is VALID [2022-02-21 03:10:13,981 INFO L290 TraceCheckUtils]: 13: Hoare triple {20612#true} assume !false; {20612#true} is VALID [2022-02-21 03:10:13,981 INFO L290 TraceCheckUtils]: 14: Hoare triple {20612#true} assume !(~m % 4294967296 >= 33554432); {20612#true} is VALID [2022-02-21 03:10:13,981 INFO L290 TraceCheckUtils]: 15: Hoare triple {20612#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {20612#true} is VALID [2022-02-21 03:10:13,981 INFO L290 TraceCheckUtils]: 16: Hoare triple {20612#true} assume 128 + ~e <= 2147483647; {20612#true} is VALID [2022-02-21 03:10:13,981 INFO L290 TraceCheckUtils]: 17: Hoare triple {20612#true} assume 128 + ~e >= -2147483648; {20612#true} is VALID [2022-02-21 03:10:13,981 INFO L290 TraceCheckUtils]: 18: Hoare triple {20612#true} assume 128 + ~e <= 2147483647; {20612#true} is VALID [2022-02-21 03:10:13,981 INFO L290 TraceCheckUtils]: 19: Hoare triple {20612#true} assume 128 + ~e >= -2147483648; {20612#true} is VALID [2022-02-21 03:10:13,981 INFO L290 TraceCheckUtils]: 20: Hoare triple {20612#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {20612#true} is VALID [2022-02-21 03:10:13,982 INFO L290 TraceCheckUtils]: 21: Hoare triple {20612#true} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {20649#(<= base2flt_~res~0 0)} is VALID [2022-02-21 03:10:13,982 INFO L290 TraceCheckUtils]: 22: Hoare triple {20649#(<= base2flt_~res~0 0)} ~__retres4~0 := ~res~0; {20650#(<= base2flt_~__retres4~0 0)} is VALID [2022-02-21 03:10:13,982 INFO L290 TraceCheckUtils]: 23: Hoare triple {20650#(<= base2flt_~__retres4~0 0)} #res := ~__retres4~0; {20651#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:10:13,983 INFO L290 TraceCheckUtils]: 24: Hoare triple {20651#(<= |base2flt_#res| 0)} assume true; {20651#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:10:13,983 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {20651#(<= |base2flt_#res| 0)} {20612#true} #450#return; {20635#(<= |ULTIMATE.start_main_#t~ret23#1| 0)} is VALID [2022-02-21 03:10:13,984 INFO L290 TraceCheckUtils]: 26: Hoare triple {20635#(<= |ULTIMATE.start_main_#t~ret23#1| 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:13,984 INFO L272 TraceCheckUtils]: 27: Hoare triple {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {20648#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:13,984 INFO L290 TraceCheckUtils]: 28: Hoare triple {20648#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20612#true} is VALID [2022-02-21 03:10:13,984 INFO L290 TraceCheckUtils]: 29: Hoare triple {20612#true} assume !(0 == ~m % 4294967296); {20612#true} is VALID [2022-02-21 03:10:13,985 INFO L290 TraceCheckUtils]: 30: Hoare triple {20612#true} assume !(~m % 4294967296 < 16777216); {20612#true} is VALID [2022-02-21 03:10:13,985 INFO L290 TraceCheckUtils]: 31: Hoare triple {20612#true} assume !false; {20612#true} is VALID [2022-02-21 03:10:13,985 INFO L290 TraceCheckUtils]: 32: Hoare triple {20612#true} assume ~m % 4294967296 >= 33554432; {20612#true} is VALID [2022-02-21 03:10:13,985 INFO L290 TraceCheckUtils]: 33: Hoare triple {20612#true} assume ~e >= 127;~__retres4~0 := 4294967295; {20612#true} is VALID [2022-02-21 03:10:13,985 INFO L290 TraceCheckUtils]: 34: Hoare triple {20612#true} #res := ~__retres4~0; {20612#true} is VALID [2022-02-21 03:10:13,985 INFO L290 TraceCheckUtils]: 35: Hoare triple {20612#true} assume true; {20612#true} is VALID [2022-02-21 03:10:13,986 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {20612#true} {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} #452#return; {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:13,986 INFO L290 TraceCheckUtils]: 37: Hoare triple {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:13,986 INFO L290 TraceCheckUtils]: 38: Hoare triple {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume !(main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:13,987 INFO L290 TraceCheckUtils]: 39: Hoare triple {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume main_~a~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:13,987 INFO L290 TraceCheckUtils]: 40: Hoare triple {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_~sa~0#1 := main_~tmp~2#1; {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:13,987 INFO L290 TraceCheckUtils]: 41: Hoare triple {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:13,987 INFO L290 TraceCheckUtils]: 42: Hoare triple {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:13,988 INFO L290 TraceCheckUtils]: 43: Hoare triple {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_~sb~0#1 := main_~tmp___0~0#1; {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:13,988 INFO L290 TraceCheckUtils]: 44: Hoare triple {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {20646#(<= |ULTIMATE.start_addflt_~a#1| 0)} is VALID [2022-02-21 03:10:13,988 INFO L290 TraceCheckUtils]: 45: Hoare triple {20646#(<= |ULTIMATE.start_addflt_~a#1| 0)} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {20646#(<= |ULTIMATE.start_addflt_~a#1| 0)} is VALID [2022-02-21 03:10:13,989 INFO L290 TraceCheckUtils]: 46: Hoare triple {20646#(<= |ULTIMATE.start_addflt_~a#1| 0)} assume !(0 == addflt_~b#1 % 4294967296); {20646#(<= |ULTIMATE.start_addflt_~a#1| 0)} is VALID [2022-02-21 03:10:13,989 INFO L290 TraceCheckUtils]: 47: Hoare triple {20646#(<= |ULTIMATE.start_addflt_~a#1| 0)} assume !(0 == addflt_~a#1); {20647#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} is VALID [2022-02-21 03:10:13,989 INFO L290 TraceCheckUtils]: 48: Hoare triple {20647#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} assume !false; {20647#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} is VALID [2022-02-21 03:10:13,990 INFO L290 TraceCheckUtils]: 49: Hoare triple {20647#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} assume !false; {20647#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} is VALID [2022-02-21 03:10:13,990 INFO L290 TraceCheckUtils]: 50: Hoare triple {20647#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} assume addflt_~a#1 >= 0;abs_108 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_108; {20613#false} is VALID [2022-02-21 03:10:13,991 INFO L290 TraceCheckUtils]: 51: Hoare triple {20613#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {20613#false} is VALID [2022-02-21 03:10:13,991 INFO L290 TraceCheckUtils]: 52: Hoare triple {20613#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {20613#false} is VALID [2022-02-21 03:10:13,991 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:13,991 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:13,991 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582998440] [2022-02-21 03:10:13,991 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582998440] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:13,992 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787501281] [2022-02-21 03:10:13,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:13,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:13,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:13,993 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:10:13,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-02-21 03:10:14,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:14,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:10:14,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:14,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:14,314 INFO L290 TraceCheckUtils]: 0: Hoare triple {20612#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); {20612#true} is VALID [2022-02-21 03:10:14,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {20612#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {20612#true} is VALID [2022-02-21 03:10:14,315 INFO L272 TraceCheckUtils]: 2: Hoare triple {20612#true} call main_#t~ret22#1 := base2flt(0, 0); {20612#true} is VALID [2022-02-21 03:10:14,315 INFO L290 TraceCheckUtils]: 3: Hoare triple {20612#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20612#true} is VALID [2022-02-21 03:10:14,315 INFO L290 TraceCheckUtils]: 4: Hoare triple {20612#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {20612#true} is VALID [2022-02-21 03:10:14,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {20612#true} #res := ~__retres4~0; {20612#true} is VALID [2022-02-21 03:10:14,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {20612#true} assume true; {20612#true} is VALID [2022-02-21 03:10:14,315 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {20612#true} {20612#true} #448#return; {20612#true} is VALID [2022-02-21 03:10:14,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {20612#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {20612#true} is VALID [2022-02-21 03:10:14,315 INFO L272 TraceCheckUtils]: 9: Hoare triple {20612#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {20612#true} is VALID [2022-02-21 03:10:14,316 INFO L290 TraceCheckUtils]: 10: Hoare triple {20612#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20612#true} is VALID [2022-02-21 03:10:14,316 INFO L290 TraceCheckUtils]: 11: Hoare triple {20612#true} assume !(0 == ~m % 4294967296); {20612#true} is VALID [2022-02-21 03:10:14,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {20612#true} assume !(~m % 4294967296 < 16777216); {20612#true} is VALID [2022-02-21 03:10:14,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {20612#true} assume !false; {20612#true} is VALID [2022-02-21 03:10:14,316 INFO L290 TraceCheckUtils]: 14: Hoare triple {20612#true} assume !(~m % 4294967296 >= 33554432); {20612#true} is VALID [2022-02-21 03:10:14,316 INFO L290 TraceCheckUtils]: 15: Hoare triple {20612#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {20612#true} is VALID [2022-02-21 03:10:14,316 INFO L290 TraceCheckUtils]: 16: Hoare triple {20612#true} assume 128 + ~e <= 2147483647; {20612#true} is VALID [2022-02-21 03:10:14,316 INFO L290 TraceCheckUtils]: 17: Hoare triple {20612#true} assume 128 + ~e >= -2147483648; {20612#true} is VALID [2022-02-21 03:10:14,317 INFO L290 TraceCheckUtils]: 18: Hoare triple {20612#true} assume 128 + ~e <= 2147483647; {20612#true} is VALID [2022-02-21 03:10:14,317 INFO L290 TraceCheckUtils]: 19: Hoare triple {20612#true} assume 128 + ~e >= -2147483648; {20612#true} is VALID [2022-02-21 03:10:14,317 INFO L290 TraceCheckUtils]: 20: Hoare triple {20612#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {20612#true} is VALID [2022-02-21 03:10:14,317 INFO L290 TraceCheckUtils]: 21: Hoare triple {20612#true} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {20649#(<= base2flt_~res~0 0)} is VALID [2022-02-21 03:10:14,318 INFO L290 TraceCheckUtils]: 22: Hoare triple {20649#(<= base2flt_~res~0 0)} ~__retres4~0 := ~res~0; {20650#(<= base2flt_~__retres4~0 0)} is VALID [2022-02-21 03:10:14,318 INFO L290 TraceCheckUtils]: 23: Hoare triple {20650#(<= base2flt_~__retres4~0 0)} #res := ~__retres4~0; {20651#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:10:14,318 INFO L290 TraceCheckUtils]: 24: Hoare triple {20651#(<= |base2flt_#res| 0)} assume true; {20651#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:10:14,319 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {20651#(<= |base2flt_#res| 0)} {20612#true} #450#return; {20635#(<= |ULTIMATE.start_main_#t~ret23#1| 0)} is VALID [2022-02-21 03:10:14,319 INFO L290 TraceCheckUtils]: 26: Hoare triple {20635#(<= |ULTIMATE.start_main_#t~ret23#1| 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:14,319 INFO L272 TraceCheckUtils]: 27: Hoare triple {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {20612#true} is VALID [2022-02-21 03:10:14,320 INFO L290 TraceCheckUtils]: 28: Hoare triple {20612#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20612#true} is VALID [2022-02-21 03:10:14,320 INFO L290 TraceCheckUtils]: 29: Hoare triple {20612#true} assume !(0 == ~m % 4294967296); {20612#true} is VALID [2022-02-21 03:10:14,320 INFO L290 TraceCheckUtils]: 30: Hoare triple {20612#true} assume !(~m % 4294967296 < 16777216); {20612#true} is VALID [2022-02-21 03:10:14,320 INFO L290 TraceCheckUtils]: 31: Hoare triple {20612#true} assume !false; {20612#true} is VALID [2022-02-21 03:10:14,320 INFO L290 TraceCheckUtils]: 32: Hoare triple {20612#true} assume ~m % 4294967296 >= 33554432; {20612#true} is VALID [2022-02-21 03:10:14,320 INFO L290 TraceCheckUtils]: 33: Hoare triple {20612#true} assume ~e >= 127;~__retres4~0 := 4294967295; {20612#true} is VALID [2022-02-21 03:10:14,320 INFO L290 TraceCheckUtils]: 34: Hoare triple {20612#true} #res := ~__retres4~0; {20612#true} is VALID [2022-02-21 03:10:14,320 INFO L290 TraceCheckUtils]: 35: Hoare triple {20612#true} assume true; {20612#true} is VALID [2022-02-21 03:10:14,321 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {20612#true} {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} #452#return; {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:14,321 INFO L290 TraceCheckUtils]: 37: Hoare triple {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:14,322 INFO L290 TraceCheckUtils]: 38: Hoare triple {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume !(main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:14,322 INFO L290 TraceCheckUtils]: 39: Hoare triple {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume main_~a~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:14,322 INFO L290 TraceCheckUtils]: 40: Hoare triple {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_~sa~0#1 := main_~tmp~2#1; {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:14,323 INFO L290 TraceCheckUtils]: 41: Hoare triple {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:14,323 INFO L290 TraceCheckUtils]: 42: Hoare triple {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:14,323 INFO L290 TraceCheckUtils]: 43: Hoare triple {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_~sb~0#1 := main_~tmp___0~0#1; {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:14,324 INFO L290 TraceCheckUtils]: 44: Hoare triple {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {20646#(<= |ULTIMATE.start_addflt_~a#1| 0)} is VALID [2022-02-21 03:10:14,324 INFO L290 TraceCheckUtils]: 45: Hoare triple {20646#(<= |ULTIMATE.start_addflt_~a#1| 0)} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {20646#(<= |ULTIMATE.start_addflt_~a#1| 0)} is VALID [2022-02-21 03:10:14,324 INFO L290 TraceCheckUtils]: 46: Hoare triple {20646#(<= |ULTIMATE.start_addflt_~a#1| 0)} assume !(0 == addflt_~b#1 % 4294967296); {20646#(<= |ULTIMATE.start_addflt_~a#1| 0)} is VALID [2022-02-21 03:10:14,325 INFO L290 TraceCheckUtils]: 47: Hoare triple {20646#(<= |ULTIMATE.start_addflt_~a#1| 0)} assume !(0 == addflt_~a#1); {20647#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} is VALID [2022-02-21 03:10:14,325 INFO L290 TraceCheckUtils]: 48: Hoare triple {20647#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} assume !false; {20647#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} is VALID [2022-02-21 03:10:14,325 INFO L290 TraceCheckUtils]: 49: Hoare triple {20647#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} assume !false; {20647#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} is VALID [2022-02-21 03:10:14,326 INFO L290 TraceCheckUtils]: 50: Hoare triple {20647#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} assume addflt_~a#1 >= 0;abs_108 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_108; {20613#false} is VALID [2022-02-21 03:10:14,326 INFO L290 TraceCheckUtils]: 51: Hoare triple {20613#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {20613#false} is VALID [2022-02-21 03:10:14,326 INFO L290 TraceCheckUtils]: 52: Hoare triple {20613#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {20613#false} is VALID [2022-02-21 03:10:14,327 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:14,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:10:14,705 INFO L290 TraceCheckUtils]: 52: Hoare triple {20613#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {20613#false} is VALID [2022-02-21 03:10:14,705 INFO L290 TraceCheckUtils]: 51: Hoare triple {20613#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {20613#false} is VALID [2022-02-21 03:10:14,706 INFO L290 TraceCheckUtils]: 50: Hoare triple {20647#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} assume addflt_~a#1 >= 0;abs_108 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_108; {20613#false} is VALID [2022-02-21 03:10:14,706 INFO L290 TraceCheckUtils]: 49: Hoare triple {20647#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} assume !false; {20647#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} is VALID [2022-02-21 03:10:14,707 INFO L290 TraceCheckUtils]: 48: Hoare triple {20647#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} assume !false; {20647#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} is VALID [2022-02-21 03:10:14,707 INFO L290 TraceCheckUtils]: 47: Hoare triple {20646#(<= |ULTIMATE.start_addflt_~a#1| 0)} assume !(0 == addflt_~a#1); {20647#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} is VALID [2022-02-21 03:10:14,708 INFO L290 TraceCheckUtils]: 46: Hoare triple {20646#(<= |ULTIMATE.start_addflt_~a#1| 0)} assume !(0 == addflt_~b#1 % 4294967296); {20646#(<= |ULTIMATE.start_addflt_~a#1| 0)} is VALID [2022-02-21 03:10:14,708 INFO L290 TraceCheckUtils]: 45: Hoare triple {20646#(<= |ULTIMATE.start_addflt_~a#1| 0)} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {20646#(<= |ULTIMATE.start_addflt_~a#1| 0)} is VALID [2022-02-21 03:10:14,708 INFO L290 TraceCheckUtils]: 44: Hoare triple {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {20646#(<= |ULTIMATE.start_addflt_~a#1| 0)} is VALID [2022-02-21 03:10:14,710 INFO L290 TraceCheckUtils]: 43: Hoare triple {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_~sb~0#1 := main_~tmp___0~0#1; {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:14,710 INFO L290 TraceCheckUtils]: 42: Hoare triple {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:14,711 INFO L290 TraceCheckUtils]: 41: Hoare triple {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:14,711 INFO L290 TraceCheckUtils]: 40: Hoare triple {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_~sa~0#1 := main_~tmp~2#1; {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:14,711 INFO L290 TraceCheckUtils]: 39: Hoare triple {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume main_~a~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:14,712 INFO L290 TraceCheckUtils]: 38: Hoare triple {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume !(main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:14,712 INFO L290 TraceCheckUtils]: 37: Hoare triple {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:14,713 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {20612#true} {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} #452#return; {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:14,713 INFO L290 TraceCheckUtils]: 35: Hoare triple {20612#true} assume true; {20612#true} is VALID [2022-02-21 03:10:14,713 INFO L290 TraceCheckUtils]: 34: Hoare triple {20612#true} #res := ~__retres4~0; {20612#true} is VALID [2022-02-21 03:10:14,713 INFO L290 TraceCheckUtils]: 33: Hoare triple {20612#true} assume ~e >= 127;~__retres4~0 := 4294967295; {20612#true} is VALID [2022-02-21 03:10:14,713 INFO L290 TraceCheckUtils]: 32: Hoare triple {20612#true} assume ~m % 4294967296 >= 33554432; {20612#true} is VALID [2022-02-21 03:10:14,714 INFO L290 TraceCheckUtils]: 31: Hoare triple {20612#true} assume !false; {20612#true} is VALID [2022-02-21 03:10:14,714 INFO L290 TraceCheckUtils]: 30: Hoare triple {20612#true} assume !(~m % 4294967296 < 16777216); {20612#true} is VALID [2022-02-21 03:10:14,714 INFO L290 TraceCheckUtils]: 29: Hoare triple {20612#true} assume !(0 == ~m % 4294967296); {20612#true} is VALID [2022-02-21 03:10:14,714 INFO L290 TraceCheckUtils]: 28: Hoare triple {20612#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20612#true} is VALID [2022-02-21 03:10:14,714 INFO L272 TraceCheckUtils]: 27: Hoare triple {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {20612#true} is VALID [2022-02-21 03:10:14,715 INFO L290 TraceCheckUtils]: 26: Hoare triple {20635#(<= |ULTIMATE.start_main_#t~ret23#1| 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {20636#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:14,715 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {20651#(<= |base2flt_#res| 0)} {20612#true} #450#return; {20635#(<= |ULTIMATE.start_main_#t~ret23#1| 0)} is VALID [2022-02-21 03:10:14,716 INFO L290 TraceCheckUtils]: 24: Hoare triple {20651#(<= |base2flt_#res| 0)} assume true; {20651#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:10:14,716 INFO L290 TraceCheckUtils]: 23: Hoare triple {20650#(<= base2flt_~__retres4~0 0)} #res := ~__retres4~0; {20651#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:10:14,717 INFO L290 TraceCheckUtils]: 22: Hoare triple {20649#(<= base2flt_~res~0 0)} ~__retres4~0 := ~res~0; {20650#(<= base2flt_~__retres4~0 0)} is VALID [2022-02-21 03:10:14,717 INFO L290 TraceCheckUtils]: 21: Hoare triple {20612#true} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {20649#(<= base2flt_~res~0 0)} is VALID [2022-02-21 03:10:14,717 INFO L290 TraceCheckUtils]: 20: Hoare triple {20612#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {20612#true} is VALID [2022-02-21 03:10:14,717 INFO L290 TraceCheckUtils]: 19: Hoare triple {20612#true} assume 128 + ~e >= -2147483648; {20612#true} is VALID [2022-02-21 03:10:14,718 INFO L290 TraceCheckUtils]: 18: Hoare triple {20612#true} assume 128 + ~e <= 2147483647; {20612#true} is VALID [2022-02-21 03:10:14,718 INFO L290 TraceCheckUtils]: 17: Hoare triple {20612#true} assume 128 + ~e >= -2147483648; {20612#true} is VALID [2022-02-21 03:10:14,718 INFO L290 TraceCheckUtils]: 16: Hoare triple {20612#true} assume 128 + ~e <= 2147483647; {20612#true} is VALID [2022-02-21 03:10:14,718 INFO L290 TraceCheckUtils]: 15: Hoare triple {20612#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {20612#true} is VALID [2022-02-21 03:10:14,718 INFO L290 TraceCheckUtils]: 14: Hoare triple {20612#true} assume !(~m % 4294967296 >= 33554432); {20612#true} is VALID [2022-02-21 03:10:14,718 INFO L290 TraceCheckUtils]: 13: Hoare triple {20612#true} assume !false; {20612#true} is VALID [2022-02-21 03:10:14,718 INFO L290 TraceCheckUtils]: 12: Hoare triple {20612#true} assume !(~m % 4294967296 < 16777216); {20612#true} is VALID [2022-02-21 03:10:14,718 INFO L290 TraceCheckUtils]: 11: Hoare triple {20612#true} assume !(0 == ~m % 4294967296); {20612#true} is VALID [2022-02-21 03:10:14,719 INFO L290 TraceCheckUtils]: 10: Hoare triple {20612#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20612#true} is VALID [2022-02-21 03:10:14,719 INFO L272 TraceCheckUtils]: 9: Hoare triple {20612#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {20612#true} is VALID [2022-02-21 03:10:14,719 INFO L290 TraceCheckUtils]: 8: Hoare triple {20612#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {20612#true} is VALID [2022-02-21 03:10:14,719 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {20612#true} {20612#true} #448#return; {20612#true} is VALID [2022-02-21 03:10:14,719 INFO L290 TraceCheckUtils]: 6: Hoare triple {20612#true} assume true; {20612#true} is VALID [2022-02-21 03:10:14,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {20612#true} #res := ~__retres4~0; {20612#true} is VALID [2022-02-21 03:10:14,719 INFO L290 TraceCheckUtils]: 4: Hoare triple {20612#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {20612#true} is VALID [2022-02-21 03:10:14,719 INFO L290 TraceCheckUtils]: 3: Hoare triple {20612#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20612#true} is VALID [2022-02-21 03:10:14,720 INFO L272 TraceCheckUtils]: 2: Hoare triple {20612#true} call main_#t~ret22#1 := base2flt(0, 0); {20612#true} is VALID [2022-02-21 03:10:14,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {20612#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {20612#true} is VALID [2022-02-21 03:10:14,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {20612#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); {20612#true} is VALID [2022-02-21 03:10:14,720 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:14,720 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787501281] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:10:14,720 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:10:14,721 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 10 [2022-02-21 03:10:14,721 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408400656] [2022-02-21 03:10:14,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:10:14,723 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 53 [2022-02-21 03:10:14,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:14,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.1) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:14,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:14,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-21 03:10:14,763 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:14,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-21 03:10:14,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-21 03:10:14,764 INFO L87 Difference]: Start difference. First operand 166 states and 204 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:16,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:16,193 INFO L93 Difference]: Finished difference Result 419 states and 508 transitions. [2022-02-21 03:10:16,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-21 03:10:16,193 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 53 [2022-02-21 03:10:16,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:16,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:16,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 399 transitions. [2022-02-21 03:10:16,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:16,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 399 transitions. [2022-02-21 03:10:16,198 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 399 transitions. [2022-02-21 03:10:16,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 399 edges. 399 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:16,474 INFO L225 Difference]: With dead ends: 419 [2022-02-21 03:10:16,474 INFO L226 Difference]: Without dead ends: 368 [2022-02-21 03:10:16,474 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-02-21 03:10:16,475 INFO L933 BasicCegarLoop]: 221 mSDtfsCounter, 313 mSDsluCounter, 1307 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1528 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:16,475 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [319 Valid, 1528 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 03:10:16,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-02-21 03:10:16,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 186. [2022-02-21 03:10:16,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:16,549 INFO L82 GeneralOperation]: Start isEquivalent. First operand 368 states. Second operand has 186 states, 162 states have (on average 1.2962962962962963) internal successors, (210), 171 states have internal predecessors, (210), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-02-21 03:10:16,549 INFO L74 IsIncluded]: Start isIncluded. First operand 368 states. Second operand has 186 states, 162 states have (on average 1.2962962962962963) internal successors, (210), 171 states have internal predecessors, (210), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-02-21 03:10:16,550 INFO L87 Difference]: Start difference. First operand 368 states. Second operand has 186 states, 162 states have (on average 1.2962962962962963) internal successors, (210), 171 states have internal predecessors, (210), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-02-21 03:10:16,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:16,556 INFO L93 Difference]: Finished difference Result 368 states and 449 transitions. [2022-02-21 03:10:16,556 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 449 transitions. [2022-02-21 03:10:16,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:16,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:16,557 INFO L74 IsIncluded]: Start isIncluded. First operand has 186 states, 162 states have (on average 1.2962962962962963) internal successors, (210), 171 states have internal predecessors, (210), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) Second operand 368 states. [2022-02-21 03:10:16,557 INFO L87 Difference]: Start difference. First operand has 186 states, 162 states have (on average 1.2962962962962963) internal successors, (210), 171 states have internal predecessors, (210), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) Second operand 368 states. [2022-02-21 03:10:16,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:16,579 INFO L93 Difference]: Finished difference Result 368 states and 449 transitions. [2022-02-21 03:10:16,579 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 449 transitions. [2022-02-21 03:10:16,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:16,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:16,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:16,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:16,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 162 states have (on average 1.2962962962962963) internal successors, (210), 171 states have internal predecessors, (210), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-02-21 03:10:16,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 228 transitions. [2022-02-21 03:10:16,589 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 228 transitions. Word has length 53 [2022-02-21 03:10:16,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:16,589 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 228 transitions. [2022-02-21 03:10:16,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:16,589 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 228 transitions. [2022-02-21 03:10:16,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-21 03:10:16,590 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:16,590 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, 1, 1, 1, 1, 1] [2022-02-21 03:10:16,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-02-21 03:10:16,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:16,792 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:16,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:16,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1055928971, now seen corresponding path program 1 times [2022-02-21 03:10:16,793 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:16,793 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526617201] [2022-02-21 03:10:16,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:16,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:16,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:16,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:16,834 INFO L290 TraceCheckUtils]: 0: Hoare triple {22424#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {22389#true} is VALID [2022-02-21 03:10:16,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {22389#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {22389#true} is VALID [2022-02-21 03:10:16,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {22389#true} #res := ~__retres4~0; {22389#true} is VALID [2022-02-21 03:10:16,835 INFO L290 TraceCheckUtils]: 3: Hoare triple {22389#true} assume true; {22389#true} is VALID [2022-02-21 03:10:16,835 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {22389#true} {22389#true} #448#return; {22389#true} is VALID [2022-02-21 03:10:16,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:16,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:16,867 INFO L290 TraceCheckUtils]: 0: Hoare triple {22424#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {22389#true} is VALID [2022-02-21 03:10:16,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {22389#true} assume !(0 == ~m % 4294967296); {22389#true} is VALID [2022-02-21 03:10:16,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {22389#true} assume !(~m % 4294967296 < 16777216); {22389#true} is VALID [2022-02-21 03:10:16,868 INFO L290 TraceCheckUtils]: 3: Hoare triple {22389#true} assume !false; {22389#true} is VALID [2022-02-21 03:10:16,868 INFO L290 TraceCheckUtils]: 4: Hoare triple {22389#true} assume !(~m % 4294967296 >= 33554432); {22389#true} is VALID [2022-02-21 03:10:16,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {22389#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {22389#true} is VALID [2022-02-21 03:10:16,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {22389#true} assume 128 + ~e <= 2147483647; {22389#true} is VALID [2022-02-21 03:10:16,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {22389#true} assume 128 + ~e >= -2147483648; {22389#true} is VALID [2022-02-21 03:10:16,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {22389#true} assume 128 + ~e <= 2147483647; {22389#true} is VALID [2022-02-21 03:10:16,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {22389#true} assume 128 + ~e >= -2147483648; {22389#true} is VALID [2022-02-21 03:10:16,869 INFO L290 TraceCheckUtils]: 10: Hoare triple {22389#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {22389#true} is VALID [2022-02-21 03:10:16,870 INFO L290 TraceCheckUtils]: 11: Hoare triple {22389#true} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {22425#(<= 0 base2flt_~res~0)} is VALID [2022-02-21 03:10:16,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {22425#(<= 0 base2flt_~res~0)} ~__retres4~0 := ~res~0; {22426#(<= 0 base2flt_~__retres4~0)} is VALID [2022-02-21 03:10:16,870 INFO L290 TraceCheckUtils]: 13: Hoare triple {22426#(<= 0 base2flt_~__retres4~0)} #res := ~__retres4~0; {22427#(<= 0 |base2flt_#res|)} is VALID [2022-02-21 03:10:16,871 INFO L290 TraceCheckUtils]: 14: Hoare triple {22427#(<= 0 |base2flt_#res|)} assume true; {22427#(<= 0 |base2flt_#res|)} is VALID [2022-02-21 03:10:16,871 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {22427#(<= 0 |base2flt_#res|)} {22389#true} #450#return; {22412#(<= 0 |ULTIMATE.start_main_#t~ret23#1|)} is VALID [2022-02-21 03:10:16,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-21 03:10:16,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:16,878 INFO L290 TraceCheckUtils]: 0: Hoare triple {22424#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {22389#true} is VALID [2022-02-21 03:10:16,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {22389#true} assume !(0 == ~m % 4294967296); {22389#true} is VALID [2022-02-21 03:10:16,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {22389#true} assume !(~m % 4294967296 < 16777216); {22389#true} is VALID [2022-02-21 03:10:16,878 INFO L290 TraceCheckUtils]: 3: Hoare triple {22389#true} assume !false; {22389#true} is VALID [2022-02-21 03:10:16,878 INFO L290 TraceCheckUtils]: 4: Hoare triple {22389#true} assume ~m % 4294967296 >= 33554432; {22389#true} is VALID [2022-02-21 03:10:16,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {22389#true} assume ~e >= 127;~__retres4~0 := 4294967295; {22389#true} is VALID [2022-02-21 03:10:16,879 INFO L290 TraceCheckUtils]: 6: Hoare triple {22389#true} #res := ~__retres4~0; {22389#true} is VALID [2022-02-21 03:10:16,879 INFO L290 TraceCheckUtils]: 7: Hoare triple {22389#true} assume true; {22389#true} is VALID [2022-02-21 03:10:16,879 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {22389#true} {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} #452#return; {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:16,880 INFO L290 TraceCheckUtils]: 0: Hoare triple {22389#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); {22389#true} is VALID [2022-02-21 03:10:16,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {22389#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {22389#true} is VALID [2022-02-21 03:10:16,880 INFO L272 TraceCheckUtils]: 2: Hoare triple {22389#true} call main_#t~ret22#1 := base2flt(0, 0); {22424#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:16,880 INFO L290 TraceCheckUtils]: 3: Hoare triple {22424#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {22389#true} is VALID [2022-02-21 03:10:16,880 INFO L290 TraceCheckUtils]: 4: Hoare triple {22389#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {22389#true} is VALID [2022-02-21 03:10:16,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {22389#true} #res := ~__retres4~0; {22389#true} is VALID [2022-02-21 03:10:16,881 INFO L290 TraceCheckUtils]: 6: Hoare triple {22389#true} assume true; {22389#true} is VALID [2022-02-21 03:10:16,881 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {22389#true} {22389#true} #448#return; {22389#true} is VALID [2022-02-21 03:10:16,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {22389#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {22389#true} is VALID [2022-02-21 03:10:16,882 INFO L272 TraceCheckUtils]: 9: Hoare triple {22389#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {22424#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:16,882 INFO L290 TraceCheckUtils]: 10: Hoare triple {22424#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {22389#true} is VALID [2022-02-21 03:10:16,882 INFO L290 TraceCheckUtils]: 11: Hoare triple {22389#true} assume !(0 == ~m % 4294967296); {22389#true} is VALID [2022-02-21 03:10:16,882 INFO L290 TraceCheckUtils]: 12: Hoare triple {22389#true} assume !(~m % 4294967296 < 16777216); {22389#true} is VALID [2022-02-21 03:10:16,882 INFO L290 TraceCheckUtils]: 13: Hoare triple {22389#true} assume !false; {22389#true} is VALID [2022-02-21 03:10:16,882 INFO L290 TraceCheckUtils]: 14: Hoare triple {22389#true} assume !(~m % 4294967296 >= 33554432); {22389#true} is VALID [2022-02-21 03:10:16,882 INFO L290 TraceCheckUtils]: 15: Hoare triple {22389#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {22389#true} is VALID [2022-02-21 03:10:16,882 INFO L290 TraceCheckUtils]: 16: Hoare triple {22389#true} assume 128 + ~e <= 2147483647; {22389#true} is VALID [2022-02-21 03:10:16,882 INFO L290 TraceCheckUtils]: 17: Hoare triple {22389#true} assume 128 + ~e >= -2147483648; {22389#true} is VALID [2022-02-21 03:10:16,883 INFO L290 TraceCheckUtils]: 18: Hoare triple {22389#true} assume 128 + ~e <= 2147483647; {22389#true} is VALID [2022-02-21 03:10:16,883 INFO L290 TraceCheckUtils]: 19: Hoare triple {22389#true} assume 128 + ~e >= -2147483648; {22389#true} is VALID [2022-02-21 03:10:16,883 INFO L290 TraceCheckUtils]: 20: Hoare triple {22389#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {22389#true} is VALID [2022-02-21 03:10:16,883 INFO L290 TraceCheckUtils]: 21: Hoare triple {22389#true} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {22425#(<= 0 base2flt_~res~0)} is VALID [2022-02-21 03:10:16,884 INFO L290 TraceCheckUtils]: 22: Hoare triple {22425#(<= 0 base2flt_~res~0)} ~__retres4~0 := ~res~0; {22426#(<= 0 base2flt_~__retres4~0)} is VALID [2022-02-21 03:10:16,884 INFO L290 TraceCheckUtils]: 23: Hoare triple {22426#(<= 0 base2flt_~__retres4~0)} #res := ~__retres4~0; {22427#(<= 0 |base2flt_#res|)} is VALID [2022-02-21 03:10:16,884 INFO L290 TraceCheckUtils]: 24: Hoare triple {22427#(<= 0 |base2flt_#res|)} assume true; {22427#(<= 0 |base2flt_#res|)} is VALID [2022-02-21 03:10:16,885 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {22427#(<= 0 |base2flt_#res|)} {22389#true} #450#return; {22412#(<= 0 |ULTIMATE.start_main_#t~ret23#1|)} is VALID [2022-02-21 03:10:16,885 INFO L290 TraceCheckUtils]: 26: Hoare triple {22412#(<= 0 |ULTIMATE.start_main_#t~ret23#1|)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:16,886 INFO L272 TraceCheckUtils]: 27: Hoare triple {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {22424#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:16,886 INFO L290 TraceCheckUtils]: 28: Hoare triple {22424#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {22389#true} is VALID [2022-02-21 03:10:16,886 INFO L290 TraceCheckUtils]: 29: Hoare triple {22389#true} assume !(0 == ~m % 4294967296); {22389#true} is VALID [2022-02-21 03:10:16,886 INFO L290 TraceCheckUtils]: 30: Hoare triple {22389#true} assume !(~m % 4294967296 < 16777216); {22389#true} is VALID [2022-02-21 03:10:16,886 INFO L290 TraceCheckUtils]: 31: Hoare triple {22389#true} assume !false; {22389#true} is VALID [2022-02-21 03:10:16,886 INFO L290 TraceCheckUtils]: 32: Hoare triple {22389#true} assume ~m % 4294967296 >= 33554432; {22389#true} is VALID [2022-02-21 03:10:16,886 INFO L290 TraceCheckUtils]: 33: Hoare triple {22389#true} assume ~e >= 127;~__retres4~0 := 4294967295; {22389#true} is VALID [2022-02-21 03:10:16,887 INFO L290 TraceCheckUtils]: 34: Hoare triple {22389#true} #res := ~__retres4~0; {22389#true} is VALID [2022-02-21 03:10:16,887 INFO L290 TraceCheckUtils]: 35: Hoare triple {22389#true} assume true; {22389#true} is VALID [2022-02-21 03:10:16,887 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {22389#true} {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} #452#return; {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:16,888 INFO L290 TraceCheckUtils]: 37: Hoare triple {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:16,888 INFO L290 TraceCheckUtils]: 38: Hoare triple {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume !(main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:16,888 INFO L290 TraceCheckUtils]: 39: Hoare triple {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume main_~a~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:16,888 INFO L290 TraceCheckUtils]: 40: Hoare triple {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} main_~sa~0#1 := main_~tmp~2#1; {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:16,889 INFO L290 TraceCheckUtils]: 41: Hoare triple {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:16,889 INFO L290 TraceCheckUtils]: 42: Hoare triple {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:16,889 INFO L290 TraceCheckUtils]: 43: Hoare triple {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} main_~sb~0#1 := main_~tmp___0~0#1; {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:16,890 INFO L290 TraceCheckUtils]: 44: Hoare triple {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {22423#(<= 0 |ULTIMATE.start_addflt_~a#1|)} is VALID [2022-02-21 03:10:16,890 INFO L290 TraceCheckUtils]: 45: Hoare triple {22423#(<= 0 |ULTIMATE.start_addflt_~a#1|)} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {22423#(<= 0 |ULTIMATE.start_addflt_~a#1|)} is VALID [2022-02-21 03:10:16,890 INFO L290 TraceCheckUtils]: 46: Hoare triple {22423#(<= 0 |ULTIMATE.start_addflt_~a#1|)} assume !(0 == addflt_~b#1 % 4294967296); {22423#(<= 0 |ULTIMATE.start_addflt_~a#1|)} is VALID [2022-02-21 03:10:16,890 INFO L290 TraceCheckUtils]: 47: Hoare triple {22423#(<= 0 |ULTIMATE.start_addflt_~a#1|)} assume !(0 == addflt_~a#1); {22423#(<= 0 |ULTIMATE.start_addflt_~a#1|)} is VALID [2022-02-21 03:10:16,891 INFO L290 TraceCheckUtils]: 48: Hoare triple {22423#(<= 0 |ULTIMATE.start_addflt_~a#1|)} assume !false; {22423#(<= 0 |ULTIMATE.start_addflt_~a#1|)} is VALID [2022-02-21 03:10:16,891 INFO L290 TraceCheckUtils]: 49: Hoare triple {22423#(<= 0 |ULTIMATE.start_addflt_~a#1|)} assume !false; {22423#(<= 0 |ULTIMATE.start_addflt_~a#1|)} is VALID [2022-02-21 03:10:16,891 INFO L290 TraceCheckUtils]: 50: Hoare triple {22423#(<= 0 |ULTIMATE.start_addflt_~a#1|)} assume !(addflt_~a#1 >= 0);addflt_~ma~0#1 := addflt_#t~nondet6#1;havoc addflt_#t~nondet6#1; {22390#false} is VALID [2022-02-21 03:10:16,892 INFO L290 TraceCheckUtils]: 51: Hoare triple {22390#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {22390#false} is VALID [2022-02-21 03:10:16,892 INFO L290 TraceCheckUtils]: 52: Hoare triple {22390#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {22390#false} is VALID [2022-02-21 03:10:16,892 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:16,892 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:16,892 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526617201] [2022-02-21 03:10:16,892 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526617201] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:16,892 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566651619] [2022-02-21 03:10:16,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:16,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:16,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:16,894 INFO L229 MonitoredProcess]: Starting monitored process 16 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:16,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-02-21 03:10:16,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:16,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 03:10:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:16,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:17,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {22389#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); {22389#true} is VALID [2022-02-21 03:10:17,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {22389#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {22434#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:17,610 INFO L272 TraceCheckUtils]: 2: Hoare triple {22434#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret22#1 := base2flt(0, 0); {22389#true} is VALID [2022-02-21 03:10:17,610 INFO L290 TraceCheckUtils]: 3: Hoare triple {22389#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {22389#true} is VALID [2022-02-21 03:10:17,610 INFO L290 TraceCheckUtils]: 4: Hoare triple {22389#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {22389#true} is VALID [2022-02-21 03:10:17,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {22389#true} #res := ~__retres4~0; {22389#true} is VALID [2022-02-21 03:10:17,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {22389#true} assume true; {22389#true} is VALID [2022-02-21 03:10:17,611 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {22389#true} {22434#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} #448#return; {22434#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:17,611 INFO L290 TraceCheckUtils]: 8: Hoare triple {22434#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {22434#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:17,611 INFO L272 TraceCheckUtils]: 9: Hoare triple {22434#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {22389#true} is VALID [2022-02-21 03:10:17,612 INFO L290 TraceCheckUtils]: 10: Hoare triple {22389#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {22462#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:17,612 INFO L290 TraceCheckUtils]: 11: Hoare triple {22462#(<= |base2flt_#in~e| base2flt_~e)} assume !(0 == ~m % 4294967296); {22462#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:17,612 INFO L290 TraceCheckUtils]: 12: Hoare triple {22462#(<= |base2flt_#in~e| base2flt_~e)} assume !(~m % 4294967296 < 16777216); {22462#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:17,612 INFO L290 TraceCheckUtils]: 13: Hoare triple {22462#(<= |base2flt_#in~e| base2flt_~e)} assume !false; {22462#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:17,613 INFO L290 TraceCheckUtils]: 14: Hoare triple {22462#(<= |base2flt_#in~e| base2flt_~e)} assume !(~m % 4294967296 >= 33554432); {22462#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:17,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {22462#(<= |base2flt_#in~e| base2flt_~e)} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {22462#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:17,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {22462#(<= |base2flt_#in~e| base2flt_~e)} assume 128 + ~e <= 2147483647; {22462#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:17,614 INFO L290 TraceCheckUtils]: 17: Hoare triple {22462#(<= |base2flt_#in~e| base2flt_~e)} assume 128 + ~e >= -2147483648; {22462#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:17,614 INFO L290 TraceCheckUtils]: 18: Hoare triple {22462#(<= |base2flt_#in~e| base2flt_~e)} assume 128 + ~e <= 2147483647; {22462#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:17,614 INFO L290 TraceCheckUtils]: 19: Hoare triple {22462#(<= |base2flt_#in~e| base2flt_~e)} assume 128 + ~e >= -2147483648; {22462#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:17,615 INFO L290 TraceCheckUtils]: 20: Hoare triple {22462#(<= |base2flt_#in~e| base2flt_~e)} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {22462#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:17,615 INFO L290 TraceCheckUtils]: 21: Hoare triple {22462#(<= |base2flt_#in~e| base2flt_~e)} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {22496#(<= |base2flt_#in~e| (div (+ (- 2147483648) base2flt_~res~0) 16777216))} is VALID [2022-02-21 03:10:17,616 INFO L290 TraceCheckUtils]: 22: Hoare triple {22496#(<= |base2flt_#in~e| (div (+ (- 2147483648) base2flt_~res~0) 16777216))} ~__retres4~0 := ~res~0; {22500#(<= |base2flt_#in~e| (div (+ (- 2147483648) base2flt_~__retres4~0) 16777216))} is VALID [2022-02-21 03:10:17,616 INFO L290 TraceCheckUtils]: 23: Hoare triple {22500#(<= |base2flt_#in~e| (div (+ (- 2147483648) base2flt_~__retres4~0) 16777216))} #res := ~__retres4~0; {22504#(<= |base2flt_#in~e| (div (+ (- 2147483648) |base2flt_#res|) 16777216))} is VALID [2022-02-21 03:10:17,616 INFO L290 TraceCheckUtils]: 24: Hoare triple {22504#(<= |base2flt_#in~e| (div (+ (- 2147483648) |base2flt_#res|) 16777216))} assume true; {22504#(<= |base2flt_#in~e| (div (+ (- 2147483648) |base2flt_#res|) 16777216))} is VALID [2022-02-21 03:10:17,617 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {22504#(<= |base2flt_#in~e| (div (+ (- 2147483648) |base2flt_#res|) 16777216))} {22434#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} #450#return; {22412#(<= 0 |ULTIMATE.start_main_#t~ret23#1|)} is VALID [2022-02-21 03:10:17,618 INFO L290 TraceCheckUtils]: 26: Hoare triple {22412#(<= 0 |ULTIMATE.start_main_#t~ret23#1|)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:17,618 INFO L272 TraceCheckUtils]: 27: Hoare triple {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {22389#true} is VALID [2022-02-21 03:10:17,618 INFO L290 TraceCheckUtils]: 28: Hoare triple {22389#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {22389#true} is VALID [2022-02-21 03:10:17,618 INFO L290 TraceCheckUtils]: 29: Hoare triple {22389#true} assume !(0 == ~m % 4294967296); {22389#true} is VALID [2022-02-21 03:10:17,618 INFO L290 TraceCheckUtils]: 30: Hoare triple {22389#true} assume !(~m % 4294967296 < 16777216); {22389#true} is VALID [2022-02-21 03:10:17,618 INFO L290 TraceCheckUtils]: 31: Hoare triple {22389#true} assume !false; {22389#true} is VALID [2022-02-21 03:10:17,618 INFO L290 TraceCheckUtils]: 32: Hoare triple {22389#true} assume ~m % 4294967296 >= 33554432; {22389#true} is VALID [2022-02-21 03:10:17,618 INFO L290 TraceCheckUtils]: 33: Hoare triple {22389#true} assume ~e >= 127;~__retres4~0 := 4294967295; {22389#true} is VALID [2022-02-21 03:10:17,618 INFO L290 TraceCheckUtils]: 34: Hoare triple {22389#true} #res := ~__retres4~0; {22389#true} is VALID [2022-02-21 03:10:17,618 INFO L290 TraceCheckUtils]: 35: Hoare triple {22389#true} assume true; {22389#true} is VALID [2022-02-21 03:10:17,619 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {22389#true} {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} #452#return; {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:17,619 INFO L290 TraceCheckUtils]: 37: Hoare triple {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:17,619 INFO L290 TraceCheckUtils]: 38: Hoare triple {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume !(main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:17,620 INFO L290 TraceCheckUtils]: 39: Hoare triple {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume main_~a~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:17,620 INFO L290 TraceCheckUtils]: 40: Hoare triple {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} main_~sa~0#1 := main_~tmp~2#1; {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:17,620 INFO L290 TraceCheckUtils]: 41: Hoare triple {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:17,621 INFO L290 TraceCheckUtils]: 42: Hoare triple {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:17,621 INFO L290 TraceCheckUtils]: 43: Hoare triple {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} main_~sb~0#1 := main_~tmp___0~0#1; {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:17,621 INFO L290 TraceCheckUtils]: 44: Hoare triple {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {22423#(<= 0 |ULTIMATE.start_addflt_~a#1|)} is VALID [2022-02-21 03:10:17,622 INFO L290 TraceCheckUtils]: 45: Hoare triple {22423#(<= 0 |ULTIMATE.start_addflt_~a#1|)} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {22423#(<= 0 |ULTIMATE.start_addflt_~a#1|)} is VALID [2022-02-21 03:10:17,622 INFO L290 TraceCheckUtils]: 46: Hoare triple {22423#(<= 0 |ULTIMATE.start_addflt_~a#1|)} assume !(0 == addflt_~b#1 % 4294967296); {22423#(<= 0 |ULTIMATE.start_addflt_~a#1|)} is VALID [2022-02-21 03:10:17,622 INFO L290 TraceCheckUtils]: 47: Hoare triple {22423#(<= 0 |ULTIMATE.start_addflt_~a#1|)} assume !(0 == addflt_~a#1); {22423#(<= 0 |ULTIMATE.start_addflt_~a#1|)} is VALID [2022-02-21 03:10:17,623 INFO L290 TraceCheckUtils]: 48: Hoare triple {22423#(<= 0 |ULTIMATE.start_addflt_~a#1|)} assume !false; {22423#(<= 0 |ULTIMATE.start_addflt_~a#1|)} is VALID [2022-02-21 03:10:17,623 INFO L290 TraceCheckUtils]: 49: Hoare triple {22423#(<= 0 |ULTIMATE.start_addflt_~a#1|)} assume !false; {22423#(<= 0 |ULTIMATE.start_addflt_~a#1|)} is VALID [2022-02-21 03:10:17,623 INFO L290 TraceCheckUtils]: 50: Hoare triple {22423#(<= 0 |ULTIMATE.start_addflt_~a#1|)} assume !(addflt_~a#1 >= 0);addflt_~ma~0#1 := addflt_#t~nondet6#1;havoc addflt_#t~nondet6#1; {22390#false} is VALID [2022-02-21 03:10:17,623 INFO L290 TraceCheckUtils]: 51: Hoare triple {22390#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {22390#false} is VALID [2022-02-21 03:10:17,624 INFO L290 TraceCheckUtils]: 52: Hoare triple {22390#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {22390#false} is VALID [2022-02-21 03:10:17,624 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:17,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:10:18,129 INFO L290 TraceCheckUtils]: 52: Hoare triple {22390#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {22390#false} is VALID [2022-02-21 03:10:18,129 INFO L290 TraceCheckUtils]: 51: Hoare triple {22390#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {22390#false} is VALID [2022-02-21 03:10:18,129 INFO L290 TraceCheckUtils]: 50: Hoare triple {22423#(<= 0 |ULTIMATE.start_addflt_~a#1|)} assume !(addflt_~a#1 >= 0);addflt_~ma~0#1 := addflt_#t~nondet6#1;havoc addflt_#t~nondet6#1; {22390#false} is VALID [2022-02-21 03:10:18,130 INFO L290 TraceCheckUtils]: 49: Hoare triple {22423#(<= 0 |ULTIMATE.start_addflt_~a#1|)} assume !false; {22423#(<= 0 |ULTIMATE.start_addflt_~a#1|)} is VALID [2022-02-21 03:10:18,130 INFO L290 TraceCheckUtils]: 48: Hoare triple {22423#(<= 0 |ULTIMATE.start_addflt_~a#1|)} assume !false; {22423#(<= 0 |ULTIMATE.start_addflt_~a#1|)} is VALID [2022-02-21 03:10:18,130 INFO L290 TraceCheckUtils]: 47: Hoare triple {22423#(<= 0 |ULTIMATE.start_addflt_~a#1|)} assume !(0 == addflt_~a#1); {22423#(<= 0 |ULTIMATE.start_addflt_~a#1|)} is VALID [2022-02-21 03:10:18,131 INFO L290 TraceCheckUtils]: 46: Hoare triple {22423#(<= 0 |ULTIMATE.start_addflt_~a#1|)} assume !(0 == addflt_~b#1 % 4294967296); {22423#(<= 0 |ULTIMATE.start_addflt_~a#1|)} is VALID [2022-02-21 03:10:18,131 INFO L290 TraceCheckUtils]: 45: Hoare triple {22423#(<= 0 |ULTIMATE.start_addflt_~a#1|)} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {22423#(<= 0 |ULTIMATE.start_addflt_~a#1|)} is VALID [2022-02-21 03:10:18,131 INFO L290 TraceCheckUtils]: 44: Hoare triple {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {22423#(<= 0 |ULTIMATE.start_addflt_~a#1|)} is VALID [2022-02-21 03:10:18,132 INFO L290 TraceCheckUtils]: 43: Hoare triple {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} main_~sb~0#1 := main_~tmp___0~0#1; {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:18,132 INFO L290 TraceCheckUtils]: 42: Hoare triple {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:18,132 INFO L290 TraceCheckUtils]: 41: Hoare triple {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:18,133 INFO L290 TraceCheckUtils]: 40: Hoare triple {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} main_~sa~0#1 := main_~tmp~2#1; {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:18,133 INFO L290 TraceCheckUtils]: 39: Hoare triple {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume main_~a~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:18,133 INFO L290 TraceCheckUtils]: 38: Hoare triple {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume !(main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:18,133 INFO L290 TraceCheckUtils]: 37: Hoare triple {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:18,134 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {22389#true} {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} #452#return; {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:18,134 INFO L290 TraceCheckUtils]: 35: Hoare triple {22389#true} assume true; {22389#true} is VALID [2022-02-21 03:10:18,134 INFO L290 TraceCheckUtils]: 34: Hoare triple {22389#true} #res := ~__retres4~0; {22389#true} is VALID [2022-02-21 03:10:18,135 INFO L290 TraceCheckUtils]: 33: Hoare triple {22389#true} assume ~e >= 127;~__retres4~0 := 4294967295; {22389#true} is VALID [2022-02-21 03:10:18,135 INFO L290 TraceCheckUtils]: 32: Hoare triple {22389#true} assume ~m % 4294967296 >= 33554432; {22389#true} is VALID [2022-02-21 03:10:18,135 INFO L290 TraceCheckUtils]: 31: Hoare triple {22389#true} assume !false; {22389#true} is VALID [2022-02-21 03:10:18,135 INFO L290 TraceCheckUtils]: 30: Hoare triple {22389#true} assume !(~m % 4294967296 < 16777216); {22389#true} is VALID [2022-02-21 03:10:18,135 INFO L290 TraceCheckUtils]: 29: Hoare triple {22389#true} assume !(0 == ~m % 4294967296); {22389#true} is VALID [2022-02-21 03:10:18,135 INFO L290 TraceCheckUtils]: 28: Hoare triple {22389#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {22389#true} is VALID [2022-02-21 03:10:18,135 INFO L272 TraceCheckUtils]: 27: Hoare triple {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {22389#true} is VALID [2022-02-21 03:10:18,136 INFO L290 TraceCheckUtils]: 26: Hoare triple {22412#(<= 0 |ULTIMATE.start_main_#t~ret23#1|)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {22413#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:18,136 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {22676#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 |base2flt_#res|))} {22434#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} #450#return; {22412#(<= 0 |ULTIMATE.start_main_#t~ret23#1|)} is VALID [2022-02-21 03:10:18,137 INFO L290 TraceCheckUtils]: 24: Hoare triple {22676#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 |base2flt_#res|))} assume true; {22676#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:18,137 INFO L290 TraceCheckUtils]: 23: Hoare triple {22683#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {22676#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:18,138 INFO L290 TraceCheckUtils]: 22: Hoare triple {22687#(or (<= 0 base2flt_~res~0) (< (+ 128 |base2flt_#in~e|) 0))} ~__retres4~0 := ~res~0; {22683#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:18,138 INFO L290 TraceCheckUtils]: 21: Hoare triple {22691#(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); {22687#(or (<= 0 base2flt_~res~0) (< (+ 128 |base2flt_#in~e|) 0))} is VALID [2022-02-21 03:10:18,139 INFO L290 TraceCheckUtils]: 20: Hoare triple {22691#(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))); {22691#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} is VALID [2022-02-21 03:10:18,139 INFO L290 TraceCheckUtils]: 19: Hoare triple {22691#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} assume 128 + ~e >= -2147483648; {22691#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} is VALID [2022-02-21 03:10:18,139 INFO L290 TraceCheckUtils]: 18: Hoare triple {22691#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} assume 128 + ~e <= 2147483647; {22691#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} is VALID [2022-02-21 03:10:18,140 INFO L290 TraceCheckUtils]: 17: Hoare triple {22691#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} assume 128 + ~e >= -2147483648; {22691#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} is VALID [2022-02-21 03:10:18,140 INFO L290 TraceCheckUtils]: 16: Hoare triple {22691#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} assume 128 + ~e <= 2147483647; {22691#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} is VALID [2022-02-21 03:10:18,141 INFO L290 TraceCheckUtils]: 15: Hoare triple {22691#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {22691#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} is VALID [2022-02-21 03:10:18,141 INFO L290 TraceCheckUtils]: 14: Hoare triple {22691#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} assume !(~m % 4294967296 >= 33554432); {22691#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} is VALID [2022-02-21 03:10:18,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {22691#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} assume !false; {22691#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} is VALID [2022-02-21 03:10:18,142 INFO L290 TraceCheckUtils]: 12: Hoare triple {22691#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} assume !(~m % 4294967296 < 16777216); {22691#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} is VALID [2022-02-21 03:10:18,142 INFO L290 TraceCheckUtils]: 11: Hoare triple {22691#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} assume !(0 == ~m % 4294967296); {22691#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} is VALID [2022-02-21 03:10:18,143 INFO L290 TraceCheckUtils]: 10: Hoare triple {22389#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {22691#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} is VALID [2022-02-21 03:10:18,143 INFO L272 TraceCheckUtils]: 9: Hoare triple {22434#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {22389#true} is VALID [2022-02-21 03:10:18,143 INFO L290 TraceCheckUtils]: 8: Hoare triple {22434#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {22434#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:18,144 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {22389#true} {22434#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} #448#return; {22434#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:18,144 INFO L290 TraceCheckUtils]: 6: Hoare triple {22389#true} assume true; {22389#true} is VALID [2022-02-21 03:10:18,144 INFO L290 TraceCheckUtils]: 5: Hoare triple {22389#true} #res := ~__retres4~0; {22389#true} is VALID [2022-02-21 03:10:18,144 INFO L290 TraceCheckUtils]: 4: Hoare triple {22389#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {22389#true} is VALID [2022-02-21 03:10:18,144 INFO L290 TraceCheckUtils]: 3: Hoare triple {22389#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {22389#true} is VALID [2022-02-21 03:10:18,144 INFO L272 TraceCheckUtils]: 2: Hoare triple {22434#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret22#1 := base2flt(0, 0); {22389#true} is VALID [2022-02-21 03:10:18,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {22389#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {22434#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:18,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {22389#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); {22389#true} is VALID [2022-02-21 03:10:18,145 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:18,145 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566651619] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:10:18,145 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:10:18,146 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 18 [2022-02-21 03:10:18,146 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822495817] [2022-02-21 03:10:18,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:10:18,146 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 16 states have internal predecessors, (73), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 53 [2022-02-21 03:10:18,147 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:18,147 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 16 states have internal predecessors, (73), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:18,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:18,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-21 03:10:18,217 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:18,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-21 03:10:18,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2022-02-21 03:10:18,218 INFO L87 Difference]: Start difference. First operand 186 states and 228 transitions. Second operand has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 16 states have internal predecessors, (73), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:20,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:20,658 INFO L93 Difference]: Finished difference Result 544 states and 679 transitions. [2022-02-21 03:10:20,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-21 03:10:20,658 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 16 states have internal predecessors, (73), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 53 [2022-02-21 03:10:20,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:20,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 16 states have internal predecessors, (73), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:20,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 462 transitions. [2022-02-21 03:10:20,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 16 states have internal predecessors, (73), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:20,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 462 transitions. [2022-02-21 03:10:20,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 462 transitions. [2022-02-21 03:10:20,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 462 edges. 462 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:20,996 INFO L225 Difference]: With dead ends: 544 [2022-02-21 03:10:20,997 INFO L226 Difference]: Without dead ends: 488 [2022-02-21 03:10:20,999 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=252, Invalid=1154, Unknown=0, NotChecked=0, Total=1406 [2022-02-21 03:10:21,008 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 571 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:21,008 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [590 Valid, 1079 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-21 03:10:21,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2022-02-21 03:10:21,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 201. [2022-02-21 03:10:21,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:21,130 INFO L82 GeneralOperation]: Start isEquivalent. First operand 488 states. Second operand has 201 states, 175 states have (on average 1.2857142857142858) internal successors, (225), 184 states have internal predecessors, (225), 9 states have call successors, (9), 4 states have call predecessors, (9), 7 states have return successors, (12), 12 states have call predecessors, (12), 9 states have call successors, (12) [2022-02-21 03:10:21,130 INFO L74 IsIncluded]: Start isIncluded. First operand 488 states. Second operand has 201 states, 175 states have (on average 1.2857142857142858) internal successors, (225), 184 states have internal predecessors, (225), 9 states have call successors, (9), 4 states have call predecessors, (9), 7 states have return successors, (12), 12 states have call predecessors, (12), 9 states have call successors, (12) [2022-02-21 03:10:21,131 INFO L87 Difference]: Start difference. First operand 488 states. Second operand has 201 states, 175 states have (on average 1.2857142857142858) internal successors, (225), 184 states have internal predecessors, (225), 9 states have call successors, (9), 4 states have call predecessors, (9), 7 states have return successors, (12), 12 states have call predecessors, (12), 9 states have call successors, (12) [2022-02-21 03:10:21,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:21,143 INFO L93 Difference]: Finished difference Result 488 states and 614 transitions. [2022-02-21 03:10:21,143 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 614 transitions. [2022-02-21 03:10:21,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:21,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:21,145 INFO L74 IsIncluded]: Start isIncluded. First operand has 201 states, 175 states have (on average 1.2857142857142858) internal successors, (225), 184 states have internal predecessors, (225), 9 states have call successors, (9), 4 states have call predecessors, (9), 7 states have return successors, (12), 12 states have call predecessors, (12), 9 states have call successors, (12) Second operand 488 states. [2022-02-21 03:10:21,145 INFO L87 Difference]: Start difference. First operand has 201 states, 175 states have (on average 1.2857142857142858) internal successors, (225), 184 states have internal predecessors, (225), 9 states have call successors, (9), 4 states have call predecessors, (9), 7 states have return successors, (12), 12 states have call predecessors, (12), 9 states have call successors, (12) Second operand 488 states. [2022-02-21 03:10:21,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:21,160 INFO L93 Difference]: Finished difference Result 488 states and 614 transitions. [2022-02-21 03:10:21,160 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 614 transitions. [2022-02-21 03:10:21,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:21,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:21,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:21,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:21,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 175 states have (on average 1.2857142857142858) internal successors, (225), 184 states have internal predecessors, (225), 9 states have call successors, (9), 4 states have call predecessors, (9), 7 states have return successors, (12), 12 states have call predecessors, (12), 9 states have call successors, (12) [2022-02-21 03:10:21,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 246 transitions. [2022-02-21 03:10:21,166 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 246 transitions. Word has length 53 [2022-02-21 03:10:21,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:21,166 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 246 transitions. [2022-02-21 03:10:21,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 16 states have internal predecessors, (73), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:21,167 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 246 transitions. [2022-02-21 03:10:21,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-21 03:10:21,167 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:21,167 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, 1, 1, 1, 1, 1] [2022-02-21 03:10:21,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:10:21,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:21,384 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:21,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:21,384 INFO L85 PathProgramCache]: Analyzing trace with hash -246584267, now seen corresponding path program 1 times [2022-02-21 03:10:21,384 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:21,384 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664670546] [2022-02-21 03:10:21,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:21,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:21,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:21,479 INFO L290 TraceCheckUtils]: 0: Hoare triple {24632#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {24597#true} is VALID [2022-02-21 03:10:21,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {24597#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {24597#true} is VALID [2022-02-21 03:10:21,479 INFO L290 TraceCheckUtils]: 2: Hoare triple {24597#true} #res := ~__retres4~0; {24597#true} is VALID [2022-02-21 03:10:21,479 INFO L290 TraceCheckUtils]: 3: Hoare triple {24597#true} assume true; {24597#true} is VALID [2022-02-21 03:10:21,479 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {24597#true} {24597#true} #448#return; {24597#true} is VALID [2022-02-21 03:10:21,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:21,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:21,519 INFO L290 TraceCheckUtils]: 0: Hoare triple {24632#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {24597#true} is VALID [2022-02-21 03:10:21,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {24597#true} assume !(0 == ~m % 4294967296); {24597#true} is VALID [2022-02-21 03:10:21,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {24597#true} assume !(~m % 4294967296 < 16777216); {24597#true} is VALID [2022-02-21 03:10:21,519 INFO L290 TraceCheckUtils]: 3: Hoare triple {24597#true} assume !false; {24597#true} is VALID [2022-02-21 03:10:21,519 INFO L290 TraceCheckUtils]: 4: Hoare triple {24597#true} assume !(~m % 4294967296 >= 33554432); {24597#true} is VALID [2022-02-21 03:10:21,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {24597#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {24597#true} is VALID [2022-02-21 03:10:21,520 INFO L290 TraceCheckUtils]: 6: Hoare triple {24597#true} assume 128 + ~e <= 2147483647; {24597#true} is VALID [2022-02-21 03:10:21,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {24597#true} assume 128 + ~e >= -2147483648; {24597#true} is VALID [2022-02-21 03:10:21,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {24597#true} assume 128 + ~e <= 2147483647; {24597#true} is VALID [2022-02-21 03:10:21,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {24597#true} assume 128 + ~e >= -2147483648; {24597#true} is VALID [2022-02-21 03:10:21,520 INFO L290 TraceCheckUtils]: 10: Hoare triple {24597#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {24597#true} is VALID [2022-02-21 03:10:21,521 INFO L290 TraceCheckUtils]: 11: Hoare triple {24597#true} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {24633#(and (<= 0 base2flt_~res~0) (<= base2flt_~res~0 0))} is VALID [2022-02-21 03:10:21,521 INFO L290 TraceCheckUtils]: 12: Hoare triple {24633#(and (<= 0 base2flt_~res~0) (<= base2flt_~res~0 0))} ~__retres4~0 := ~res~0; {24634#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:21,521 INFO L290 TraceCheckUtils]: 13: Hoare triple {24634#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {24635#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:21,522 INFO L290 TraceCheckUtils]: 14: Hoare triple {24635#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {24635#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:21,523 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {24635#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {24597#true} #450#return; {24620#(and (<= 0 |ULTIMATE.start_main_#t~ret23#1|) (<= |ULTIMATE.start_main_#t~ret23#1| 0))} is VALID [2022-02-21 03:10:21,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-21 03:10:21,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:21,527 INFO L290 TraceCheckUtils]: 0: Hoare triple {24632#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {24597#true} is VALID [2022-02-21 03:10:21,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {24597#true} assume !(0 == ~m % 4294967296); {24597#true} is VALID [2022-02-21 03:10:21,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {24597#true} assume !(~m % 4294967296 < 16777216); {24597#true} is VALID [2022-02-21 03:10:21,527 INFO L290 TraceCheckUtils]: 3: Hoare triple {24597#true} assume !false; {24597#true} is VALID [2022-02-21 03:10:21,528 INFO L290 TraceCheckUtils]: 4: Hoare triple {24597#true} assume ~m % 4294967296 >= 33554432; {24597#true} is VALID [2022-02-21 03:10:21,528 INFO L290 TraceCheckUtils]: 5: Hoare triple {24597#true} assume ~e >= 127;~__retres4~0 := 4294967295; {24597#true} is VALID [2022-02-21 03:10:21,528 INFO L290 TraceCheckUtils]: 6: Hoare triple {24597#true} #res := ~__retres4~0; {24597#true} is VALID [2022-02-21 03:10:21,528 INFO L290 TraceCheckUtils]: 7: Hoare triple {24597#true} assume true; {24597#true} is VALID [2022-02-21 03:10:21,529 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {24597#true} {24621#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #452#return; {24621#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:10:21,529 INFO L290 TraceCheckUtils]: 0: Hoare triple {24597#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); {24597#true} is VALID [2022-02-21 03:10:21,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {24597#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {24597#true} is VALID [2022-02-21 03:10:21,529 INFO L272 TraceCheckUtils]: 2: Hoare triple {24597#true} call main_#t~ret22#1 := base2flt(0, 0); {24632#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:21,530 INFO L290 TraceCheckUtils]: 3: Hoare triple {24632#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {24597#true} is VALID [2022-02-21 03:10:21,530 INFO L290 TraceCheckUtils]: 4: Hoare triple {24597#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {24597#true} is VALID [2022-02-21 03:10:21,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {24597#true} #res := ~__retres4~0; {24597#true} is VALID [2022-02-21 03:10:21,530 INFO L290 TraceCheckUtils]: 6: Hoare triple {24597#true} assume true; {24597#true} is VALID [2022-02-21 03:10:21,530 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {24597#true} {24597#true} #448#return; {24597#true} is VALID [2022-02-21 03:10:21,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {24597#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {24597#true} is VALID [2022-02-21 03:10:21,531 INFO L272 TraceCheckUtils]: 9: Hoare triple {24597#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {24632#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:21,531 INFO L290 TraceCheckUtils]: 10: Hoare triple {24632#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {24597#true} is VALID [2022-02-21 03:10:21,531 INFO L290 TraceCheckUtils]: 11: Hoare triple {24597#true} assume !(0 == ~m % 4294967296); {24597#true} is VALID [2022-02-21 03:10:21,531 INFO L290 TraceCheckUtils]: 12: Hoare triple {24597#true} assume !(~m % 4294967296 < 16777216); {24597#true} is VALID [2022-02-21 03:10:21,531 INFO L290 TraceCheckUtils]: 13: Hoare triple {24597#true} assume !false; {24597#true} is VALID [2022-02-21 03:10:21,531 INFO L290 TraceCheckUtils]: 14: Hoare triple {24597#true} assume !(~m % 4294967296 >= 33554432); {24597#true} is VALID [2022-02-21 03:10:21,531 INFO L290 TraceCheckUtils]: 15: Hoare triple {24597#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {24597#true} is VALID [2022-02-21 03:10:21,532 INFO L290 TraceCheckUtils]: 16: Hoare triple {24597#true} assume 128 + ~e <= 2147483647; {24597#true} is VALID [2022-02-21 03:10:21,532 INFO L290 TraceCheckUtils]: 17: Hoare triple {24597#true} assume 128 + ~e >= -2147483648; {24597#true} is VALID [2022-02-21 03:10:21,532 INFO L290 TraceCheckUtils]: 18: Hoare triple {24597#true} assume 128 + ~e <= 2147483647; {24597#true} is VALID [2022-02-21 03:10:21,532 INFO L290 TraceCheckUtils]: 19: Hoare triple {24597#true} assume 128 + ~e >= -2147483648; {24597#true} is VALID [2022-02-21 03:10:21,532 INFO L290 TraceCheckUtils]: 20: Hoare triple {24597#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {24597#true} is VALID [2022-02-21 03:10:21,532 INFO L290 TraceCheckUtils]: 21: Hoare triple {24597#true} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {24633#(and (<= 0 base2flt_~res~0) (<= base2flt_~res~0 0))} is VALID [2022-02-21 03:10:21,533 INFO L290 TraceCheckUtils]: 22: Hoare triple {24633#(and (<= 0 base2flt_~res~0) (<= base2flt_~res~0 0))} ~__retres4~0 := ~res~0; {24634#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:21,533 INFO L290 TraceCheckUtils]: 23: Hoare triple {24634#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {24635#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:21,533 INFO L290 TraceCheckUtils]: 24: Hoare triple {24635#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {24635#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:21,534 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {24635#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {24597#true} #450#return; {24620#(and (<= 0 |ULTIMATE.start_main_#t~ret23#1|) (<= |ULTIMATE.start_main_#t~ret23#1| 0))} is VALID [2022-02-21 03:10:21,534 INFO L290 TraceCheckUtils]: 26: Hoare triple {24620#(and (<= 0 |ULTIMATE.start_main_#t~ret23#1|) (<= |ULTIMATE.start_main_#t~ret23#1| 0))} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {24621#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:10:21,535 INFO L272 TraceCheckUtils]: 27: Hoare triple {24621#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {24632#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:21,535 INFO L290 TraceCheckUtils]: 28: Hoare triple {24632#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {24597#true} is VALID [2022-02-21 03:10:21,535 INFO L290 TraceCheckUtils]: 29: Hoare triple {24597#true} assume !(0 == ~m % 4294967296); {24597#true} is VALID [2022-02-21 03:10:21,535 INFO L290 TraceCheckUtils]: 30: Hoare triple {24597#true} assume !(~m % 4294967296 < 16777216); {24597#true} is VALID [2022-02-21 03:10:21,535 INFO L290 TraceCheckUtils]: 31: Hoare triple {24597#true} assume !false; {24597#true} is VALID [2022-02-21 03:10:21,536 INFO L290 TraceCheckUtils]: 32: Hoare triple {24597#true} assume ~m % 4294967296 >= 33554432; {24597#true} is VALID [2022-02-21 03:10:21,536 INFO L290 TraceCheckUtils]: 33: Hoare triple {24597#true} assume ~e >= 127;~__retres4~0 := 4294967295; {24597#true} is VALID [2022-02-21 03:10:21,536 INFO L290 TraceCheckUtils]: 34: Hoare triple {24597#true} #res := ~__retres4~0; {24597#true} is VALID [2022-02-21 03:10:21,536 INFO L290 TraceCheckUtils]: 35: Hoare triple {24597#true} assume true; {24597#true} is VALID [2022-02-21 03:10:21,536 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {24597#true} {24621#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #452#return; {24621#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:10:21,537 INFO L290 TraceCheckUtils]: 37: Hoare triple {24621#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {24621#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:10:21,537 INFO L290 TraceCheckUtils]: 38: Hoare triple {24621#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume !(main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {24631#(and (<= (+ (* (div |ULTIMATE.start_main_~zero~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~a~0#1|) |ULTIMATE.start_main_~zero~0#1|) (< 0 (+ (div |ULTIMATE.start_main_~a~0#1| 4294967296) 1)))} is VALID [2022-02-21 03:10:21,538 INFO L290 TraceCheckUtils]: 39: Hoare triple {24631#(and (<= (+ (* (div |ULTIMATE.start_main_~zero~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~a~0#1|) |ULTIMATE.start_main_~zero~0#1|) (< 0 (+ (div |ULTIMATE.start_main_~a~0#1| 4294967296) 1)))} assume main_~a~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {24598#false} is VALID [2022-02-21 03:10:21,538 INFO L290 TraceCheckUtils]: 40: Hoare triple {24598#false} main_~sa~0#1 := main_~tmp~2#1; {24598#false} is VALID [2022-02-21 03:10:21,538 INFO L290 TraceCheckUtils]: 41: Hoare triple {24598#false} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {24598#false} is VALID [2022-02-21 03:10:21,538 INFO L290 TraceCheckUtils]: 42: Hoare triple {24598#false} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {24598#false} is VALID [2022-02-21 03:10:21,538 INFO L290 TraceCheckUtils]: 43: Hoare triple {24598#false} main_~sb~0#1 := main_~tmp___0~0#1; {24598#false} is VALID [2022-02-21 03:10:21,538 INFO L290 TraceCheckUtils]: 44: Hoare triple {24598#false} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {24598#false} is VALID [2022-02-21 03:10:21,539 INFO L290 TraceCheckUtils]: 45: Hoare triple {24598#false} assume addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296;addflt_~tmp~0#1 := addflt_~a#1;addflt_~a#1 := addflt_~b#1;addflt_~b#1 := addflt_~tmp~0#1; {24598#false} is VALID [2022-02-21 03:10:21,539 INFO L290 TraceCheckUtils]: 46: Hoare triple {24598#false} assume !(0 == addflt_~b#1 % 4294967296); {24598#false} is VALID [2022-02-21 03:10:21,539 INFO L290 TraceCheckUtils]: 47: Hoare triple {24598#false} assume !(0 == addflt_~a#1); {24598#false} is VALID [2022-02-21 03:10:21,539 INFO L290 TraceCheckUtils]: 48: Hoare triple {24598#false} assume !false; {24598#false} is VALID [2022-02-21 03:10:21,539 INFO L290 TraceCheckUtils]: 49: Hoare triple {24598#false} assume !false; {24598#false} is VALID [2022-02-21 03:10:21,539 INFO L290 TraceCheckUtils]: 50: Hoare triple {24598#false} assume addflt_~a#1 >= 0;abs_108 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_108; {24598#false} is VALID [2022-02-21 03:10:21,539 INFO L290 TraceCheckUtils]: 51: Hoare triple {24598#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {24598#false} is VALID [2022-02-21 03:10:21,539 INFO L290 TraceCheckUtils]: 52: Hoare triple {24598#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {24598#false} is VALID [2022-02-21 03:10:21,540 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:21,540 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:21,540 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664670546] [2022-02-21 03:10:21,540 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664670546] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:21,540 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615312402] [2022-02-21 03:10:21,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:21,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:21,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:21,542 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:10:21,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-02-21 03:10:21,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:21,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-21 03:10:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:21,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:22,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {24597#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); {24597#true} is VALID [2022-02-21 03:10:22,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {24597#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {24597#true} is VALID [2022-02-21 03:10:22,033 INFO L272 TraceCheckUtils]: 2: Hoare triple {24597#true} call main_#t~ret22#1 := base2flt(0, 0); {24597#true} is VALID [2022-02-21 03:10:22,033 INFO L290 TraceCheckUtils]: 3: Hoare triple {24597#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {24648#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:22,034 INFO L290 TraceCheckUtils]: 4: Hoare triple {24648#(= base2flt_~m |base2flt_#in~m|)} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {24652#(<= (mod |base2flt_#in~m| 4294967296) 0)} is VALID [2022-02-21 03:10:22,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {24652#(<= (mod |base2flt_#in~m| 4294967296) 0)} #res := ~__retres4~0; {24652#(<= (mod |base2flt_#in~m| 4294967296) 0)} is VALID [2022-02-21 03:10:22,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {24652#(<= (mod |base2flt_#in~m| 4294967296) 0)} assume true; {24652#(<= (mod |base2flt_#in~m| 4294967296) 0)} is VALID [2022-02-21 03:10:22,034 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {24652#(<= (mod |base2flt_#in~m| 4294967296) 0)} {24597#true} #448#return; {24597#true} is VALID [2022-02-21 03:10:22,034 INFO L290 TraceCheckUtils]: 8: Hoare triple {24597#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {24597#true} is VALID [2022-02-21 03:10:22,034 INFO L272 TraceCheckUtils]: 9: Hoare triple {24597#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {24597#true} is VALID [2022-02-21 03:10:22,034 INFO L290 TraceCheckUtils]: 10: Hoare triple {24597#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {24597#true} is VALID [2022-02-21 03:10:22,034 INFO L290 TraceCheckUtils]: 11: Hoare triple {24597#true} assume !(0 == ~m % 4294967296); {24597#true} is VALID [2022-02-21 03:10:22,034 INFO L290 TraceCheckUtils]: 12: Hoare triple {24597#true} assume !(~m % 4294967296 < 16777216); {24597#true} is VALID [2022-02-21 03:10:22,035 INFO L290 TraceCheckUtils]: 13: Hoare triple {24597#true} assume !false; {24597#true} is VALID [2022-02-21 03:10:22,035 INFO L290 TraceCheckUtils]: 14: Hoare triple {24597#true} assume !(~m % 4294967296 >= 33554432); {24597#true} is VALID [2022-02-21 03:10:22,035 INFO L290 TraceCheckUtils]: 15: Hoare triple {24597#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {24597#true} is VALID [2022-02-21 03:10:22,035 INFO L290 TraceCheckUtils]: 16: Hoare triple {24597#true} assume 128 + ~e <= 2147483647; {24597#true} is VALID [2022-02-21 03:10:22,035 INFO L290 TraceCheckUtils]: 17: Hoare triple {24597#true} assume 128 + ~e >= -2147483648; {24597#true} is VALID [2022-02-21 03:10:22,035 INFO L290 TraceCheckUtils]: 18: Hoare triple {24597#true} assume 128 + ~e <= 2147483647; {24597#true} is VALID [2022-02-21 03:10:22,035 INFO L290 TraceCheckUtils]: 19: Hoare triple {24597#true} assume 128 + ~e >= -2147483648; {24597#true} is VALID [2022-02-21 03:10:22,035 INFO L290 TraceCheckUtils]: 20: Hoare triple {24597#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {24597#true} is VALID [2022-02-21 03:10:22,036 INFO L290 TraceCheckUtils]: 21: Hoare triple {24597#true} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {24633#(and (<= 0 base2flt_~res~0) (<= base2flt_~res~0 0))} is VALID [2022-02-21 03:10:22,036 INFO L290 TraceCheckUtils]: 22: Hoare triple {24633#(and (<= 0 base2flt_~res~0) (<= base2flt_~res~0 0))} ~__retres4~0 := ~res~0; {24634#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:22,036 INFO L290 TraceCheckUtils]: 23: Hoare triple {24634#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {24635#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:22,037 INFO L290 TraceCheckUtils]: 24: Hoare triple {24635#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {24635#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:22,037 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {24635#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {24597#true} #450#return; {24620#(and (<= 0 |ULTIMATE.start_main_#t~ret23#1|) (<= |ULTIMATE.start_main_#t~ret23#1| 0))} is VALID [2022-02-21 03:10:22,038 INFO L290 TraceCheckUtils]: 26: Hoare triple {24620#(and (<= 0 |ULTIMATE.start_main_#t~ret23#1|) (<= |ULTIMATE.start_main_#t~ret23#1| 0))} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {24621#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:10:22,038 INFO L272 TraceCheckUtils]: 27: Hoare triple {24621#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {24597#true} is VALID [2022-02-21 03:10:22,038 INFO L290 TraceCheckUtils]: 28: Hoare triple {24597#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {24597#true} is VALID [2022-02-21 03:10:22,038 INFO L290 TraceCheckUtils]: 29: Hoare triple {24597#true} assume !(0 == ~m % 4294967296); {24597#true} is VALID [2022-02-21 03:10:22,038 INFO L290 TraceCheckUtils]: 30: Hoare triple {24597#true} assume !(~m % 4294967296 < 16777216); {24597#true} is VALID [2022-02-21 03:10:22,038 INFO L290 TraceCheckUtils]: 31: Hoare triple {24597#true} assume !false; {24597#true} is VALID [2022-02-21 03:10:22,038 INFO L290 TraceCheckUtils]: 32: Hoare triple {24597#true} assume ~m % 4294967296 >= 33554432; {24597#true} is VALID [2022-02-21 03:10:22,038 INFO L290 TraceCheckUtils]: 33: Hoare triple {24597#true} assume ~e >= 127;~__retres4~0 := 4294967295; {24597#true} is VALID [2022-02-21 03:10:22,038 INFO L290 TraceCheckUtils]: 34: Hoare triple {24597#true} #res := ~__retres4~0; {24597#true} is VALID [2022-02-21 03:10:22,038 INFO L290 TraceCheckUtils]: 35: Hoare triple {24597#true} assume true; {24597#true} is VALID [2022-02-21 03:10:22,039 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {24597#true} {24621#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #452#return; {24621#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:10:22,039 INFO L290 TraceCheckUtils]: 37: Hoare triple {24621#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {24621#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:10:22,040 INFO L290 TraceCheckUtils]: 38: Hoare triple {24621#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume !(main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {24621#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:10:22,040 INFO L290 TraceCheckUtils]: 39: Hoare triple {24621#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {24621#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:10:22,040 INFO L290 TraceCheckUtils]: 40: Hoare triple {24621#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} main_~sa~0#1 := main_~tmp~2#1; {24621#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:10:22,041 INFO L290 TraceCheckUtils]: 41: Hoare triple {24621#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {24621#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:10:22,041 INFO L290 TraceCheckUtils]: 42: Hoare triple {24621#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {24621#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:10:22,042 INFO L290 TraceCheckUtils]: 43: Hoare triple {24621#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} main_~sb~0#1 := main_~tmp___0~0#1; {24621#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:10:22,042 INFO L290 TraceCheckUtils]: 44: Hoare triple {24621#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {24773#(and (<= |ULTIMATE.start_addflt_~a#1| 0) (<= 0 |ULTIMATE.start_addflt_~a#1|))} is VALID [2022-02-21 03:10:22,042 INFO L290 TraceCheckUtils]: 45: Hoare triple {24773#(and (<= |ULTIMATE.start_addflt_~a#1| 0) (<= 0 |ULTIMATE.start_addflt_~a#1|))} assume addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296;addflt_~tmp~0#1 := addflt_~a#1;addflt_~a#1 := addflt_~b#1;addflt_~b#1 := addflt_~tmp~0#1; {24777#(and (<= |ULTIMATE.start_addflt_~b#1| 0) (<= 0 |ULTIMATE.start_addflt_~b#1|))} is VALID [2022-02-21 03:10:22,043 INFO L290 TraceCheckUtils]: 46: Hoare triple {24777#(and (<= |ULTIMATE.start_addflt_~b#1| 0) (<= 0 |ULTIMATE.start_addflt_~b#1|))} assume !(0 == addflt_~b#1 % 4294967296); {24598#false} is VALID [2022-02-21 03:10:22,043 INFO L290 TraceCheckUtils]: 47: Hoare triple {24598#false} assume !(0 == addflt_~a#1); {24598#false} is VALID [2022-02-21 03:10:22,043 INFO L290 TraceCheckUtils]: 48: Hoare triple {24598#false} assume !false; {24598#false} is VALID [2022-02-21 03:10:22,043 INFO L290 TraceCheckUtils]: 49: Hoare triple {24598#false} assume !false; {24598#false} is VALID [2022-02-21 03:10:22,043 INFO L290 TraceCheckUtils]: 50: Hoare triple {24598#false} assume addflt_~a#1 >= 0;abs_108 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_108; {24598#false} is VALID [2022-02-21 03:10:22,043 INFO L290 TraceCheckUtils]: 51: Hoare triple {24598#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {24598#false} is VALID [2022-02-21 03:10:22,043 INFO L290 TraceCheckUtils]: 52: Hoare triple {24598#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {24598#false} is VALID [2022-02-21 03:10:22,043 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-21 03:10:22,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:10:22,293 INFO L290 TraceCheckUtils]: 52: Hoare triple {24598#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {24598#false} is VALID [2022-02-21 03:10:22,293 INFO L290 TraceCheckUtils]: 51: Hoare triple {24598#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {24598#false} is VALID [2022-02-21 03:10:22,293 INFO L290 TraceCheckUtils]: 50: Hoare triple {24598#false} assume addflt_~a#1 >= 0;abs_108 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_108; {24598#false} is VALID [2022-02-21 03:10:22,293 INFO L290 TraceCheckUtils]: 49: Hoare triple {24598#false} assume !false; {24598#false} is VALID [2022-02-21 03:10:22,293 INFO L290 TraceCheckUtils]: 48: Hoare triple {24598#false} assume !false; {24598#false} is VALID [2022-02-21 03:10:22,293 INFO L290 TraceCheckUtils]: 47: Hoare triple {24598#false} assume !(0 == addflt_~a#1); {24598#false} is VALID [2022-02-21 03:10:22,293 INFO L290 TraceCheckUtils]: 46: Hoare triple {24817#(= (mod |ULTIMATE.start_addflt_~b#1| 4294967296) 0)} assume !(0 == addflt_~b#1 % 4294967296); {24598#false} is VALID [2022-02-21 03:10:22,294 INFO L290 TraceCheckUtils]: 45: Hoare triple {24821#(= (mod |ULTIMATE.start_addflt_~a#1| 4294967296) 0)} assume addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296;addflt_~tmp~0#1 := addflt_~a#1;addflt_~a#1 := addflt_~b#1;addflt_~b#1 := addflt_~tmp~0#1; {24817#(= (mod |ULTIMATE.start_addflt_~b#1| 4294967296) 0)} is VALID [2022-02-21 03:10:22,294 INFO L290 TraceCheckUtils]: 44: Hoare triple {24825#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {24821#(= (mod |ULTIMATE.start_addflt_~a#1| 4294967296) 0)} is VALID [2022-02-21 03:10:22,295 INFO L290 TraceCheckUtils]: 43: Hoare triple {24825#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} main_~sb~0#1 := main_~tmp___0~0#1; {24825#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:22,295 INFO L290 TraceCheckUtils]: 42: Hoare triple {24825#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {24825#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:22,295 INFO L290 TraceCheckUtils]: 41: Hoare triple {24825#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {24825#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:22,296 INFO L290 TraceCheckUtils]: 40: Hoare triple {24825#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} main_~sa~0#1 := main_~tmp~2#1; {24825#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:22,296 INFO L290 TraceCheckUtils]: 39: Hoare triple {24825#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} assume main_~a~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {24825#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:22,296 INFO L290 TraceCheckUtils]: 38: Hoare triple {24825#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} assume !(main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {24825#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:22,297 INFO L290 TraceCheckUtils]: 37: Hoare triple {24825#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {24825#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:22,297 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {24597#true} {24825#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} #452#return; {24825#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:22,297 INFO L290 TraceCheckUtils]: 35: Hoare triple {24597#true} assume true; {24597#true} is VALID [2022-02-21 03:10:22,297 INFO L290 TraceCheckUtils]: 34: Hoare triple {24597#true} #res := ~__retres4~0; {24597#true} is VALID [2022-02-21 03:10:22,297 INFO L290 TraceCheckUtils]: 33: Hoare triple {24597#true} assume ~e >= 127;~__retres4~0 := 4294967295; {24597#true} is VALID [2022-02-21 03:10:22,297 INFO L290 TraceCheckUtils]: 32: Hoare triple {24597#true} assume ~m % 4294967296 >= 33554432; {24597#true} is VALID [2022-02-21 03:10:22,297 INFO L290 TraceCheckUtils]: 31: Hoare triple {24597#true} assume !false; {24597#true} is VALID [2022-02-21 03:10:22,298 INFO L290 TraceCheckUtils]: 30: Hoare triple {24597#true} assume !(~m % 4294967296 < 16777216); {24597#true} is VALID [2022-02-21 03:10:22,298 INFO L290 TraceCheckUtils]: 29: Hoare triple {24597#true} assume !(0 == ~m % 4294967296); {24597#true} is VALID [2022-02-21 03:10:22,298 INFO L290 TraceCheckUtils]: 28: Hoare triple {24597#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {24597#true} is VALID [2022-02-21 03:10:22,298 INFO L272 TraceCheckUtils]: 27: Hoare triple {24825#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {24597#true} is VALID [2022-02-21 03:10:22,298 INFO L290 TraceCheckUtils]: 26: Hoare triple {24880#(= (mod |ULTIMATE.start_main_#t~ret23#1| 4294967296) 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {24825#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:22,299 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {24887#(= (mod |base2flt_#res| 4294967296) 0)} {24597#true} #450#return; {24880#(= (mod |ULTIMATE.start_main_#t~ret23#1| 4294967296) 0)} is VALID [2022-02-21 03:10:22,299 INFO L290 TraceCheckUtils]: 24: Hoare triple {24887#(= (mod |base2flt_#res| 4294967296) 0)} assume true; {24887#(= (mod |base2flt_#res| 4294967296) 0)} is VALID [2022-02-21 03:10:22,299 INFO L290 TraceCheckUtils]: 23: Hoare triple {24894#(= (mod base2flt_~__retres4~0 4294967296) 0)} #res := ~__retres4~0; {24887#(= (mod |base2flt_#res| 4294967296) 0)} is VALID [2022-02-21 03:10:22,300 INFO L290 TraceCheckUtils]: 22: Hoare triple {24898#(= (mod base2flt_~res~0 4294967296) 0)} ~__retres4~0 := ~res~0; {24894#(= (mod base2flt_~__retres4~0 4294967296) 0)} is VALID [2022-02-21 03:10:22,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {24597#true} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {24898#(= (mod base2flt_~res~0 4294967296) 0)} is VALID [2022-02-21 03:10:22,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {24597#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {24597#true} is VALID [2022-02-21 03:10:22,300 INFO L290 TraceCheckUtils]: 19: Hoare triple {24597#true} assume 128 + ~e >= -2147483648; {24597#true} is VALID [2022-02-21 03:10:22,300 INFO L290 TraceCheckUtils]: 18: Hoare triple {24597#true} assume 128 + ~e <= 2147483647; {24597#true} is VALID [2022-02-21 03:10:22,300 INFO L290 TraceCheckUtils]: 17: Hoare triple {24597#true} assume 128 + ~e >= -2147483648; {24597#true} is VALID [2022-02-21 03:10:22,300 INFO L290 TraceCheckUtils]: 16: Hoare triple {24597#true} assume 128 + ~e <= 2147483647; {24597#true} is VALID [2022-02-21 03:10:22,301 INFO L290 TraceCheckUtils]: 15: Hoare triple {24597#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {24597#true} is VALID [2022-02-21 03:10:22,301 INFO L290 TraceCheckUtils]: 14: Hoare triple {24597#true} assume !(~m % 4294967296 >= 33554432); {24597#true} is VALID [2022-02-21 03:10:22,301 INFO L290 TraceCheckUtils]: 13: Hoare triple {24597#true} assume !false; {24597#true} is VALID [2022-02-21 03:10:22,301 INFO L290 TraceCheckUtils]: 12: Hoare triple {24597#true} assume !(~m % 4294967296 < 16777216); {24597#true} is VALID [2022-02-21 03:10:22,301 INFO L290 TraceCheckUtils]: 11: Hoare triple {24597#true} assume !(0 == ~m % 4294967296); {24597#true} is VALID [2022-02-21 03:10:22,301 INFO L290 TraceCheckUtils]: 10: Hoare triple {24597#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {24597#true} is VALID [2022-02-21 03:10:22,301 INFO L272 TraceCheckUtils]: 9: Hoare triple {24597#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {24597#true} is VALID [2022-02-21 03:10:22,301 INFO L290 TraceCheckUtils]: 8: Hoare triple {24597#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {24597#true} is VALID [2022-02-21 03:10:22,301 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {24597#true} {24597#true} #448#return; {24597#true} is VALID [2022-02-21 03:10:22,301 INFO L290 TraceCheckUtils]: 6: Hoare triple {24597#true} assume true; {24597#true} is VALID [2022-02-21 03:10:22,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {24597#true} #res := ~__retres4~0; {24597#true} is VALID [2022-02-21 03:10:22,301 INFO L290 TraceCheckUtils]: 4: Hoare triple {24597#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {24597#true} is VALID [2022-02-21 03:10:22,301 INFO L290 TraceCheckUtils]: 3: Hoare triple {24597#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {24597#true} is VALID [2022-02-21 03:10:22,301 INFO L272 TraceCheckUtils]: 2: Hoare triple {24597#true} call main_#t~ret22#1 := base2flt(0, 0); {24597#true} is VALID [2022-02-21 03:10:22,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {24597#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {24597#true} is VALID [2022-02-21 03:10:22,302 INFO L290 TraceCheckUtils]: 0: Hoare triple {24597#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); {24597#true} is VALID [2022-02-21 03:10:22,302 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:22,302 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615312402] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:10:22,302 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:10:22,302 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 20 [2022-02-21 03:10:22,302 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199271887] [2022-02-21 03:10:22,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:10:22,303 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.45) internal successors, (69), 17 states have internal predecessors, (69), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 53 [2022-02-21 03:10:22,303 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:22,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 3.45) internal successors, (69), 17 states have internal predecessors, (69), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:22,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:22,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-21 03:10:22,354 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:22,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-21 03:10:22,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-02-21 03:10:22,355 INFO L87 Difference]: Start difference. First operand 201 states and 246 transitions. Second operand has 20 states, 20 states have (on average 3.45) internal successors, (69), 17 states have internal predecessors, (69), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:24,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:24,317 INFO L93 Difference]: Finished difference Result 436 states and 552 transitions. [2022-02-21 03:10:24,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-21 03:10:24,317 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.45) internal successors, (69), 17 states have internal predecessors, (69), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 53 [2022-02-21 03:10:24,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:24,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 3.45) internal successors, (69), 17 states have internal predecessors, (69), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:24,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 347 transitions. [2022-02-21 03:10:24,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 3.45) internal successors, (69), 17 states have internal predecessors, (69), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:24,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 347 transitions. [2022-02-21 03:10:24,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 347 transitions. [2022-02-21 03:10:24,544 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 347 edges. 347 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:24,549 INFO L225 Difference]: With dead ends: 436 [2022-02-21 03:10:24,549 INFO L226 Difference]: Without dead ends: 346 [2022-02-21 03:10:24,550 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=226, Invalid=1180, Unknown=0, NotChecked=0, Total=1406 [2022-02-21 03:10:24,550 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 214 mSDsluCounter, 1428 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 1548 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:24,550 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 1548 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-21 03:10:24,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-02-21 03:10:24,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 186. [2022-02-21 03:10:24,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:24,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 346 states. Second operand has 186 states, 162 states have (on average 1.2901234567901234) internal successors, (209), 171 states have internal predecessors, (209), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-02-21 03:10:24,620 INFO L74 IsIncluded]: Start isIncluded. First operand 346 states. Second operand has 186 states, 162 states have (on average 1.2901234567901234) internal successors, (209), 171 states have internal predecessors, (209), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-02-21 03:10:24,620 INFO L87 Difference]: Start difference. First operand 346 states. Second operand has 186 states, 162 states have (on average 1.2901234567901234) internal successors, (209), 171 states have internal predecessors, (209), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-02-21 03:10:24,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:24,639 INFO L93 Difference]: Finished difference Result 346 states and 439 transitions. [2022-02-21 03:10:24,639 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 439 transitions. [2022-02-21 03:10:24,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:24,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:24,641 INFO L74 IsIncluded]: Start isIncluded. First operand has 186 states, 162 states have (on average 1.2901234567901234) internal successors, (209), 171 states have internal predecessors, (209), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) Second operand 346 states. [2022-02-21 03:10:24,641 INFO L87 Difference]: Start difference. First operand has 186 states, 162 states have (on average 1.2901234567901234) internal successors, (209), 171 states have internal predecessors, (209), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) Second operand 346 states. [2022-02-21 03:10:24,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:24,648 INFO L93 Difference]: Finished difference Result 346 states and 439 transitions. [2022-02-21 03:10:24,648 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 439 transitions. [2022-02-21 03:10:24,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:24,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:24,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:24,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:24,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 162 states have (on average 1.2901234567901234) internal successors, (209), 171 states have internal predecessors, (209), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-02-21 03:10:24,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 227 transitions. [2022-02-21 03:10:24,652 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 227 transitions. Word has length 53 [2022-02-21 03:10:24,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:24,653 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 227 transitions. [2022-02-21 03:10:24,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.45) internal successors, (69), 17 states have internal predecessors, (69), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:24,653 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 227 transitions. [2022-02-21 03:10:24,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-21 03:10:24,653 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:24,654 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, 1, 1, 1, 1, 1] [2022-02-21 03:10:24,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-02-21 03:10:24,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-02-21 03:10:24,871 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:24,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:24,872 INFO L85 PathProgramCache]: Analyzing trace with hash 239613636, now seen corresponding path program 1 times [2022-02-21 03:10:24,872 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:24,872 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083131501] [2022-02-21 03:10:24,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:24,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:24,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:24,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:24,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {26422#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {26390#true} is VALID [2022-02-21 03:10:24,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {26390#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {26390#true} is VALID [2022-02-21 03:10:24,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {26390#true} #res := ~__retres4~0; {26390#true} is VALID [2022-02-21 03:10:24,896 INFO L290 TraceCheckUtils]: 3: Hoare triple {26390#true} assume true; {26390#true} is VALID [2022-02-21 03:10:24,897 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {26390#true} {26390#true} #448#return; {26390#true} is VALID [2022-02-21 03:10:24,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:24,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:24,930 INFO L290 TraceCheckUtils]: 0: Hoare triple {26422#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {26390#true} is VALID [2022-02-21 03:10:24,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {26390#true} assume !(0 == ~m % 4294967296); {26390#true} is VALID [2022-02-21 03:10:24,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {26390#true} assume !(~m % 4294967296 < 16777216); {26423#(or (<= (+ (div base2flt_~m 4294967296) 1) 0) (<= (+ 16777216 (* (div base2flt_~m 4294967296) 4294967296)) base2flt_~m))} is VALID [2022-02-21 03:10:24,931 INFO L290 TraceCheckUtils]: 3: Hoare triple {26423#(or (<= (+ (div base2flt_~m 4294967296) 1) 0) (<= (+ 16777216 (* (div base2flt_~m 4294967296) 4294967296)) base2flt_~m))} assume !false; {26423#(or (<= (+ (div base2flt_~m 4294967296) 1) 0) (<= (+ 16777216 (* (div base2flt_~m 4294967296) 4294967296)) base2flt_~m))} is VALID [2022-02-21 03:10:24,932 INFO L290 TraceCheckUtils]: 4: Hoare triple {26423#(or (<= (+ (div base2flt_~m 4294967296) 1) 0) (<= (+ 16777216 (* (div base2flt_~m 4294967296) 4294967296)) base2flt_~m))} assume !(~m % 4294967296 >= 33554432); {26424#(and (or (not (<= (+ (div base2flt_~m 4294967296) 1) 0)) (<= base2flt_~m (+ 33554431 (* (div base2flt_~m 4294967296) 4294967296)))) (or (<= (+ (div base2flt_~m 4294967296) 1) 0) (<= (+ 16777216 (* (div base2flt_~m 4294967296) 4294967296)) base2flt_~m)))} is VALID [2022-02-21 03:10:24,932 INFO L290 TraceCheckUtils]: 5: Hoare triple {26424#(and (or (not (<= (+ (div base2flt_~m 4294967296) 1) 0)) (<= base2flt_~m (+ 33554431 (* (div base2flt_~m 4294967296) 4294967296)))) (or (<= (+ (div base2flt_~m 4294967296) 1) 0) (<= (+ 16777216 (* (div base2flt_~m 4294967296) 4294967296)) base2flt_~m)))} assume !(0 == ~m || 0 == ~bitwiseComplement(16777216)); {26424#(and (or (not (<= (+ (div base2flt_~m 4294967296) 1) 0)) (<= base2flt_~m (+ 33554431 (* (div base2flt_~m 4294967296) 4294967296)))) (or (<= (+ (div base2flt_~m 4294967296) 1) 0) (<= (+ 16777216 (* (div base2flt_~m 4294967296) 4294967296)) base2flt_~m)))} is VALID [2022-02-21 03:10:24,933 INFO L290 TraceCheckUtils]: 6: Hoare triple {26424#(and (or (not (<= (+ (div base2flt_~m 4294967296) 1) 0)) (<= base2flt_~m (+ 33554431 (* (div base2flt_~m 4294967296) 4294967296)))) (or (<= (+ (div base2flt_~m 4294967296) 1) 0) (<= (+ 16777216 (* (div base2flt_~m 4294967296) 4294967296)) base2flt_~m)))} assume 1 == ~m && (0 == ~bitwiseComplement(16777216) || 1 == ~bitwiseComplement(16777216));~m := ~bitwiseComplement(16777216); {26391#false} is VALID [2022-02-21 03:10:24,933 INFO L290 TraceCheckUtils]: 7: Hoare triple {26391#false} assume 128 + ~e <= 2147483647; {26391#false} is VALID [2022-02-21 03:10:24,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {26391#false} assume 128 + ~e >= -2147483648; {26391#false} is VALID [2022-02-21 03:10:24,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {26391#false} assume 128 + ~e <= 2147483647; {26391#false} is VALID [2022-02-21 03:10:24,933 INFO L290 TraceCheckUtils]: 10: Hoare triple {26391#false} assume 128 + ~e >= -2147483648; {26391#false} is VALID [2022-02-21 03:10:24,934 INFO L290 TraceCheckUtils]: 11: Hoare triple {26391#false} assume (1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e));~res~0 := 1; {26391#false} is VALID [2022-02-21 03:10:24,934 INFO L290 TraceCheckUtils]: 12: Hoare triple {26391#false} ~__retres4~0 := ~res~0; {26391#false} is VALID [2022-02-21 03:10:24,934 INFO L290 TraceCheckUtils]: 13: Hoare triple {26391#false} #res := ~__retres4~0; {26391#false} is VALID [2022-02-21 03:10:24,934 INFO L290 TraceCheckUtils]: 14: Hoare triple {26391#false} assume true; {26391#false} is VALID [2022-02-21 03:10:24,934 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26391#false} {26390#true} #450#return; {26391#false} is VALID [2022-02-21 03:10:24,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-21 03:10:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:24,938 INFO L290 TraceCheckUtils]: 0: Hoare triple {26422#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {26390#true} is VALID [2022-02-21 03:10:24,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {26390#true} assume !(0 == ~m % 4294967296); {26390#true} is VALID [2022-02-21 03:10:24,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {26390#true} assume !(~m % 4294967296 < 16777216); {26390#true} is VALID [2022-02-21 03:10:24,939 INFO L290 TraceCheckUtils]: 3: Hoare triple {26390#true} assume !false; {26390#true} is VALID [2022-02-21 03:10:24,939 INFO L290 TraceCheckUtils]: 4: Hoare triple {26390#true} assume ~m % 4294967296 >= 33554432; {26390#true} is VALID [2022-02-21 03:10:24,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {26390#true} assume ~e >= 127;~__retres4~0 := 4294967295; {26390#true} is VALID [2022-02-21 03:10:24,939 INFO L290 TraceCheckUtils]: 6: Hoare triple {26390#true} #res := ~__retres4~0; {26390#true} is VALID [2022-02-21 03:10:24,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {26390#true} assume true; {26390#true} is VALID [2022-02-21 03:10:24,940 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {26390#true} {26391#false} #452#return; {26391#false} is VALID [2022-02-21 03:10:24,940 INFO L290 TraceCheckUtils]: 0: Hoare triple {26390#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); {26390#true} is VALID [2022-02-21 03:10:24,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {26390#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {26390#true} is VALID [2022-02-21 03:10:24,940 INFO L272 TraceCheckUtils]: 2: Hoare triple {26390#true} call main_#t~ret22#1 := base2flt(0, 0); {26422#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:24,941 INFO L290 TraceCheckUtils]: 3: Hoare triple {26422#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {26390#true} is VALID [2022-02-21 03:10:24,941 INFO L290 TraceCheckUtils]: 4: Hoare triple {26390#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {26390#true} is VALID [2022-02-21 03:10:24,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {26390#true} #res := ~__retres4~0; {26390#true} is VALID [2022-02-21 03:10:24,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {26390#true} assume true; {26390#true} is VALID [2022-02-21 03:10:24,941 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {26390#true} {26390#true} #448#return; {26390#true} is VALID [2022-02-21 03:10:24,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {26390#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {26390#true} is VALID [2022-02-21 03:10:24,942 INFO L272 TraceCheckUtils]: 9: Hoare triple {26390#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {26422#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:24,942 INFO L290 TraceCheckUtils]: 10: Hoare triple {26422#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {26390#true} is VALID [2022-02-21 03:10:24,942 INFO L290 TraceCheckUtils]: 11: Hoare triple {26390#true} assume !(0 == ~m % 4294967296); {26390#true} is VALID [2022-02-21 03:10:24,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {26390#true} assume !(~m % 4294967296 < 16777216); {26423#(or (<= (+ (div base2flt_~m 4294967296) 1) 0) (<= (+ 16777216 (* (div base2flt_~m 4294967296) 4294967296)) base2flt_~m))} is VALID [2022-02-21 03:10:24,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {26423#(or (<= (+ (div base2flt_~m 4294967296) 1) 0) (<= (+ 16777216 (* (div base2flt_~m 4294967296) 4294967296)) base2flt_~m))} assume !false; {26423#(or (<= (+ (div base2flt_~m 4294967296) 1) 0) (<= (+ 16777216 (* (div base2flt_~m 4294967296) 4294967296)) base2flt_~m))} is VALID [2022-02-21 03:10:24,943 INFO L290 TraceCheckUtils]: 14: Hoare triple {26423#(or (<= (+ (div base2flt_~m 4294967296) 1) 0) (<= (+ 16777216 (* (div base2flt_~m 4294967296) 4294967296)) base2flt_~m))} assume !(~m % 4294967296 >= 33554432); {26424#(and (or (not (<= (+ (div base2flt_~m 4294967296) 1) 0)) (<= base2flt_~m (+ 33554431 (* (div base2flt_~m 4294967296) 4294967296)))) (or (<= (+ (div base2flt_~m 4294967296) 1) 0) (<= (+ 16777216 (* (div base2flt_~m 4294967296) 4294967296)) base2flt_~m)))} is VALID [2022-02-21 03:10:24,944 INFO L290 TraceCheckUtils]: 15: Hoare triple {26424#(and (or (not (<= (+ (div base2flt_~m 4294967296) 1) 0)) (<= base2flt_~m (+ 33554431 (* (div base2flt_~m 4294967296) 4294967296)))) (or (<= (+ (div base2flt_~m 4294967296) 1) 0) (<= (+ 16777216 (* (div base2flt_~m 4294967296) 4294967296)) base2flt_~m)))} assume !(0 == ~m || 0 == ~bitwiseComplement(16777216)); {26424#(and (or (not (<= (+ (div base2flt_~m 4294967296) 1) 0)) (<= base2flt_~m (+ 33554431 (* (div base2flt_~m 4294967296) 4294967296)))) (or (<= (+ (div base2flt_~m 4294967296) 1) 0) (<= (+ 16777216 (* (div base2flt_~m 4294967296) 4294967296)) base2flt_~m)))} is VALID [2022-02-21 03:10:24,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {26424#(and (or (not (<= (+ (div base2flt_~m 4294967296) 1) 0)) (<= base2flt_~m (+ 33554431 (* (div base2flt_~m 4294967296) 4294967296)))) (or (<= (+ (div base2flt_~m 4294967296) 1) 0) (<= (+ 16777216 (* (div base2flt_~m 4294967296) 4294967296)) base2flt_~m)))} assume 1 == ~m && (0 == ~bitwiseComplement(16777216) || 1 == ~bitwiseComplement(16777216));~m := ~bitwiseComplement(16777216); {26391#false} is VALID [2022-02-21 03:10:24,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {26391#false} assume 128 + ~e <= 2147483647; {26391#false} is VALID [2022-02-21 03:10:24,944 INFO L290 TraceCheckUtils]: 18: Hoare triple {26391#false} assume 128 + ~e >= -2147483648; {26391#false} is VALID [2022-02-21 03:10:24,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {26391#false} assume 128 + ~e <= 2147483647; {26391#false} is VALID [2022-02-21 03:10:24,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {26391#false} assume 128 + ~e >= -2147483648; {26391#false} is VALID [2022-02-21 03:10:24,945 INFO L290 TraceCheckUtils]: 21: Hoare triple {26391#false} assume (1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e));~res~0 := 1; {26391#false} is VALID [2022-02-21 03:10:24,945 INFO L290 TraceCheckUtils]: 22: Hoare triple {26391#false} ~__retres4~0 := ~res~0; {26391#false} is VALID [2022-02-21 03:10:24,945 INFO L290 TraceCheckUtils]: 23: Hoare triple {26391#false} #res := ~__retres4~0; {26391#false} is VALID [2022-02-21 03:10:24,945 INFO L290 TraceCheckUtils]: 24: Hoare triple {26391#false} assume true; {26391#false} is VALID [2022-02-21 03:10:24,945 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {26391#false} {26390#true} #450#return; {26391#false} is VALID [2022-02-21 03:10:24,945 INFO L290 TraceCheckUtils]: 26: Hoare triple {26391#false} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {26391#false} is VALID [2022-02-21 03:10:24,946 INFO L272 TraceCheckUtils]: 27: Hoare triple {26391#false} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {26422#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:24,946 INFO L290 TraceCheckUtils]: 28: Hoare triple {26422#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {26390#true} is VALID [2022-02-21 03:10:24,946 INFO L290 TraceCheckUtils]: 29: Hoare triple {26390#true} assume !(0 == ~m % 4294967296); {26390#true} is VALID [2022-02-21 03:10:24,946 INFO L290 TraceCheckUtils]: 30: Hoare triple {26390#true} assume !(~m % 4294967296 < 16777216); {26390#true} is VALID [2022-02-21 03:10:24,946 INFO L290 TraceCheckUtils]: 31: Hoare triple {26390#true} assume !false; {26390#true} is VALID [2022-02-21 03:10:24,946 INFO L290 TraceCheckUtils]: 32: Hoare triple {26390#true} assume ~m % 4294967296 >= 33554432; {26390#true} is VALID [2022-02-21 03:10:24,946 INFO L290 TraceCheckUtils]: 33: Hoare triple {26390#true} assume ~e >= 127;~__retres4~0 := 4294967295; {26390#true} is VALID [2022-02-21 03:10:24,946 INFO L290 TraceCheckUtils]: 34: Hoare triple {26390#true} #res := ~__retres4~0; {26390#true} is VALID [2022-02-21 03:10:24,947 INFO L290 TraceCheckUtils]: 35: Hoare triple {26390#true} assume true; {26390#true} is VALID [2022-02-21 03:10:24,947 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {26390#true} {26391#false} #452#return; {26391#false} is VALID [2022-02-21 03:10:24,947 INFO L290 TraceCheckUtils]: 37: Hoare triple {26391#false} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {26391#false} is VALID [2022-02-21 03:10:24,947 INFO L290 TraceCheckUtils]: 38: Hoare triple {26391#false} assume !(main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {26391#false} is VALID [2022-02-21 03:10:24,947 INFO L290 TraceCheckUtils]: 39: Hoare triple {26391#false} assume main_~a~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {26391#false} is VALID [2022-02-21 03:10:24,947 INFO L290 TraceCheckUtils]: 40: Hoare triple {26391#false} main_~sa~0#1 := main_~tmp~2#1; {26391#false} is VALID [2022-02-21 03:10:24,947 INFO L290 TraceCheckUtils]: 41: Hoare triple {26391#false} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {26391#false} is VALID [2022-02-21 03:10:24,948 INFO L290 TraceCheckUtils]: 42: Hoare triple {26391#false} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {26391#false} is VALID [2022-02-21 03:10:24,948 INFO L290 TraceCheckUtils]: 43: Hoare triple {26391#false} main_~sb~0#1 := main_~tmp___0~0#1; {26391#false} is VALID [2022-02-21 03:10:24,948 INFO L290 TraceCheckUtils]: 44: Hoare triple {26391#false} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {26391#false} is VALID [2022-02-21 03:10:24,948 INFO L290 TraceCheckUtils]: 45: Hoare triple {26391#false} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {26391#false} is VALID [2022-02-21 03:10:24,948 INFO L290 TraceCheckUtils]: 46: Hoare triple {26391#false} assume !(0 == addflt_~b#1 % 4294967296); {26391#false} is VALID [2022-02-21 03:10:24,948 INFO L290 TraceCheckUtils]: 47: Hoare triple {26391#false} assume !(0 == addflt_~a#1); {26391#false} is VALID [2022-02-21 03:10:24,948 INFO L290 TraceCheckUtils]: 48: Hoare triple {26391#false} assume !false; {26391#false} is VALID [2022-02-21 03:10:24,949 INFO L290 TraceCheckUtils]: 49: Hoare triple {26391#false} assume !false; {26391#false} is VALID [2022-02-21 03:10:24,949 INFO L290 TraceCheckUtils]: 50: Hoare triple {26391#false} assume addflt_~a#1 >= 0;abs_108 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_108; {26391#false} is VALID [2022-02-21 03:10:24,949 INFO L290 TraceCheckUtils]: 51: Hoare triple {26391#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {26391#false} is VALID [2022-02-21 03:10:24,949 INFO L290 TraceCheckUtils]: 52: Hoare triple {26391#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {26391#false} is VALID [2022-02-21 03:10:24,949 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-21 03:10:24,949 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:24,950 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083131501] [2022-02-21 03:10:24,950 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083131501] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:24,950 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829816569] [2022-02-21 03:10:24,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:24,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:24,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:24,959 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:10:24,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-02-21 03:10:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:25,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:10:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:25,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:25,137 INFO L290 TraceCheckUtils]: 0: Hoare triple {26390#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); {26390#true} is VALID [2022-02-21 03:10:25,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {26390#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {26390#true} is VALID [2022-02-21 03:10:25,137 INFO L272 TraceCheckUtils]: 2: Hoare triple {26390#true} call main_#t~ret22#1 := base2flt(0, 0); {26390#true} is VALID [2022-02-21 03:10:25,137 INFO L290 TraceCheckUtils]: 3: Hoare triple {26390#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {26390#true} is VALID [2022-02-21 03:10:25,138 INFO L290 TraceCheckUtils]: 4: Hoare triple {26390#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {26390#true} is VALID [2022-02-21 03:10:25,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {26390#true} #res := ~__retres4~0; {26390#true} is VALID [2022-02-21 03:10:25,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {26390#true} assume true; {26390#true} is VALID [2022-02-21 03:10:25,138 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {26390#true} {26390#true} #448#return; {26390#true} is VALID [2022-02-21 03:10:25,138 INFO L290 TraceCheckUtils]: 8: Hoare triple {26390#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {26390#true} is VALID [2022-02-21 03:10:25,138 INFO L272 TraceCheckUtils]: 9: Hoare triple {26390#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {26390#true} is VALID [2022-02-21 03:10:25,138 INFO L290 TraceCheckUtils]: 10: Hoare triple {26390#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {26390#true} is VALID [2022-02-21 03:10:25,138 INFO L290 TraceCheckUtils]: 11: Hoare triple {26390#true} assume !(0 == ~m % 4294967296); {26390#true} is VALID [2022-02-21 03:10:25,139 INFO L290 TraceCheckUtils]: 12: Hoare triple {26390#true} assume !(~m % 4294967296 < 16777216); {26464#(not (< (mod base2flt_~m 4294967296) 16777216))} is VALID [2022-02-21 03:10:25,139 INFO L290 TraceCheckUtils]: 13: Hoare triple {26464#(not (< (mod base2flt_~m 4294967296) 16777216))} assume !false; {26464#(not (< (mod base2flt_~m 4294967296) 16777216))} is VALID [2022-02-21 03:10:25,139 INFO L290 TraceCheckUtils]: 14: Hoare triple {26464#(not (< (mod base2flt_~m 4294967296) 16777216))} assume !(~m % 4294967296 >= 33554432); {26471#(and (not (< (mod base2flt_~m 4294967296) 16777216)) (not (<= 33554432 (mod base2flt_~m 4294967296))))} is VALID [2022-02-21 03:10:25,140 INFO L290 TraceCheckUtils]: 15: Hoare triple {26471#(and (not (< (mod base2flt_~m 4294967296) 16777216)) (not (<= 33554432 (mod base2flt_~m 4294967296))))} assume !(0 == ~m || 0 == ~bitwiseComplement(16777216)); {26471#(and (not (< (mod base2flt_~m 4294967296) 16777216)) (not (<= 33554432 (mod base2flt_~m 4294967296))))} is VALID [2022-02-21 03:10:25,140 INFO L290 TraceCheckUtils]: 16: Hoare triple {26471#(and (not (< (mod base2flt_~m 4294967296) 16777216)) (not (<= 33554432 (mod base2flt_~m 4294967296))))} assume 1 == ~m && (0 == ~bitwiseComplement(16777216) || 1 == ~bitwiseComplement(16777216));~m := ~bitwiseComplement(16777216); {26391#false} is VALID [2022-02-21 03:10:25,140 INFO L290 TraceCheckUtils]: 17: Hoare triple {26391#false} assume 128 + ~e <= 2147483647; {26391#false} is VALID [2022-02-21 03:10:25,140 INFO L290 TraceCheckUtils]: 18: Hoare triple {26391#false} assume 128 + ~e >= -2147483648; {26391#false} is VALID [2022-02-21 03:10:25,140 INFO L290 TraceCheckUtils]: 19: Hoare triple {26391#false} assume 128 + ~e <= 2147483647; {26391#false} is VALID [2022-02-21 03:10:25,141 INFO L290 TraceCheckUtils]: 20: Hoare triple {26391#false} assume 128 + ~e >= -2147483648; {26391#false} is VALID [2022-02-21 03:10:25,141 INFO L290 TraceCheckUtils]: 21: Hoare triple {26391#false} assume (1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e));~res~0 := 1; {26391#false} is VALID [2022-02-21 03:10:25,141 INFO L290 TraceCheckUtils]: 22: Hoare triple {26391#false} ~__retres4~0 := ~res~0; {26391#false} is VALID [2022-02-21 03:10:25,142 INFO L290 TraceCheckUtils]: 23: Hoare triple {26391#false} #res := ~__retres4~0; {26391#false} is VALID [2022-02-21 03:10:25,142 INFO L290 TraceCheckUtils]: 24: Hoare triple {26391#false} assume true; {26391#false} is VALID [2022-02-21 03:10:25,142 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {26391#false} {26390#true} #450#return; {26391#false} is VALID [2022-02-21 03:10:25,142 INFO L290 TraceCheckUtils]: 26: Hoare triple {26391#false} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {26391#false} is VALID [2022-02-21 03:10:25,143 INFO L272 TraceCheckUtils]: 27: Hoare triple {26391#false} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {26391#false} is VALID [2022-02-21 03:10:25,143 INFO L290 TraceCheckUtils]: 28: Hoare triple {26391#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {26391#false} is VALID [2022-02-21 03:10:25,143 INFO L290 TraceCheckUtils]: 29: Hoare triple {26391#false} assume !(0 == ~m % 4294967296); {26391#false} is VALID [2022-02-21 03:10:25,143 INFO L290 TraceCheckUtils]: 30: Hoare triple {26391#false} assume !(~m % 4294967296 < 16777216); {26391#false} is VALID [2022-02-21 03:10:25,143 INFO L290 TraceCheckUtils]: 31: Hoare triple {26391#false} assume !false; {26391#false} is VALID [2022-02-21 03:10:25,143 INFO L290 TraceCheckUtils]: 32: Hoare triple {26391#false} assume ~m % 4294967296 >= 33554432; {26391#false} is VALID [2022-02-21 03:10:25,143 INFO L290 TraceCheckUtils]: 33: Hoare triple {26391#false} assume ~e >= 127;~__retres4~0 := 4294967295; {26391#false} is VALID [2022-02-21 03:10:25,143 INFO L290 TraceCheckUtils]: 34: Hoare triple {26391#false} #res := ~__retres4~0; {26391#false} is VALID [2022-02-21 03:10:25,143 INFO L290 TraceCheckUtils]: 35: Hoare triple {26391#false} assume true; {26391#false} is VALID [2022-02-21 03:10:25,144 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {26391#false} {26391#false} #452#return; {26391#false} is VALID [2022-02-21 03:10:25,144 INFO L290 TraceCheckUtils]: 37: Hoare triple {26391#false} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {26391#false} is VALID [2022-02-21 03:10:25,144 INFO L290 TraceCheckUtils]: 38: Hoare triple {26391#false} assume !(main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {26391#false} is VALID [2022-02-21 03:10:25,145 INFO L290 TraceCheckUtils]: 39: Hoare triple {26391#false} assume main_~a~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {26391#false} is VALID [2022-02-21 03:10:25,146 INFO L290 TraceCheckUtils]: 40: Hoare triple {26391#false} main_~sa~0#1 := main_~tmp~2#1; {26391#false} is VALID [2022-02-21 03:10:25,147 INFO L290 TraceCheckUtils]: 41: Hoare triple {26391#false} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {26391#false} is VALID [2022-02-21 03:10:25,147 INFO L290 TraceCheckUtils]: 42: Hoare triple {26391#false} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {26391#false} is VALID [2022-02-21 03:10:25,147 INFO L290 TraceCheckUtils]: 43: Hoare triple {26391#false} main_~sb~0#1 := main_~tmp___0~0#1; {26391#false} is VALID [2022-02-21 03:10:25,147 INFO L290 TraceCheckUtils]: 44: Hoare triple {26391#false} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {26391#false} is VALID [2022-02-21 03:10:25,147 INFO L290 TraceCheckUtils]: 45: Hoare triple {26391#false} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {26391#false} is VALID [2022-02-21 03:10:25,147 INFO L290 TraceCheckUtils]: 46: Hoare triple {26391#false} assume !(0 == addflt_~b#1 % 4294967296); {26391#false} is VALID [2022-02-21 03:10:25,147 INFO L290 TraceCheckUtils]: 47: Hoare triple {26391#false} assume !(0 == addflt_~a#1); {26391#false} is VALID [2022-02-21 03:10:25,147 INFO L290 TraceCheckUtils]: 48: Hoare triple {26391#false} assume !false; {26391#false} is VALID [2022-02-21 03:10:25,148 INFO L290 TraceCheckUtils]: 49: Hoare triple {26391#false} assume !false; {26391#false} is VALID [2022-02-21 03:10:25,148 INFO L290 TraceCheckUtils]: 50: Hoare triple {26391#false} assume addflt_~a#1 >= 0;abs_108 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_108; {26391#false} is VALID [2022-02-21 03:10:25,148 INFO L290 TraceCheckUtils]: 51: Hoare triple {26391#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {26391#false} is VALID [2022-02-21 03:10:25,148 INFO L290 TraceCheckUtils]: 52: Hoare triple {26391#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {26391#false} is VALID [2022-02-21 03:10:25,148 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:25,148 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:10:25,148 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829816569] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:25,149 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:10:25,149 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-02-21 03:10:25,149 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568269506] [2022-02-21 03:10:25,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:25,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 53 [2022-02-21 03:10:25,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:25,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:25,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:25,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:10:25,176 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:25,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:10:25,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:10:25,177 INFO L87 Difference]: Start difference. First operand 186 states and 227 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:25,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:25,518 INFO L93 Difference]: Finished difference Result 411 states and 523 transitions. [2022-02-21 03:10:25,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:10:25,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 53 [2022-02-21 03:10:25,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:25,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:25,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 297 transitions. [2022-02-21 03:10:25,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:25,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 297 transitions. [2022-02-21 03:10:25,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 297 transitions. [2022-02-21 03:10:25,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 297 edges. 297 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:25,721 INFO L225 Difference]: With dead ends: 411 [2022-02-21 03:10:25,721 INFO L226 Difference]: Without dead ends: 262 [2022-02-21 03:10:25,722 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:10:25,722 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 50 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:25,722 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 235 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:10:25,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-02-21 03:10:25,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 212. [2022-02-21 03:10:25,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:25,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 262 states. Second operand has 212 states, 188 states have (on average 1.2819148936170213) internal successors, (241), 197 states have internal predecessors, (241), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-02-21 03:10:25,843 INFO L74 IsIncluded]: Start isIncluded. First operand 262 states. Second operand has 212 states, 188 states have (on average 1.2819148936170213) internal successors, (241), 197 states have internal predecessors, (241), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-02-21 03:10:25,844 INFO L87 Difference]: Start difference. First operand 262 states. Second operand has 212 states, 188 states have (on average 1.2819148936170213) internal successors, (241), 197 states have internal predecessors, (241), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-02-21 03:10:25,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:25,848 INFO L93 Difference]: Finished difference Result 262 states and 321 transitions. [2022-02-21 03:10:25,848 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 321 transitions. [2022-02-21 03:10:25,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:25,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:25,849 INFO L74 IsIncluded]: Start isIncluded. First operand has 212 states, 188 states have (on average 1.2819148936170213) internal successors, (241), 197 states have internal predecessors, (241), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) Second operand 262 states. [2022-02-21 03:10:25,849 INFO L87 Difference]: Start difference. First operand has 212 states, 188 states have (on average 1.2819148936170213) internal successors, (241), 197 states have internal predecessors, (241), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) Second operand 262 states. [2022-02-21 03:10:25,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:25,852 INFO L93 Difference]: Finished difference Result 262 states and 321 transitions. [2022-02-21 03:10:25,853 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 321 transitions. [2022-02-21 03:10:25,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:25,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:25,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:25,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:25,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 188 states have (on average 1.2819148936170213) internal successors, (241), 197 states have internal predecessors, (241), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-02-21 03:10:25,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 259 transitions. [2022-02-21 03:10:25,857 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 259 transitions. Word has length 53 [2022-02-21 03:10:25,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:25,857 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 259 transitions. [2022-02-21 03:10:25,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:25,857 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 259 transitions. [2022-02-21 03:10:25,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-21 03:10:25,858 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:25,858 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, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:25,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-02-21 03:10:26,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:26,071 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:26,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:26,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1225098171, now seen corresponding path program 1 times [2022-02-21 03:10:26,072 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:26,072 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638144428] [2022-02-21 03:10:26,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:26,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:26,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:26,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:26,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {27840#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {27807#true} is VALID [2022-02-21 03:10:26,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {27807#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {27807#true} is VALID [2022-02-21 03:10:26,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {27807#true} #res := ~__retres4~0; {27807#true} is VALID [2022-02-21 03:10:26,099 INFO L290 TraceCheckUtils]: 3: Hoare triple {27807#true} assume true; {27807#true} is VALID [2022-02-21 03:10:26,099 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {27807#true} {27807#true} #448#return; {27807#true} is VALID [2022-02-21 03:10:26,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:26,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:26,137 INFO L290 TraceCheckUtils]: 0: Hoare triple {27840#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {27807#true} is VALID [2022-02-21 03:10:26,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {27807#true} assume !(0 == ~m % 4294967296); {27807#true} is VALID [2022-02-21 03:10:26,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {27807#true} assume !(~m % 4294967296 < 16777216); {27807#true} is VALID [2022-02-21 03:10:26,138 INFO L290 TraceCheckUtils]: 3: Hoare triple {27807#true} assume !false; {27807#true} is VALID [2022-02-21 03:10:26,138 INFO L290 TraceCheckUtils]: 4: Hoare triple {27807#true} assume !(~m % 4294967296 >= 33554432); {27807#true} is VALID [2022-02-21 03:10:26,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {27807#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {27841#(= base2flt_~m 0)} is VALID [2022-02-21 03:10:26,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {27841#(= base2flt_~m 0)} assume 128 + ~e <= 2147483647; {27841#(= base2flt_~m 0)} is VALID [2022-02-21 03:10:26,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {27841#(= base2flt_~m 0)} assume 128 + ~e >= -2147483648; {27841#(= base2flt_~m 0)} is VALID [2022-02-21 03:10:26,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {27841#(= base2flt_~m 0)} assume 128 + ~e <= 2147483647; {27841#(= base2flt_~m 0)} is VALID [2022-02-21 03:10:26,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {27841#(= base2flt_~m 0)} assume 128 + ~e >= -2147483648; {27841#(= base2flt_~m 0)} is VALID [2022-02-21 03:10:26,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {27841#(= base2flt_~m 0)} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {27842#(or (= base2flt_~m 0) (not (= (+ (* 16777216 base2flt_~e) 2147483648) 0)))} is VALID [2022-02-21 03:10:26,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {27842#(or (= base2flt_~m 0) (not (= (+ (* 16777216 base2flt_~e) 2147483648) 0)))} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {27843#(not (= (+ 128 base2flt_~e) 0))} is VALID [2022-02-21 03:10:26,140 INFO L290 TraceCheckUtils]: 12: Hoare triple {27843#(not (= (+ 128 base2flt_~e) 0))} assume (0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e);~res~0 := ~m; {27808#false} is VALID [2022-02-21 03:10:26,140 INFO L290 TraceCheckUtils]: 13: Hoare triple {27808#false} ~__retres4~0 := ~res~0; {27808#false} is VALID [2022-02-21 03:10:26,140 INFO L290 TraceCheckUtils]: 14: Hoare triple {27808#false} #res := ~__retres4~0; {27808#false} is VALID [2022-02-21 03:10:26,141 INFO L290 TraceCheckUtils]: 15: Hoare triple {27808#false} assume true; {27808#false} is VALID [2022-02-21 03:10:26,146 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {27808#false} {27807#true} #450#return; {27808#false} is VALID [2022-02-21 03:10:26,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-02-21 03:10:26,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:26,153 INFO L290 TraceCheckUtils]: 0: Hoare triple {27840#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {27807#true} is VALID [2022-02-21 03:10:26,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {27807#true} assume !(0 == ~m % 4294967296); {27807#true} is VALID [2022-02-21 03:10:26,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {27807#true} assume !(~m % 4294967296 < 16777216); {27807#true} is VALID [2022-02-21 03:10:26,153 INFO L290 TraceCheckUtils]: 3: Hoare triple {27807#true} assume !false; {27807#true} is VALID [2022-02-21 03:10:26,153 INFO L290 TraceCheckUtils]: 4: Hoare triple {27807#true} assume ~m % 4294967296 >= 33554432; {27807#true} is VALID [2022-02-21 03:10:26,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {27807#true} assume ~e >= 127;~__retres4~0 := 4294967295; {27807#true} is VALID [2022-02-21 03:10:26,153 INFO L290 TraceCheckUtils]: 6: Hoare triple {27807#true} #res := ~__retres4~0; {27807#true} is VALID [2022-02-21 03:10:26,154 INFO L290 TraceCheckUtils]: 7: Hoare triple {27807#true} assume true; {27807#true} is VALID [2022-02-21 03:10:26,154 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {27807#true} {27808#false} #452#return; {27808#false} is VALID [2022-02-21 03:10:26,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {27807#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); {27807#true} is VALID [2022-02-21 03:10:26,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {27807#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {27807#true} is VALID [2022-02-21 03:10:26,154 INFO L272 TraceCheckUtils]: 2: Hoare triple {27807#true} call main_#t~ret22#1 := base2flt(0, 0); {27840#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:26,154 INFO L290 TraceCheckUtils]: 3: Hoare triple {27840#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {27807#true} is VALID [2022-02-21 03:10:26,155 INFO L290 TraceCheckUtils]: 4: Hoare triple {27807#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {27807#true} is VALID [2022-02-21 03:10:26,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {27807#true} #res := ~__retres4~0; {27807#true} is VALID [2022-02-21 03:10:26,155 INFO L290 TraceCheckUtils]: 6: Hoare triple {27807#true} assume true; {27807#true} is VALID [2022-02-21 03:10:26,155 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {27807#true} {27807#true} #448#return; {27807#true} is VALID [2022-02-21 03:10:26,155 INFO L290 TraceCheckUtils]: 8: Hoare triple {27807#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {27807#true} is VALID [2022-02-21 03:10:26,156 INFO L272 TraceCheckUtils]: 9: Hoare triple {27807#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {27840#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:26,156 INFO L290 TraceCheckUtils]: 10: Hoare triple {27840#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {27807#true} is VALID [2022-02-21 03:10:26,156 INFO L290 TraceCheckUtils]: 11: Hoare triple {27807#true} assume !(0 == ~m % 4294967296); {27807#true} is VALID [2022-02-21 03:10:26,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {27807#true} assume !(~m % 4294967296 < 16777216); {27807#true} is VALID [2022-02-21 03:10:26,156 INFO L290 TraceCheckUtils]: 13: Hoare triple {27807#true} assume !false; {27807#true} is VALID [2022-02-21 03:10:26,156 INFO L290 TraceCheckUtils]: 14: Hoare triple {27807#true} assume !(~m % 4294967296 >= 33554432); {27807#true} is VALID [2022-02-21 03:10:26,156 INFO L290 TraceCheckUtils]: 15: Hoare triple {27807#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {27841#(= base2flt_~m 0)} is VALID [2022-02-21 03:10:26,157 INFO L290 TraceCheckUtils]: 16: Hoare triple {27841#(= base2flt_~m 0)} assume 128 + ~e <= 2147483647; {27841#(= base2flt_~m 0)} is VALID [2022-02-21 03:10:26,157 INFO L290 TraceCheckUtils]: 17: Hoare triple {27841#(= base2flt_~m 0)} assume 128 + ~e >= -2147483648; {27841#(= base2flt_~m 0)} is VALID [2022-02-21 03:10:26,157 INFO L290 TraceCheckUtils]: 18: Hoare triple {27841#(= base2flt_~m 0)} assume 128 + ~e <= 2147483647; {27841#(= base2flt_~m 0)} is VALID [2022-02-21 03:10:26,157 INFO L290 TraceCheckUtils]: 19: Hoare triple {27841#(= base2flt_~m 0)} assume 128 + ~e >= -2147483648; {27841#(= base2flt_~m 0)} is VALID [2022-02-21 03:10:26,158 INFO L290 TraceCheckUtils]: 20: Hoare triple {27841#(= base2flt_~m 0)} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {27842#(or (= base2flt_~m 0) (not (= (+ (* 16777216 base2flt_~e) 2147483648) 0)))} is VALID [2022-02-21 03:10:26,158 INFO L290 TraceCheckUtils]: 21: Hoare triple {27842#(or (= base2flt_~m 0) (not (= (+ (* 16777216 base2flt_~e) 2147483648) 0)))} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {27843#(not (= (+ 128 base2flt_~e) 0))} is VALID [2022-02-21 03:10:26,159 INFO L290 TraceCheckUtils]: 22: Hoare triple {27843#(not (= (+ 128 base2flt_~e) 0))} assume (0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e);~res~0 := ~m; {27808#false} is VALID [2022-02-21 03:10:26,159 INFO L290 TraceCheckUtils]: 23: Hoare triple {27808#false} ~__retres4~0 := ~res~0; {27808#false} is VALID [2022-02-21 03:10:26,159 INFO L290 TraceCheckUtils]: 24: Hoare triple {27808#false} #res := ~__retres4~0; {27808#false} is VALID [2022-02-21 03:10:26,159 INFO L290 TraceCheckUtils]: 25: Hoare triple {27808#false} assume true; {27808#false} is VALID [2022-02-21 03:10:26,159 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {27808#false} {27807#true} #450#return; {27808#false} is VALID [2022-02-21 03:10:26,159 INFO L290 TraceCheckUtils]: 27: Hoare triple {27808#false} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {27808#false} is VALID [2022-02-21 03:10:26,159 INFO L272 TraceCheckUtils]: 28: Hoare triple {27808#false} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {27840#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:26,159 INFO L290 TraceCheckUtils]: 29: Hoare triple {27840#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {27807#true} is VALID [2022-02-21 03:10:26,159 INFO L290 TraceCheckUtils]: 30: Hoare triple {27807#true} assume !(0 == ~m % 4294967296); {27807#true} is VALID [2022-02-21 03:10:26,160 INFO L290 TraceCheckUtils]: 31: Hoare triple {27807#true} assume !(~m % 4294967296 < 16777216); {27807#true} is VALID [2022-02-21 03:10:26,160 INFO L290 TraceCheckUtils]: 32: Hoare triple {27807#true} assume !false; {27807#true} is VALID [2022-02-21 03:10:26,160 INFO L290 TraceCheckUtils]: 33: Hoare triple {27807#true} assume ~m % 4294967296 >= 33554432; {27807#true} is VALID [2022-02-21 03:10:26,160 INFO L290 TraceCheckUtils]: 34: Hoare triple {27807#true} assume ~e >= 127;~__retres4~0 := 4294967295; {27807#true} is VALID [2022-02-21 03:10:26,160 INFO L290 TraceCheckUtils]: 35: Hoare triple {27807#true} #res := ~__retres4~0; {27807#true} is VALID [2022-02-21 03:10:26,160 INFO L290 TraceCheckUtils]: 36: Hoare triple {27807#true} assume true; {27807#true} is VALID [2022-02-21 03:10:26,160 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {27807#true} {27808#false} #452#return; {27808#false} is VALID [2022-02-21 03:10:26,160 INFO L290 TraceCheckUtils]: 38: Hoare triple {27808#false} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {27808#false} is VALID [2022-02-21 03:10:26,161 INFO L290 TraceCheckUtils]: 39: Hoare triple {27808#false} assume !(main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {27808#false} is VALID [2022-02-21 03:10:26,161 INFO L290 TraceCheckUtils]: 40: Hoare triple {27808#false} assume main_~a~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {27808#false} is VALID [2022-02-21 03:10:26,161 INFO L290 TraceCheckUtils]: 41: Hoare triple {27808#false} main_~sa~0#1 := main_~tmp~2#1; {27808#false} is VALID [2022-02-21 03:10:26,161 INFO L290 TraceCheckUtils]: 42: Hoare triple {27808#false} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {27808#false} is VALID [2022-02-21 03:10:26,161 INFO L290 TraceCheckUtils]: 43: Hoare triple {27808#false} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {27808#false} is VALID [2022-02-21 03:10:26,161 INFO L290 TraceCheckUtils]: 44: Hoare triple {27808#false} main_~sb~0#1 := main_~tmp___0~0#1; {27808#false} is VALID [2022-02-21 03:10:26,161 INFO L290 TraceCheckUtils]: 45: Hoare triple {27808#false} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {27808#false} is VALID [2022-02-21 03:10:26,161 INFO L290 TraceCheckUtils]: 46: Hoare triple {27808#false} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {27808#false} is VALID [2022-02-21 03:10:26,161 INFO L290 TraceCheckUtils]: 47: Hoare triple {27808#false} assume !(0 == addflt_~b#1 % 4294967296); {27808#false} is VALID [2022-02-21 03:10:26,162 INFO L290 TraceCheckUtils]: 48: Hoare triple {27808#false} assume !(0 == addflt_~a#1); {27808#false} is VALID [2022-02-21 03:10:26,162 INFO L290 TraceCheckUtils]: 49: Hoare triple {27808#false} assume !false; {27808#false} is VALID [2022-02-21 03:10:26,162 INFO L290 TraceCheckUtils]: 50: Hoare triple {27808#false} assume !false; {27808#false} is VALID [2022-02-21 03:10:26,162 INFO L290 TraceCheckUtils]: 51: Hoare triple {27808#false} assume addflt_~a#1 >= 0;abs_108 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_108; {27808#false} is VALID [2022-02-21 03:10:26,162 INFO L290 TraceCheckUtils]: 52: Hoare triple {27808#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {27808#false} is VALID [2022-02-21 03:10:26,162 INFO L290 TraceCheckUtils]: 53: Hoare triple {27808#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {27808#false} is VALID [2022-02-21 03:10:26,163 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:26,163 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:26,163 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638144428] [2022-02-21 03:10:26,163 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638144428] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:26,163 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590831514] [2022-02-21 03:10:26,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:26,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:26,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:26,188 INFO L229 MonitoredProcess]: Starting monitored process 19 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:26,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-02-21 03:10:26,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:26,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:10:26,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:26,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:26,339 INFO L290 TraceCheckUtils]: 0: Hoare triple {27807#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); {27807#true} is VALID [2022-02-21 03:10:26,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {27807#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {27807#true} is VALID [2022-02-21 03:10:26,339 INFO L272 TraceCheckUtils]: 2: Hoare triple {27807#true} call main_#t~ret22#1 := base2flt(0, 0); {27807#true} is VALID [2022-02-21 03:10:26,339 INFO L290 TraceCheckUtils]: 3: Hoare triple {27807#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {27807#true} is VALID [2022-02-21 03:10:26,339 INFO L290 TraceCheckUtils]: 4: Hoare triple {27807#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {27807#true} is VALID [2022-02-21 03:10:26,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {27807#true} #res := ~__retres4~0; {27807#true} is VALID [2022-02-21 03:10:26,339 INFO L290 TraceCheckUtils]: 6: Hoare triple {27807#true} assume true; {27807#true} is VALID [2022-02-21 03:10:26,340 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {27807#true} {27807#true} #448#return; {27807#true} is VALID [2022-02-21 03:10:26,340 INFO L290 TraceCheckUtils]: 8: Hoare triple {27807#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {27807#true} is VALID [2022-02-21 03:10:26,340 INFO L272 TraceCheckUtils]: 9: Hoare triple {27807#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {27807#true} is VALID [2022-02-21 03:10:26,340 INFO L290 TraceCheckUtils]: 10: Hoare triple {27807#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {27807#true} is VALID [2022-02-21 03:10:26,340 INFO L290 TraceCheckUtils]: 11: Hoare triple {27807#true} assume !(0 == ~m % 4294967296); {27807#true} is VALID [2022-02-21 03:10:26,340 INFO L290 TraceCheckUtils]: 12: Hoare triple {27807#true} assume !(~m % 4294967296 < 16777216); {27807#true} is VALID [2022-02-21 03:10:26,340 INFO L290 TraceCheckUtils]: 13: Hoare triple {27807#true} assume !false; {27807#true} is VALID [2022-02-21 03:10:26,340 INFO L290 TraceCheckUtils]: 14: Hoare triple {27807#true} assume !(~m % 4294967296 >= 33554432); {27807#true} is VALID [2022-02-21 03:10:26,341 INFO L290 TraceCheckUtils]: 15: Hoare triple {27807#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {27841#(= base2flt_~m 0)} is VALID [2022-02-21 03:10:26,341 INFO L290 TraceCheckUtils]: 16: Hoare triple {27841#(= base2flt_~m 0)} assume 128 + ~e <= 2147483647; {27841#(= base2flt_~m 0)} is VALID [2022-02-21 03:10:26,341 INFO L290 TraceCheckUtils]: 17: Hoare triple {27841#(= base2flt_~m 0)} assume 128 + ~e >= -2147483648; {27841#(= base2flt_~m 0)} is VALID [2022-02-21 03:10:26,341 INFO L290 TraceCheckUtils]: 18: Hoare triple {27841#(= base2flt_~m 0)} assume 128 + ~e <= 2147483647; {27841#(= base2flt_~m 0)} is VALID [2022-02-21 03:10:26,342 INFO L290 TraceCheckUtils]: 19: Hoare triple {27841#(= base2flt_~m 0)} assume 128 + ~e >= -2147483648; {27841#(= base2flt_~m 0)} is VALID [2022-02-21 03:10:26,342 INFO L290 TraceCheckUtils]: 20: Hoare triple {27841#(= base2flt_~m 0)} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {27841#(= base2flt_~m 0)} is VALID [2022-02-21 03:10:26,342 INFO L290 TraceCheckUtils]: 21: Hoare triple {27841#(= base2flt_~m 0)} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {27843#(not (= (+ 128 base2flt_~e) 0))} is VALID [2022-02-21 03:10:26,343 INFO L290 TraceCheckUtils]: 22: Hoare triple {27843#(not (= (+ 128 base2flt_~e) 0))} assume (0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e);~res~0 := ~m; {27808#false} is VALID [2022-02-21 03:10:26,343 INFO L290 TraceCheckUtils]: 23: Hoare triple {27808#false} ~__retres4~0 := ~res~0; {27808#false} is VALID [2022-02-21 03:10:26,343 INFO L290 TraceCheckUtils]: 24: Hoare triple {27808#false} #res := ~__retres4~0; {27808#false} is VALID [2022-02-21 03:10:26,343 INFO L290 TraceCheckUtils]: 25: Hoare triple {27808#false} assume true; {27808#false} is VALID [2022-02-21 03:10:26,343 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {27808#false} {27807#true} #450#return; {27808#false} is VALID [2022-02-21 03:10:26,343 INFO L290 TraceCheckUtils]: 27: Hoare triple {27808#false} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {27808#false} is VALID [2022-02-21 03:10:26,343 INFO L272 TraceCheckUtils]: 28: Hoare triple {27808#false} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {27808#false} is VALID [2022-02-21 03:10:26,344 INFO L290 TraceCheckUtils]: 29: Hoare triple {27808#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {27808#false} is VALID [2022-02-21 03:10:26,344 INFO L290 TraceCheckUtils]: 30: Hoare triple {27808#false} assume !(0 == ~m % 4294967296); {27808#false} is VALID [2022-02-21 03:10:26,344 INFO L290 TraceCheckUtils]: 31: Hoare triple {27808#false} assume !(~m % 4294967296 < 16777216); {27808#false} is VALID [2022-02-21 03:10:26,344 INFO L290 TraceCheckUtils]: 32: Hoare triple {27808#false} assume !false; {27808#false} is VALID [2022-02-21 03:10:26,344 INFO L290 TraceCheckUtils]: 33: Hoare triple {27808#false} assume ~m % 4294967296 >= 33554432; {27808#false} is VALID [2022-02-21 03:10:26,344 INFO L290 TraceCheckUtils]: 34: Hoare triple {27808#false} assume ~e >= 127;~__retres4~0 := 4294967295; {27808#false} is VALID [2022-02-21 03:10:26,344 INFO L290 TraceCheckUtils]: 35: Hoare triple {27808#false} #res := ~__retres4~0; {27808#false} is VALID [2022-02-21 03:10:26,344 INFO L290 TraceCheckUtils]: 36: Hoare triple {27808#false} assume true; {27808#false} is VALID [2022-02-21 03:10:26,344 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {27808#false} {27808#false} #452#return; {27808#false} is VALID [2022-02-21 03:10:26,345 INFO L290 TraceCheckUtils]: 38: Hoare triple {27808#false} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {27808#false} is VALID [2022-02-21 03:10:26,345 INFO L290 TraceCheckUtils]: 39: Hoare triple {27808#false} assume !(main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {27808#false} is VALID [2022-02-21 03:10:26,345 INFO L290 TraceCheckUtils]: 40: Hoare triple {27808#false} assume main_~a~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {27808#false} is VALID [2022-02-21 03:10:26,345 INFO L290 TraceCheckUtils]: 41: Hoare triple {27808#false} main_~sa~0#1 := main_~tmp~2#1; {27808#false} is VALID [2022-02-21 03:10:26,345 INFO L290 TraceCheckUtils]: 42: Hoare triple {27808#false} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {27808#false} is VALID [2022-02-21 03:10:26,345 INFO L290 TraceCheckUtils]: 43: Hoare triple {27808#false} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {27808#false} is VALID [2022-02-21 03:10:26,345 INFO L290 TraceCheckUtils]: 44: Hoare triple {27808#false} main_~sb~0#1 := main_~tmp___0~0#1; {27808#false} is VALID [2022-02-21 03:10:26,345 INFO L290 TraceCheckUtils]: 45: Hoare triple {27808#false} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {27808#false} is VALID [2022-02-21 03:10:26,346 INFO L290 TraceCheckUtils]: 46: Hoare triple {27808#false} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {27808#false} is VALID [2022-02-21 03:10:26,346 INFO L290 TraceCheckUtils]: 47: Hoare triple {27808#false} assume !(0 == addflt_~b#1 % 4294967296); {27808#false} is VALID [2022-02-21 03:10:26,346 INFO L290 TraceCheckUtils]: 48: Hoare triple {27808#false} assume !(0 == addflt_~a#1); {27808#false} is VALID [2022-02-21 03:10:26,346 INFO L290 TraceCheckUtils]: 49: Hoare triple {27808#false} assume !false; {27808#false} is VALID [2022-02-21 03:10:26,346 INFO L290 TraceCheckUtils]: 50: Hoare triple {27808#false} assume !false; {27808#false} is VALID [2022-02-21 03:10:26,346 INFO L290 TraceCheckUtils]: 51: Hoare triple {27808#false} assume addflt_~a#1 >= 0;abs_108 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_108; {27808#false} is VALID [2022-02-21 03:10:26,346 INFO L290 TraceCheckUtils]: 52: Hoare triple {27808#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {27808#false} is VALID [2022-02-21 03:10:26,346 INFO L290 TraceCheckUtils]: 53: Hoare triple {27808#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {27808#false} is VALID [2022-02-21 03:10:26,347 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:26,347 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:10:26,347 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590831514] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:26,347 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:10:26,347 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-02-21 03:10:26,347 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646691874] [2022-02-21 03:10:26,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:26,348 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 54 [2022-02-21 03:10:26,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:26,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:26,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:26,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:10:26,373 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:26,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:10:26,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:10:26,373 INFO L87 Difference]: Start difference. First operand 212 states and 259 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:26,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:26,679 INFO L93 Difference]: Finished difference Result 385 states and 477 transitions. [2022-02-21 03:10:26,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:10:26,680 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 54 [2022-02-21 03:10:26,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:26,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:26,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 268 transitions. [2022-02-21 03:10:26,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:26,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 268 transitions. [2022-02-21 03:10:26,683 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 268 transitions. [2022-02-21 03:10:26,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 268 edges. 268 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:26,789 INFO L225 Difference]: With dead ends: 385 [2022-02-21 03:10:26,789 INFO L226 Difference]: Without dead ends: 237 [2022-02-21 03:10:26,790 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:10:26,791 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 18 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:26,792 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 337 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:10:26,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-02-21 03:10:26,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 208. [2022-02-21 03:10:26,896 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:26,896 INFO L82 GeneralOperation]: Start isEquivalent. First operand 237 states. Second operand has 208 states, 184 states have (on average 1.2934782608695652) internal successors, (238), 193 states have internal predecessors, (238), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-02-21 03:10:26,896 INFO L74 IsIncluded]: Start isIncluded. First operand 237 states. Second operand has 208 states, 184 states have (on average 1.2934782608695652) internal successors, (238), 193 states have internal predecessors, (238), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-02-21 03:10:26,897 INFO L87 Difference]: Start difference. First operand 237 states. Second operand has 208 states, 184 states have (on average 1.2934782608695652) internal successors, (238), 193 states have internal predecessors, (238), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-02-21 03:10:26,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:26,901 INFO L93 Difference]: Finished difference Result 237 states and 293 transitions. [2022-02-21 03:10:26,901 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 293 transitions. [2022-02-21 03:10:26,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:26,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:26,902 INFO L74 IsIncluded]: Start isIncluded. First operand has 208 states, 184 states have (on average 1.2934782608695652) internal successors, (238), 193 states have internal predecessors, (238), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) Second operand 237 states. [2022-02-21 03:10:26,902 INFO L87 Difference]: Start difference. First operand has 208 states, 184 states have (on average 1.2934782608695652) internal successors, (238), 193 states have internal predecessors, (238), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) Second operand 237 states. [2022-02-21 03:10:26,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:26,906 INFO L93 Difference]: Finished difference Result 237 states and 293 transitions. [2022-02-21 03:10:26,906 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 293 transitions. [2022-02-21 03:10:26,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:26,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:26,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:26,906 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:26,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 184 states have (on average 1.2934782608695652) internal successors, (238), 193 states have internal predecessors, (238), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-02-21 03:10:26,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 256 transitions. [2022-02-21 03:10:26,909 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 256 transitions. Word has length 54 [2022-02-21 03:10:26,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:26,910 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 256 transitions. [2022-02-21 03:10:26,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:26,910 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 256 transitions. [2022-02-21 03:10:26,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-21 03:10:26,915 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:26,915 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, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:26,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-02-21 03:10:27,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:27,136 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:27,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:27,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1756937806, now seen corresponding path program 1 times [2022-02-21 03:10:27,137 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:27,137 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303423171] [2022-02-21 03:10:27,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:27,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:27,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:27,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:27,336 INFO L290 TraceCheckUtils]: 0: Hoare triple {29187#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {29147#true} is VALID [2022-02-21 03:10:27,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {29147#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {29147#true} is VALID [2022-02-21 03:10:27,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {29147#true} #res := ~__retres4~0; {29147#true} is VALID [2022-02-21 03:10:27,336 INFO L290 TraceCheckUtils]: 3: Hoare triple {29147#true} assume true; {29147#true} is VALID [2022-02-21 03:10:27,336 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {29147#true} {29147#true} #448#return; {29147#true} is VALID [2022-02-21 03:10:27,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:27,341 INFO L290 TraceCheckUtils]: 0: Hoare triple {29187#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {29147#true} is VALID [2022-02-21 03:10:27,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {29147#true} assume !(0 == ~m % 4294967296); {29147#true} is VALID [2022-02-21 03:10:27,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {29147#true} assume !(~m % 4294967296 < 16777216); {29147#true} is VALID [2022-02-21 03:10:27,342 INFO L290 TraceCheckUtils]: 3: Hoare triple {29147#true} assume !false; {29147#true} is VALID [2022-02-21 03:10:27,342 INFO L290 TraceCheckUtils]: 4: Hoare triple {29147#true} assume !(~m % 4294967296 >= 33554432); {29147#true} is VALID [2022-02-21 03:10:27,342 INFO L290 TraceCheckUtils]: 5: Hoare triple {29147#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {29147#true} is VALID [2022-02-21 03:10:27,342 INFO L290 TraceCheckUtils]: 6: Hoare triple {29147#true} assume 128 + ~e <= 2147483647; {29147#true} is VALID [2022-02-21 03:10:27,342 INFO L290 TraceCheckUtils]: 7: Hoare triple {29147#true} assume 128 + ~e >= -2147483648; {29147#true} is VALID [2022-02-21 03:10:27,342 INFO L290 TraceCheckUtils]: 8: Hoare triple {29147#true} assume 128 + ~e <= 2147483647; {29147#true} is VALID [2022-02-21 03:10:27,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {29147#true} assume 128 + ~e >= -2147483648; {29147#true} is VALID [2022-02-21 03:10:27,342 INFO L290 TraceCheckUtils]: 10: Hoare triple {29147#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {29147#true} is VALID [2022-02-21 03:10:27,343 INFO L290 TraceCheckUtils]: 11: Hoare triple {29147#true} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {29147#true} is VALID [2022-02-21 03:10:27,343 INFO L290 TraceCheckUtils]: 12: Hoare triple {29147#true} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {29147#true} is VALID [2022-02-21 03:10:27,344 INFO L290 TraceCheckUtils]: 13: Hoare triple {29147#true} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_77 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_77; {29147#true} is VALID [2022-02-21 03:10:27,344 INFO L290 TraceCheckUtils]: 14: Hoare triple {29147#true} ~__retres4~0 := ~res~0; {29147#true} is VALID [2022-02-21 03:10:27,344 INFO L290 TraceCheckUtils]: 15: Hoare triple {29147#true} #res := ~__retres4~0; {29147#true} is VALID [2022-02-21 03:10:27,344 INFO L290 TraceCheckUtils]: 16: Hoare triple {29147#true} assume true; {29147#true} is VALID [2022-02-21 03:10:27,344 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {29147#true} {29147#true} #450#return; {29147#true} is VALID [2022-02-21 03:10:27,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-02-21 03:10:27,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:27,370 INFO L290 TraceCheckUtils]: 0: Hoare triple {29187#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {29147#true} is VALID [2022-02-21 03:10:27,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {29147#true} assume !(0 == ~m % 4294967296); {29147#true} is VALID [2022-02-21 03:10:27,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {29147#true} assume !(~m % 4294967296 < 16777216); {29147#true} is VALID [2022-02-21 03:10:27,371 INFO L290 TraceCheckUtils]: 3: Hoare triple {29147#true} assume !false; {29147#true} is VALID [2022-02-21 03:10:27,371 INFO L290 TraceCheckUtils]: 4: Hoare triple {29147#true} assume ~m % 4294967296 >= 33554432; {29147#true} is VALID [2022-02-21 03:10:27,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {29147#true} assume ~e >= 127;~__retres4~0 := 4294967295; {29188#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:27,372 INFO L290 TraceCheckUtils]: 6: Hoare triple {29188#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} #res := ~__retres4~0; {29189#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:27,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {29189#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} assume true; {29189#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:27,373 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {29189#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} {29147#true} #452#return; {29181#(and (<= 4294967295 |ULTIMATE.start_main_#t~ret24#1|) (<= |ULTIMATE.start_main_#t~ret24#1| 4294967295))} is VALID [2022-02-21 03:10:27,373 INFO L290 TraceCheckUtils]: 0: Hoare triple {29147#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); {29147#true} is VALID [2022-02-21 03:10:27,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {29147#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {29147#true} is VALID [2022-02-21 03:10:27,374 INFO L272 TraceCheckUtils]: 2: Hoare triple {29147#true} call main_#t~ret22#1 := base2flt(0, 0); {29187#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:27,374 INFO L290 TraceCheckUtils]: 3: Hoare triple {29187#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {29147#true} is VALID [2022-02-21 03:10:27,374 INFO L290 TraceCheckUtils]: 4: Hoare triple {29147#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {29147#true} is VALID [2022-02-21 03:10:27,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {29147#true} #res := ~__retres4~0; {29147#true} is VALID [2022-02-21 03:10:27,374 INFO L290 TraceCheckUtils]: 6: Hoare triple {29147#true} assume true; {29147#true} is VALID [2022-02-21 03:10:27,374 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {29147#true} {29147#true} #448#return; {29147#true} is VALID [2022-02-21 03:10:27,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {29147#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {29147#true} is VALID [2022-02-21 03:10:27,375 INFO L272 TraceCheckUtils]: 9: Hoare triple {29147#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {29187#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:27,375 INFO L290 TraceCheckUtils]: 10: Hoare triple {29187#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {29147#true} is VALID [2022-02-21 03:10:27,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {29147#true} assume !(0 == ~m % 4294967296); {29147#true} is VALID [2022-02-21 03:10:27,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {29147#true} assume !(~m % 4294967296 < 16777216); {29147#true} is VALID [2022-02-21 03:10:27,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {29147#true} assume !false; {29147#true} is VALID [2022-02-21 03:10:27,375 INFO L290 TraceCheckUtils]: 14: Hoare triple {29147#true} assume !(~m % 4294967296 >= 33554432); {29147#true} is VALID [2022-02-21 03:10:27,375 INFO L290 TraceCheckUtils]: 15: Hoare triple {29147#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {29147#true} is VALID [2022-02-21 03:10:27,376 INFO L290 TraceCheckUtils]: 16: Hoare triple {29147#true} assume 128 + ~e <= 2147483647; {29147#true} is VALID [2022-02-21 03:10:27,376 INFO L290 TraceCheckUtils]: 17: Hoare triple {29147#true} assume 128 + ~e >= -2147483648; {29147#true} is VALID [2022-02-21 03:10:27,376 INFO L290 TraceCheckUtils]: 18: Hoare triple {29147#true} assume 128 + ~e <= 2147483647; {29147#true} is VALID [2022-02-21 03:10:27,376 INFO L290 TraceCheckUtils]: 19: Hoare triple {29147#true} assume 128 + ~e >= -2147483648; {29147#true} is VALID [2022-02-21 03:10:27,376 INFO L290 TraceCheckUtils]: 20: Hoare triple {29147#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {29147#true} is VALID [2022-02-21 03:10:27,376 INFO L290 TraceCheckUtils]: 21: Hoare triple {29147#true} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {29147#true} is VALID [2022-02-21 03:10:27,376 INFO L290 TraceCheckUtils]: 22: Hoare triple {29147#true} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {29147#true} is VALID [2022-02-21 03:10:27,376 INFO L290 TraceCheckUtils]: 23: Hoare triple {29147#true} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_77 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_77; {29147#true} is VALID [2022-02-21 03:10:27,376 INFO L290 TraceCheckUtils]: 24: Hoare triple {29147#true} ~__retres4~0 := ~res~0; {29147#true} is VALID [2022-02-21 03:10:27,377 INFO L290 TraceCheckUtils]: 25: Hoare triple {29147#true} #res := ~__retres4~0; {29147#true} is VALID [2022-02-21 03:10:27,377 INFO L290 TraceCheckUtils]: 26: Hoare triple {29147#true} assume true; {29147#true} is VALID [2022-02-21 03:10:27,377 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {29147#true} {29147#true} #450#return; {29147#true} is VALID [2022-02-21 03:10:27,377 INFO L290 TraceCheckUtils]: 28: Hoare triple {29147#true} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {29147#true} is VALID [2022-02-21 03:10:27,377 INFO L272 TraceCheckUtils]: 29: Hoare triple {29147#true} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {29187#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:27,377 INFO L290 TraceCheckUtils]: 30: Hoare triple {29187#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {29147#true} is VALID [2022-02-21 03:10:27,378 INFO L290 TraceCheckUtils]: 31: Hoare triple {29147#true} assume !(0 == ~m % 4294967296); {29147#true} is VALID [2022-02-21 03:10:27,378 INFO L290 TraceCheckUtils]: 32: Hoare triple {29147#true} assume !(~m % 4294967296 < 16777216); {29147#true} is VALID [2022-02-21 03:10:27,378 INFO L290 TraceCheckUtils]: 33: Hoare triple {29147#true} assume !false; {29147#true} is VALID [2022-02-21 03:10:27,378 INFO L290 TraceCheckUtils]: 34: Hoare triple {29147#true} assume ~m % 4294967296 >= 33554432; {29147#true} is VALID [2022-02-21 03:10:27,378 INFO L290 TraceCheckUtils]: 35: Hoare triple {29147#true} assume ~e >= 127;~__retres4~0 := 4294967295; {29188#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:27,379 INFO L290 TraceCheckUtils]: 36: Hoare triple {29188#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} #res := ~__retres4~0; {29189#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:27,379 INFO L290 TraceCheckUtils]: 37: Hoare triple {29189#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} assume true; {29189#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:27,379 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {29189#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} {29147#true} #452#return; {29181#(and (<= 4294967295 |ULTIMATE.start_main_#t~ret24#1|) (<= |ULTIMATE.start_main_#t~ret24#1| 4294967295))} is VALID [2022-02-21 03:10:27,380 INFO L290 TraceCheckUtils]: 39: Hoare triple {29181#(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; {29182#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} is VALID [2022-02-21 03:10:27,380 INFO L290 TraceCheckUtils]: 40: Hoare triple {29182#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} assume !(main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {29182#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} is VALID [2022-02-21 03:10:27,381 INFO L290 TraceCheckUtils]: 41: Hoare triple {29182#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} assume main_~a~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {29182#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} is VALID [2022-02-21 03:10:27,381 INFO L290 TraceCheckUtils]: 42: Hoare triple {29182#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} main_~sa~0#1 := main_~tmp~2#1; {29182#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} is VALID [2022-02-21 03:10:27,381 INFO L290 TraceCheckUtils]: 43: Hoare triple {29182#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {29182#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} is VALID [2022-02-21 03:10:27,382 INFO L290 TraceCheckUtils]: 44: Hoare triple {29182#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {29182#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} is VALID [2022-02-21 03:10:27,382 INFO L290 TraceCheckUtils]: 45: Hoare triple {29182#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} main_~sb~0#1 := main_~tmp___0~0#1; {29182#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} is VALID [2022-02-21 03:10:27,382 INFO L290 TraceCheckUtils]: 46: Hoare triple {29182#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {29183#(or (<= (div |ULTIMATE.start_addflt_~a#1| 4294967296) (+ (* 16777216 (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) 8388607)) (and (<= 4294967295 |ULTIMATE.start_addflt_~b#1|) (<= |ULTIMATE.start_addflt_~b#1| 4294967295)))} is VALID [2022-02-21 03:10:27,383 INFO L290 TraceCheckUtils]: 47: Hoare triple {29183#(or (<= (div |ULTIMATE.start_addflt_~a#1| 4294967296) (+ (* 16777216 (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) 8388607)) (and (<= 4294967295 |ULTIMATE.start_addflt_~b#1|) (<= |ULTIMATE.start_addflt_~b#1| 4294967295)))} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {29184#(or (and (<= (div |ULTIMATE.start_addflt_~b#1| 4294967296) 0) (<= (+ 4294967295 (* (div |ULTIMATE.start_addflt_~a#1| 4294967296) 4294967296)) (+ (* 4294967296 (div |ULTIMATE.start_addflt_~b#1| 4294967296)) |ULTIMATE.start_addflt_~a#1|))) (<= (div |ULTIMATE.start_addflt_~a#1| 4294967296) (+ (* 16777216 (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) 8388607)))} is VALID [2022-02-21 03:10:27,384 INFO L290 TraceCheckUtils]: 48: Hoare triple {29184#(or (and (<= (div |ULTIMATE.start_addflt_~b#1| 4294967296) 0) (<= (+ 4294967295 (* (div |ULTIMATE.start_addflt_~a#1| 4294967296) 4294967296)) (+ (* 4294967296 (div |ULTIMATE.start_addflt_~b#1| 4294967296)) |ULTIMATE.start_addflt_~a#1|))) (<= (div |ULTIMATE.start_addflt_~a#1| 4294967296) (+ (* 16777216 (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) 8388607)))} assume !(0 == addflt_~b#1 % 4294967296); {29185#(or (<= (+ 4294967295 (* (div |ULTIMATE.start_addflt_~a#1| 4294967296) 4294967296)) |ULTIMATE.start_addflt_~a#1|) (<= (div |ULTIMATE.start_addflt_~a#1| 4294967296) (+ (* 16777216 (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) 8388607)))} is VALID [2022-02-21 03:10:27,384 INFO L290 TraceCheckUtils]: 49: Hoare triple {29185#(or (<= (+ 4294967295 (* (div |ULTIMATE.start_addflt_~a#1| 4294967296) 4294967296)) |ULTIMATE.start_addflt_~a#1|) (<= (div |ULTIMATE.start_addflt_~a#1| 4294967296) (+ (* 16777216 (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) 8388607)))} assume !(0 == addflt_~a#1); {29185#(or (<= (+ 4294967295 (* (div |ULTIMATE.start_addflt_~a#1| 4294967296) 4294967296)) |ULTIMATE.start_addflt_~a#1|) (<= (div |ULTIMATE.start_addflt_~a#1| 4294967296) (+ (* 16777216 (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) 8388607)))} is VALID [2022-02-21 03:10:27,385 INFO L290 TraceCheckUtils]: 50: Hoare triple {29185#(or (<= (+ 4294967295 (* (div |ULTIMATE.start_addflt_~a#1| 4294967296) 4294967296)) |ULTIMATE.start_addflt_~a#1|) (<= (div |ULTIMATE.start_addflt_~a#1| 4294967296) (+ (* 16777216 (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) 8388607)))} assume !false; {29185#(or (<= (+ 4294967295 (* (div |ULTIMATE.start_addflt_~a#1| 4294967296) 4294967296)) |ULTIMATE.start_addflt_~a#1|) (<= (div |ULTIMATE.start_addflt_~a#1| 4294967296) (+ (* 16777216 (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) 8388607)))} is VALID [2022-02-21 03:10:27,385 INFO L290 TraceCheckUtils]: 51: Hoare triple {29185#(or (<= (+ 4294967295 (* (div |ULTIMATE.start_addflt_~a#1| 4294967296) 4294967296)) |ULTIMATE.start_addflt_~a#1|) (<= (div |ULTIMATE.start_addflt_~a#1| 4294967296) (+ (* 16777216 (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) 8388607)))} assume !false; {29185#(or (<= (+ 4294967295 (* (div |ULTIMATE.start_addflt_~a#1| 4294967296) 4294967296)) |ULTIMATE.start_addflt_~a#1|) (<= (div |ULTIMATE.start_addflt_~a#1| 4294967296) (+ (* 16777216 (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) 8388607)))} is VALID [2022-02-21 03:10:27,386 INFO L290 TraceCheckUtils]: 52: Hoare triple {29185#(or (<= (+ 4294967295 (* (div |ULTIMATE.start_addflt_~a#1| 4294967296) 4294967296)) |ULTIMATE.start_addflt_~a#1|) (<= (div |ULTIMATE.start_addflt_~a#1| 4294967296) (+ (* 16777216 (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) 8388607)))} assume addflt_~a#1 >= 0;abs_108 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_108; {29185#(or (<= (+ 4294967295 (* (div |ULTIMATE.start_addflt_~a#1| 4294967296) 4294967296)) |ULTIMATE.start_addflt_~a#1|) (<= (div |ULTIMATE.start_addflt_~a#1| 4294967296) (+ (* 16777216 (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) 8388607)))} is VALID [2022-02-21 03:10:27,386 INFO L290 TraceCheckUtils]: 53: Hoare triple {29185#(or (<= (+ 4294967295 (* (div |ULTIMATE.start_addflt_~a#1| 4294967296) 4294967296)) |ULTIMATE.start_addflt_~a#1|) (<= (div |ULTIMATE.start_addflt_~a#1| 4294967296) (+ (* 16777216 (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) 8388607)))} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {29186#(or (<= (div |ULTIMATE.start_addflt_~a#1| 16777216) (+ 2147483647 (* 4294967296 (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)))) (<= (+ 255 (* (div |ULTIMATE.start_addflt_~a#1| 4294967296) 256)) (div |ULTIMATE.start_addflt_~a#1| 16777216)))} is VALID [2022-02-21 03:10:27,387 INFO L290 TraceCheckUtils]: 54: Hoare triple {29186#(or (<= (div |ULTIMATE.start_addflt_~a#1| 16777216) (+ 2147483647 (* 4294967296 (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)))) (<= (+ 255 (* (div |ULTIMATE.start_addflt_~a#1| 4294967296) 256)) (div |ULTIMATE.start_addflt_~a#1| 16777216)))} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {29148#false} is VALID [2022-02-21 03:10:27,387 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-21 03:10:27,388 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:27,388 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303423171] [2022-02-21 03:10:27,388 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303423171] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:27,388 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:10:27,388 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-21 03:10:27,388 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249519573] [2022-02-21 03:10:27,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:27,389 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2022-02-21 03:10:27,389 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:27,389 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:27,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:27,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-21 03:10:27,420 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:27,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-21 03:10:27,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-02-21 03:10:27,421 INFO L87 Difference]: Start difference. First operand 208 states and 256 transitions. Second operand has 11 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:29,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:29,210 INFO L93 Difference]: Finished difference Result 390 states and 475 transitions. [2022-02-21 03:10:29,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-21 03:10:29,210 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2022-02-21 03:10:29,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:29,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:29,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 276 transitions. [2022-02-21 03:10:29,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:29,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 276 transitions. [2022-02-21 03:10:29,214 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 276 transitions. [2022-02-21 03:10:29,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 276 edges. 276 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:29,430 INFO L225 Difference]: With dead ends: 390 [2022-02-21 03:10:29,430 INFO L226 Difference]: Without dead ends: 389 [2022-02-21 03:10:29,431 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-02-21 03:10:29,431 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 356 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:29,431 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [359 Valid, 878 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-21 03:10:29,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2022-02-21 03:10:29,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 234. [2022-02-21 03:10:29,589 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:29,589 INFO L82 GeneralOperation]: Start isEquivalent. First operand 389 states. Second operand has 234 states, 209 states have (on average 1.291866028708134) internal successors, (270), 217 states have internal predecessors, (270), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (13), 12 states have call predecessors, (13), 8 states have call successors, (13) [2022-02-21 03:10:29,590 INFO L74 IsIncluded]: Start isIncluded. First operand 389 states. Second operand has 234 states, 209 states have (on average 1.291866028708134) internal successors, (270), 217 states have internal predecessors, (270), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (13), 12 states have call predecessors, (13), 8 states have call successors, (13) [2022-02-21 03:10:29,590 INFO L87 Difference]: Start difference. First operand 389 states. Second operand has 234 states, 209 states have (on average 1.291866028708134) internal successors, (270), 217 states have internal predecessors, (270), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (13), 12 states have call predecessors, (13), 8 states have call successors, (13) [2022-02-21 03:10:29,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:29,597 INFO L93 Difference]: Finished difference Result 389 states and 474 transitions. [2022-02-21 03:10:29,597 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 474 transitions. [2022-02-21 03:10:29,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:29,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:29,598 INFO L74 IsIncluded]: Start isIncluded. First operand has 234 states, 209 states have (on average 1.291866028708134) internal successors, (270), 217 states have internal predecessors, (270), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (13), 12 states have call predecessors, (13), 8 states have call successors, (13) Second operand 389 states. [2022-02-21 03:10:29,599 INFO L87 Difference]: Start difference. First operand has 234 states, 209 states have (on average 1.291866028708134) internal successors, (270), 217 states have internal predecessors, (270), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (13), 12 states have call predecessors, (13), 8 states have call successors, (13) Second operand 389 states. [2022-02-21 03:10:29,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:29,605 INFO L93 Difference]: Finished difference Result 389 states and 474 transitions. [2022-02-21 03:10:29,605 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 474 transitions. [2022-02-21 03:10:29,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:29,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:29,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:29,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:29,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 209 states have (on average 1.291866028708134) internal successors, (270), 217 states have internal predecessors, (270), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (13), 12 states have call predecessors, (13), 8 states have call successors, (13) [2022-02-21 03:10:29,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 291 transitions. [2022-02-21 03:10:29,609 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 291 transitions. Word has length 55 [2022-02-21 03:10:29,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:29,610 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 291 transitions. [2022-02-21 03:10:29,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:29,610 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 291 transitions. [2022-02-21 03:10:29,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-21 03:10:29,611 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:29,611 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, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:29,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-02-21 03:10:29,611 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:29,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:29,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1728682864, now seen corresponding path program 1 times [2022-02-21 03:10:29,612 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:29,612 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366608053] [2022-02-21 03:10:29,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:29,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:29,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:29,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:29,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:29,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {30706#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {30667#true} is VALID [2022-02-21 03:10:29,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {30667#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {30667#true} is VALID [2022-02-21 03:10:29,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {30667#true} #res := ~__retres4~0; {30667#true} is VALID [2022-02-21 03:10:29,713 INFO L290 TraceCheckUtils]: 3: Hoare triple {30667#true} assume true; {30667#true} is VALID [2022-02-21 03:10:29,713 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {30667#true} {30667#true} #448#return; {30667#true} is VALID [2022-02-21 03:10:29,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:29,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:29,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {30706#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {30667#true} is VALID [2022-02-21 03:10:29,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {30667#true} assume !(0 == ~m % 4294967296); {30667#true} is VALID [2022-02-21 03:10:29,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {30667#true} assume !(~m % 4294967296 < 16777216); {30667#true} is VALID [2022-02-21 03:10:29,720 INFO L290 TraceCheckUtils]: 3: Hoare triple {30667#true} assume !false; {30667#true} is VALID [2022-02-21 03:10:29,720 INFO L290 TraceCheckUtils]: 4: Hoare triple {30667#true} assume !(~m % 4294967296 >= 33554432); {30667#true} is VALID [2022-02-21 03:10:29,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {30667#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {30667#true} is VALID [2022-02-21 03:10:29,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {30667#true} assume 128 + ~e <= 2147483647; {30667#true} is VALID [2022-02-21 03:10:29,721 INFO L290 TraceCheckUtils]: 7: Hoare triple {30667#true} assume 128 + ~e >= -2147483648; {30667#true} is VALID [2022-02-21 03:10:29,721 INFO L290 TraceCheckUtils]: 8: Hoare triple {30667#true} assume 128 + ~e <= 2147483647; {30667#true} is VALID [2022-02-21 03:10:29,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {30667#true} assume 128 + ~e >= -2147483648; {30667#true} is VALID [2022-02-21 03:10:29,721 INFO L290 TraceCheckUtils]: 10: Hoare triple {30667#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {30667#true} is VALID [2022-02-21 03:10:29,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {30667#true} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {30667#true} is VALID [2022-02-21 03:10:29,721 INFO L290 TraceCheckUtils]: 12: Hoare triple {30667#true} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {30667#true} is VALID [2022-02-21 03:10:29,722 INFO L290 TraceCheckUtils]: 13: Hoare triple {30667#true} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_77 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_77; {30667#true} is VALID [2022-02-21 03:10:29,722 INFO L290 TraceCheckUtils]: 14: Hoare triple {30667#true} ~__retres4~0 := ~res~0; {30667#true} is VALID [2022-02-21 03:10:29,722 INFO L290 TraceCheckUtils]: 15: Hoare triple {30667#true} #res := ~__retres4~0; {30667#true} is VALID [2022-02-21 03:10:29,722 INFO L290 TraceCheckUtils]: 16: Hoare triple {30667#true} assume true; {30667#true} is VALID [2022-02-21 03:10:29,722 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {30667#true} {30667#true} #450#return; {30667#true} is VALID [2022-02-21 03:10:29,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-02-21 03:10:29,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:29,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {30706#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {30667#true} is VALID [2022-02-21 03:10:29,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {30667#true} assume !(0 == ~m % 4294967296); {30667#true} is VALID [2022-02-21 03:10:29,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {30667#true} assume !(~m % 4294967296 < 16777216); {30667#true} is VALID [2022-02-21 03:10:29,753 INFO L290 TraceCheckUtils]: 3: Hoare triple {30667#true} assume !false; {30667#true} is VALID [2022-02-21 03:10:29,753 INFO L290 TraceCheckUtils]: 4: Hoare triple {30667#true} assume ~m % 4294967296 >= 33554432; {30667#true} is VALID [2022-02-21 03:10:29,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {30667#true} assume ~e >= 127;~__retres4~0 := 4294967295; {30707#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:29,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {30707#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} #res := ~__retres4~0; {30708#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:29,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {30708#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} assume true; {30708#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:29,755 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {30708#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} {30667#true} #452#return; {30701#(and (<= 4294967295 |ULTIMATE.start_main_#t~ret24#1|) (<= |ULTIMATE.start_main_#t~ret24#1| 4294967295))} is VALID [2022-02-21 03:10:29,755 INFO L290 TraceCheckUtils]: 0: Hoare triple {30667#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); {30667#true} is VALID [2022-02-21 03:10:29,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {30667#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {30667#true} is VALID [2022-02-21 03:10:29,756 INFO L272 TraceCheckUtils]: 2: Hoare triple {30667#true} call main_#t~ret22#1 := base2flt(0, 0); {30706#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:29,756 INFO L290 TraceCheckUtils]: 3: Hoare triple {30706#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {30667#true} is VALID [2022-02-21 03:10:29,756 INFO L290 TraceCheckUtils]: 4: Hoare triple {30667#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {30667#true} is VALID [2022-02-21 03:10:29,756 INFO L290 TraceCheckUtils]: 5: Hoare triple {30667#true} #res := ~__retres4~0; {30667#true} is VALID [2022-02-21 03:10:29,756 INFO L290 TraceCheckUtils]: 6: Hoare triple {30667#true} assume true; {30667#true} is VALID [2022-02-21 03:10:29,756 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {30667#true} {30667#true} #448#return; {30667#true} is VALID [2022-02-21 03:10:29,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {30667#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {30667#true} is VALID [2022-02-21 03:10:29,757 INFO L272 TraceCheckUtils]: 9: Hoare triple {30667#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {30706#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:29,757 INFO L290 TraceCheckUtils]: 10: Hoare triple {30706#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {30667#true} is VALID [2022-02-21 03:10:29,757 INFO L290 TraceCheckUtils]: 11: Hoare triple {30667#true} assume !(0 == ~m % 4294967296); {30667#true} is VALID [2022-02-21 03:10:29,757 INFO L290 TraceCheckUtils]: 12: Hoare triple {30667#true} assume !(~m % 4294967296 < 16777216); {30667#true} is VALID [2022-02-21 03:10:29,757 INFO L290 TraceCheckUtils]: 13: Hoare triple {30667#true} assume !false; {30667#true} is VALID [2022-02-21 03:10:29,757 INFO L290 TraceCheckUtils]: 14: Hoare triple {30667#true} assume !(~m % 4294967296 >= 33554432); {30667#true} is VALID [2022-02-21 03:10:29,758 INFO L290 TraceCheckUtils]: 15: Hoare triple {30667#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {30667#true} is VALID [2022-02-21 03:10:29,758 INFO L290 TraceCheckUtils]: 16: Hoare triple {30667#true} assume 128 + ~e <= 2147483647; {30667#true} is VALID [2022-02-21 03:10:29,758 INFO L290 TraceCheckUtils]: 17: Hoare triple {30667#true} assume 128 + ~e >= -2147483648; {30667#true} is VALID [2022-02-21 03:10:29,758 INFO L290 TraceCheckUtils]: 18: Hoare triple {30667#true} assume 128 + ~e <= 2147483647; {30667#true} is VALID [2022-02-21 03:10:29,758 INFO L290 TraceCheckUtils]: 19: Hoare triple {30667#true} assume 128 + ~e >= -2147483648; {30667#true} is VALID [2022-02-21 03:10:29,758 INFO L290 TraceCheckUtils]: 20: Hoare triple {30667#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {30667#true} is VALID [2022-02-21 03:10:29,758 INFO L290 TraceCheckUtils]: 21: Hoare triple {30667#true} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {30667#true} is VALID [2022-02-21 03:10:29,759 INFO L290 TraceCheckUtils]: 22: Hoare triple {30667#true} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {30667#true} is VALID [2022-02-21 03:10:29,759 INFO L290 TraceCheckUtils]: 23: Hoare triple {30667#true} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_77 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_77; {30667#true} is VALID [2022-02-21 03:10:29,759 INFO L290 TraceCheckUtils]: 24: Hoare triple {30667#true} ~__retres4~0 := ~res~0; {30667#true} is VALID [2022-02-21 03:10:29,759 INFO L290 TraceCheckUtils]: 25: Hoare triple {30667#true} #res := ~__retres4~0; {30667#true} is VALID [2022-02-21 03:10:29,759 INFO L290 TraceCheckUtils]: 26: Hoare triple {30667#true} assume true; {30667#true} is VALID [2022-02-21 03:10:29,759 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {30667#true} {30667#true} #450#return; {30667#true} is VALID [2022-02-21 03:10:29,759 INFO L290 TraceCheckUtils]: 28: Hoare triple {30667#true} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {30667#true} is VALID [2022-02-21 03:10:29,760 INFO L272 TraceCheckUtils]: 29: Hoare triple {30667#true} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {30706#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:29,760 INFO L290 TraceCheckUtils]: 30: Hoare triple {30706#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {30667#true} is VALID [2022-02-21 03:10:29,760 INFO L290 TraceCheckUtils]: 31: Hoare triple {30667#true} assume !(0 == ~m % 4294967296); {30667#true} is VALID [2022-02-21 03:10:29,760 INFO L290 TraceCheckUtils]: 32: Hoare triple {30667#true} assume !(~m % 4294967296 < 16777216); {30667#true} is VALID [2022-02-21 03:10:29,760 INFO L290 TraceCheckUtils]: 33: Hoare triple {30667#true} assume !false; {30667#true} is VALID [2022-02-21 03:10:29,760 INFO L290 TraceCheckUtils]: 34: Hoare triple {30667#true} assume ~m % 4294967296 >= 33554432; {30667#true} is VALID [2022-02-21 03:10:29,761 INFO L290 TraceCheckUtils]: 35: Hoare triple {30667#true} assume ~e >= 127;~__retres4~0 := 4294967295; {30707#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:29,761 INFO L290 TraceCheckUtils]: 36: Hoare triple {30707#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} #res := ~__retres4~0; {30708#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:29,761 INFO L290 TraceCheckUtils]: 37: Hoare triple {30708#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} assume true; {30708#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:29,762 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {30708#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} {30667#true} #452#return; {30701#(and (<= 4294967295 |ULTIMATE.start_main_#t~ret24#1|) (<= |ULTIMATE.start_main_#t~ret24#1| 4294967295))} is VALID [2022-02-21 03:10:29,762 INFO L290 TraceCheckUtils]: 39: Hoare triple {30701#(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; {30702#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} is VALID [2022-02-21 03:10:29,763 INFO L290 TraceCheckUtils]: 40: Hoare triple {30702#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} assume !(main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {30702#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} is VALID [2022-02-21 03:10:29,763 INFO L290 TraceCheckUtils]: 41: Hoare triple {30702#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} assume main_~a~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {30702#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} is VALID [2022-02-21 03:10:29,763 INFO L290 TraceCheckUtils]: 42: Hoare triple {30702#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} main_~sa~0#1 := main_~tmp~2#1; {30702#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} is VALID [2022-02-21 03:10:29,764 INFO L290 TraceCheckUtils]: 43: Hoare triple {30702#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {30702#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} is VALID [2022-02-21 03:10:29,764 INFO L290 TraceCheckUtils]: 44: Hoare triple {30702#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {30702#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} is VALID [2022-02-21 03:10:29,765 INFO L290 TraceCheckUtils]: 45: Hoare triple {30702#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} main_~sb~0#1 := main_~tmp___0~0#1; {30702#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} is VALID [2022-02-21 03:10:29,765 INFO L290 TraceCheckUtils]: 46: Hoare triple {30702#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {30703#(and (<= 4294967295 |ULTIMATE.start_addflt_~b#1|) (<= |ULTIMATE.start_addflt_~b#1| 4294967295))} is VALID [2022-02-21 03:10:29,766 INFO L290 TraceCheckUtils]: 47: Hoare triple {30703#(and (<= 4294967295 |ULTIMATE.start_addflt_~b#1|) (<= |ULTIMATE.start_addflt_~b#1| 4294967295))} assume addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296;addflt_~tmp~0#1 := addflt_~a#1;addflt_~a#1 := addflt_~b#1;addflt_~b#1 := addflt_~tmp~0#1; {30704#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} is VALID [2022-02-21 03:10:29,766 INFO L290 TraceCheckUtils]: 48: Hoare triple {30704#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} assume !(0 == addflt_~b#1 % 4294967296); {30704#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} is VALID [2022-02-21 03:10:29,766 INFO L290 TraceCheckUtils]: 49: Hoare triple {30704#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} assume !(0 == addflt_~a#1); {30704#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} is VALID [2022-02-21 03:10:29,767 INFO L290 TraceCheckUtils]: 50: Hoare triple {30704#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} assume !false; {30704#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} is VALID [2022-02-21 03:10:29,767 INFO L290 TraceCheckUtils]: 51: Hoare triple {30704#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} assume !false; {30704#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} is VALID [2022-02-21 03:10:29,768 INFO L290 TraceCheckUtils]: 52: Hoare triple {30704#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} assume addflt_~a#1 >= 0;abs_108 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_108; {30704#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} is VALID [2022-02-21 03:10:29,768 INFO L290 TraceCheckUtils]: 53: Hoare triple {30704#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {30705#(and (<= (div |ULTIMATE.start_addflt_~a#1| 16777216) (+ 2147483647 (* 4294967296 (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)))) (< 0 (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1)))} is VALID [2022-02-21 03:10:29,769 INFO L290 TraceCheckUtils]: 54: Hoare triple {30705#(and (<= (div |ULTIMATE.start_addflt_~a#1| 16777216) (+ 2147483647 (* 4294967296 (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)))) (< 0 (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1)))} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {30668#false} is VALID [2022-02-21 03:10:29,769 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-21 03:10:29,769 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:29,769 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366608053] [2022-02-21 03:10:29,769 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366608053] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:29,770 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:10:29,770 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-21 03:10:29,770 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384313546] [2022-02-21 03:10:29,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:29,770 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2022-02-21 03:10:29,770 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:29,771 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:29,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:29,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-21 03:10:29,804 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:29,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-21 03:10:29,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-21 03:10:29,804 INFO L87 Difference]: Start difference. First operand 234 states and 291 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:30,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:30,908 INFO L93 Difference]: Finished difference Result 429 states and 523 transitions. [2022-02-21 03:10:30,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-21 03:10:30,908 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2022-02-21 03:10:30,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:30,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:30,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 331 transitions. [2022-02-21 03:10:30,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:30,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 331 transitions. [2022-02-21 03:10:30,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 331 transitions. [2022-02-21 03:10:31,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 331 edges. 331 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:31,090 INFO L225 Difference]: With dead ends: 429 [2022-02-21 03:10:31,090 INFO L226 Difference]: Without dead ends: 378 [2022-02-21 03:10:31,090 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-02-21 03:10:31,090 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 249 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:31,091 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 1234 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 03:10:31,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2022-02-21 03:10:31,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 258. [2022-02-21 03:10:31,194 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:31,194 INFO L82 GeneralOperation]: Start isEquivalent. First operand 378 states. Second operand has 258 states, 233 states have (on average 1.2746781115879828) internal successors, (297), 240 states have internal predecessors, (297), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (13), 13 states have call predecessors, (13), 8 states have call successors, (13) [2022-02-21 03:10:31,194 INFO L74 IsIncluded]: Start isIncluded. First operand 378 states. Second operand has 258 states, 233 states have (on average 1.2746781115879828) internal successors, (297), 240 states have internal predecessors, (297), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (13), 13 states have call predecessors, (13), 8 states have call successors, (13) [2022-02-21 03:10:31,195 INFO L87 Difference]: Start difference. First operand 378 states. Second operand has 258 states, 233 states have (on average 1.2746781115879828) internal successors, (297), 240 states have internal predecessors, (297), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (13), 13 states have call predecessors, (13), 8 states have call successors, (13) [2022-02-21 03:10:31,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:31,200 INFO L93 Difference]: Finished difference Result 378 states and 460 transitions. [2022-02-21 03:10:31,200 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 460 transitions. [2022-02-21 03:10:31,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:31,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:31,201 INFO L74 IsIncluded]: Start isIncluded. First operand has 258 states, 233 states have (on average 1.2746781115879828) internal successors, (297), 240 states have internal predecessors, (297), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (13), 13 states have call predecessors, (13), 8 states have call successors, (13) Second operand 378 states. [2022-02-21 03:10:31,201 INFO L87 Difference]: Start difference. First operand has 258 states, 233 states have (on average 1.2746781115879828) internal successors, (297), 240 states have internal predecessors, (297), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (13), 13 states have call predecessors, (13), 8 states have call successors, (13) Second operand 378 states. [2022-02-21 03:10:31,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:31,207 INFO L93 Difference]: Finished difference Result 378 states and 460 transitions. [2022-02-21 03:10:31,207 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 460 transitions. [2022-02-21 03:10:31,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:31,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:31,207 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:31,208 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:31,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 233 states have (on average 1.2746781115879828) internal successors, (297), 240 states have internal predecessors, (297), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (13), 13 states have call predecessors, (13), 8 states have call successors, (13) [2022-02-21 03:10:31,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 318 transitions. [2022-02-21 03:10:31,212 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 318 transitions. Word has length 55 [2022-02-21 03:10:31,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:31,212 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 318 transitions. [2022-02-21 03:10:31,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:31,212 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 318 transitions. [2022-02-21 03:10:31,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-21 03:10:31,213 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:31,213 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:31,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-02-21 03:10:31,213 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:31,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:31,214 INFO L85 PathProgramCache]: Analyzing trace with hash -129424594, now seen corresponding path program 1 times [2022-02-21 03:10:31,214 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:31,214 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340433990] [2022-02-21 03:10:31,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:31,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:31,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:31,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:31,327 INFO L290 TraceCheckUtils]: 0: Hoare triple {32276#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {32231#true} is VALID [2022-02-21 03:10:31,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {32231#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {32277#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:31,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {32277#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {32278#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:31,328 INFO L290 TraceCheckUtils]: 3: Hoare triple {32278#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {32278#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:31,328 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {32278#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {32231#true} #448#return; {32238#(= |ULTIMATE.start_main_#t~ret22#1| 0)} is VALID [2022-02-21 03:10:31,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:31,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {32276#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {32231#true} is VALID [2022-02-21 03:10:31,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {32231#true} assume !(0 == ~m % 4294967296); {32231#true} is VALID [2022-02-21 03:10:31,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {32231#true} assume !(~m % 4294967296 < 16777216); {32231#true} is VALID [2022-02-21 03:10:31,335 INFO L290 TraceCheckUtils]: 3: Hoare triple {32231#true} assume !false; {32231#true} is VALID [2022-02-21 03:10:31,336 INFO L290 TraceCheckUtils]: 4: Hoare triple {32231#true} assume !(~m % 4294967296 >= 33554432); {32231#true} is VALID [2022-02-21 03:10:31,336 INFO L290 TraceCheckUtils]: 5: Hoare triple {32231#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {32231#true} is VALID [2022-02-21 03:10:31,336 INFO L290 TraceCheckUtils]: 6: Hoare triple {32231#true} assume 128 + ~e <= 2147483647; {32231#true} is VALID [2022-02-21 03:10:31,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {32231#true} assume 128 + ~e >= -2147483648; {32231#true} is VALID [2022-02-21 03:10:31,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {32231#true} assume 128 + ~e <= 2147483647; {32231#true} is VALID [2022-02-21 03:10:31,336 INFO L290 TraceCheckUtils]: 9: Hoare triple {32231#true} assume 128 + ~e >= -2147483648; {32231#true} is VALID [2022-02-21 03:10:31,336 INFO L290 TraceCheckUtils]: 10: Hoare triple {32231#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {32231#true} is VALID [2022-02-21 03:10:31,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {32231#true} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {32231#true} is VALID [2022-02-21 03:10:31,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {32231#true} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {32231#true} is VALID [2022-02-21 03:10:31,337 INFO L290 TraceCheckUtils]: 13: Hoare triple {32231#true} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_77 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_77; {32231#true} is VALID [2022-02-21 03:10:31,337 INFO L290 TraceCheckUtils]: 14: Hoare triple {32231#true} ~__retres4~0 := ~res~0; {32231#true} is VALID [2022-02-21 03:10:31,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {32231#true} #res := ~__retres4~0; {32231#true} is VALID [2022-02-21 03:10:31,337 INFO L290 TraceCheckUtils]: 16: Hoare triple {32231#true} assume true; {32231#true} is VALID [2022-02-21 03:10:31,337 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {32231#true} {32239#(= |ULTIMATE.start_main_~zero~0#1| 0)} #450#return; {32239#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:31,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-02-21 03:10:31,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:31,360 INFO L290 TraceCheckUtils]: 0: Hoare triple {32276#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {32231#true} is VALID [2022-02-21 03:10:31,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {32231#true} assume !(0 == ~m % 4294967296); {32231#true} is VALID [2022-02-21 03:10:31,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {32231#true} assume !(~m % 4294967296 < 16777216); {32231#true} is VALID [2022-02-21 03:10:31,360 INFO L290 TraceCheckUtils]: 3: Hoare triple {32231#true} assume !false; {32231#true} is VALID [2022-02-21 03:10:31,360 INFO L290 TraceCheckUtils]: 4: Hoare triple {32231#true} assume !(~m % 4294967296 >= 33554432); {32231#true} is VALID [2022-02-21 03:10:31,360 INFO L290 TraceCheckUtils]: 5: Hoare triple {32231#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {32231#true} is VALID [2022-02-21 03:10:31,361 INFO L290 TraceCheckUtils]: 6: Hoare triple {32231#true} assume 128 + ~e <= 2147483647; {32231#true} is VALID [2022-02-21 03:10:31,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {32231#true} assume 128 + ~e >= -2147483648; {32231#true} is VALID [2022-02-21 03:10:31,361 INFO L290 TraceCheckUtils]: 8: Hoare triple {32231#true} assume 128 + ~e <= 2147483647; {32231#true} is VALID [2022-02-21 03:10:31,361 INFO L290 TraceCheckUtils]: 9: Hoare triple {32231#true} assume 128 + ~e >= -2147483648; {32231#true} is VALID [2022-02-21 03:10:31,361 INFO L290 TraceCheckUtils]: 10: Hoare triple {32231#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {32231#true} is VALID [2022-02-21 03:10:31,361 INFO L290 TraceCheckUtils]: 11: Hoare triple {32231#true} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {32279#(and (<= 0 base2flt_~res~0) (<= base2flt_~res~0 0))} is VALID [2022-02-21 03:10:31,362 INFO L290 TraceCheckUtils]: 12: Hoare triple {32279#(and (<= 0 base2flt_~res~0) (<= base2flt_~res~0 0))} ~__retres4~0 := ~res~0; {32277#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:31,362 INFO L290 TraceCheckUtils]: 13: Hoare triple {32277#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {32278#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:31,362 INFO L290 TraceCheckUtils]: 14: Hoare triple {32278#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {32278#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:31,363 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {32278#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {32239#(= |ULTIMATE.start_main_~zero~0#1| 0)} #452#return; {32274#(and (= |ULTIMATE.start_main_~zero~0#1| 0) (<= 0 |ULTIMATE.start_main_#t~ret24#1|) (<= |ULTIMATE.start_main_#t~ret24#1| 0))} is VALID [2022-02-21 03:10:31,363 INFO L290 TraceCheckUtils]: 0: Hoare triple {32231#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); {32231#true} is VALID [2022-02-21 03:10:31,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {32231#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {32231#true} is VALID [2022-02-21 03:10:31,364 INFO L272 TraceCheckUtils]: 2: Hoare triple {32231#true} call main_#t~ret22#1 := base2flt(0, 0); {32276#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:31,364 INFO L290 TraceCheckUtils]: 3: Hoare triple {32276#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {32231#true} is VALID [2022-02-21 03:10:31,364 INFO L290 TraceCheckUtils]: 4: Hoare triple {32231#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {32277#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:31,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {32277#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {32278#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:31,365 INFO L290 TraceCheckUtils]: 6: Hoare triple {32278#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {32278#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:31,366 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {32278#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {32231#true} #448#return; {32238#(= |ULTIMATE.start_main_#t~ret22#1| 0)} is VALID [2022-02-21 03:10:31,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {32238#(= |ULTIMATE.start_main_#t~ret22#1| 0)} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {32239#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:31,366 INFO L272 TraceCheckUtils]: 9: Hoare triple {32239#(= |ULTIMATE.start_main_~zero~0#1| 0)} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {32276#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:31,367 INFO L290 TraceCheckUtils]: 10: Hoare triple {32276#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {32231#true} is VALID [2022-02-21 03:10:31,367 INFO L290 TraceCheckUtils]: 11: Hoare triple {32231#true} assume !(0 == ~m % 4294967296); {32231#true} is VALID [2022-02-21 03:10:31,367 INFO L290 TraceCheckUtils]: 12: Hoare triple {32231#true} assume !(~m % 4294967296 < 16777216); {32231#true} is VALID [2022-02-21 03:10:31,367 INFO L290 TraceCheckUtils]: 13: Hoare triple {32231#true} assume !false; {32231#true} is VALID [2022-02-21 03:10:31,367 INFO L290 TraceCheckUtils]: 14: Hoare triple {32231#true} assume !(~m % 4294967296 >= 33554432); {32231#true} is VALID [2022-02-21 03:10:31,367 INFO L290 TraceCheckUtils]: 15: Hoare triple {32231#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {32231#true} is VALID [2022-02-21 03:10:31,367 INFO L290 TraceCheckUtils]: 16: Hoare triple {32231#true} assume 128 + ~e <= 2147483647; {32231#true} is VALID [2022-02-21 03:10:31,367 INFO L290 TraceCheckUtils]: 17: Hoare triple {32231#true} assume 128 + ~e >= -2147483648; {32231#true} is VALID [2022-02-21 03:10:31,368 INFO L290 TraceCheckUtils]: 18: Hoare triple {32231#true} assume 128 + ~e <= 2147483647; {32231#true} is VALID [2022-02-21 03:10:31,368 INFO L290 TraceCheckUtils]: 19: Hoare triple {32231#true} assume 128 + ~e >= -2147483648; {32231#true} is VALID [2022-02-21 03:10:31,368 INFO L290 TraceCheckUtils]: 20: Hoare triple {32231#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {32231#true} is VALID [2022-02-21 03:10:31,368 INFO L290 TraceCheckUtils]: 21: Hoare triple {32231#true} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {32231#true} is VALID [2022-02-21 03:10:31,368 INFO L290 TraceCheckUtils]: 22: Hoare triple {32231#true} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {32231#true} is VALID [2022-02-21 03:10:31,368 INFO L290 TraceCheckUtils]: 23: Hoare triple {32231#true} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_77 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_77; {32231#true} is VALID [2022-02-21 03:10:31,368 INFO L290 TraceCheckUtils]: 24: Hoare triple {32231#true} ~__retres4~0 := ~res~0; {32231#true} is VALID [2022-02-21 03:10:31,368 INFO L290 TraceCheckUtils]: 25: Hoare triple {32231#true} #res := ~__retres4~0; {32231#true} is VALID [2022-02-21 03:10:31,368 INFO L290 TraceCheckUtils]: 26: Hoare triple {32231#true} assume true; {32231#true} is VALID [2022-02-21 03:10:31,369 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {32231#true} {32239#(= |ULTIMATE.start_main_~zero~0#1| 0)} #450#return; {32239#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:31,369 INFO L290 TraceCheckUtils]: 28: Hoare triple {32239#(= |ULTIMATE.start_main_~zero~0#1| 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {32239#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:31,370 INFO L272 TraceCheckUtils]: 29: Hoare triple {32239#(= |ULTIMATE.start_main_~zero~0#1| 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {32276#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:31,370 INFO L290 TraceCheckUtils]: 30: Hoare triple {32276#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {32231#true} is VALID [2022-02-21 03:10:31,370 INFO L290 TraceCheckUtils]: 31: Hoare triple {32231#true} assume !(0 == ~m % 4294967296); {32231#true} is VALID [2022-02-21 03:10:31,370 INFO L290 TraceCheckUtils]: 32: Hoare triple {32231#true} assume !(~m % 4294967296 < 16777216); {32231#true} is VALID [2022-02-21 03:10:31,371 INFO L290 TraceCheckUtils]: 33: Hoare triple {32231#true} assume !false; {32231#true} is VALID [2022-02-21 03:10:31,371 INFO L290 TraceCheckUtils]: 34: Hoare triple {32231#true} assume !(~m % 4294967296 >= 33554432); {32231#true} is VALID [2022-02-21 03:10:31,371 INFO L290 TraceCheckUtils]: 35: Hoare triple {32231#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {32231#true} is VALID [2022-02-21 03:10:31,371 INFO L290 TraceCheckUtils]: 36: Hoare triple {32231#true} assume 128 + ~e <= 2147483647; {32231#true} is VALID [2022-02-21 03:10:31,371 INFO L290 TraceCheckUtils]: 37: Hoare triple {32231#true} assume 128 + ~e >= -2147483648; {32231#true} is VALID [2022-02-21 03:10:31,372 INFO L290 TraceCheckUtils]: 38: Hoare triple {32231#true} assume 128 + ~e <= 2147483647; {32231#true} is VALID [2022-02-21 03:10:31,372 INFO L290 TraceCheckUtils]: 39: Hoare triple {32231#true} assume 128 + ~e >= -2147483648; {32231#true} is VALID [2022-02-21 03:10:31,372 INFO L290 TraceCheckUtils]: 40: Hoare triple {32231#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {32231#true} is VALID [2022-02-21 03:10:31,372 INFO L290 TraceCheckUtils]: 41: Hoare triple {32231#true} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {32279#(and (<= 0 base2flt_~res~0) (<= base2flt_~res~0 0))} is VALID [2022-02-21 03:10:31,373 INFO L290 TraceCheckUtils]: 42: Hoare triple {32279#(and (<= 0 base2flt_~res~0) (<= base2flt_~res~0 0))} ~__retres4~0 := ~res~0; {32277#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:31,373 INFO L290 TraceCheckUtils]: 43: Hoare triple {32277#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {32278#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:31,373 INFO L290 TraceCheckUtils]: 44: Hoare triple {32278#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {32278#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:31,374 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {32278#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {32239#(= |ULTIMATE.start_main_~zero~0#1| 0)} #452#return; {32274#(and (= |ULTIMATE.start_main_~zero~0#1| 0) (<= 0 |ULTIMATE.start_main_#t~ret24#1|) (<= |ULTIMATE.start_main_#t~ret24#1| 0))} is VALID [2022-02-21 03:10:31,374 INFO L290 TraceCheckUtils]: 46: Hoare triple {32274#(and (= |ULTIMATE.start_main_~zero~0#1| 0) (<= 0 |ULTIMATE.start_main_#t~ret24#1|) (<= |ULTIMATE.start_main_#t~ret24#1| 0))} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {32275#(and (<= |ULTIMATE.start_main_~b~0#1| 0) (= |ULTIMATE.start_main_~zero~0#1| 0) (<= (div |ULTIMATE.start_main_~zero~0#1| 4294967296) (div |ULTIMATE.start_main_~b~0#1| 4294967296)))} is VALID [2022-02-21 03:10:31,375 INFO L290 TraceCheckUtils]: 47: Hoare triple {32275#(and (<= |ULTIMATE.start_main_~b~0#1| 0) (= |ULTIMATE.start_main_~zero~0#1| 0) (<= (div |ULTIMATE.start_main_~zero~0#1| 4294967296) (div |ULTIMATE.start_main_~b~0#1| 4294967296)))} assume !(main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {32275#(and (<= |ULTIMATE.start_main_~b~0#1| 0) (= |ULTIMATE.start_main_~zero~0#1| 0) (<= (div |ULTIMATE.start_main_~zero~0#1| 4294967296) (div |ULTIMATE.start_main_~b~0#1| 4294967296)))} is VALID [2022-02-21 03:10:31,375 INFO L290 TraceCheckUtils]: 48: Hoare triple {32275#(and (<= |ULTIMATE.start_main_~b~0#1| 0) (= |ULTIMATE.start_main_~zero~0#1| 0) (<= (div |ULTIMATE.start_main_~zero~0#1| 4294967296) (div |ULTIMATE.start_main_~b~0#1| 4294967296)))} assume main_~a~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {32275#(and (<= |ULTIMATE.start_main_~b~0#1| 0) (= |ULTIMATE.start_main_~zero~0#1| 0) (<= (div |ULTIMATE.start_main_~zero~0#1| 4294967296) (div |ULTIMATE.start_main_~b~0#1| 4294967296)))} is VALID [2022-02-21 03:10:31,375 INFO L290 TraceCheckUtils]: 49: Hoare triple {32275#(and (<= |ULTIMATE.start_main_~b~0#1| 0) (= |ULTIMATE.start_main_~zero~0#1| 0) (<= (div |ULTIMATE.start_main_~zero~0#1| 4294967296) (div |ULTIMATE.start_main_~b~0#1| 4294967296)))} main_~sa~0#1 := main_~tmp~2#1; {32275#(and (<= |ULTIMATE.start_main_~b~0#1| 0) (= |ULTIMATE.start_main_~zero~0#1| 0) (<= (div |ULTIMATE.start_main_~zero~0#1| 4294967296) (div |ULTIMATE.start_main_~b~0#1| 4294967296)))} is VALID [2022-02-21 03:10:31,376 INFO L290 TraceCheckUtils]: 50: Hoare triple {32275#(and (<= |ULTIMATE.start_main_~b~0#1| 0) (= |ULTIMATE.start_main_~zero~0#1| 0) (<= (div |ULTIMATE.start_main_~zero~0#1| 4294967296) (div |ULTIMATE.start_main_~b~0#1| 4294967296)))} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {32275#(and (<= |ULTIMATE.start_main_~b~0#1| 0) (= |ULTIMATE.start_main_~zero~0#1| 0) (<= (div |ULTIMATE.start_main_~zero~0#1| 4294967296) (div |ULTIMATE.start_main_~b~0#1| 4294967296)))} is VALID [2022-02-21 03:10:31,376 INFO L290 TraceCheckUtils]: 51: Hoare triple {32275#(and (<= |ULTIMATE.start_main_~b~0#1| 0) (= |ULTIMATE.start_main_~zero~0#1| 0) (<= (div |ULTIMATE.start_main_~zero~0#1| 4294967296) (div |ULTIMATE.start_main_~b~0#1| 4294967296)))} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {32232#false} is VALID [2022-02-21 03:10:31,376 INFO L290 TraceCheckUtils]: 52: Hoare triple {32232#false} main_~sb~0#1 := main_~tmp___0~0#1; {32232#false} is VALID [2022-02-21 03:10:31,377 INFO L290 TraceCheckUtils]: 53: Hoare triple {32232#false} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {32232#false} is VALID [2022-02-21 03:10:31,377 INFO L290 TraceCheckUtils]: 54: Hoare triple {32232#false} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {32232#false} is VALID [2022-02-21 03:10:31,377 INFO L290 TraceCheckUtils]: 55: Hoare triple {32232#false} assume !(0 == addflt_~b#1 % 4294967296); {32232#false} is VALID [2022-02-21 03:10:31,377 INFO L290 TraceCheckUtils]: 56: Hoare triple {32232#false} assume !(0 == addflt_~a#1); {32232#false} is VALID [2022-02-21 03:10:31,377 INFO L290 TraceCheckUtils]: 57: Hoare triple {32232#false} assume !false; {32232#false} is VALID [2022-02-21 03:10:31,377 INFO L290 TraceCheckUtils]: 58: Hoare triple {32232#false} assume !false; {32232#false} is VALID [2022-02-21 03:10:31,377 INFO L290 TraceCheckUtils]: 59: Hoare triple {32232#false} assume addflt_~a#1 >= 0;abs_108 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_108; {32232#false} is VALID [2022-02-21 03:10:31,377 INFO L290 TraceCheckUtils]: 60: Hoare triple {32232#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {32232#false} is VALID [2022-02-21 03:10:31,377 INFO L290 TraceCheckUtils]: 61: Hoare triple {32232#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {32232#false} is VALID [2022-02-21 03:10:31,378 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-02-21 03:10:31,378 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:31,378 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340433990] [2022-02-21 03:10:31,378 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340433990] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:31,378 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961983813] [2022-02-21 03:10:31,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:31,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:31,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:31,380 INFO L229 MonitoredProcess]: Starting monitored process 20 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:31,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-02-21 03:10:31,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:31,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-21 03:10:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:31,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:31,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {32231#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); {32231#true} is VALID [2022-02-21 03:10:31,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {32231#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {32231#true} is VALID [2022-02-21 03:10:31,734 INFO L272 TraceCheckUtils]: 2: Hoare triple {32231#true} call main_#t~ret22#1 := base2flt(0, 0); {32231#true} is VALID [2022-02-21 03:10:31,735 INFO L290 TraceCheckUtils]: 3: Hoare triple {32231#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {32292#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:31,735 INFO L290 TraceCheckUtils]: 4: Hoare triple {32292#(= base2flt_~m |base2flt_#in~m|)} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {32296#(<= (mod |base2flt_#in~m| 4294967296) 0)} is VALID [2022-02-21 03:10:31,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {32296#(<= (mod |base2flt_#in~m| 4294967296) 0)} #res := ~__retres4~0; {32296#(<= (mod |base2flt_#in~m| 4294967296) 0)} is VALID [2022-02-21 03:10:31,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {32296#(<= (mod |base2flt_#in~m| 4294967296) 0)} assume true; {32296#(<= (mod |base2flt_#in~m| 4294967296) 0)} is VALID [2022-02-21 03:10:31,736 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {32296#(<= (mod |base2flt_#in~m| 4294967296) 0)} {32231#true} #448#return; {32231#true} is VALID [2022-02-21 03:10:31,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {32231#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {32231#true} is VALID [2022-02-21 03:10:31,736 INFO L272 TraceCheckUtils]: 9: Hoare triple {32231#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {32231#true} is VALID [2022-02-21 03:10:31,736 INFO L290 TraceCheckUtils]: 10: Hoare triple {32231#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {32231#true} is VALID [2022-02-21 03:10:31,736 INFO L290 TraceCheckUtils]: 11: Hoare triple {32231#true} assume !(0 == ~m % 4294967296); {32231#true} is VALID [2022-02-21 03:10:31,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {32231#true} assume !(~m % 4294967296 < 16777216); {32231#true} is VALID [2022-02-21 03:10:31,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {32231#true} assume !false; {32231#true} is VALID [2022-02-21 03:10:31,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {32231#true} assume !(~m % 4294967296 >= 33554432); {32231#true} is VALID [2022-02-21 03:10:31,736 INFO L290 TraceCheckUtils]: 15: Hoare triple {32231#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {32231#true} is VALID [2022-02-21 03:10:31,736 INFO L290 TraceCheckUtils]: 16: Hoare triple {32231#true} assume 128 + ~e <= 2147483647; {32231#true} is VALID [2022-02-21 03:10:31,736 INFO L290 TraceCheckUtils]: 17: Hoare triple {32231#true} assume 128 + ~e >= -2147483648; {32231#true} is VALID [2022-02-21 03:10:31,736 INFO L290 TraceCheckUtils]: 18: Hoare triple {32231#true} assume 128 + ~e <= 2147483647; {32231#true} is VALID [2022-02-21 03:10:31,736 INFO L290 TraceCheckUtils]: 19: Hoare triple {32231#true} assume 128 + ~e >= -2147483648; {32231#true} is VALID [2022-02-21 03:10:31,736 INFO L290 TraceCheckUtils]: 20: Hoare triple {32231#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {32231#true} is VALID [2022-02-21 03:10:31,736 INFO L290 TraceCheckUtils]: 21: Hoare triple {32231#true} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {32231#true} is VALID [2022-02-21 03:10:31,737 INFO L290 TraceCheckUtils]: 22: Hoare triple {32231#true} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {32231#true} is VALID [2022-02-21 03:10:31,737 INFO L290 TraceCheckUtils]: 23: Hoare triple {32231#true} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_77 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_77; {32231#true} is VALID [2022-02-21 03:10:31,737 INFO L290 TraceCheckUtils]: 24: Hoare triple {32231#true} ~__retres4~0 := ~res~0; {32231#true} is VALID [2022-02-21 03:10:31,737 INFO L290 TraceCheckUtils]: 25: Hoare triple {32231#true} #res := ~__retres4~0; {32231#true} is VALID [2022-02-21 03:10:31,737 INFO L290 TraceCheckUtils]: 26: Hoare triple {32231#true} assume true; {32231#true} is VALID [2022-02-21 03:10:31,737 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {32231#true} {32231#true} #450#return; {32231#true} is VALID [2022-02-21 03:10:31,737 INFO L290 TraceCheckUtils]: 28: Hoare triple {32231#true} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {32231#true} is VALID [2022-02-21 03:10:31,737 INFO L272 TraceCheckUtils]: 29: Hoare triple {32231#true} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {32231#true} is VALID [2022-02-21 03:10:31,737 INFO L290 TraceCheckUtils]: 30: Hoare triple {32231#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {32231#true} is VALID [2022-02-21 03:10:31,737 INFO L290 TraceCheckUtils]: 31: Hoare triple {32231#true} assume !(0 == ~m % 4294967296); {32231#true} is VALID [2022-02-21 03:10:31,737 INFO L290 TraceCheckUtils]: 32: Hoare triple {32231#true} assume !(~m % 4294967296 < 16777216); {32231#true} is VALID [2022-02-21 03:10:31,737 INFO L290 TraceCheckUtils]: 33: Hoare triple {32231#true} assume !false; {32231#true} is VALID [2022-02-21 03:10:31,738 INFO L290 TraceCheckUtils]: 34: Hoare triple {32231#true} assume !(~m % 4294967296 >= 33554432); {32231#true} is VALID [2022-02-21 03:10:31,738 INFO L290 TraceCheckUtils]: 35: Hoare triple {32231#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {32231#true} is VALID [2022-02-21 03:10:31,738 INFO L290 TraceCheckUtils]: 36: Hoare triple {32231#true} assume 128 + ~e <= 2147483647; {32231#true} is VALID [2022-02-21 03:10:31,738 INFO L290 TraceCheckUtils]: 37: Hoare triple {32231#true} assume 128 + ~e >= -2147483648; {32231#true} is VALID [2022-02-21 03:10:31,738 INFO L290 TraceCheckUtils]: 38: Hoare triple {32231#true} assume 128 + ~e <= 2147483647; {32231#true} is VALID [2022-02-21 03:10:31,738 INFO L290 TraceCheckUtils]: 39: Hoare triple {32231#true} assume 128 + ~e >= -2147483648; {32231#true} is VALID [2022-02-21 03:10:31,738 INFO L290 TraceCheckUtils]: 40: Hoare triple {32231#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {32231#true} is VALID [2022-02-21 03:10:31,738 INFO L290 TraceCheckUtils]: 41: Hoare triple {32231#true} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {32279#(and (<= 0 base2flt_~res~0) (<= base2flt_~res~0 0))} is VALID [2022-02-21 03:10:31,739 INFO L290 TraceCheckUtils]: 42: Hoare triple {32279#(and (<= 0 base2flt_~res~0) (<= base2flt_~res~0 0))} ~__retres4~0 := ~res~0; {32277#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:31,739 INFO L290 TraceCheckUtils]: 43: Hoare triple {32277#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {32278#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:31,739 INFO L290 TraceCheckUtils]: 44: Hoare triple {32278#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {32278#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:31,740 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {32278#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {32231#true} #452#return; {32420#(and (<= 0 |ULTIMATE.start_main_#t~ret24#1|) (<= |ULTIMATE.start_main_#t~ret24#1| 0))} is VALID [2022-02-21 03:10:31,740 INFO L290 TraceCheckUtils]: 46: Hoare triple {32420#(and (<= 0 |ULTIMATE.start_main_#t~ret24#1|) (<= |ULTIMATE.start_main_#t~ret24#1| 0))} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {32424#(and (<= 0 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 0))} is VALID [2022-02-21 03:10:31,740 INFO L290 TraceCheckUtils]: 47: Hoare triple {32424#(and (<= 0 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 0))} assume !(main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {32424#(and (<= 0 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 0))} is VALID [2022-02-21 03:10:31,740 INFO L290 TraceCheckUtils]: 48: Hoare triple {32424#(and (<= 0 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 0))} assume main_~a~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {32424#(and (<= 0 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 0))} is VALID [2022-02-21 03:10:31,741 INFO L290 TraceCheckUtils]: 49: Hoare triple {32424#(and (<= 0 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 0))} main_~sa~0#1 := main_~tmp~2#1; {32424#(and (<= 0 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 0))} is VALID [2022-02-21 03:10:31,741 INFO L290 TraceCheckUtils]: 50: Hoare triple {32424#(and (<= 0 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 0))} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {32424#(and (<= 0 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 0))} is VALID [2022-02-21 03:10:31,741 INFO L290 TraceCheckUtils]: 51: Hoare triple {32424#(and (<= 0 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 0))} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {32424#(and (<= 0 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 0))} is VALID [2022-02-21 03:10:31,742 INFO L290 TraceCheckUtils]: 52: Hoare triple {32424#(and (<= 0 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 0))} main_~sb~0#1 := main_~tmp___0~0#1; {32424#(and (<= 0 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 0))} is VALID [2022-02-21 03:10:31,742 INFO L290 TraceCheckUtils]: 53: Hoare triple {32424#(and (<= 0 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 0))} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {32446#(and (<= |ULTIMATE.start_addflt_~b#1| 0) (<= 0 |ULTIMATE.start_addflt_~b#1|))} is VALID [2022-02-21 03:10:31,742 INFO L290 TraceCheckUtils]: 54: Hoare triple {32446#(and (<= |ULTIMATE.start_addflt_~b#1| 0) (<= 0 |ULTIMATE.start_addflt_~b#1|))} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {32446#(and (<= |ULTIMATE.start_addflt_~b#1| 0) (<= 0 |ULTIMATE.start_addflt_~b#1|))} is VALID [2022-02-21 03:10:31,743 INFO L290 TraceCheckUtils]: 55: Hoare triple {32446#(and (<= |ULTIMATE.start_addflt_~b#1| 0) (<= 0 |ULTIMATE.start_addflt_~b#1|))} assume !(0 == addflt_~b#1 % 4294967296); {32232#false} is VALID [2022-02-21 03:10:31,743 INFO L290 TraceCheckUtils]: 56: Hoare triple {32232#false} assume !(0 == addflt_~a#1); {32232#false} is VALID [2022-02-21 03:10:31,743 INFO L290 TraceCheckUtils]: 57: Hoare triple {32232#false} assume !false; {32232#false} is VALID [2022-02-21 03:10:31,743 INFO L290 TraceCheckUtils]: 58: Hoare triple {32232#false} assume !false; {32232#false} is VALID [2022-02-21 03:10:31,743 INFO L290 TraceCheckUtils]: 59: Hoare triple {32232#false} assume addflt_~a#1 >= 0;abs_108 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_108; {32232#false} is VALID [2022-02-21 03:10:31,743 INFO L290 TraceCheckUtils]: 60: Hoare triple {32232#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {32232#false} is VALID [2022-02-21 03:10:31,743 INFO L290 TraceCheckUtils]: 61: Hoare triple {32232#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {32232#false} is VALID [2022-02-21 03:10:31,743 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-02-21 03:10:31,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:10:31,939 INFO L290 TraceCheckUtils]: 61: Hoare triple {32232#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {32232#false} is VALID [2022-02-21 03:10:31,939 INFO L290 TraceCheckUtils]: 60: Hoare triple {32232#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {32232#false} is VALID [2022-02-21 03:10:31,939 INFO L290 TraceCheckUtils]: 59: Hoare triple {32232#false} assume addflt_~a#1 >= 0;abs_108 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_108; {32232#false} is VALID [2022-02-21 03:10:31,939 INFO L290 TraceCheckUtils]: 58: Hoare triple {32232#false} assume !false; {32232#false} is VALID [2022-02-21 03:10:31,940 INFO L290 TraceCheckUtils]: 57: Hoare triple {32232#false} assume !false; {32232#false} is VALID [2022-02-21 03:10:31,940 INFO L290 TraceCheckUtils]: 56: Hoare triple {32232#false} assume !(0 == addflt_~a#1); {32232#false} is VALID [2022-02-21 03:10:31,940 INFO L290 TraceCheckUtils]: 55: Hoare triple {32489#(= (mod |ULTIMATE.start_addflt_~b#1| 4294967296) 0)} assume !(0 == addflt_~b#1 % 4294967296); {32232#false} is VALID [2022-02-21 03:10:31,940 INFO L290 TraceCheckUtils]: 54: Hoare triple {32489#(= (mod |ULTIMATE.start_addflt_~b#1| 4294967296) 0)} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {32489#(= (mod |ULTIMATE.start_addflt_~b#1| 4294967296) 0)} is VALID [2022-02-21 03:10:31,941 INFO L290 TraceCheckUtils]: 53: Hoare triple {32496#(= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {32489#(= (mod |ULTIMATE.start_addflt_~b#1| 4294967296) 0)} is VALID [2022-02-21 03:10:31,941 INFO L290 TraceCheckUtils]: 52: Hoare triple {32496#(= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} main_~sb~0#1 := main_~tmp___0~0#1; {32496#(= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:31,942 INFO L290 TraceCheckUtils]: 51: Hoare triple {32496#(= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {32496#(= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:31,942 INFO L290 TraceCheckUtils]: 50: Hoare triple {32496#(= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {32496#(= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:31,942 INFO L290 TraceCheckUtils]: 49: Hoare triple {32496#(= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} main_~sa~0#1 := main_~tmp~2#1; {32496#(= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:31,942 INFO L290 TraceCheckUtils]: 48: Hoare triple {32496#(= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} assume main_~a~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {32496#(= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:31,943 INFO L290 TraceCheckUtils]: 47: Hoare triple {32496#(= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} assume !(main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {32496#(= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:31,943 INFO L290 TraceCheckUtils]: 46: Hoare triple {32518#(= (mod |ULTIMATE.start_main_#t~ret24#1| 4294967296) 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {32496#(= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:31,944 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {32525#(= (mod |base2flt_#res| 4294967296) 0)} {32231#true} #452#return; {32518#(= (mod |ULTIMATE.start_main_#t~ret24#1| 4294967296) 0)} is VALID [2022-02-21 03:10:31,944 INFO L290 TraceCheckUtils]: 44: Hoare triple {32525#(= (mod |base2flt_#res| 4294967296) 0)} assume true; {32525#(= (mod |base2flt_#res| 4294967296) 0)} is VALID [2022-02-21 03:10:31,944 INFO L290 TraceCheckUtils]: 43: Hoare triple {32532#(= (mod base2flt_~__retres4~0 4294967296) 0)} #res := ~__retres4~0; {32525#(= (mod |base2flt_#res| 4294967296) 0)} is VALID [2022-02-21 03:10:31,945 INFO L290 TraceCheckUtils]: 42: Hoare triple {32536#(= (mod base2flt_~res~0 4294967296) 0)} ~__retres4~0 := ~res~0; {32532#(= (mod base2flt_~__retres4~0 4294967296) 0)} is VALID [2022-02-21 03:10:31,945 INFO L290 TraceCheckUtils]: 41: Hoare triple {32231#true} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {32536#(= (mod base2flt_~res~0 4294967296) 0)} is VALID [2022-02-21 03:10:31,945 INFO L290 TraceCheckUtils]: 40: Hoare triple {32231#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {32231#true} is VALID [2022-02-21 03:10:31,946 INFO L290 TraceCheckUtils]: 39: Hoare triple {32231#true} assume 128 + ~e >= -2147483648; {32231#true} is VALID [2022-02-21 03:10:31,946 INFO L290 TraceCheckUtils]: 38: Hoare triple {32231#true} assume 128 + ~e <= 2147483647; {32231#true} is VALID [2022-02-21 03:10:31,946 INFO L290 TraceCheckUtils]: 37: Hoare triple {32231#true} assume 128 + ~e >= -2147483648; {32231#true} is VALID [2022-02-21 03:10:31,946 INFO L290 TraceCheckUtils]: 36: Hoare triple {32231#true} assume 128 + ~e <= 2147483647; {32231#true} is VALID [2022-02-21 03:10:31,946 INFO L290 TraceCheckUtils]: 35: Hoare triple {32231#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {32231#true} is VALID [2022-02-21 03:10:31,946 INFO L290 TraceCheckUtils]: 34: Hoare triple {32231#true} assume !(~m % 4294967296 >= 33554432); {32231#true} is VALID [2022-02-21 03:10:31,946 INFO L290 TraceCheckUtils]: 33: Hoare triple {32231#true} assume !false; {32231#true} is VALID [2022-02-21 03:10:31,947 INFO L290 TraceCheckUtils]: 32: Hoare triple {32231#true} assume !(~m % 4294967296 < 16777216); {32231#true} is VALID [2022-02-21 03:10:31,947 INFO L290 TraceCheckUtils]: 31: Hoare triple {32231#true} assume !(0 == ~m % 4294967296); {32231#true} is VALID [2022-02-21 03:10:31,947 INFO L290 TraceCheckUtils]: 30: Hoare triple {32231#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {32231#true} is VALID [2022-02-21 03:10:31,947 INFO L272 TraceCheckUtils]: 29: Hoare triple {32231#true} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {32231#true} is VALID [2022-02-21 03:10:31,947 INFO L290 TraceCheckUtils]: 28: Hoare triple {32231#true} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {32231#true} is VALID [2022-02-21 03:10:31,947 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {32231#true} {32231#true} #450#return; {32231#true} is VALID [2022-02-21 03:10:31,947 INFO L290 TraceCheckUtils]: 26: Hoare triple {32231#true} assume true; {32231#true} is VALID [2022-02-21 03:10:31,947 INFO L290 TraceCheckUtils]: 25: Hoare triple {32231#true} #res := ~__retres4~0; {32231#true} is VALID [2022-02-21 03:10:31,948 INFO L290 TraceCheckUtils]: 24: Hoare triple {32231#true} ~__retres4~0 := ~res~0; {32231#true} is VALID [2022-02-21 03:10:31,948 INFO L290 TraceCheckUtils]: 23: Hoare triple {32231#true} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_77 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_77; {32231#true} is VALID [2022-02-21 03:10:31,948 INFO L290 TraceCheckUtils]: 22: Hoare triple {32231#true} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {32231#true} is VALID [2022-02-21 03:10:31,948 INFO L290 TraceCheckUtils]: 21: Hoare triple {32231#true} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {32231#true} is VALID [2022-02-21 03:10:31,948 INFO L290 TraceCheckUtils]: 20: Hoare triple {32231#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {32231#true} is VALID [2022-02-21 03:10:31,948 INFO L290 TraceCheckUtils]: 19: Hoare triple {32231#true} assume 128 + ~e >= -2147483648; {32231#true} is VALID [2022-02-21 03:10:31,948 INFO L290 TraceCheckUtils]: 18: Hoare triple {32231#true} assume 128 + ~e <= 2147483647; {32231#true} is VALID [2022-02-21 03:10:31,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {32231#true} assume 128 + ~e >= -2147483648; {32231#true} is VALID [2022-02-21 03:10:31,948 INFO L290 TraceCheckUtils]: 16: Hoare triple {32231#true} assume 128 + ~e <= 2147483647; {32231#true} is VALID [2022-02-21 03:10:31,949 INFO L290 TraceCheckUtils]: 15: Hoare triple {32231#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {32231#true} is VALID [2022-02-21 03:10:31,949 INFO L290 TraceCheckUtils]: 14: Hoare triple {32231#true} assume !(~m % 4294967296 >= 33554432); {32231#true} is VALID [2022-02-21 03:10:31,949 INFO L290 TraceCheckUtils]: 13: Hoare triple {32231#true} assume !false; {32231#true} is VALID [2022-02-21 03:10:31,949 INFO L290 TraceCheckUtils]: 12: Hoare triple {32231#true} assume !(~m % 4294967296 < 16777216); {32231#true} is VALID [2022-02-21 03:10:31,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {32231#true} assume !(0 == ~m % 4294967296); {32231#true} is VALID [2022-02-21 03:10:31,949 INFO L290 TraceCheckUtils]: 10: Hoare triple {32231#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {32231#true} is VALID [2022-02-21 03:10:31,949 INFO L272 TraceCheckUtils]: 9: Hoare triple {32231#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {32231#true} is VALID [2022-02-21 03:10:31,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {32231#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {32231#true} is VALID [2022-02-21 03:10:31,950 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {32231#true} {32231#true} #448#return; {32231#true} is VALID [2022-02-21 03:10:31,950 INFO L290 TraceCheckUtils]: 6: Hoare triple {32231#true} assume true; {32231#true} is VALID [2022-02-21 03:10:31,950 INFO L290 TraceCheckUtils]: 5: Hoare triple {32231#true} #res := ~__retres4~0; {32231#true} is VALID [2022-02-21 03:10:31,950 INFO L290 TraceCheckUtils]: 4: Hoare triple {32231#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {32231#true} is VALID [2022-02-21 03:10:31,950 INFO L290 TraceCheckUtils]: 3: Hoare triple {32231#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {32231#true} is VALID [2022-02-21 03:10:31,950 INFO L272 TraceCheckUtils]: 2: Hoare triple {32231#true} call main_#t~ret22#1 := base2flt(0, 0); {32231#true} is VALID [2022-02-21 03:10:31,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {32231#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {32231#true} is VALID [2022-02-21 03:10:31,950 INFO L290 TraceCheckUtils]: 0: Hoare triple {32231#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); {32231#true} is VALID [2022-02-21 03:10:31,951 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-02-21 03:10:31,951 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961983813] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:31,951 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-02-21 03:10:31,951 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 10] total 21 [2022-02-21 03:10:31,951 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798713886] [2022-02-21 03:10:31,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:31,952 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 62 [2022-02-21 03:10:31,952 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:31,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:31,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:31,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-21 03:10:31,987 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:31,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 03:10:31,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2022-02-21 03:10:31,988 INFO L87 Difference]: Start difference. First operand 258 states and 318 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:32,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:32,933 INFO L93 Difference]: Finished difference Result 402 states and 487 transitions. [2022-02-21 03:10:32,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 03:10:32,933 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 62 [2022-02-21 03:10:32,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:32,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:32,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 248 transitions. [2022-02-21 03:10:32,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:32,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 248 transitions. [2022-02-21 03:10:32,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 248 transitions. [2022-02-21 03:10:33,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 248 edges. 248 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:33,110 INFO L225 Difference]: With dead ends: 402 [2022-02-21 03:10:33,110 INFO L226 Difference]: Without dead ends: 291 [2022-02-21 03:10:33,110 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 120 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2022-02-21 03:10:33,111 INFO L933 BasicCegarLoop]: 167 mSDtfsCounter, 41 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:33,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 1097 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:10:33,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-02-21 03:10:33,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 252. [2022-02-21 03:10:33,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:33,228 INFO L82 GeneralOperation]: Start isEquivalent. First operand 291 states. Second operand has 252 states, 227 states have (on average 1.2731277533039647) internal successors, (289), 234 states have internal predecessors, (289), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (13), 13 states have call predecessors, (13), 8 states have call successors, (13) [2022-02-21 03:10:33,228 INFO L74 IsIncluded]: Start isIncluded. First operand 291 states. Second operand has 252 states, 227 states have (on average 1.2731277533039647) internal successors, (289), 234 states have internal predecessors, (289), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (13), 13 states have call predecessors, (13), 8 states have call successors, (13) [2022-02-21 03:10:33,229 INFO L87 Difference]: Start difference. First operand 291 states. Second operand has 252 states, 227 states have (on average 1.2731277533039647) internal successors, (289), 234 states have internal predecessors, (289), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (13), 13 states have call predecessors, (13), 8 states have call successors, (13) [2022-02-21 03:10:33,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:33,233 INFO L93 Difference]: Finished difference Result 291 states and 354 transitions. [2022-02-21 03:10:33,234 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 354 transitions. [2022-02-21 03:10:33,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:33,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:33,234 INFO L74 IsIncluded]: Start isIncluded. First operand has 252 states, 227 states have (on average 1.2731277533039647) internal successors, (289), 234 states have internal predecessors, (289), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (13), 13 states have call predecessors, (13), 8 states have call successors, (13) Second operand 291 states. [2022-02-21 03:10:33,235 INFO L87 Difference]: Start difference. First operand has 252 states, 227 states have (on average 1.2731277533039647) internal successors, (289), 234 states have internal predecessors, (289), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (13), 13 states have call predecessors, (13), 8 states have call successors, (13) Second operand 291 states. [2022-02-21 03:10:33,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:33,239 INFO L93 Difference]: Finished difference Result 291 states and 354 transitions. [2022-02-21 03:10:33,239 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 354 transitions. [2022-02-21 03:10:33,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:33,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:33,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:33,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:33,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 227 states have (on average 1.2731277533039647) internal successors, (289), 234 states have internal predecessors, (289), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (13), 13 states have call predecessors, (13), 8 states have call successors, (13) [2022-02-21 03:10:33,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 310 transitions. [2022-02-21 03:10:33,243 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 310 transitions. Word has length 62 [2022-02-21 03:10:33,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:33,243 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 310 transitions. [2022-02-21 03:10:33,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:33,244 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 310 transitions. [2022-02-21 03:10:33,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-21 03:10:33,245 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:33,245 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:33,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-02-21 03:10:33,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:33,462 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:33,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:33,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1579288781, now seen corresponding path program 1 times [2022-02-21 03:10:33,462 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:33,462 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668835378] [2022-02-21 03:10:33,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:33,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:33,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:10:33,494 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:10:33,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:10:33,535 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:10:33,536 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-21 03:10:33,536 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 20 remaining) [2022-02-21 03:10:33,537 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 20 remaining) [2022-02-21 03:10:33,538 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 20 remaining) [2022-02-21 03:10:33,538 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 20 remaining) [2022-02-21 03:10:33,538 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 20 remaining) [2022-02-21 03:10:33,538 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 20 remaining) [2022-02-21 03:10:33,538 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 20 remaining) [2022-02-21 03:10:33,538 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 20 remaining) [2022-02-21 03:10:33,538 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 20 remaining) [2022-02-21 03:10:33,539 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 20 remaining) [2022-02-21 03:10:33,539 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 20 remaining) [2022-02-21 03:10:33,539 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 20 remaining) [2022-02-21 03:10:33,539 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 20 remaining) [2022-02-21 03:10:33,539 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 20 remaining) [2022-02-21 03:10:33,539 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 20 remaining) [2022-02-21 03:10:33,539 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 20 remaining) [2022-02-21 03:10:33,540 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 20 remaining) [2022-02-21 03:10:33,540 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 20 remaining) [2022-02-21 03:10:33,540 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 20 remaining) [2022-02-21 03:10:33,540 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 20 remaining) [2022-02-21 03:10:33,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-02-21 03:10:33,543 INFO L732 BasicCegarLoop]: Path program histogram: [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:33,546 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-21 03:10:33,588 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call #t~ret22 := base2flt(0, 0); [2022-02-21 03:10:33,589 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.UnprovableResult.getProgramExecutionAsString(UnprovableResult.java:132) at de.uni_freiburg.informatik.ultimate.core.lib.results.UnprovableResult.getLongDescription(UnprovableResult.java:125) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-21 03:10:33,594 INFO L158 Benchmark]: Toolchain (without parser) took 45871.68ms. Allocated memory was 104.9MB in the beginning and 234.9MB in the end (delta: 130.0MB). Free memory was 71.7MB in the beginning and 204.5MB in the end (delta: -132.8MB). Peak memory consumption was 133.1MB. Max. memory is 16.1GB. [2022-02-21 03:10:33,595 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 81.8MB. Free memory was 52.0MB in the beginning and 52.0MB in the end (delta: 18.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:10:33,595 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.43ms. Allocated memory is still 104.9MB. Free memory was 71.3MB in the beginning and 74.1MB in the end (delta: -2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:10:33,595 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.50ms. Allocated memory is still 104.9MB. Free memory was 74.1MB in the beginning and 71.1MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-21 03:10:33,595 INFO L158 Benchmark]: Boogie Preprocessor took 56.81ms. Allocated memory is still 104.9MB. Free memory was 71.1MB in the beginning and 69.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:10:33,595 INFO L158 Benchmark]: RCFGBuilder took 676.22ms. Allocated memory is still 104.9MB. Free memory was 69.6MB in the beginning and 80.0MB in the end (delta: -10.4MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. [2022-02-21 03:10:33,597 INFO L158 Benchmark]: TraceAbstraction took 44777.06ms. Allocated memory was 104.9MB in the beginning and 234.9MB in the end (delta: 130.0MB). Free memory was 80.0MB in the beginning and 204.5MB in the end (delta: -124.4MB). Peak memory consumption was 141.9MB. Max. memory is 16.1GB. [2022-02-21 03:10:33,600 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 81.8MB. Free memory was 52.0MB in the beginning and 52.0MB in the end (delta: 18.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.43ms. Allocated memory is still 104.9MB. Free memory was 71.3MB in the beginning and 74.1MB in the end (delta: -2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.50ms. Allocated memory is still 104.9MB. Free memory was 74.1MB in the beginning and 71.1MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.81ms. Allocated memory is still 104.9MB. Free memory was 71.1MB in the beginning and 69.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 676.22ms. Allocated memory is still 104.9MB. Free memory was 69.6MB in the beginning and 80.0MB in the end (delta: -10.4MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. * TraceAbstraction took 44777.06ms. Allocated memory was 104.9MB in the beginning and 234.9MB in the end (delta: 130.0MB). Free memory was 80.0MB in the beginning and 204.5MB in the end (delta: -124.4MB). Peak memory consumption was 141.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-21 03:10:33,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator