./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_4-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_4-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 c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:10:07,482 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:10:07,484 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:10:07,518 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:10:07,518 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:10:07,519 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:10:07,520 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:10:07,521 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:10:07,522 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:10:07,523 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:10:07,523 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:10:07,524 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:10:07,524 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:10:07,525 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:10:07,526 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:10:07,526 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:10:07,527 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:10:07,528 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:10:07,529 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:10:07,530 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:10:07,530 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:10:07,531 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:10:07,532 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:10:07,533 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:10:07,534 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:10:07,534 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:10:07,535 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:10:07,535 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:10:07,536 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:10:07,536 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:10:07,536 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:10:07,537 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:10:07,537 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:10:07,538 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:10:07,543 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:10:07,544 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:10:07,544 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:10:07,544 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:10:07,544 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:10:07,545 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:10:07,545 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:10:07,546 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-02-21 03:10:07,571 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:10:07,572 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:10:07,572 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:10:07,573 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:10:07,573 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:10:07,573 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:10:07,574 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:10:07,574 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:10:07,574 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:10:07,574 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:10:07,575 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:10:07,575 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:10:07,575 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:10:07,575 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:10:07,576 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:10:07,576 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:10:07,576 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:10:07,576 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:10:07,576 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:10:07,576 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:10:07,576 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:10:07,577 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:10:07,577 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:10:07,577 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:10:07,577 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:10:07,577 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:10:07,577 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:10:07,577 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:10:07,578 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:10:07,578 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:10:07,578 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:10:07,578 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:10:07,578 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:10:07,578 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 -> c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a [2022-02-21 03:10:07,791 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:10:07,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:10:07,820 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:10:07,821 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:10:07,821 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:10:07,822 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2022-02-21 03:10:07,878 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f19ef4f2a/35ec07c7f3e547f58144e35ed10d2332/FLAG34d5a19a2 [2022-02-21 03:10:08,243 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:10:08,244 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2022-02-21 03:10:08,249 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f19ef4f2a/35ec07c7f3e547f58144e35ed10d2332/FLAG34d5a19a2 [2022-02-21 03:10:08,635 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f19ef4f2a/35ec07c7f3e547f58144e35ed10d2332 [2022-02-21 03:10:08,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:10:08,640 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:10:08,642 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:10:08,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:10:08,645 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:10:08,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:10:08" (1/1) ... [2022-02-21 03:10:08,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45411103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:08, skipping insertion in model container [2022-02-21 03:10:08,648 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:10:08" (1/1) ... [2022-02-21 03:10:08,652 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:10:08,676 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:10:08,799 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c[730,743] [2022-02-21 03:10:08,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:10:08,849 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:10:08,856 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c[730,743] [2022-02-21 03:10:08,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:10:08,909 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:10:08,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:08 WrapperNode [2022-02-21 03:10:08,910 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:10:08,910 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:10:08,910 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:10:08,910 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:10:08,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:08" (1/1) ... [2022-02-21 03:10:08,943 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:08" (1/1) ... [2022-02-21 03:10:08,959 INFO L137 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2022-02-21 03:10:08,960 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:10:08,961 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:10:08,961 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:10:08,961 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:10:08,967 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:08" (1/1) ... [2022-02-21 03:10:08,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:08" (1/1) ... [2022-02-21 03:10:08,973 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:08" (1/1) ... [2022-02-21 03:10:08,973 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:08" (1/1) ... [2022-02-21 03:10:08,988 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:08" (1/1) ... [2022-02-21 03:10:09,008 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:08" (1/1) ... [2022-02-21 03:10:09,009 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:08" (1/1) ... [2022-02-21 03:10:09,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:10:09,012 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:10:09,012 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:10:09,012 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:10:09,017 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:08" (1/1) ... [2022-02-21 03:10:09,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:10:09,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:09,042 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-21 03:10:09,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-21 03:10:09,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:10:09,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:10:09,072 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-02-21 03:10:09,072 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-02-21 03:10:09,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:10:09,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:10:09,072 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2022-02-21 03:10:09,073 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2022-02-21 03:10:09,073 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-21 03:10:09,073 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-21 03:10:09,143 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:10:09,145 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:10:09,576 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:10:09,582 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:10:09,583 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:10:09,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:10:09 BoogieIcfgContainer [2022-02-21 03:10:09,585 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:10:09,587 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:10:09,587 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:10:09,590 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:10:09,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:10:08" (1/3) ... [2022-02-21 03:10:09,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f39ab0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:10:09, skipping insertion in model container [2022-02-21 03:10:09,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:08" (2/3) ... [2022-02-21 03:10:09,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f39ab0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:10:09, skipping insertion in model container [2022-02-21 03:10:09,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:10:09" (3/3) ... [2022-02-21 03:10:09,592 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2022-02-21 03:10:09,596 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:10:09,596 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2022-02-21 03:10:09,633 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:10:09,638 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-21 03:10:09,638 INFO L340 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2022-02-21 03:10:09,659 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 91 states have (on average 1.7692307692307692) internal successors, (161), 111 states have internal predecessors, (161), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-21 03:10:09,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-21 03:10:09,666 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:09,667 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:09,667 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:09,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:09,671 INFO L85 PathProgramCache]: Analyzing trace with hash -618414996, now seen corresponding path program 1 times [2022-02-21 03:10:09,677 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:09,677 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735319671] [2022-02-21 03:10:09,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:09,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:09,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:09,809 INFO L290 TraceCheckUtils]: 0: Hoare triple {127#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(24, 2);call #Ultimate.allocInit(12, 3); {127#true} is VALID [2022-02-21 03:10:09,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {127#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {127#true} is VALID [2022-02-21 03:10:09,810 INFO L272 TraceCheckUtils]: 2: Hoare triple {127#true} call main_#t~ret22#1 := base2flt(0, 0); {127#true} is VALID [2022-02-21 03:10:09,810 INFO L290 TraceCheckUtils]: 3: Hoare triple {127#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {127#true} is VALID [2022-02-21 03:10:09,810 INFO L290 TraceCheckUtils]: 4: Hoare triple {127#true} assume !(0 == ~m % 4294967296); {127#true} is VALID [2022-02-21 03:10:09,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {127#true} assume !(~m % 4294967296 < 16777216); {127#true} is VALID [2022-02-21 03:10:09,812 INFO L290 TraceCheckUtils]: 6: Hoare triple {127#true} assume !true; {128#false} is VALID [2022-02-21 03:10:09,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {128#false} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {128#false} is VALID [2022-02-21 03:10:09,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {128#false} assume !(128 + ~e <= 2147483647); {128#false} is VALID [2022-02-21 03:10:09,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:09,814 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:09,815 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735319671] [2022-02-21 03:10:09,816 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735319671] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:09,816 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:10:09,816 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:10:09,819 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402537998] [2022-02-21 03:10:09,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:09,825 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-21 03:10:09,828 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:09,831 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:10:09,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:09,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-21 03:10:09,846 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:09,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 03:10:09,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 03:10:09,873 INFO L87 Difference]: Start difference. First operand has 124 states, 91 states have (on average 1.7692307692307692) internal successors, (161), 111 states have internal predecessors, (161), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 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:10:10,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:10,035 INFO L93 Difference]: Finished difference Result 243 states and 363 transitions. [2022-02-21 03:10:10,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 03:10:10,036 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-21 03:10:10,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:10,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:10:10,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 363 transitions. [2022-02-21 03:10:10,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:10:10,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 363 transitions. [2022-02-21 03:10:10,079 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 363 transitions. [2022-02-21 03:10:10,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 363 edges. 363 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:10,365 INFO L225 Difference]: With dead ends: 243 [2022-02-21 03:10:10,365 INFO L226 Difference]: Without dead ends: 112 [2022-02-21 03:10:10,369 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 03:10:10,371 INFO L933 BasicCegarLoop]: 159 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, 159 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:10,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:10:10,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-02-21 03:10:10,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-02-21 03:10:10,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:10,398 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand has 112 states, 83 states have (on average 1.5783132530120483) internal successors, (131), 101 states have internal predecessors, (131), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 03:10:10,399 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand has 112 states, 83 states have (on average 1.5783132530120483) internal successors, (131), 101 states have internal predecessors, (131), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 03:10:10,400 INFO L87 Difference]: Start difference. First operand 112 states. Second operand has 112 states, 83 states have (on average 1.5783132530120483) internal successors, (131), 101 states have internal predecessors, (131), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 03:10:10,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:10,406 INFO L93 Difference]: Finished difference Result 112 states and 146 transitions. [2022-02-21 03:10:10,406 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 146 transitions. [2022-02-21 03:10:10,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:10,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:10,408 INFO L74 IsIncluded]: Start isIncluded. First operand has 112 states, 83 states have (on average 1.5783132530120483) internal successors, (131), 101 states have internal predecessors, (131), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 112 states. [2022-02-21 03:10:10,409 INFO L87 Difference]: Start difference. First operand has 112 states, 83 states have (on average 1.5783132530120483) internal successors, (131), 101 states have internal predecessors, (131), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 112 states. [2022-02-21 03:10:10,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:10,414 INFO L93 Difference]: Finished difference Result 112 states and 146 transitions. [2022-02-21 03:10:10,414 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 146 transitions. [2022-02-21 03:10:10,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:10,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:10,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:10,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:10,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 83 states have (on average 1.5783132530120483) internal successors, (131), 101 states have internal predecessors, (131), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 03:10:10,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 146 transitions. [2022-02-21 03:10:10,421 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 146 transitions. Word has length 9 [2022-02-21 03:10:10,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:10,422 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 146 transitions. [2022-02-21 03:10:10,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:10:10,422 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 146 transitions. [2022-02-21 03:10:10,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-21 03:10:10,423 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:10,423 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:10,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:10:10,423 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:10,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:10,424 INFO L85 PathProgramCache]: Analyzing trace with hash -619356344, now seen corresponding path program 1 times [2022-02-21 03:10:10,424 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:10,424 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597361335] [2022-02-21 03:10:10,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:10,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:10,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:10,474 INFO L290 TraceCheckUtils]: 0: Hoare triple {761#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); {761#true} is VALID [2022-02-21 03:10:10,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {761#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {761#true} is VALID [2022-02-21 03:10:10,475 INFO L272 TraceCheckUtils]: 2: Hoare triple {761#true} call main_#t~ret22#1 := base2flt(0, 0); {763#(= |base2flt_#in~e| 0)} is VALID [2022-02-21 03:10:10,475 INFO L290 TraceCheckUtils]: 3: Hoare triple {763#(= |base2flt_#in~e| 0)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {764#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:10,476 INFO L290 TraceCheckUtils]: 4: Hoare triple {764#(= base2flt_~e 0)} assume !(0 == ~m % 4294967296); {764#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:10,476 INFO L290 TraceCheckUtils]: 5: Hoare triple {764#(= base2flt_~e 0)} assume ~m % 4294967296 < 16777216; {764#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:10,476 INFO L290 TraceCheckUtils]: 6: Hoare triple {764#(= base2flt_~e 0)} assume !false; {764#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:10,477 INFO L290 TraceCheckUtils]: 7: Hoare triple {764#(= base2flt_~e 0)} assume !(~e <= -128); {764#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:10,477 INFO L290 TraceCheckUtils]: 8: Hoare triple {764#(= base2flt_~e 0)} assume !(~e - 1 <= 2147483647); {762#false} is VALID [2022-02-21 03:10:10,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:10,478 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:10,478 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597361335] [2022-02-21 03:10:10,478 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597361335] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:10,478 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:10:10,478 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:10:10,479 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434955356] [2022-02-21 03:10:10,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:10,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-21 03:10:10,480 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:10,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:10:10,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:10,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:10:10,487 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:10,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:10:10,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:10:10,488 INFO L87 Difference]: Start difference. First operand 112 states and 146 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:10:10,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:10,766 INFO L93 Difference]: Finished difference Result 283 states and 383 transitions. [2022-02-21 03:10:10,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:10:10,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-21 03:10:10,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:10,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:10:10,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 383 transitions. [2022-02-21 03:10:10,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:10:10,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 383 transitions. [2022-02-21 03:10:10,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 383 transitions. [2022-02-21 03:10:11,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 383 edges. 383 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:11,058 INFO L225 Difference]: With dead ends: 283 [2022-02-21 03:10:11,058 INFO L226 Difference]: Without dead ends: 174 [2022-02-21 03:10:11,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:10:11,060 INFO L933 BasicCegarLoop]: 129 mSDtfsCounter, 106 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 388 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:10:11,060 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 388 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:10:11,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-02-21 03:10:11,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 161. [2022-02-21 03:10:11,069 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:11,069 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand has 161 states, 131 states have (on average 1.5725190839694656) internal successors, (206), 149 states have internal predecessors, (206), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 03:10:11,070 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand has 161 states, 131 states have (on average 1.5725190839694656) internal successors, (206), 149 states have internal predecessors, (206), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 03:10:11,070 INFO L87 Difference]: Start difference. First operand 174 states. Second operand has 161 states, 131 states have (on average 1.5725190839694656) internal successors, (206), 149 states have internal predecessors, (206), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 03:10:11,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:11,076 INFO L93 Difference]: Finished difference Result 174 states and 227 transitions. [2022-02-21 03:10:11,076 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 227 transitions. [2022-02-21 03:10:11,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:11,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:11,078 INFO L74 IsIncluded]: Start isIncluded. First operand has 161 states, 131 states have (on average 1.5725190839694656) internal successors, (206), 149 states have internal predecessors, (206), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 174 states. [2022-02-21 03:10:11,078 INFO L87 Difference]: Start difference. First operand has 161 states, 131 states have (on average 1.5725190839694656) internal successors, (206), 149 states have internal predecessors, (206), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 174 states. [2022-02-21 03:10:11,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:11,084 INFO L93 Difference]: Finished difference Result 174 states and 227 transitions. [2022-02-21 03:10:11,084 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 227 transitions. [2022-02-21 03:10:11,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:11,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:11,085 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:11,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:11,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 131 states have (on average 1.5725190839694656) internal successors, (206), 149 states have internal predecessors, (206), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 03:10:11,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 221 transitions. [2022-02-21 03:10:11,091 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 221 transitions. Word has length 9 [2022-02-21 03:10:11,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:11,091 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 221 transitions. [2022-02-21 03:10:11,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:10:11,091 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 221 transitions. [2022-02-21 03:10:11,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-21 03:10:11,092 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:11,092 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:11,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 03:10:11,092 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:11,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:11,093 INFO L85 PathProgramCache]: Analyzing trace with hash -2023794271, now seen corresponding path program 1 times [2022-02-21 03:10:11,093 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:11,093 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645926] [2022-02-21 03:10:11,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:11,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:11,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:11,131 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:10:11,131 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_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {1625#true} is VALID [2022-02-21 03:10:11,132 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:10:11,132 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:10:11,133 INFO L290 TraceCheckUtils]: 4: Hoare triple {1628#(= base2flt_~e 0)} assume !(0 == ~m % 4294967296); {1628#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:11,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {1628#(= base2flt_~e 0)} assume ~m % 4294967296 < 16777216; {1628#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:11,133 INFO L290 TraceCheckUtils]: 6: Hoare triple {1628#(= base2flt_~e 0)} assume !false; {1628#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:11,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {1628#(= base2flt_~e 0)} assume !(~e <= -128); {1628#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:11,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {1628#(= base2flt_~e 0)} assume ~e - 1 <= 2147483647; {1628#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:11,134 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:10:11,135 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:10:11,135 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:10:11,136 INFO L290 TraceCheckUtils]: 12: Hoare triple {1629#(<= (+ base2flt_~e 1) 0)} assume !(128 + ~e <= 2147483647); {1626#false} is VALID [2022-02-21 03:10:11,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:11,136 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:11,136 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645926] [2022-02-21 03:10:11,136 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645926] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:11,136 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:10:11,137 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:10:11,137 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645852293] [2022-02-21 03:10:11,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:11,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-21 03:10:11,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:11,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:10:11,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:11,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:10:11,146 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:11,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:10:11,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:10:11,147 INFO L87 Difference]: Start difference. First operand 161 states and 221 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:10:11,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:11,525 INFO L93 Difference]: Finished difference Result 196 states and 260 transitions. [2022-02-21 03:10:11,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:10:11,525 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-21 03:10:11,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:11,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:10:11,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 260 transitions. [2022-02-21 03:10:11,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:10:11,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 260 transitions. [2022-02-21 03:10:11,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 260 transitions. [2022-02-21 03:10:11,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 260 edges. 260 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:11,697 INFO L225 Difference]: With dead ends: 196 [2022-02-21 03:10:11,697 INFO L226 Difference]: Without dead ends: 193 [2022-02-21 03:10:11,698 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:10:11,698 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 161 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:11,699 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 519 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:10:11,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-02-21 03:10:11,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 168. [2022-02-21 03:10:11,707 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:11,708 INFO L82 GeneralOperation]: Start isEquivalent. First operand 193 states. Second operand has 168 states, 138 states have (on average 1.5724637681159421) internal successors, (217), 156 states have internal predecessors, (217), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 03:10:11,708 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states. Second operand has 168 states, 138 states have (on average 1.5724637681159421) internal successors, (217), 156 states have internal predecessors, (217), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 03:10:11,709 INFO L87 Difference]: Start difference. First operand 193 states. Second operand has 168 states, 138 states have (on average 1.5724637681159421) internal successors, (217), 156 states have internal predecessors, (217), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 03:10:11,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:11,713 INFO L93 Difference]: Finished difference Result 193 states and 257 transitions. [2022-02-21 03:10:11,713 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 257 transitions. [2022-02-21 03:10:11,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:11,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:11,714 INFO L74 IsIncluded]: Start isIncluded. First operand has 168 states, 138 states have (on average 1.5724637681159421) internal successors, (217), 156 states have internal predecessors, (217), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 193 states. [2022-02-21 03:10:11,715 INFO L87 Difference]: Start difference. First operand has 168 states, 138 states have (on average 1.5724637681159421) internal successors, (217), 156 states have internal predecessors, (217), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 193 states. [2022-02-21 03:10:11,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:11,719 INFO L93 Difference]: Finished difference Result 193 states and 257 transitions. [2022-02-21 03:10:11,719 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 257 transitions. [2022-02-21 03:10:11,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:11,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:11,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:11,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:11,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 138 states have (on average 1.5724637681159421) internal successors, (217), 156 states have internal predecessors, (217), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 03:10:11,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 232 transitions. [2022-02-21 03:10:11,724 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 232 transitions. Word has length 13 [2022-02-21 03:10:11,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:11,724 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 232 transitions. [2022-02-21 03:10:11,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:10:11,725 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 232 transitions. [2022-02-21 03:10:11,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-21 03:10:11,725 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:11,725 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:11,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 03:10:11,725 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:11,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:11,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1686887160, now seen corresponding path program 1 times [2022-02-21 03:10:11,726 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:11,726 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122971927] [2022-02-21 03:10:11,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:11,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:11,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:11,760 INFO L290 TraceCheckUtils]: 0: Hoare triple {2439#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); {2439#true} is VALID [2022-02-21 03:10:11,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {2439#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {2439#true} is VALID [2022-02-21 03:10:11,761 INFO L272 TraceCheckUtils]: 2: Hoare triple {2439#true} call main_#t~ret22#1 := base2flt(0, 0); {2441#(= |base2flt_#in~e| 0)} is VALID [2022-02-21 03:10:11,761 INFO L290 TraceCheckUtils]: 3: Hoare triple {2441#(= |base2flt_#in~e| 0)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {2442#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:11,762 INFO L290 TraceCheckUtils]: 4: Hoare triple {2442#(= base2flt_~e 0)} assume !(0 == ~m % 4294967296); {2442#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:11,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {2442#(= base2flt_~e 0)} assume ~m % 4294967296 < 16777216; {2442#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:11,762 INFO L290 TraceCheckUtils]: 6: Hoare triple {2442#(= base2flt_~e 0)} assume !false; {2442#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:11,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {2442#(= base2flt_~e 0)} assume !(~e <= -128); {2442#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:11,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {2442#(= base2flt_~e 0)} assume ~e - 1 <= 2147483647; {2442#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:11,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {2442#(= base2flt_~e 0)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {2443#(<= 0 (+ base2flt_~e 1))} is VALID [2022-02-21 03:10:11,764 INFO L290 TraceCheckUtils]: 10: Hoare triple {2443#(<= 0 (+ base2flt_~e 1))} assume !(~m % 4294967296 < 16777216); {2443#(<= 0 (+ base2flt_~e 1))} is VALID [2022-02-21 03:10:11,764 INFO L290 TraceCheckUtils]: 11: Hoare triple {2443#(<= 0 (+ base2flt_~e 1))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {2443#(<= 0 (+ base2flt_~e 1))} is VALID [2022-02-21 03:10:11,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {2443#(<= 0 (+ base2flt_~e 1))} assume 128 + ~e <= 2147483647; {2443#(<= 0 (+ base2flt_~e 1))} is VALID [2022-02-21 03:10:11,765 INFO L290 TraceCheckUtils]: 13: Hoare triple {2443#(<= 0 (+ base2flt_~e 1))} assume !(128 + ~e >= -2147483648); {2440#false} is VALID [2022-02-21 03:10:11,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:11,765 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:11,765 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122971927] [2022-02-21 03:10:11,765 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122971927] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:11,765 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:10:11,766 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:10:11,766 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239768985] [2022-02-21 03:10:11,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:11,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-21 03:10:11,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:11,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:10:11,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:11,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:10:11,775 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:11,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:10:11,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:10:11,776 INFO L87 Difference]: Start difference. First operand 168 states and 232 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:10:12,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:12,150 INFO L93 Difference]: Finished difference Result 316 states and 422 transitions. [2022-02-21 03:10:12,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:10:12,150 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-21 03:10:12,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:12,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:10:12,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 407 transitions. [2022-02-21 03:10:12,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:10:12,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 407 transitions. [2022-02-21 03:10:12,157 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 407 transitions. [2022-02-21 03:10:12,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 407 edges. 407 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:12,406 INFO L225 Difference]: With dead ends: 316 [2022-02-21 03:10:12,406 INFO L226 Difference]: Without dead ends: 203 [2022-02-21 03:10:12,406 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:10:12,407 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 165 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:12,407 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 529 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:10:12,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-02-21 03:10:12,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 172. [2022-02-21 03:10:12,418 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:12,419 INFO L82 GeneralOperation]: Start isEquivalent. First operand 203 states. Second operand has 172 states, 142 states have (on average 1.5492957746478873) internal successors, (220), 160 states have internal predecessors, (220), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 03:10:12,419 INFO L74 IsIncluded]: Start isIncluded. First operand 203 states. Second operand has 172 states, 142 states have (on average 1.5492957746478873) internal successors, (220), 160 states have internal predecessors, (220), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 03:10:12,419 INFO L87 Difference]: Start difference. First operand 203 states. Second operand has 172 states, 142 states have (on average 1.5492957746478873) internal successors, (220), 160 states have internal predecessors, (220), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 03:10:12,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:12,442 INFO L93 Difference]: Finished difference Result 203 states and 267 transitions. [2022-02-21 03:10:12,442 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 267 transitions. [2022-02-21 03:10:12,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:12,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:12,443 INFO L74 IsIncluded]: Start isIncluded. First operand has 172 states, 142 states have (on average 1.5492957746478873) internal successors, (220), 160 states have internal predecessors, (220), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 203 states. [2022-02-21 03:10:12,443 INFO L87 Difference]: Start difference. First operand has 172 states, 142 states have (on average 1.5492957746478873) internal successors, (220), 160 states have internal predecessors, (220), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 203 states. [2022-02-21 03:10:12,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:12,448 INFO L93 Difference]: Finished difference Result 203 states and 267 transitions. [2022-02-21 03:10:12,448 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 267 transitions. [2022-02-21 03:10:12,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:12,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:12,448 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:12,449 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:12,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 142 states have (on average 1.5492957746478873) internal successors, (220), 160 states have internal predecessors, (220), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 03:10:12,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 235 transitions. [2022-02-21 03:10:12,452 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 235 transitions. Word has length 14 [2022-02-21 03:10:12,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:12,453 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 235 transitions. [2022-02-21 03:10:12,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:10:12,453 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 235 transitions. [2022-02-21 03:10:12,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-21 03:10:12,453 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:12,453 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:12,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 03:10:12,454 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:12,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:12,454 INFO L85 PathProgramCache]: Analyzing trace with hash 564430704, now seen corresponding path program 1 times [2022-02-21 03:10:12,455 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:12,455 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45018474] [2022-02-21 03:10:12,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:12,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:12,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:12,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:12,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:12,496 INFO L290 TraceCheckUtils]: 0: Hoare triple {3426#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {3416#true} is VALID [2022-02-21 03:10:12,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {3416#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {3416#true} is VALID [2022-02-21 03:10:12,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {3416#true} #res := ~__retres4~0; {3416#true} is VALID [2022-02-21 03:10:12,497 INFO L290 TraceCheckUtils]: 3: Hoare triple {3416#true} assume true; {3416#true} is VALID [2022-02-21 03:10:12,498 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3416#true} {3418#(<= |ULTIMATE.start_main_~ea~2#1| 127)} #349#return; {3418#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:10:12,498 INFO L290 TraceCheckUtils]: 0: Hoare triple {3416#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); {3416#true} is VALID [2022-02-21 03:10:12,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {3416#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {3418#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:10:12,499 INFO L272 TraceCheckUtils]: 2: Hoare triple {3418#(<= |ULTIMATE.start_main_~ea~2#1| 127)} call main_#t~ret22#1 := base2flt(0, 0); {3426#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:12,499 INFO L290 TraceCheckUtils]: 3: Hoare triple {3426#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {3416#true} is VALID [2022-02-21 03:10:12,499 INFO L290 TraceCheckUtils]: 4: Hoare triple {3416#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {3416#true} is VALID [2022-02-21 03:10:12,499 INFO L290 TraceCheckUtils]: 5: Hoare triple {3416#true} #res := ~__retres4~0; {3416#true} is VALID [2022-02-21 03:10:12,499 INFO L290 TraceCheckUtils]: 6: Hoare triple {3416#true} assume true; {3416#true} is VALID [2022-02-21 03:10:12,500 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3416#true} {3418#(<= |ULTIMATE.start_main_~ea~2#1| 127)} #349#return; {3418#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:10:12,500 INFO L290 TraceCheckUtils]: 8: Hoare triple {3418#(<= |ULTIMATE.start_main_~ea~2#1| 127)} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {3418#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:10:12,501 INFO L272 TraceCheckUtils]: 9: Hoare triple {3418#(<= |ULTIMATE.start_main_~ea~2#1| 127)} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {3424#(<= |base2flt_#in~e| 127)} is VALID [2022-02-21 03:10:12,501 INFO L290 TraceCheckUtils]: 10: Hoare triple {3424#(<= |base2flt_#in~e| 127)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {3425#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:12,502 INFO L290 TraceCheckUtils]: 11: Hoare triple {3425#(<= base2flt_~e 127)} assume !(0 == ~m % 4294967296); {3425#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:12,502 INFO L290 TraceCheckUtils]: 12: Hoare triple {3425#(<= base2flt_~e 127)} assume ~m % 4294967296 < 16777216; {3425#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:12,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {3425#(<= base2flt_~e 127)} assume !false; {3425#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:12,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {3425#(<= base2flt_~e 127)} assume !(~e <= -128); {3425#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:12,503 INFO L290 TraceCheckUtils]: 15: Hoare triple {3425#(<= base2flt_~e 127)} assume !(~e - 1 <= 2147483647); {3417#false} is VALID [2022-02-21 03:10:12,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:12,503 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:12,504 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45018474] [2022-02-21 03:10:12,504 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45018474] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:12,504 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700796980] [2022-02-21 03:10:12,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:12,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:12,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:12,506 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:10:12,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-21 03:10:12,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:12,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:10:12,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:12,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:12,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {3416#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); {3416#true} is VALID [2022-02-21 03:10:12,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {3416#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {3418#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:10:12,689 INFO L272 TraceCheckUtils]: 2: Hoare triple {3418#(<= |ULTIMATE.start_main_~ea~2#1| 127)} call main_#t~ret22#1 := base2flt(0, 0); {3416#true} is VALID [2022-02-21 03:10:12,689 INFO L290 TraceCheckUtils]: 3: Hoare triple {3416#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {3416#true} is VALID [2022-02-21 03:10:12,689 INFO L290 TraceCheckUtils]: 4: Hoare triple {3416#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {3416#true} is VALID [2022-02-21 03:10:12,689 INFO L290 TraceCheckUtils]: 5: Hoare triple {3416#true} #res := ~__retres4~0; {3416#true} is VALID [2022-02-21 03:10:12,689 INFO L290 TraceCheckUtils]: 6: Hoare triple {3416#true} assume true; {3416#true} is VALID [2022-02-21 03:10:12,690 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3416#true} {3418#(<= |ULTIMATE.start_main_~ea~2#1| 127)} #349#return; {3418#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:10:12,690 INFO L290 TraceCheckUtils]: 8: Hoare triple {3418#(<= |ULTIMATE.start_main_~ea~2#1| 127)} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {3418#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:10:12,691 INFO L272 TraceCheckUtils]: 9: Hoare triple {3418#(<= |ULTIMATE.start_main_~ea~2#1| 127)} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {3424#(<= |base2flt_#in~e| 127)} is VALID [2022-02-21 03:10:12,691 INFO L290 TraceCheckUtils]: 10: Hoare triple {3424#(<= |base2flt_#in~e| 127)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {3425#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:12,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {3425#(<= base2flt_~e 127)} assume !(0 == ~m % 4294967296); {3425#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:12,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {3425#(<= base2flt_~e 127)} assume ~m % 4294967296 < 16777216; {3425#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:12,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {3425#(<= base2flt_~e 127)} assume !false; {3425#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:12,692 INFO L290 TraceCheckUtils]: 14: Hoare triple {3425#(<= base2flt_~e 127)} assume !(~e <= -128); {3425#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:12,693 INFO L290 TraceCheckUtils]: 15: Hoare triple {3425#(<= base2flt_~e 127)} assume !(~e - 1 <= 2147483647); {3417#false} is VALID [2022-02-21 03:10:12,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:12,693 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:10:12,693 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700796980] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:12,693 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:10:12,694 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-02-21 03:10:12,694 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54630690] [2022-02-21 03:10:12,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:12,694 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-21 03:10:12,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:12,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:10:12,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:12,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:10:12,704 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:12,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:10:12,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:10:12,704 INFO L87 Difference]: Start difference. First operand 172 states and 235 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:10:13,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:13,086 INFO L93 Difference]: Finished difference Result 242 states and 332 transitions. [2022-02-21 03:10:13,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:10:13,086 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-21 03:10:13,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:13,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:10:13,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 234 transitions. [2022-02-21 03:10:13,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:10:13,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 234 transitions. [2022-02-21 03:10:13,091 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 234 transitions. [2022-02-21 03:10:13,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:13,240 INFO L225 Difference]: With dead ends: 242 [2022-02-21 03:10:13,240 INFO L226 Difference]: Without dead ends: 238 [2022-02-21 03:10:13,240 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:10:13,241 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 122 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:13,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 487 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:10:13,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-02-21 03:10:13,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 208. [2022-02-21 03:10:13,267 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:13,267 INFO L82 GeneralOperation]: Start isEquivalent. First operand 238 states. Second operand has 208 states, 178 states have (on average 1.5730337078651686) internal successors, (280), 195 states have internal predecessors, (280), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 03:10:13,268 INFO L74 IsIncluded]: Start isIncluded. First operand 238 states. Second operand has 208 states, 178 states have (on average 1.5730337078651686) internal successors, (280), 195 states have internal predecessors, (280), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 03:10:13,268 INFO L87 Difference]: Start difference. First operand 238 states. Second operand has 208 states, 178 states have (on average 1.5730337078651686) internal successors, (280), 195 states have internal predecessors, (280), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 03:10:13,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:13,274 INFO L93 Difference]: Finished difference Result 238 states and 326 transitions. [2022-02-21 03:10:13,274 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 326 transitions. [2022-02-21 03:10:13,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:13,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:13,275 INFO L74 IsIncluded]: Start isIncluded. First operand has 208 states, 178 states have (on average 1.5730337078651686) internal successors, (280), 195 states have internal predecessors, (280), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 238 states. [2022-02-21 03:10:13,275 INFO L87 Difference]: Start difference. First operand has 208 states, 178 states have (on average 1.5730337078651686) internal successors, (280), 195 states have internal predecessors, (280), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 238 states. [2022-02-21 03:10:13,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:13,279 INFO L93 Difference]: Finished difference Result 238 states and 326 transitions. [2022-02-21 03:10:13,280 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 326 transitions. [2022-02-21 03:10:13,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:13,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:13,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:13,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:13,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 178 states have (on average 1.5730337078651686) internal successors, (280), 195 states have internal predecessors, (280), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 03:10:13,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 295 transitions. [2022-02-21 03:10:13,285 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 295 transitions. Word has length 16 [2022-02-21 03:10:13,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:13,285 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 295 transitions. [2022-02-21 03:10:13,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:10:13,285 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 295 transitions. [2022-02-21 03:10:13,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-21 03:10:13,286 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:13,286 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:13,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:10:13,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:13,502 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:13,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:13,503 INFO L85 PathProgramCache]: Analyzing trace with hash -864836854, now seen corresponding path program 1 times [2022-02-21 03:10:13,503 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:13,503 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891350864] [2022-02-21 03:10:13,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:13,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:13,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:13,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {4472#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); {4472#true} is VALID [2022-02-21 03:10:13,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {4472#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {4472#true} is VALID [2022-02-21 03:10:13,553 INFO L272 TraceCheckUtils]: 2: Hoare triple {4472#true} call main_#t~ret22#1 := base2flt(0, 0); {4474#(= |base2flt_#in~e| 0)} is VALID [2022-02-21 03:10:13,553 INFO L290 TraceCheckUtils]: 3: Hoare triple {4474#(= |base2flt_#in~e| 0)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {4475#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:13,554 INFO L290 TraceCheckUtils]: 4: Hoare triple {4475#(= base2flt_~e 0)} assume !(0 == ~m % 4294967296); {4475#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:13,556 INFO L290 TraceCheckUtils]: 5: Hoare triple {4475#(= base2flt_~e 0)} assume !(~m % 4294967296 < 16777216); {4475#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:13,556 INFO L290 TraceCheckUtils]: 6: Hoare triple {4475#(= base2flt_~e 0)} assume !false; {4475#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:13,556 INFO L290 TraceCheckUtils]: 7: Hoare triple {4475#(= base2flt_~e 0)} assume ~m % 4294967296 >= 33554432; {4475#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:13,557 INFO L290 TraceCheckUtils]: 8: Hoare triple {4475#(= base2flt_~e 0)} assume !(~e >= 127); {4475#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:13,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {4475#(= base2flt_~e 0)} assume 1 + ~e <= 2147483647; {4475#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:13,558 INFO L290 TraceCheckUtils]: 10: Hoare triple {4475#(= base2flt_~e 0)} assume 1 + ~e >= -2147483648;~e := 1 + ~e;~m := ~m / 2; {4476#(<= base2flt_~e 1)} is VALID [2022-02-21 03:10:13,558 INFO L290 TraceCheckUtils]: 11: Hoare triple {4476#(<= base2flt_~e 1)} assume !false; {4476#(<= base2flt_~e 1)} is VALID [2022-02-21 03:10:13,558 INFO L290 TraceCheckUtils]: 12: Hoare triple {4476#(<= base2flt_~e 1)} assume !(~m % 4294967296 >= 33554432); {4476#(<= base2flt_~e 1)} is VALID [2022-02-21 03:10:13,559 INFO L290 TraceCheckUtils]: 13: Hoare triple {4476#(<= base2flt_~e 1)} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {4476#(<= base2flt_~e 1)} is VALID [2022-02-21 03:10:13,559 INFO L290 TraceCheckUtils]: 14: Hoare triple {4476#(<= base2flt_~e 1)} assume !(128 + ~e <= 2147483647); {4473#false} is VALID [2022-02-21 03:10:13,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:13,559 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:13,559 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891350864] [2022-02-21 03:10:13,560 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891350864] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:13,560 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118083328] [2022-02-21 03:10:13,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:13,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:13,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:13,561 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:10:13,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-21 03:10:13,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:13,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:10:13,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:13,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:13,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {4472#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); {4472#true} is VALID [2022-02-21 03:10:13,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {4472#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {4472#true} is VALID [2022-02-21 03:10:13,687 INFO L272 TraceCheckUtils]: 2: Hoare triple {4472#true} call main_#t~ret22#1 := base2flt(0, 0); {4472#true} is VALID [2022-02-21 03:10:13,687 INFO L290 TraceCheckUtils]: 3: Hoare triple {4472#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {4472#true} is VALID [2022-02-21 03:10:13,688 INFO L290 TraceCheckUtils]: 4: Hoare triple {4472#true} assume !(0 == ~m % 4294967296); {4472#true} is VALID [2022-02-21 03:10:13,688 INFO L290 TraceCheckUtils]: 5: Hoare triple {4472#true} assume !(~m % 4294967296 < 16777216); {4472#true} is VALID [2022-02-21 03:10:13,688 INFO L290 TraceCheckUtils]: 6: Hoare triple {4472#true} assume !false; {4472#true} is VALID [2022-02-21 03:10:13,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {4472#true} assume ~m % 4294967296 >= 33554432; {4472#true} is VALID [2022-02-21 03:10:13,689 INFO L290 TraceCheckUtils]: 8: Hoare triple {4472#true} assume !(~e >= 127); {4504#(not (<= 127 base2flt_~e))} is VALID [2022-02-21 03:10:13,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {4504#(not (<= 127 base2flt_~e))} assume 1 + ~e <= 2147483647; {4504#(not (<= 127 base2flt_~e))} is VALID [2022-02-21 03:10:13,689 INFO L290 TraceCheckUtils]: 10: Hoare triple {4504#(not (<= 127 base2flt_~e))} assume 1 + ~e >= -2147483648;~e := 1 + ~e;~m := ~m / 2; {4511#(< base2flt_~e 128)} is VALID [2022-02-21 03:10:13,690 INFO L290 TraceCheckUtils]: 11: Hoare triple {4511#(< base2flt_~e 128)} assume !false; {4511#(< base2flt_~e 128)} is VALID [2022-02-21 03:10:13,690 INFO L290 TraceCheckUtils]: 12: Hoare triple {4511#(< base2flt_~e 128)} assume !(~m % 4294967296 >= 33554432); {4511#(< base2flt_~e 128)} is VALID [2022-02-21 03:10:13,690 INFO L290 TraceCheckUtils]: 13: Hoare triple {4511#(< base2flt_~e 128)} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {4511#(< base2flt_~e 128)} is VALID [2022-02-21 03:10:13,691 INFO L290 TraceCheckUtils]: 14: Hoare triple {4511#(< base2flt_~e 128)} assume !(128 + ~e <= 2147483647); {4473#false} is VALID [2022-02-21 03:10:13,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:13,691 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:10:13,691 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118083328] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:13,691 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:10:13,691 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-02-21 03:10:13,692 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505387743] [2022-02-21 03:10:13,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:13,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-21 03:10:13,692 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:13,692 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:10:13,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:13,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:10:13,701 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:13,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:10:13,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:10:13,701 INFO L87 Difference]: Start difference. First operand 208 states and 295 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:10:13,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:13,975 INFO L93 Difference]: Finished difference Result 260 states and 366 transitions. [2022-02-21 03:10:13,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:10:13,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-21 03:10:13,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:13,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:10:13,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2022-02-21 03:10:13,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:10:13,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2022-02-21 03:10:13,979 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 186 transitions. [2022-02-21 03:10:14,091 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:14,094 INFO L225 Difference]: With dead ends: 260 [2022-02-21 03:10:14,095 INFO L226 Difference]: Without dead ends: 258 [2022-02-21 03:10:14,095 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:10:14,095 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 26 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 417 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:10:14,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 417 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:10:14,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-02-21 03:10:14,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 201. [2022-02-21 03:10:14,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:14,123 INFO L82 GeneralOperation]: Start isEquivalent. First operand 258 states. Second operand has 201 states, 171 states have (on average 1.5497076023391814) internal successors, (265), 188 states have internal predecessors, (265), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 03:10:14,123 INFO L74 IsIncluded]: Start isIncluded. First operand 258 states. Second operand has 201 states, 171 states have (on average 1.5497076023391814) internal successors, (265), 188 states have internal predecessors, (265), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 03:10:14,123 INFO L87 Difference]: Start difference. First operand 258 states. Second operand has 201 states, 171 states have (on average 1.5497076023391814) internal successors, (265), 188 states have internal predecessors, (265), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 03:10:14,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:14,127 INFO L93 Difference]: Finished difference Result 258 states and 360 transitions. [2022-02-21 03:10:14,128 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 360 transitions. [2022-02-21 03:10:14,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:14,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:14,128 INFO L74 IsIncluded]: Start isIncluded. First operand has 201 states, 171 states have (on average 1.5497076023391814) internal successors, (265), 188 states have internal predecessors, (265), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 258 states. [2022-02-21 03:10:14,129 INFO L87 Difference]: Start difference. First operand has 201 states, 171 states have (on average 1.5497076023391814) internal successors, (265), 188 states have internal predecessors, (265), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 258 states. [2022-02-21 03:10:14,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:14,133 INFO L93 Difference]: Finished difference Result 258 states and 360 transitions. [2022-02-21 03:10:14,133 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 360 transitions. [2022-02-21 03:10:14,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:14,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:14,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:14,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:14,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 171 states have (on average 1.5497076023391814) internal successors, (265), 188 states have internal predecessors, (265), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 03:10:14,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 280 transitions. [2022-02-21 03:10:14,137 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 280 transitions. Word has length 15 [2022-02-21 03:10:14,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:14,137 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 280 transitions. [2022-02-21 03:10:14,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:10:14,137 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 280 transitions. [2022-02-21 03:10:14,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-21 03:10:14,138 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:14,138 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:14,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:10:14,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-02-21 03:10:14,354 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:14,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:14,355 INFO L85 PathProgramCache]: Analyzing trace with hash 317482697, now seen corresponding path program 1 times [2022-02-21 03:10:14,355 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:14,355 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605277470] [2022-02-21 03:10:14,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:14,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:14,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:14,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:14,382 INFO L290 TraceCheckUtils]: 0: Hoare triple {5581#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5573#true} is VALID [2022-02-21 03:10:14,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {5573#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {5573#true} is VALID [2022-02-21 03:10:14,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {5573#true} #res := ~__retres4~0; {5573#true} is VALID [2022-02-21 03:10:14,383 INFO L290 TraceCheckUtils]: 3: Hoare triple {5573#true} assume true; {5573#true} is VALID [2022-02-21 03:10:14,383 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5573#true} {5573#true} #349#return; {5573#true} is VALID [2022-02-21 03:10:14,383 INFO L290 TraceCheckUtils]: 0: Hoare triple {5573#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); {5573#true} is VALID [2022-02-21 03:10:14,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {5573#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {5573#true} is VALID [2022-02-21 03:10:14,384 INFO L272 TraceCheckUtils]: 2: Hoare triple {5573#true} call main_#t~ret22#1 := base2flt(0, 0); {5581#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:14,384 INFO L290 TraceCheckUtils]: 3: Hoare triple {5581#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5573#true} is VALID [2022-02-21 03:10:14,384 INFO L290 TraceCheckUtils]: 4: Hoare triple {5573#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {5573#true} is VALID [2022-02-21 03:10:14,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {5573#true} #res := ~__retres4~0; {5573#true} is VALID [2022-02-21 03:10:14,384 INFO L290 TraceCheckUtils]: 6: Hoare triple {5573#true} assume true; {5573#true} is VALID [2022-02-21 03:10:14,384 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5573#true} {5573#true} #349#return; {5573#true} is VALID [2022-02-21 03:10:14,385 INFO L290 TraceCheckUtils]: 8: Hoare triple {5573#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {5573#true} is VALID [2022-02-21 03:10:14,385 INFO L272 TraceCheckUtils]: 9: Hoare triple {5573#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {5573#true} is VALID [2022-02-21 03:10:14,385 INFO L290 TraceCheckUtils]: 10: Hoare triple {5573#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5573#true} is VALID [2022-02-21 03:10:14,385 INFO L290 TraceCheckUtils]: 11: Hoare triple {5573#true} assume !(0 == ~m % 4294967296); {5573#true} is VALID [2022-02-21 03:10:14,385 INFO L290 TraceCheckUtils]: 12: Hoare triple {5573#true} assume ~m % 4294967296 < 16777216; {5573#true} is VALID [2022-02-21 03:10:14,385 INFO L290 TraceCheckUtils]: 13: Hoare triple {5573#true} assume !false; {5573#true} is VALID [2022-02-21 03:10:14,386 INFO L290 TraceCheckUtils]: 14: Hoare triple {5573#true} assume !(~e <= -128); {5580#(<= 0 (+ base2flt_~e 127))} is VALID [2022-02-21 03:10:14,386 INFO L290 TraceCheckUtils]: 15: Hoare triple {5580#(<= 0 (+ base2flt_~e 127))} assume ~e - 1 <= 2147483647; {5580#(<= 0 (+ base2flt_~e 127))} is VALID [2022-02-21 03:10:14,386 INFO L290 TraceCheckUtils]: 16: Hoare triple {5580#(<= 0 (+ base2flt_~e 127))} assume !(~e - 1 >= -2147483648); {5574#false} is VALID [2022-02-21 03:10:14,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:10:14,387 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:14,387 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605277470] [2022-02-21 03:10:14,387 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605277470] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:14,387 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22972533] [2022-02-21 03:10:14,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:14,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:14,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:14,399 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:10:14,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-21 03:10:14,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:14,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:10:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:14,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:14,469 INFO L290 TraceCheckUtils]: 0: Hoare triple {5573#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); {5573#true} is VALID [2022-02-21 03:10:14,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {5573#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {5573#true} is VALID [2022-02-21 03:10:14,469 INFO L272 TraceCheckUtils]: 2: Hoare triple {5573#true} call main_#t~ret22#1 := base2flt(0, 0); {5573#true} is VALID [2022-02-21 03:10:14,470 INFO L290 TraceCheckUtils]: 3: Hoare triple {5573#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5573#true} is VALID [2022-02-21 03:10:14,470 INFO L290 TraceCheckUtils]: 4: Hoare triple {5573#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {5573#true} is VALID [2022-02-21 03:10:14,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {5573#true} #res := ~__retres4~0; {5573#true} is VALID [2022-02-21 03:10:14,470 INFO L290 TraceCheckUtils]: 6: Hoare triple {5573#true} assume true; {5573#true} is VALID [2022-02-21 03:10:14,470 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5573#true} {5573#true} #349#return; {5573#true} is VALID [2022-02-21 03:10:14,470 INFO L290 TraceCheckUtils]: 8: Hoare triple {5573#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {5573#true} is VALID [2022-02-21 03:10:14,470 INFO L272 TraceCheckUtils]: 9: Hoare triple {5573#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {5573#true} is VALID [2022-02-21 03:10:14,471 INFO L290 TraceCheckUtils]: 10: Hoare triple {5573#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5573#true} is VALID [2022-02-21 03:10:14,471 INFO L290 TraceCheckUtils]: 11: Hoare triple {5573#true} assume !(0 == ~m % 4294967296); {5573#true} is VALID [2022-02-21 03:10:14,471 INFO L290 TraceCheckUtils]: 12: Hoare triple {5573#true} assume ~m % 4294967296 < 16777216; {5573#true} is VALID [2022-02-21 03:10:14,471 INFO L290 TraceCheckUtils]: 13: Hoare triple {5573#true} assume !false; {5573#true} is VALID [2022-02-21 03:10:14,471 INFO L290 TraceCheckUtils]: 14: Hoare triple {5573#true} assume !(~e <= -128); {5580#(<= 0 (+ base2flt_~e 127))} is VALID [2022-02-21 03:10:14,472 INFO L290 TraceCheckUtils]: 15: Hoare triple {5580#(<= 0 (+ base2flt_~e 127))} assume ~e - 1 <= 2147483647; {5580#(<= 0 (+ base2flt_~e 127))} is VALID [2022-02-21 03:10:14,472 INFO L290 TraceCheckUtils]: 16: Hoare triple {5580#(<= 0 (+ base2flt_~e 127))} assume !(~e - 1 >= -2147483648); {5574#false} is VALID [2022-02-21 03:10:14,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:10:14,472 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:10:14,472 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22972533] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:14,472 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:10:14,473 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2022-02-21 03:10:14,473 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046042442] [2022-02-21 03:10:14,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:14,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-21 03:10:14,473 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:14,473 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:10:14,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:14,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:10:14,483 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:14,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:10:14,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:10:14,483 INFO L87 Difference]: Start difference. First operand 201 states and 280 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:10:14,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:14,643 INFO L93 Difference]: Finished difference Result 210 states and 289 transitions. [2022-02-21 03:10:14,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:10:14,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-21 03:10:14,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:14,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:10:14,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2022-02-21 03:10:14,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:10:14,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2022-02-21 03:10:14,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 150 transitions. [2022-02-21 03:10:14,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:14,738 INFO L225 Difference]: With dead ends: 210 [2022-02-21 03:10:14,738 INFO L226 Difference]: Without dead ends: 209 [2022-02-21 03:10:14,738 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:10:14,739 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 3 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:14,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 266 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:10:14,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-02-21 03:10:14,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 198. [2022-02-21 03:10:14,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:14,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 209 states. Second operand has 198 states, 169 states have (on average 1.5384615384615385) internal successors, (260), 185 states have internal predecessors, (260), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 03:10:14,781 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand has 198 states, 169 states have (on average 1.5384615384615385) internal successors, (260), 185 states have internal predecessors, (260), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 03:10:14,781 INFO L87 Difference]: Start difference. First operand 209 states. Second operand has 198 states, 169 states have (on average 1.5384615384615385) internal successors, (260), 185 states have internal predecessors, (260), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 03:10:14,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:14,785 INFO L93 Difference]: Finished difference Result 209 states and 286 transitions. [2022-02-21 03:10:14,785 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 286 transitions. [2022-02-21 03:10:14,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:14,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:14,786 INFO L74 IsIncluded]: Start isIncluded. First operand has 198 states, 169 states have (on average 1.5384615384615385) internal successors, (260), 185 states have internal predecessors, (260), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 209 states. [2022-02-21 03:10:14,786 INFO L87 Difference]: Start difference. First operand has 198 states, 169 states have (on average 1.5384615384615385) internal successors, (260), 185 states have internal predecessors, (260), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 209 states. [2022-02-21 03:10:14,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:14,790 INFO L93 Difference]: Finished difference Result 209 states and 286 transitions. [2022-02-21 03:10:14,790 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 286 transitions. [2022-02-21 03:10:14,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:14,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:14,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:14,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:14,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 169 states have (on average 1.5384615384615385) internal successors, (260), 185 states have internal predecessors, (260), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 03:10:14,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 275 transitions. [2022-02-21 03:10:14,794 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 275 transitions. Word has length 17 [2022-02-21 03:10:14,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:14,794 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 275 transitions. [2022-02-21 03:10:14,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:10:14,795 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 275 transitions. [2022-02-21 03:10:14,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-21 03:10:14,795 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:14,795 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:14,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:10:15,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:15,012 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:15,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:15,012 INFO L85 PathProgramCache]: Analyzing trace with hash 2139477144, now seen corresponding path program 1 times [2022-02-21 03:10:15,012 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:15,012 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268868240] [2022-02-21 03:10:15,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:15,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:15,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:15,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:15,081 INFO L290 TraceCheckUtils]: 0: Hoare triple {6535#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {6525#true} is VALID [2022-02-21 03:10:15,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {6525#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {6525#true} is VALID [2022-02-21 03:10:15,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {6525#true} #res := ~__retres4~0; {6525#true} is VALID [2022-02-21 03:10:15,082 INFO L290 TraceCheckUtils]: 3: Hoare triple {6525#true} assume true; {6525#true} is VALID [2022-02-21 03:10:15,083 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6525#true} {6527#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} #349#return; {6527#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:15,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {6525#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); {6525#true} is VALID [2022-02-21 03:10:15,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {6525#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {6527#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:15,084 INFO L272 TraceCheckUtils]: 2: Hoare triple {6527#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret22#1 := base2flt(0, 0); {6535#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:15,084 INFO L290 TraceCheckUtils]: 3: Hoare triple {6535#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {6525#true} is VALID [2022-02-21 03:10:15,084 INFO L290 TraceCheckUtils]: 4: Hoare triple {6525#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {6525#true} is VALID [2022-02-21 03:10:15,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {6525#true} #res := ~__retres4~0; {6525#true} is VALID [2022-02-21 03:10:15,085 INFO L290 TraceCheckUtils]: 6: Hoare triple {6525#true} assume true; {6525#true} is VALID [2022-02-21 03:10:15,085 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6525#true} {6527#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} #349#return; {6527#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:15,086 INFO L290 TraceCheckUtils]: 8: Hoare triple {6527#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {6527#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:15,086 INFO L272 TraceCheckUtils]: 9: Hoare triple {6527#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {6533#(<= 0 (+ 128 |base2flt_#in~e|))} is VALID [2022-02-21 03:10:15,087 INFO L290 TraceCheckUtils]: 10: Hoare triple {6533#(<= 0 (+ 128 |base2flt_#in~e|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {6534#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:15,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {6534#(<= 0 (+ 128 base2flt_~e))} assume !(0 == ~m % 4294967296); {6534#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:15,087 INFO L290 TraceCheckUtils]: 12: Hoare triple {6534#(<= 0 (+ 128 base2flt_~e))} assume !(~m % 4294967296 < 16777216); {6534#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:15,088 INFO L290 TraceCheckUtils]: 13: Hoare triple {6534#(<= 0 (+ 128 base2flt_~e))} assume !false; {6534#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:15,088 INFO L290 TraceCheckUtils]: 14: Hoare triple {6534#(<= 0 (+ 128 base2flt_~e))} assume ~m % 4294967296 >= 33554432; {6534#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:15,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {6534#(<= 0 (+ 128 base2flt_~e))} assume !(~e >= 127); {6534#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:15,089 INFO L290 TraceCheckUtils]: 16: Hoare triple {6534#(<= 0 (+ 128 base2flt_~e))} assume 1 + ~e <= 2147483647; {6534#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:15,089 INFO L290 TraceCheckUtils]: 17: Hoare triple {6534#(<= 0 (+ 128 base2flt_~e))} assume !(1 + ~e >= -2147483648); {6526#false} is VALID [2022-02-21 03:10:15,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:15,090 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:15,090 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268868240] [2022-02-21 03:10:15,090 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268868240] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:15,090 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532688825] [2022-02-21 03:10:15,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:15,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:15,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:15,103 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:10:15,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-21 03:10:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:15,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:10:15,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:15,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:15,260 INFO L290 TraceCheckUtils]: 0: Hoare triple {6525#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); {6525#true} is VALID [2022-02-21 03:10:15,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {6525#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {6527#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:15,275 INFO L272 TraceCheckUtils]: 2: Hoare triple {6527#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret22#1 := base2flt(0, 0); {6525#true} is VALID [2022-02-21 03:10:15,275 INFO L290 TraceCheckUtils]: 3: Hoare triple {6525#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {6525#true} is VALID [2022-02-21 03:10:15,276 INFO L290 TraceCheckUtils]: 4: Hoare triple {6525#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {6525#true} is VALID [2022-02-21 03:10:15,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {6525#true} #res := ~__retres4~0; {6525#true} is VALID [2022-02-21 03:10:15,276 INFO L290 TraceCheckUtils]: 6: Hoare triple {6525#true} assume true; {6525#true} is VALID [2022-02-21 03:10:15,277 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6525#true} {6527#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} #349#return; {6527#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:15,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {6527#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {6527#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:15,278 INFO L272 TraceCheckUtils]: 9: Hoare triple {6527#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {6533#(<= 0 (+ 128 |base2flt_#in~e|))} is VALID [2022-02-21 03:10:15,278 INFO L290 TraceCheckUtils]: 10: Hoare triple {6533#(<= 0 (+ 128 |base2flt_#in~e|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {6534#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:15,278 INFO L290 TraceCheckUtils]: 11: Hoare triple {6534#(<= 0 (+ 128 base2flt_~e))} assume !(0 == ~m % 4294967296); {6534#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:15,279 INFO L290 TraceCheckUtils]: 12: Hoare triple {6534#(<= 0 (+ 128 base2flt_~e))} assume !(~m % 4294967296 < 16777216); {6534#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:15,279 INFO L290 TraceCheckUtils]: 13: Hoare triple {6534#(<= 0 (+ 128 base2flt_~e))} assume !false; {6534#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:15,280 INFO L290 TraceCheckUtils]: 14: Hoare triple {6534#(<= 0 (+ 128 base2flt_~e))} assume ~m % 4294967296 >= 33554432; {6534#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:15,280 INFO L290 TraceCheckUtils]: 15: Hoare triple {6534#(<= 0 (+ 128 base2flt_~e))} assume !(~e >= 127); {6534#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:15,280 INFO L290 TraceCheckUtils]: 16: Hoare triple {6534#(<= 0 (+ 128 base2flt_~e))} assume 1 + ~e <= 2147483647; {6534#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:15,281 INFO L290 TraceCheckUtils]: 17: Hoare triple {6534#(<= 0 (+ 128 base2flt_~e))} assume !(1 + ~e >= -2147483648); {6526#false} is VALID [2022-02-21 03:10:15,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:15,281 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:10:15,281 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532688825] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:15,281 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:10:15,282 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-02-21 03:10:15,282 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901736143] [2022-02-21 03:10:15,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:15,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-21 03:10:15,282 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:15,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:10:15,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:15,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:10:15,294 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:15,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:10:15,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:10:15,295 INFO L87 Difference]: Start difference. First operand 198 states and 275 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:10:15,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:15,825 INFO L93 Difference]: Finished difference Result 241 states and 329 transitions. [2022-02-21 03:10:15,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:10:15,825 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-21 03:10:15,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:15,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:10:15,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 223 transitions. [2022-02-21 03:10:15,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:10:15,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 223 transitions. [2022-02-21 03:10:15,829 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 223 transitions. [2022-02-21 03:10:16,026 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:16,029 INFO L225 Difference]: With dead ends: 241 [2022-02-21 03:10:16,029 INFO L226 Difference]: Without dead ends: 238 [2022-02-21 03:10:16,030 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:10:16,030 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 107 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:16,030 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 488 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:10:16,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-02-21 03:10:16,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 206. [2022-02-21 03:10:16,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:16,085 INFO L82 GeneralOperation]: Start isEquivalent. First operand 238 states. Second operand has 206 states, 177 states have (on average 1.5310734463276836) internal successors, (271), 193 states have internal predecessors, (271), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 03:10:16,086 INFO L74 IsIncluded]: Start isIncluded. First operand 238 states. Second operand has 206 states, 177 states have (on average 1.5310734463276836) internal successors, (271), 193 states have internal predecessors, (271), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 03:10:16,086 INFO L87 Difference]: Start difference. First operand 238 states. Second operand has 206 states, 177 states have (on average 1.5310734463276836) internal successors, (271), 193 states have internal predecessors, (271), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 03:10:16,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:16,090 INFO L93 Difference]: Finished difference Result 238 states and 326 transitions. [2022-02-21 03:10:16,090 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 326 transitions. [2022-02-21 03:10:16,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:16,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:16,091 INFO L74 IsIncluded]: Start isIncluded. First operand has 206 states, 177 states have (on average 1.5310734463276836) internal successors, (271), 193 states have internal predecessors, (271), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 238 states. [2022-02-21 03:10:16,091 INFO L87 Difference]: Start difference. First operand has 206 states, 177 states have (on average 1.5310734463276836) internal successors, (271), 193 states have internal predecessors, (271), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 238 states. [2022-02-21 03:10:16,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:16,095 INFO L93 Difference]: Finished difference Result 238 states and 326 transitions. [2022-02-21 03:10:16,095 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 326 transitions. [2022-02-21 03:10:16,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:16,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:16,096 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:16,096 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:16,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 177 states have (on average 1.5310734463276836) internal successors, (271), 193 states have internal predecessors, (271), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 03:10:16,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 286 transitions. [2022-02-21 03:10:16,104 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 286 transitions. Word has length 18 [2022-02-21 03:10:16,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:16,104 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 286 transitions. [2022-02-21 03:10:16,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:10:16,105 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 286 transitions. [2022-02-21 03:10:16,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-21 03:10:16,105 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:16,105 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:16,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:10:16,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:16,322 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:16,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:16,322 INFO L85 PathProgramCache]: Analyzing trace with hash 251531834, now seen corresponding path program 1 times [2022-02-21 03:10:16,322 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:16,322 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121365009] [2022-02-21 03:10:16,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:16,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:16,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:16,363 INFO L290 TraceCheckUtils]: 0: Hoare triple {7586#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); {7586#true} is VALID [2022-02-21 03:10:16,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {7586#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {7586#true} is VALID [2022-02-21 03:10:16,364 INFO L272 TraceCheckUtils]: 2: Hoare triple {7586#true} call main_#t~ret22#1 := base2flt(0, 0); {7586#true} is VALID [2022-02-21 03:10:16,364 INFO L290 TraceCheckUtils]: 3: Hoare triple {7586#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {7586#true} is VALID [2022-02-21 03:10:16,364 INFO L290 TraceCheckUtils]: 4: Hoare triple {7586#true} assume !(0 == ~m % 4294967296); {7586#true} is VALID [2022-02-21 03:10:16,364 INFO L290 TraceCheckUtils]: 5: Hoare triple {7586#true} assume ~m % 4294967296 < 16777216; {7586#true} is VALID [2022-02-21 03:10:16,364 INFO L290 TraceCheckUtils]: 6: Hoare triple {7586#true} assume !false; {7586#true} is VALID [2022-02-21 03:10:16,365 INFO L290 TraceCheckUtils]: 7: Hoare triple {7586#true} assume !(~e <= -128); {7586#true} is VALID [2022-02-21 03:10:16,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {7586#true} assume ~e - 1 <= 2147483647; {7586#true} is VALID [2022-02-21 03:10:16,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {7586#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {7586#true} is VALID [2022-02-21 03:10:16,365 INFO L290 TraceCheckUtils]: 10: Hoare triple {7586#true} assume ~m % 4294967296 < 16777216; {7586#true} is VALID [2022-02-21 03:10:16,365 INFO L290 TraceCheckUtils]: 11: Hoare triple {7586#true} assume !false; {7586#true} is VALID [2022-02-21 03:10:16,365 INFO L290 TraceCheckUtils]: 12: Hoare triple {7586#true} assume !(~e <= -128); {7588#(<= 0 (+ base2flt_~e 127))} is VALID [2022-02-21 03:10:16,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {7588#(<= 0 (+ base2flt_~e 127))} assume ~e - 1 <= 2147483647; {7588#(<= 0 (+ base2flt_~e 127))} is VALID [2022-02-21 03:10:16,366 INFO L290 TraceCheckUtils]: 14: Hoare triple {7588#(<= 0 (+ base2flt_~e 127))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {7589#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:16,367 INFO L290 TraceCheckUtils]: 15: Hoare triple {7589#(<= 0 (+ 128 base2flt_~e))} assume !(~m % 4294967296 < 16777216); {7589#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:16,367 INFO L290 TraceCheckUtils]: 16: Hoare triple {7589#(<= 0 (+ 128 base2flt_~e))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {7589#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:16,367 INFO L290 TraceCheckUtils]: 17: Hoare triple {7589#(<= 0 (+ 128 base2flt_~e))} assume 128 + ~e <= 2147483647; {7589#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:16,368 INFO L290 TraceCheckUtils]: 18: Hoare triple {7589#(<= 0 (+ 128 base2flt_~e))} assume !(128 + ~e >= -2147483648); {7587#false} is VALID [2022-02-21 03:10:16,368 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:10:16,368 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:16,368 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121365009] [2022-02-21 03:10:16,368 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121365009] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:16,368 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:10:16,368 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:10:16,369 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374351744] [2022-02-21 03:10:16,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:16,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-21 03:10:16,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:16,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:10:16,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:16,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:10:16,379 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:16,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:10:16,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:10:16,380 INFO L87 Difference]: Start difference. First operand 206 states and 286 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:10:16,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:16,723 INFO L93 Difference]: Finished difference Result 261 states and 362 transitions. [2022-02-21 03:10:16,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:10:16,723 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-21 03:10:16,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:16,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:10:16,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 182 transitions. [2022-02-21 03:10:16,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:10:16,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 182 transitions. [2022-02-21 03:10:16,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 182 transitions. [2022-02-21 03:10:16,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:16,861 INFO L225 Difference]: With dead ends: 261 [2022-02-21 03:10:16,861 INFO L226 Difference]: Without dead ends: 259 [2022-02-21 03:10:16,861 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:10:16,863 INFO L933 BasicCegarLoop]: 155 mSDtfsCounter, 27 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:16,864 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 287 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:10:16,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-02-21 03:10:16,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 206. [2022-02-21 03:10:16,902 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:16,902 INFO L82 GeneralOperation]: Start isEquivalent. First operand 259 states. Second operand has 206 states, 177 states have (on average 1.5197740112994351) internal successors, (269), 193 states have internal predecessors, (269), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 03:10:16,906 INFO L74 IsIncluded]: Start isIncluded. First operand 259 states. Second operand has 206 states, 177 states have (on average 1.5197740112994351) internal successors, (269), 193 states have internal predecessors, (269), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 03:10:16,907 INFO L87 Difference]: Start difference. First operand 259 states. Second operand has 206 states, 177 states have (on average 1.5197740112994351) internal successors, (269), 193 states have internal predecessors, (269), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 03:10:16,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:16,911 INFO L93 Difference]: Finished difference Result 259 states and 356 transitions. [2022-02-21 03:10:16,911 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 356 transitions. [2022-02-21 03:10:16,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:16,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:16,912 INFO L74 IsIncluded]: Start isIncluded. First operand has 206 states, 177 states have (on average 1.5197740112994351) internal successors, (269), 193 states have internal predecessors, (269), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 259 states. [2022-02-21 03:10:16,912 INFO L87 Difference]: Start difference. First operand has 206 states, 177 states have (on average 1.5197740112994351) internal successors, (269), 193 states have internal predecessors, (269), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 259 states. [2022-02-21 03:10:16,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:16,917 INFO L93 Difference]: Finished difference Result 259 states and 356 transitions. [2022-02-21 03:10:16,917 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 356 transitions. [2022-02-21 03:10:16,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:16,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:16,917 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:16,917 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:16,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 177 states have (on average 1.5197740112994351) internal successors, (269), 193 states have internal predecessors, (269), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 03:10:16,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 284 transitions. [2022-02-21 03:10:16,921 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 284 transitions. Word has length 19 [2022-02-21 03:10:16,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:16,922 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 284 transitions. [2022-02-21 03:10:16,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:10:16,922 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 284 transitions. [2022-02-21 03:10:16,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-21 03:10:16,922 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:16,922 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:16,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-21 03:10:16,923 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:16,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:16,923 INFO L85 PathProgramCache]: Analyzing trace with hash -125890422, now seen corresponding path program 1 times [2022-02-21 03:10:16,923 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:16,923 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79892536] [2022-02-21 03:10:16,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:16,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:16,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:16,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:16,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:16,994 INFO L290 TraceCheckUtils]: 0: Hoare triple {8668#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8653#true} is VALID [2022-02-21 03:10:16,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {8653#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {8653#true} is VALID [2022-02-21 03:10:16,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {8653#true} #res := ~__retres4~0; {8653#true} is VALID [2022-02-21 03:10:16,994 INFO L290 TraceCheckUtils]: 3: Hoare triple {8653#true} assume true; {8653#true} is VALID [2022-02-21 03:10:16,995 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {8653#true} {8655#(<= |ULTIMATE.start_main_~eb~2#1| 127)} #349#return; {8655#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:10:16,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:16,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:17,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {8668#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8653#true} is VALID [2022-02-21 03:10:17,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {8653#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {8653#true} is VALID [2022-02-21 03:10:17,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {8653#true} #res := ~__retres4~0; {8653#true} is VALID [2022-02-21 03:10:17,004 INFO L290 TraceCheckUtils]: 3: Hoare triple {8653#true} assume true; {8653#true} is VALID [2022-02-21 03:10:17,005 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {8653#true} {8655#(<= |ULTIMATE.start_main_~eb~2#1| 127)} #351#return; {8655#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:10:17,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {8653#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); {8653#true} is VALID [2022-02-21 03:10:17,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {8653#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {8655#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:10:17,007 INFO L272 TraceCheckUtils]: 2: Hoare triple {8655#(<= |ULTIMATE.start_main_~eb~2#1| 127)} call main_#t~ret22#1 := base2flt(0, 0); {8668#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:17,007 INFO L290 TraceCheckUtils]: 3: Hoare triple {8668#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8653#true} is VALID [2022-02-21 03:10:17,008 INFO L290 TraceCheckUtils]: 4: Hoare triple {8653#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {8653#true} is VALID [2022-02-21 03:10:17,008 INFO L290 TraceCheckUtils]: 5: Hoare triple {8653#true} #res := ~__retres4~0; {8653#true} is VALID [2022-02-21 03:10:17,008 INFO L290 TraceCheckUtils]: 6: Hoare triple {8653#true} assume true; {8653#true} is VALID [2022-02-21 03:10:17,008 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {8653#true} {8655#(<= |ULTIMATE.start_main_~eb~2#1| 127)} #349#return; {8655#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:10:17,009 INFO L290 TraceCheckUtils]: 8: Hoare triple {8655#(<= |ULTIMATE.start_main_~eb~2#1| 127)} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {8655#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:10:17,009 INFO L272 TraceCheckUtils]: 9: Hoare triple {8655#(<= |ULTIMATE.start_main_~eb~2#1| 127)} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {8668#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:17,010 INFO L290 TraceCheckUtils]: 10: Hoare triple {8668#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8653#true} is VALID [2022-02-21 03:10:17,010 INFO L290 TraceCheckUtils]: 11: Hoare triple {8653#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {8653#true} is VALID [2022-02-21 03:10:17,010 INFO L290 TraceCheckUtils]: 12: Hoare triple {8653#true} #res := ~__retres4~0; {8653#true} is VALID [2022-02-21 03:10:17,010 INFO L290 TraceCheckUtils]: 13: Hoare triple {8653#true} assume true; {8653#true} is VALID [2022-02-21 03:10:17,010 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {8653#true} {8655#(<= |ULTIMATE.start_main_~eb~2#1| 127)} #351#return; {8655#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:10:17,011 INFO L290 TraceCheckUtils]: 15: Hoare triple {8655#(<= |ULTIMATE.start_main_~eb~2#1| 127)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {8655#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:10:17,011 INFO L272 TraceCheckUtils]: 16: Hoare triple {8655#(<= |ULTIMATE.start_main_~eb~2#1| 127)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {8666#(<= |base2flt_#in~e| 127)} is VALID [2022-02-21 03:10:17,012 INFO L290 TraceCheckUtils]: 17: Hoare triple {8666#(<= |base2flt_#in~e| 127)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8667#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:17,012 INFO L290 TraceCheckUtils]: 18: Hoare triple {8667#(<= base2flt_~e 127)} assume !(0 == ~m % 4294967296); {8667#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:17,012 INFO L290 TraceCheckUtils]: 19: Hoare triple {8667#(<= base2flt_~e 127)} assume ~m % 4294967296 < 16777216; {8667#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:17,013 INFO L290 TraceCheckUtils]: 20: Hoare triple {8667#(<= base2flt_~e 127)} assume !false; {8667#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:17,013 INFO L290 TraceCheckUtils]: 21: Hoare triple {8667#(<= base2flt_~e 127)} assume !(~e <= -128); {8667#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:17,013 INFO L290 TraceCheckUtils]: 22: Hoare triple {8667#(<= base2flt_~e 127)} assume !(~e - 1 <= 2147483647); {8654#false} is VALID [2022-02-21 03:10:17,013 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-21 03:10:17,014 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:17,014 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79892536] [2022-02-21 03:10:17,014 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79892536] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:17,014 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296243497] [2022-02-21 03:10:17,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:17,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:17,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:17,028 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:10:17,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-21 03:10:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:17,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:10:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:17,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:17,170 INFO L290 TraceCheckUtils]: 0: Hoare triple {8653#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); {8653#true} is VALID [2022-02-21 03:10:17,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {8653#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {8655#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:10:17,175 INFO L272 TraceCheckUtils]: 2: Hoare triple {8655#(<= |ULTIMATE.start_main_~eb~2#1| 127)} call main_#t~ret22#1 := base2flt(0, 0); {8653#true} is VALID [2022-02-21 03:10:17,177 INFO L290 TraceCheckUtils]: 3: Hoare triple {8653#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8653#true} is VALID [2022-02-21 03:10:17,183 INFO L290 TraceCheckUtils]: 4: Hoare triple {8653#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {8653#true} is VALID [2022-02-21 03:10:17,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {8653#true} #res := ~__retres4~0; {8653#true} is VALID [2022-02-21 03:10:17,185 INFO L290 TraceCheckUtils]: 6: Hoare triple {8653#true} assume true; {8653#true} is VALID [2022-02-21 03:10:17,186 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {8653#true} {8655#(<= |ULTIMATE.start_main_~eb~2#1| 127)} #349#return; {8655#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:10:17,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {8655#(<= |ULTIMATE.start_main_~eb~2#1| 127)} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {8655#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:10:17,186 INFO L272 TraceCheckUtils]: 9: Hoare triple {8655#(<= |ULTIMATE.start_main_~eb~2#1| 127)} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {8653#true} is VALID [2022-02-21 03:10:17,186 INFO L290 TraceCheckUtils]: 10: Hoare triple {8653#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8653#true} is VALID [2022-02-21 03:10:17,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {8653#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {8653#true} is VALID [2022-02-21 03:10:17,190 INFO L290 TraceCheckUtils]: 12: Hoare triple {8653#true} #res := ~__retres4~0; {8653#true} is VALID [2022-02-21 03:10:17,190 INFO L290 TraceCheckUtils]: 13: Hoare triple {8653#true} assume true; {8653#true} is VALID [2022-02-21 03:10:17,191 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {8653#true} {8655#(<= |ULTIMATE.start_main_~eb~2#1| 127)} #351#return; {8655#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:10:17,192 INFO L290 TraceCheckUtils]: 15: Hoare triple {8655#(<= |ULTIMATE.start_main_~eb~2#1| 127)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {8655#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:10:17,192 INFO L272 TraceCheckUtils]: 16: Hoare triple {8655#(<= |ULTIMATE.start_main_~eb~2#1| 127)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {8666#(<= |base2flt_#in~e| 127)} is VALID [2022-02-21 03:10:17,193 INFO L290 TraceCheckUtils]: 17: Hoare triple {8666#(<= |base2flt_#in~e| 127)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8667#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:17,193 INFO L290 TraceCheckUtils]: 18: Hoare triple {8667#(<= base2flt_~e 127)} assume !(0 == ~m % 4294967296); {8667#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:17,193 INFO L290 TraceCheckUtils]: 19: Hoare triple {8667#(<= base2flt_~e 127)} assume ~m % 4294967296 < 16777216; {8667#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:17,194 INFO L290 TraceCheckUtils]: 20: Hoare triple {8667#(<= base2flt_~e 127)} assume !false; {8667#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:17,194 INFO L290 TraceCheckUtils]: 21: Hoare triple {8667#(<= base2flt_~e 127)} assume !(~e <= -128); {8667#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:17,194 INFO L290 TraceCheckUtils]: 22: Hoare triple {8667#(<= base2flt_~e 127)} assume !(~e - 1 <= 2147483647); {8654#false} is VALID [2022-02-21 03:10:17,195 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-21 03:10:17,195 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:10:17,195 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296243497] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:17,195 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:10:17,195 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-02-21 03:10:17,196 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620326079] [2022-02-21 03:10:17,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:17,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-02-21 03:10:17,196 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:17,198 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:10:17,210 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:17,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:10:17,210 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:17,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:10:17,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:10:17,211 INFO L87 Difference]: Start difference. First operand 206 states and 284 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:10:17,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:17,647 INFO L93 Difference]: Finished difference Result 236 states and 325 transitions. [2022-02-21 03:10:17,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:10:17,648 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-02-21 03:10:17,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:17,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:10:17,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 222 transitions. [2022-02-21 03:10:17,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:10:17,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 222 transitions. [2022-02-21 03:10:17,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 222 transitions. [2022-02-21 03:10:17,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:17,824 INFO L225 Difference]: With dead ends: 236 [2022-02-21 03:10:17,824 INFO L226 Difference]: Without dead ends: 233 [2022-02-21 03:10:17,825 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:10:17,825 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 112 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 485 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:10:17,826 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 485 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:10:17,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-02-21 03:10:17,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 194. [2022-02-21 03:10:17,896 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:17,896 INFO L82 GeneralOperation]: Start isEquivalent. First operand 233 states. Second operand has 194 states, 168 states have (on average 1.4821428571428572) internal successors, (249), 181 states have internal predecessors, (249), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 03:10:17,897 INFO L74 IsIncluded]: Start isIncluded. First operand 233 states. Second operand has 194 states, 168 states have (on average 1.4821428571428572) internal successors, (249), 181 states have internal predecessors, (249), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 03:10:17,897 INFO L87 Difference]: Start difference. First operand 233 states. Second operand has 194 states, 168 states have (on average 1.4821428571428572) internal successors, (249), 181 states have internal predecessors, (249), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 03:10:17,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:17,902 INFO L93 Difference]: Finished difference Result 233 states and 320 transitions. [2022-02-21 03:10:17,903 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 320 transitions. [2022-02-21 03:10:17,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:17,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:17,904 INFO L74 IsIncluded]: Start isIncluded. First operand has 194 states, 168 states have (on average 1.4821428571428572) internal successors, (249), 181 states have internal predecessors, (249), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 233 states. [2022-02-21 03:10:17,904 INFO L87 Difference]: Start difference. First operand has 194 states, 168 states have (on average 1.4821428571428572) internal successors, (249), 181 states have internal predecessors, (249), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 233 states. [2022-02-21 03:10:17,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:17,910 INFO L93 Difference]: Finished difference Result 233 states and 320 transitions. [2022-02-21 03:10:17,910 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 320 transitions. [2022-02-21 03:10:17,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:17,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:17,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:17,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:17,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 168 states have (on average 1.4821428571428572) internal successors, (249), 181 states have internal predecessors, (249), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 03:10:17,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 264 transitions. [2022-02-21 03:10:17,916 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 264 transitions. Word has length 23 [2022-02-21 03:10:17,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:17,916 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 264 transitions. [2022-02-21 03:10:17,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:10:17,916 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 264 transitions. [2022-02-21 03:10:17,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-21 03:10:17,917 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:17,917 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:17,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:10:18,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-02-21 03:10:18,141 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:18,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:18,141 INFO L85 PathProgramCache]: Analyzing trace with hash 165838642, now seen corresponding path program 1 times [2022-02-21 03:10:18,141 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:18,141 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985776497] [2022-02-21 03:10:18,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:18,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:18,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:18,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:18,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {9719#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9704#true} is VALID [2022-02-21 03:10:18,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {9704#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {9704#true} is VALID [2022-02-21 03:10:18,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {9704#true} #res := ~__retres4~0; {9704#true} is VALID [2022-02-21 03:10:18,189 INFO L290 TraceCheckUtils]: 3: Hoare triple {9704#true} assume true; {9704#true} is VALID [2022-02-21 03:10:18,190 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {9704#true} {9706#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} #349#return; {9706#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:10:18,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:18,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:18,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {9719#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9704#true} is VALID [2022-02-21 03:10:18,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {9704#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {9704#true} is VALID [2022-02-21 03:10:18,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {9704#true} #res := ~__retres4~0; {9704#true} is VALID [2022-02-21 03:10:18,196 INFO L290 TraceCheckUtils]: 3: Hoare triple {9704#true} assume true; {9704#true} is VALID [2022-02-21 03:10:18,197 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {9704#true} {9706#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} #351#return; {9706#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:10:18,197 INFO L290 TraceCheckUtils]: 0: Hoare triple {9704#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); {9704#true} is VALID [2022-02-21 03:10:18,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {9704#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {9706#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:10:18,198 INFO L272 TraceCheckUtils]: 2: Hoare triple {9706#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} call main_#t~ret22#1 := base2flt(0, 0); {9719#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:18,198 INFO L290 TraceCheckUtils]: 3: Hoare triple {9719#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9704#true} is VALID [2022-02-21 03:10:18,198 INFO L290 TraceCheckUtils]: 4: Hoare triple {9704#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {9704#true} is VALID [2022-02-21 03:10:18,198 INFO L290 TraceCheckUtils]: 5: Hoare triple {9704#true} #res := ~__retres4~0; {9704#true} is VALID [2022-02-21 03:10:18,199 INFO L290 TraceCheckUtils]: 6: Hoare triple {9704#true} assume true; {9704#true} is VALID [2022-02-21 03:10:18,199 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {9704#true} {9706#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} #349#return; {9706#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:10:18,200 INFO L290 TraceCheckUtils]: 8: Hoare triple {9706#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {9706#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:10:18,200 INFO L272 TraceCheckUtils]: 9: Hoare triple {9706#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {9719#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:18,201 INFO L290 TraceCheckUtils]: 10: Hoare triple {9719#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9704#true} is VALID [2022-02-21 03:10:18,201 INFO L290 TraceCheckUtils]: 11: Hoare triple {9704#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {9704#true} is VALID [2022-02-21 03:10:18,201 INFO L290 TraceCheckUtils]: 12: Hoare triple {9704#true} #res := ~__retres4~0; {9704#true} is VALID [2022-02-21 03:10:18,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {9704#true} assume true; {9704#true} is VALID [2022-02-21 03:10:18,202 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {9704#true} {9706#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} #351#return; {9706#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:10:18,202 INFO L290 TraceCheckUtils]: 15: Hoare triple {9706#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {9706#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:10:18,203 INFO L272 TraceCheckUtils]: 16: Hoare triple {9706#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {9717#(<= 0 (+ 128 |base2flt_#in~e|))} is VALID [2022-02-21 03:10:18,203 INFO L290 TraceCheckUtils]: 17: Hoare triple {9717#(<= 0 (+ 128 |base2flt_#in~e|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9718#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:18,204 INFO L290 TraceCheckUtils]: 18: Hoare triple {9718#(<= 0 (+ 128 base2flt_~e))} assume !(0 == ~m % 4294967296); {9718#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:18,204 INFO L290 TraceCheckUtils]: 19: Hoare triple {9718#(<= 0 (+ 128 base2flt_~e))} assume !(~m % 4294967296 < 16777216); {9718#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:18,204 INFO L290 TraceCheckUtils]: 20: Hoare triple {9718#(<= 0 (+ 128 base2flt_~e))} assume !false; {9718#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:18,205 INFO L290 TraceCheckUtils]: 21: Hoare triple {9718#(<= 0 (+ 128 base2flt_~e))} assume ~m % 4294967296 >= 33554432; {9718#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:18,205 INFO L290 TraceCheckUtils]: 22: Hoare triple {9718#(<= 0 (+ 128 base2flt_~e))} assume !(~e >= 127); {9718#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:18,206 INFO L290 TraceCheckUtils]: 23: Hoare triple {9718#(<= 0 (+ 128 base2flt_~e))} assume 1 + ~e <= 2147483647; {9718#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:18,206 INFO L290 TraceCheckUtils]: 24: Hoare triple {9718#(<= 0 (+ 128 base2flt_~e))} assume !(1 + ~e >= -2147483648); {9705#false} is VALID [2022-02-21 03:10:18,206 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-21 03:10:18,207 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:18,207 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985776497] [2022-02-21 03:10:18,207 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985776497] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:18,207 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376981297] [2022-02-21 03:10:18,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:18,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:18,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:18,209 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:10:18,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-21 03:10:18,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:18,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:10:18,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:18,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:18,359 INFO L290 TraceCheckUtils]: 0: Hoare triple {9704#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); {9704#true} is VALID [2022-02-21 03:10:18,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {9704#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {9706#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:10:18,360 INFO L272 TraceCheckUtils]: 2: Hoare triple {9706#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} call main_#t~ret22#1 := base2flt(0, 0); {9704#true} is VALID [2022-02-21 03:10:18,360 INFO L290 TraceCheckUtils]: 3: Hoare triple {9704#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9704#true} is VALID [2022-02-21 03:10:18,360 INFO L290 TraceCheckUtils]: 4: Hoare triple {9704#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {9704#true} is VALID [2022-02-21 03:10:18,360 INFO L290 TraceCheckUtils]: 5: Hoare triple {9704#true} #res := ~__retres4~0; {9704#true} is VALID [2022-02-21 03:10:18,360 INFO L290 TraceCheckUtils]: 6: Hoare triple {9704#true} assume true; {9704#true} is VALID [2022-02-21 03:10:18,361 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {9704#true} {9706#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} #349#return; {9706#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:10:18,362 INFO L290 TraceCheckUtils]: 8: Hoare triple {9706#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {9706#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:10:18,362 INFO L272 TraceCheckUtils]: 9: Hoare triple {9706#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {9704#true} is VALID [2022-02-21 03:10:18,362 INFO L290 TraceCheckUtils]: 10: Hoare triple {9704#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9704#true} is VALID [2022-02-21 03:10:18,362 INFO L290 TraceCheckUtils]: 11: Hoare triple {9704#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {9704#true} is VALID [2022-02-21 03:10:18,362 INFO L290 TraceCheckUtils]: 12: Hoare triple {9704#true} #res := ~__retres4~0; {9704#true} is VALID [2022-02-21 03:10:18,362 INFO L290 TraceCheckUtils]: 13: Hoare triple {9704#true} assume true; {9704#true} is VALID [2022-02-21 03:10:18,363 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {9704#true} {9706#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} #351#return; {9706#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:10:18,363 INFO L290 TraceCheckUtils]: 15: Hoare triple {9706#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {9706#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:10:18,364 INFO L272 TraceCheckUtils]: 16: Hoare triple {9706#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {9717#(<= 0 (+ 128 |base2flt_#in~e|))} is VALID [2022-02-21 03:10:18,365 INFO L290 TraceCheckUtils]: 17: Hoare triple {9717#(<= 0 (+ 128 |base2flt_#in~e|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9718#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:18,365 INFO L290 TraceCheckUtils]: 18: Hoare triple {9718#(<= 0 (+ 128 base2flt_~e))} assume !(0 == ~m % 4294967296); {9718#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:18,365 INFO L290 TraceCheckUtils]: 19: Hoare triple {9718#(<= 0 (+ 128 base2flt_~e))} assume !(~m % 4294967296 < 16777216); {9718#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:18,366 INFO L290 TraceCheckUtils]: 20: Hoare triple {9718#(<= 0 (+ 128 base2flt_~e))} assume !false; {9718#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:18,366 INFO L290 TraceCheckUtils]: 21: Hoare triple {9718#(<= 0 (+ 128 base2flt_~e))} assume ~m % 4294967296 >= 33554432; {9718#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:18,367 INFO L290 TraceCheckUtils]: 22: Hoare triple {9718#(<= 0 (+ 128 base2flt_~e))} assume !(~e >= 127); {9718#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:18,367 INFO L290 TraceCheckUtils]: 23: Hoare triple {9718#(<= 0 (+ 128 base2flt_~e))} assume 1 + ~e <= 2147483647; {9718#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:18,367 INFO L290 TraceCheckUtils]: 24: Hoare triple {9718#(<= 0 (+ 128 base2flt_~e))} assume !(1 + ~e >= -2147483648); {9705#false} is VALID [2022-02-21 03:10:18,368 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-21 03:10:18,368 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:10:18,368 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376981297] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:18,368 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:10:18,368 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-02-21 03:10:18,369 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483281562] [2022-02-21 03:10:18,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:18,369 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-02-21 03:10:18,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:18,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:10:18,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:10:18,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:10:18,385 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:18,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:10:18,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:10:18,386 INFO L87 Difference]: Start difference. First operand 194 states and 264 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:10:18,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:18,868 INFO L93 Difference]: Finished difference Result 224 states and 304 transitions. [2022-02-21 03:10:18,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:10:18,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-02-21 03:10:18,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:18,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:10:18,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 215 transitions. [2022-02-21 03:10:18,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:10:18,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 215 transitions. [2022-02-21 03:10:18,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 215 transitions. [2022-02-21 03:10:19,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 215 edges. 215 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:19,056 INFO L225 Difference]: With dead ends: 224 [2022-02-21 03:10:19,056 INFO L226 Difference]: Without dead ends: 221 [2022-02-21 03:10:19,057 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:10:19,057 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 96 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:19,058 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 491 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:10:19,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-02-21 03:10:19,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 183. [2022-02-21 03:10:19,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:19,116 INFO L82 GeneralOperation]: Start isEquivalent. First operand 221 states. Second operand has 183 states, 160 states have (on average 1.4625) internal successors, (234), 170 states have internal predecessors, (234), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 03:10:19,116 INFO L74 IsIncluded]: Start isIncluded. First operand 221 states. Second operand has 183 states, 160 states have (on average 1.4625) internal successors, (234), 170 states have internal predecessors, (234), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 03:10:19,116 INFO L87 Difference]: Start difference. First operand 221 states. Second operand has 183 states, 160 states have (on average 1.4625) internal successors, (234), 170 states have internal predecessors, (234), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 03:10:19,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:19,120 INFO L93 Difference]: Finished difference Result 221 states and 301 transitions. [2022-02-21 03:10:19,120 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 301 transitions. [2022-02-21 03:10:19,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:19,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:19,121 INFO L74 IsIncluded]: Start isIncluded. First operand has 183 states, 160 states have (on average 1.4625) internal successors, (234), 170 states have internal predecessors, (234), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 221 states. [2022-02-21 03:10:19,121 INFO L87 Difference]: Start difference. First operand has 183 states, 160 states have (on average 1.4625) internal successors, (234), 170 states have internal predecessors, (234), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 221 states. [2022-02-21 03:10:19,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:19,124 INFO L93 Difference]: Finished difference Result 221 states and 301 transitions. [2022-02-21 03:10:19,124 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 301 transitions. [2022-02-21 03:10:19,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:19,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:19,125 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:19,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:19,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 160 states have (on average 1.4625) internal successors, (234), 170 states have internal predecessors, (234), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-21 03:10:19,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 249 transitions. [2022-02-21 03:10:19,127 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 249 transitions. Word has length 25 [2022-02-21 03:10:19,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:19,128 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 249 transitions. [2022-02-21 03:10:19,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:10:19,128 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 249 transitions. [2022-02-21 03:10:19,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-21 03:10:19,128 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:19,128 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:19,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:10:19,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:19,356 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:19,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:19,356 INFO L85 PathProgramCache]: Analyzing trace with hash 340378026, now seen corresponding path program 1 times [2022-02-21 03:10:19,356 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:19,356 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695072728] [2022-02-21 03:10:19,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:19,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:19,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:19,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:19,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:19,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {10734#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {10712#true} is VALID [2022-02-21 03:10:19,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {10712#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {10712#true} is VALID [2022-02-21 03:10:19,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {10712#true} #res := ~__retres4~0; {10712#true} is VALID [2022-02-21 03:10:19,411 INFO L290 TraceCheckUtils]: 3: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-02-21 03:10:19,411 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10712#true} {10712#true} #349#return; {10712#true} is VALID [2022-02-21 03:10:19,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:19,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:19,472 INFO L290 TraceCheckUtils]: 0: Hoare triple {10734#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {10712#true} is VALID [2022-02-21 03:10:19,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {10712#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {10735#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:19,473 INFO L290 TraceCheckUtils]: 2: Hoare triple {10735#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {10736#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:19,473 INFO L290 TraceCheckUtils]: 3: Hoare triple {10736#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {10736#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:19,474 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10736#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {10712#true} #351#return; {10724#(= |ULTIMATE.start_main_#t~ret23#1| 0)} is VALID [2022-02-21 03:10:19,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-21 03:10:19,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:19,478 INFO L290 TraceCheckUtils]: 0: Hoare triple {10734#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {10712#true} is VALID [2022-02-21 03:10:19,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {10712#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {10712#true} is VALID [2022-02-21 03:10:19,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {10712#true} #res := ~__retres4~0; {10712#true} is VALID [2022-02-21 03:10:19,478 INFO L290 TraceCheckUtils]: 3: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-02-21 03:10:19,479 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10712#true} {10725#(= |ULTIMATE.start_main_~a~0#1| 0)} #353#return; {10725#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:19,479 INFO L290 TraceCheckUtils]: 0: Hoare triple {10712#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); {10712#true} is VALID [2022-02-21 03:10:19,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {10712#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {10712#true} is VALID [2022-02-21 03:10:19,480 INFO L272 TraceCheckUtils]: 2: Hoare triple {10712#true} call main_#t~ret22#1 := base2flt(0, 0); {10734#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:19,480 INFO L290 TraceCheckUtils]: 3: Hoare triple {10734#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {10712#true} is VALID [2022-02-21 03:10:19,480 INFO L290 TraceCheckUtils]: 4: Hoare triple {10712#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {10712#true} is VALID [2022-02-21 03:10:19,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {10712#true} #res := ~__retres4~0; {10712#true} is VALID [2022-02-21 03:10:19,480 INFO L290 TraceCheckUtils]: 6: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-02-21 03:10:19,480 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10712#true} {10712#true} #349#return; {10712#true} is VALID [2022-02-21 03:10:19,480 INFO L290 TraceCheckUtils]: 8: Hoare triple {10712#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {10712#true} is VALID [2022-02-21 03:10:19,481 INFO L272 TraceCheckUtils]: 9: Hoare triple {10712#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {10734#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:19,481 INFO L290 TraceCheckUtils]: 10: Hoare triple {10734#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {10712#true} is VALID [2022-02-21 03:10:19,481 INFO L290 TraceCheckUtils]: 11: Hoare triple {10712#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {10735#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:19,482 INFO L290 TraceCheckUtils]: 12: Hoare triple {10735#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {10736#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:19,482 INFO L290 TraceCheckUtils]: 13: Hoare triple {10736#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {10736#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:19,483 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {10736#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {10712#true} #351#return; {10724#(= |ULTIMATE.start_main_#t~ret23#1| 0)} is VALID [2022-02-21 03:10:19,483 INFO L290 TraceCheckUtils]: 15: Hoare triple {10724#(= |ULTIMATE.start_main_#t~ret23#1| 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {10725#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:19,484 INFO L272 TraceCheckUtils]: 16: Hoare triple {10725#(= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {10734#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:19,484 INFO L290 TraceCheckUtils]: 17: Hoare triple {10734#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {10712#true} is VALID [2022-02-21 03:10:19,484 INFO L290 TraceCheckUtils]: 18: Hoare triple {10712#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {10712#true} is VALID [2022-02-21 03:10:19,484 INFO L290 TraceCheckUtils]: 19: Hoare triple {10712#true} #res := ~__retres4~0; {10712#true} is VALID [2022-02-21 03:10:19,484 INFO L290 TraceCheckUtils]: 20: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-02-21 03:10:19,485 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10712#true} {10725#(= |ULTIMATE.start_main_~a~0#1| 0)} #353#return; {10725#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:19,485 INFO L290 TraceCheckUtils]: 22: Hoare triple {10725#(= |ULTIMATE.start_main_~a~0#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {10725#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:19,486 INFO L272 TraceCheckUtils]: 23: Hoare triple {10725#(= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {10731#(= |addflt_#in~a| 0)} is VALID [2022-02-21 03:10:19,486 INFO L290 TraceCheckUtils]: 24: Hoare triple {10731#(= |addflt_#in~a| 0)} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {10732#(= addflt_~a 0)} is VALID [2022-02-21 03:10:19,486 INFO L290 TraceCheckUtils]: 25: Hoare triple {10732#(= addflt_~a 0)} assume ~a % 4294967296 < ~b % 4294967296;~tmp~0 := ~a;~a := ~b;~b := ~tmp~0; {10733#(= addflt_~b 0)} is VALID [2022-02-21 03:10:19,487 INFO L290 TraceCheckUtils]: 26: Hoare triple {10733#(= addflt_~b 0)} assume !(0 == ~b % 4294967296); {10713#false} is VALID [2022-02-21 03:10:19,487 INFO L290 TraceCheckUtils]: 27: Hoare triple {10713#false} assume 0 == ~a;~ma~0 := 0; {10713#false} is VALID [2022-02-21 03:10:19,487 INFO L290 TraceCheckUtils]: 28: Hoare triple {10713#false} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {10713#false} is VALID [2022-02-21 03:10:19,487 INFO L290 TraceCheckUtils]: 29: Hoare triple {10713#false} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {10713#false} is VALID [2022-02-21 03:10:19,487 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:19,487 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:19,488 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695072728] [2022-02-21 03:10:19,488 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695072728] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:19,488 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518549263] [2022-02-21 03:10:19,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:19,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:19,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:19,489 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:10:19,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-21 03:10:19,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:19,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-21 03:10:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:19,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:19,694 INFO L290 TraceCheckUtils]: 0: Hoare triple {10712#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); {10712#true} is VALID [2022-02-21 03:10:19,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {10712#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {10712#true} is VALID [2022-02-21 03:10:19,698 INFO L272 TraceCheckUtils]: 2: Hoare triple {10712#true} call main_#t~ret22#1 := base2flt(0, 0); {10712#true} is VALID [2022-02-21 03:10:19,699 INFO L290 TraceCheckUtils]: 3: Hoare triple {10712#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {10749#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:19,700 INFO L290 TraceCheckUtils]: 4: Hoare triple {10749#(= base2flt_~m |base2flt_#in~m|)} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {10753#(<= (mod |base2flt_#in~m| 4294967296) 0)} is VALID [2022-02-21 03:10:19,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {10753#(<= (mod |base2flt_#in~m| 4294967296) 0)} #res := ~__retres4~0; {10753#(<= (mod |base2flt_#in~m| 4294967296) 0)} is VALID [2022-02-21 03:10:19,700 INFO L290 TraceCheckUtils]: 6: Hoare triple {10753#(<= (mod |base2flt_#in~m| 4294967296) 0)} assume true; {10753#(<= (mod |base2flt_#in~m| 4294967296) 0)} is VALID [2022-02-21 03:10:19,700 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10753#(<= (mod |base2flt_#in~m| 4294967296) 0)} {10712#true} #349#return; {10712#true} is VALID [2022-02-21 03:10:19,700 INFO L290 TraceCheckUtils]: 8: Hoare triple {10712#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {10712#true} is VALID [2022-02-21 03:10:19,700 INFO L272 TraceCheckUtils]: 9: Hoare triple {10712#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {10712#true} is VALID [2022-02-21 03:10:19,701 INFO L290 TraceCheckUtils]: 10: Hoare triple {10712#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {10712#true} is VALID [2022-02-21 03:10:19,701 INFO L290 TraceCheckUtils]: 11: Hoare triple {10712#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {10735#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:19,701 INFO L290 TraceCheckUtils]: 12: Hoare triple {10735#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {10736#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:19,702 INFO L290 TraceCheckUtils]: 13: Hoare triple {10736#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {10736#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:19,702 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {10736#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {10712#true} #351#return; {10724#(= |ULTIMATE.start_main_#t~ret23#1| 0)} is VALID [2022-02-21 03:10:19,703 INFO L290 TraceCheckUtils]: 15: Hoare triple {10724#(= |ULTIMATE.start_main_#t~ret23#1| 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {10725#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:19,703 INFO L272 TraceCheckUtils]: 16: Hoare triple {10725#(= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {10712#true} is VALID [2022-02-21 03:10:19,703 INFO L290 TraceCheckUtils]: 17: Hoare triple {10712#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {10712#true} is VALID [2022-02-21 03:10:19,703 INFO L290 TraceCheckUtils]: 18: Hoare triple {10712#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {10712#true} is VALID [2022-02-21 03:10:19,703 INFO L290 TraceCheckUtils]: 19: Hoare triple {10712#true} #res := ~__retres4~0; {10712#true} is VALID [2022-02-21 03:10:19,703 INFO L290 TraceCheckUtils]: 20: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-02-21 03:10:19,704 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10712#true} {10725#(= |ULTIMATE.start_main_~a~0#1| 0)} #353#return; {10725#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:19,704 INFO L290 TraceCheckUtils]: 22: Hoare triple {10725#(= |ULTIMATE.start_main_~a~0#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {10725#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:19,704 INFO L272 TraceCheckUtils]: 23: Hoare triple {10725#(= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {10731#(= |addflt_#in~a| 0)} is VALID [2022-02-21 03:10:19,705 INFO L290 TraceCheckUtils]: 24: Hoare triple {10731#(= |addflt_#in~a| 0)} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {10732#(= addflt_~a 0)} is VALID [2022-02-21 03:10:19,705 INFO L290 TraceCheckUtils]: 25: Hoare triple {10732#(= addflt_~a 0)} assume ~a % 4294967296 < ~b % 4294967296;~tmp~0 := ~a;~a := ~b;~b := ~tmp~0; {10733#(= addflt_~b 0)} is VALID [2022-02-21 03:10:19,705 INFO L290 TraceCheckUtils]: 26: Hoare triple {10733#(= addflt_~b 0)} assume !(0 == ~b % 4294967296); {10713#false} is VALID [2022-02-21 03:10:19,705 INFO L290 TraceCheckUtils]: 27: Hoare triple {10713#false} assume 0 == ~a;~ma~0 := 0; {10713#false} is VALID [2022-02-21 03:10:19,705 INFO L290 TraceCheckUtils]: 28: Hoare triple {10713#false} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {10713#false} is VALID [2022-02-21 03:10:19,705 INFO L290 TraceCheckUtils]: 29: Hoare triple {10713#false} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {10713#false} is VALID [2022-02-21 03:10:19,705 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:19,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:10:19,985 INFO L290 TraceCheckUtils]: 29: Hoare triple {10713#false} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {10713#false} is VALID [2022-02-21 03:10:19,985 INFO L290 TraceCheckUtils]: 28: Hoare triple {10713#false} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {10713#false} is VALID [2022-02-21 03:10:19,985 INFO L290 TraceCheckUtils]: 27: Hoare triple {10713#false} assume 0 == ~a;~ma~0 := 0; {10713#false} is VALID [2022-02-21 03:10:19,985 INFO L290 TraceCheckUtils]: 26: Hoare triple {10838#(= (mod addflt_~b 4294967296) 0)} assume !(0 == ~b % 4294967296); {10713#false} is VALID [2022-02-21 03:10:19,986 INFO L290 TraceCheckUtils]: 25: Hoare triple {10842#(= (mod addflt_~a 4294967296) 0)} assume ~a % 4294967296 < ~b % 4294967296;~tmp~0 := ~a;~a := ~b;~b := ~tmp~0; {10838#(= (mod addflt_~b 4294967296) 0)} is VALID [2022-02-21 03:10:19,986 INFO L290 TraceCheckUtils]: 24: Hoare triple {10846#(= (mod |addflt_#in~a| 4294967296) 0)} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {10842#(= (mod addflt_~a 4294967296) 0)} is VALID [2022-02-21 03:10:19,987 INFO L272 TraceCheckUtils]: 23: Hoare triple {10850#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {10846#(= (mod |addflt_#in~a| 4294967296) 0)} is VALID [2022-02-21 03:10:19,987 INFO L290 TraceCheckUtils]: 22: Hoare triple {10850#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {10850#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:19,988 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10712#true} {10850#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} #353#return; {10850#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:19,988 INFO L290 TraceCheckUtils]: 20: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-02-21 03:10:19,988 INFO L290 TraceCheckUtils]: 19: Hoare triple {10712#true} #res := ~__retres4~0; {10712#true} is VALID [2022-02-21 03:10:19,988 INFO L290 TraceCheckUtils]: 18: Hoare triple {10712#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {10712#true} is VALID [2022-02-21 03:10:19,988 INFO L290 TraceCheckUtils]: 17: Hoare triple {10712#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {10712#true} is VALID [2022-02-21 03:10:19,989 INFO L272 TraceCheckUtils]: 16: Hoare triple {10850#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {10712#true} is VALID [2022-02-21 03:10:19,989 INFO L290 TraceCheckUtils]: 15: Hoare triple {10875#(= (mod |ULTIMATE.start_main_#t~ret23#1| 4294967296) 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {10850#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:19,990 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {10882#(= (mod |base2flt_#res| 4294967296) 0)} {10712#true} #351#return; {10875#(= (mod |ULTIMATE.start_main_#t~ret23#1| 4294967296) 0)} is VALID [2022-02-21 03:10:19,990 INFO L290 TraceCheckUtils]: 13: Hoare triple {10882#(= (mod |base2flt_#res| 4294967296) 0)} assume true; {10882#(= (mod |base2flt_#res| 4294967296) 0)} is VALID [2022-02-21 03:10:19,990 INFO L290 TraceCheckUtils]: 12: Hoare triple {10889#(= (mod base2flt_~__retres4~0 4294967296) 0)} #res := ~__retres4~0; {10882#(= (mod |base2flt_#res| 4294967296) 0)} is VALID [2022-02-21 03:10:19,991 INFO L290 TraceCheckUtils]: 11: Hoare triple {10712#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {10889#(= (mod base2flt_~__retres4~0 4294967296) 0)} is VALID [2022-02-21 03:10:19,991 INFO L290 TraceCheckUtils]: 10: Hoare triple {10712#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {10712#true} is VALID [2022-02-21 03:10:19,991 INFO L272 TraceCheckUtils]: 9: Hoare triple {10712#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {10712#true} is VALID [2022-02-21 03:10:19,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {10712#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {10712#true} is VALID [2022-02-21 03:10:19,991 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10712#true} {10712#true} #349#return; {10712#true} is VALID [2022-02-21 03:10:19,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-02-21 03:10:19,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {10712#true} #res := ~__retres4~0; {10712#true} is VALID [2022-02-21 03:10:19,991 INFO L290 TraceCheckUtils]: 4: Hoare triple {10712#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {10712#true} is VALID [2022-02-21 03:10:19,992 INFO L290 TraceCheckUtils]: 3: Hoare triple {10712#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {10712#true} is VALID [2022-02-21 03:10:19,992 INFO L272 TraceCheckUtils]: 2: Hoare triple {10712#true} call main_#t~ret22#1 := base2flt(0, 0); {10712#true} is VALID [2022-02-21 03:10:19,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {10712#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {10712#true} is VALID [2022-02-21 03:10:19,992 INFO L290 TraceCheckUtils]: 0: Hoare triple {10712#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); {10712#true} is VALID [2022-02-21 03:10:19,992 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:19,992 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518549263] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:10:19,992 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:10:19,992 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 19 [2022-02-21 03:10:19,993 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237871711] [2022-02-21 03:10:19,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:10:19,993 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 14 states have internal predecessors, (31), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 30 [2022-02-21 03:10:19,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:19,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 14 states have internal predecessors, (31), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:20,025 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:20,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-21 03:10:20,025 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:20,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-21 03:10:20,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2022-02-21 03:10:20,026 INFO L87 Difference]: Start difference. First operand 183 states and 249 transitions. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 14 states have internal predecessors, (31), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:23,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:23,784 INFO L93 Difference]: Finished difference Result 601 states and 806 transitions. [2022-02-21 03:10:23,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-21 03:10:23,785 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 14 states have internal predecessors, (31), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 30 [2022-02-21 03:10:23,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:23,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 14 states have internal predecessors, (31), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:23,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 577 transitions. [2022-02-21 03:10:23,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 14 states have internal predecessors, (31), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:23,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 577 transitions. [2022-02-21 03:10:23,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 577 transitions. [2022-02-21 03:10:24,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 577 edges. 577 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:24,197 INFO L225 Difference]: With dead ends: 601 [2022-02-21 03:10:24,197 INFO L226 Difference]: Without dead ends: 423 [2022-02-21 03:10:24,198 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=187, Invalid=1145, Unknown=0, NotChecked=0, Total=1332 [2022-02-21 03:10:24,198 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 507 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 2115 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 2176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:24,198 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [512 Valid, 697 Invalid, 2176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2115 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-02-21 03:10:24,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-02-21 03:10:24,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 155. [2022-02-21 03:10:24,257 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:24,257 INFO L82 GeneralOperation]: Start isEquivalent. First operand 423 states. Second operand has 155 states, 128 states have (on average 1.4296875) internal successors, (183), 139 states have internal predecessors, (183), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-02-21 03:10:24,257 INFO L74 IsIncluded]: Start isIncluded. First operand 423 states. Second operand has 155 states, 128 states have (on average 1.4296875) internal successors, (183), 139 states have internal predecessors, (183), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-02-21 03:10:24,258 INFO L87 Difference]: Start difference. First operand 423 states. Second operand has 155 states, 128 states have (on average 1.4296875) internal successors, (183), 139 states have internal predecessors, (183), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-02-21 03:10:24,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:24,266 INFO L93 Difference]: Finished difference Result 423 states and 556 transitions. [2022-02-21 03:10:24,266 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 556 transitions. [2022-02-21 03:10:24,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:24,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:24,268 INFO L74 IsIncluded]: Start isIncluded. First operand has 155 states, 128 states have (on average 1.4296875) internal successors, (183), 139 states have internal predecessors, (183), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Second operand 423 states. [2022-02-21 03:10:24,268 INFO L87 Difference]: Start difference. First operand has 155 states, 128 states have (on average 1.4296875) internal successors, (183), 139 states have internal predecessors, (183), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Second operand 423 states. [2022-02-21 03:10:24,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:24,277 INFO L93 Difference]: Finished difference Result 423 states and 556 transitions. [2022-02-21 03:10:24,277 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 556 transitions. [2022-02-21 03:10:24,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:24,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:24,278 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:24,278 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:24,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 128 states have (on average 1.4296875) internal successors, (183), 139 states have internal predecessors, (183), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-02-21 03:10:24,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 203 transitions. [2022-02-21 03:10:24,281 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 203 transitions. Word has length 30 [2022-02-21 03:10:24,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:24,281 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 203 transitions. [2022-02-21 03:10:24,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 14 states have internal predecessors, (31), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:24,281 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 203 transitions. [2022-02-21 03:10:24,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-21 03:10:24,282 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:24,282 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:24,298 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:24,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:24,495 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:24,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:24,496 INFO L85 PathProgramCache]: Analyzing trace with hash -809815083, now seen corresponding path program 1 times [2022-02-21 03:10:24,496 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:24,496 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967374327] [2022-02-21 03:10:24,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:24,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:24,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:24,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:24,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:24,545 INFO L290 TraceCheckUtils]: 0: Hoare triple {12709#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12683#true} is VALID [2022-02-21 03:10:24,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {12683#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {12683#true} is VALID [2022-02-21 03:10:24,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {12683#true} #res := ~__retres4~0; {12683#true} is VALID [2022-02-21 03:10:24,545 INFO L290 TraceCheckUtils]: 3: Hoare triple {12683#true} assume true; {12683#true} is VALID [2022-02-21 03:10:24,545 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {12683#true} {12683#true} #349#return; {12683#true} is VALID [2022-02-21 03:10:24,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:24,549 INFO L290 TraceCheckUtils]: 0: Hoare triple {12709#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12683#true} is VALID [2022-02-21 03:10:24,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {12683#true} assume !(0 == ~m % 4294967296); {12683#true} is VALID [2022-02-21 03:10:24,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {12683#true} assume !(~m % 4294967296 < 16777216); {12683#true} is VALID [2022-02-21 03:10:24,550 INFO L290 TraceCheckUtils]: 3: Hoare triple {12683#true} assume !false; {12683#true} is VALID [2022-02-21 03:10:24,550 INFO L290 TraceCheckUtils]: 4: Hoare triple {12683#true} assume ~m % 4294967296 >= 33554432; {12683#true} is VALID [2022-02-21 03:10:24,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {12683#true} assume ~e >= 127;~__retres4~0 := 4294967295; {12683#true} is VALID [2022-02-21 03:10:24,550 INFO L290 TraceCheckUtils]: 6: Hoare triple {12683#true} #res := ~__retres4~0; {12683#true} is VALID [2022-02-21 03:10:24,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {12683#true} assume true; {12683#true} is VALID [2022-02-21 03:10:24,550 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {12683#true} {12683#true} #351#return; {12683#true} is VALID [2022-02-21 03:10:24,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-21 03:10:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:24,576 INFO L290 TraceCheckUtils]: 0: Hoare triple {12709#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12683#true} is VALID [2022-02-21 03:10:24,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {12683#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {12710#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:24,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {12710#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {12711#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:24,577 INFO L290 TraceCheckUtils]: 3: Hoare triple {12711#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {12711#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:24,578 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {12711#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {12683#true} #353#return; {12704#(= |ULTIMATE.start_main_#t~ret24#1| 0)} is VALID [2022-02-21 03:10:24,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {12683#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); {12683#true} is VALID [2022-02-21 03:10:24,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {12683#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {12683#true} is VALID [2022-02-21 03:10:24,578 INFO L272 TraceCheckUtils]: 2: Hoare triple {12683#true} call main_#t~ret22#1 := base2flt(0, 0); {12709#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:24,578 INFO L290 TraceCheckUtils]: 3: Hoare triple {12709#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12683#true} is VALID [2022-02-21 03:10:24,579 INFO L290 TraceCheckUtils]: 4: Hoare triple {12683#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {12683#true} is VALID [2022-02-21 03:10:24,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {12683#true} #res := ~__retres4~0; {12683#true} is VALID [2022-02-21 03:10:24,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {12683#true} assume true; {12683#true} is VALID [2022-02-21 03:10:24,579 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {12683#true} {12683#true} #349#return; {12683#true} is VALID [2022-02-21 03:10:24,579 INFO L290 TraceCheckUtils]: 8: Hoare triple {12683#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {12683#true} is VALID [2022-02-21 03:10:24,580 INFO L272 TraceCheckUtils]: 9: Hoare triple {12683#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {12709#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:24,580 INFO L290 TraceCheckUtils]: 10: Hoare triple {12709#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12683#true} is VALID [2022-02-21 03:10:24,580 INFO L290 TraceCheckUtils]: 11: Hoare triple {12683#true} assume !(0 == ~m % 4294967296); {12683#true} is VALID [2022-02-21 03:10:24,580 INFO L290 TraceCheckUtils]: 12: Hoare triple {12683#true} assume !(~m % 4294967296 < 16777216); {12683#true} is VALID [2022-02-21 03:10:24,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {12683#true} assume !false; {12683#true} is VALID [2022-02-21 03:10:24,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {12683#true} assume ~m % 4294967296 >= 33554432; {12683#true} is VALID [2022-02-21 03:10:24,580 INFO L290 TraceCheckUtils]: 15: Hoare triple {12683#true} assume ~e >= 127;~__retres4~0 := 4294967295; {12683#true} is VALID [2022-02-21 03:10:24,580 INFO L290 TraceCheckUtils]: 16: Hoare triple {12683#true} #res := ~__retres4~0; {12683#true} is VALID [2022-02-21 03:10:24,581 INFO L290 TraceCheckUtils]: 17: Hoare triple {12683#true} assume true; {12683#true} is VALID [2022-02-21 03:10:24,581 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12683#true} {12683#true} #351#return; {12683#true} is VALID [2022-02-21 03:10:24,581 INFO L290 TraceCheckUtils]: 19: Hoare triple {12683#true} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {12683#true} is VALID [2022-02-21 03:10:24,581 INFO L272 TraceCheckUtils]: 20: Hoare triple {12683#true} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {12709#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:24,581 INFO L290 TraceCheckUtils]: 21: Hoare triple {12709#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12683#true} is VALID [2022-02-21 03:10:24,582 INFO L290 TraceCheckUtils]: 22: Hoare triple {12683#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {12710#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:24,582 INFO L290 TraceCheckUtils]: 23: Hoare triple {12710#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {12711#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:24,582 INFO L290 TraceCheckUtils]: 24: Hoare triple {12711#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {12711#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:24,583 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {12711#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {12683#true} #353#return; {12704#(= |ULTIMATE.start_main_#t~ret24#1| 0)} is VALID [2022-02-21 03:10:24,583 INFO L290 TraceCheckUtils]: 26: Hoare triple {12704#(= |ULTIMATE.start_main_#t~ret24#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {12705#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-21 03:10:24,584 INFO L272 TraceCheckUtils]: 27: Hoare triple {12705#(= |ULTIMATE.start_main_~b~0#1| 0)} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {12706#(= |addflt_#in~b| 0)} is VALID [2022-02-21 03:10:24,584 INFO L290 TraceCheckUtils]: 28: Hoare triple {12706#(= |addflt_#in~b| 0)} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {12707#(= addflt_~b 0)} is VALID [2022-02-21 03:10:24,584 INFO L290 TraceCheckUtils]: 29: Hoare triple {12707#(= addflt_~b 0)} assume ~a % 4294967296 < ~b % 4294967296;~tmp~0 := ~a;~a := ~b;~b := ~tmp~0; {12708#(= addflt_~a 0)} is VALID [2022-02-21 03:10:24,585 INFO L290 TraceCheckUtils]: 30: Hoare triple {12708#(= addflt_~a 0)} assume !(0 == ~b % 4294967296); {12708#(= addflt_~a 0)} is VALID [2022-02-21 03:10:24,585 INFO L290 TraceCheckUtils]: 31: Hoare triple {12708#(= addflt_~a 0)} assume !(0 == ~a); {12684#false} is VALID [2022-02-21 03:10:24,585 INFO L290 TraceCheckUtils]: 32: Hoare triple {12684#false} assume !false; {12684#false} is VALID [2022-02-21 03:10:24,585 INFO L290 TraceCheckUtils]: 33: Hoare triple {12684#false} assume !false; {12684#false} is VALID [2022-02-21 03:10:24,585 INFO L290 TraceCheckUtils]: 34: Hoare triple {12684#false} assume ~a >= 0;abs_108 := (if ~a < 16777215 then ~a else 16777215);assume ~a >= 0;assume ~ma~0 < abs_108; {12684#false} is VALID [2022-02-21 03:10:24,586 INFO L290 TraceCheckUtils]: 35: Hoare triple {12684#false} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {12684#false} is VALID [2022-02-21 03:10:24,586 INFO L290 TraceCheckUtils]: 36: Hoare triple {12684#false} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {12684#false} is VALID [2022-02-21 03:10:24,586 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-21 03:10:24,586 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:24,586 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967374327] [2022-02-21 03:10:24,586 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967374327] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:24,586 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:10:24,586 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-21 03:10:24,586 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048350063] [2022-02-21 03:10:24,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:24,587 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2022-02-21 03:10:24,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:24,588 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:24,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:24,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-21 03:10:24,606 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:24,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-21 03:10:24,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-02-21 03:10:24,607 INFO L87 Difference]: Start difference. First operand 155 states and 203 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:26,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:26,047 INFO L93 Difference]: Finished difference Result 404 states and 522 transitions. [2022-02-21 03:10:26,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 03:10:26,047 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2022-02-21 03:10:26,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:26,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:26,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 428 transitions. [2022-02-21 03:10:26,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:26,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 428 transitions. [2022-02-21 03:10:26,053 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 428 transitions. [2022-02-21 03:10:26,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 428 edges. 428 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:26,361 INFO L225 Difference]: With dead ends: 404 [2022-02-21 03:10:26,361 INFO L226 Difference]: Without dead ends: 330 [2022-02-21 03:10:26,361 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-02-21 03:10:26,362 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 467 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:26,362 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [471 Valid, 516 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-21 03:10:26,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-02-21 03:10:26,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 166. [2022-02-21 03:10:26,417 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:26,418 INFO L82 GeneralOperation]: Start isEquivalent. First operand 330 states. Second operand has 166 states, 136 states have (on average 1.4044117647058822) internal successors, (191), 148 states have internal predecessors, (191), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2022-02-21 03:10:26,418 INFO L74 IsIncluded]: Start isIncluded. First operand 330 states. Second operand has 166 states, 136 states have (on average 1.4044117647058822) internal successors, (191), 148 states have internal predecessors, (191), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2022-02-21 03:10:26,418 INFO L87 Difference]: Start difference. First operand 330 states. Second operand has 166 states, 136 states have (on average 1.4044117647058822) internal successors, (191), 148 states have internal predecessors, (191), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2022-02-21 03:10:26,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:26,424 INFO L93 Difference]: Finished difference Result 330 states and 427 transitions. [2022-02-21 03:10:26,424 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 427 transitions. [2022-02-21 03:10:26,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:26,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:26,425 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 136 states have (on average 1.4044117647058822) internal successors, (191), 148 states have internal predecessors, (191), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) Second operand 330 states. [2022-02-21 03:10:26,426 INFO L87 Difference]: Start difference. First operand has 166 states, 136 states have (on average 1.4044117647058822) internal successors, (191), 148 states have internal predecessors, (191), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) Second operand 330 states. [2022-02-21 03:10:26,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:26,431 INFO L93 Difference]: Finished difference Result 330 states and 427 transitions. [2022-02-21 03:10:26,432 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 427 transitions. [2022-02-21 03:10:26,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:26,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:26,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:26,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:26,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 136 states have (on average 1.4044117647058822) internal successors, (191), 148 states have internal predecessors, (191), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2022-02-21 03:10:26,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 215 transitions. [2022-02-21 03:10:26,435 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 215 transitions. Word has length 37 [2022-02-21 03:10:26,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:26,436 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 215 transitions. [2022-02-21 03:10:26,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:26,436 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 215 transitions. [2022-02-21 03:10:26,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-21 03:10:26,436 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:26,437 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:26,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-21 03:10:26,437 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:26,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:26,437 INFO L85 PathProgramCache]: Analyzing trace with hash 311287935, now seen corresponding path program 1 times [2022-02-21 03:10:26,437 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:26,437 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698049912] [2022-02-21 03:10:26,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:26,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:26,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:26,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:26,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:26,482 INFO L290 TraceCheckUtils]: 0: Hoare triple {14077#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14049#true} is VALID [2022-02-21 03:10:26,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {14049#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {14049#true} is VALID [2022-02-21 03:10:26,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {14049#true} #res := ~__retres4~0; {14049#true} is VALID [2022-02-21 03:10:26,483 INFO L290 TraceCheckUtils]: 3: Hoare triple {14049#true} assume true; {14049#true} is VALID [2022-02-21 03:10:26,483 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {14049#true} {14049#true} #349#return; {14049#true} is VALID [2022-02-21 03:10:26,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:26,508 INFO L290 TraceCheckUtils]: 0: Hoare triple {14077#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14049#true} is VALID [2022-02-21 03:10:26,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {14049#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {14078#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:26,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {14078#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {14079#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:26,509 INFO L290 TraceCheckUtils]: 3: Hoare triple {14079#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {14079#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:26,510 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {14079#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {14049#true} #351#return; {14061#(= |ULTIMATE.start_main_#t~ret23#1| 0)} is VALID [2022-02-21 03:10:26,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-21 03:10:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:26,513 INFO L290 TraceCheckUtils]: 0: Hoare triple {14077#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14049#true} is VALID [2022-02-21 03:10:26,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {14049#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {14049#true} is VALID [2022-02-21 03:10:26,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {14049#true} #res := ~__retres4~0; {14049#true} is VALID [2022-02-21 03:10:26,514 INFO L290 TraceCheckUtils]: 3: Hoare triple {14049#true} assume true; {14049#true} is VALID [2022-02-21 03:10:26,514 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {14049#true} {14062#(= |ULTIMATE.start_main_~a~0#1| 0)} #353#return; {14062#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:26,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-21 03:10:26,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:26,530 INFO L290 TraceCheckUtils]: 0: Hoare triple {14080#(and (= abs_110 |old(abs_110)|) (= abs_140 |old(abs_140)|) (= abs_113 |old(abs_113)|) (= abs_111 |old(abs_111)|) (= abs_108 |old(abs_108)|) (= abs_141 |old(abs_141)|))} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {14049#true} is VALID [2022-02-21 03:10:26,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {14049#true} assume !(~a % 4294967296 < ~b % 4294967296); {14049#true} is VALID [2022-02-21 03:10:26,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {14049#true} assume 0 == ~b % 4294967296;~__retres10~0 := ~a; {14049#true} is VALID [2022-02-21 03:10:26,530 INFO L290 TraceCheckUtils]: 3: Hoare triple {14049#true} #res := ~__retres10~0; {14049#true} is VALID [2022-02-21 03:10:26,530 INFO L290 TraceCheckUtils]: 4: Hoare triple {14049#true} assume true; {14049#true} is VALID [2022-02-21 03:10:26,531 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {14049#true} {14062#(= |ULTIMATE.start_main_~a~0#1| 0)} #355#return; {14062#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:26,531 INFO L290 TraceCheckUtils]: 0: Hoare triple {14049#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); {14049#true} is VALID [2022-02-21 03:10:26,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {14049#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {14049#true} is VALID [2022-02-21 03:10:26,531 INFO L272 TraceCheckUtils]: 2: Hoare triple {14049#true} call main_#t~ret22#1 := base2flt(0, 0); {14077#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:26,532 INFO L290 TraceCheckUtils]: 3: Hoare triple {14077#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14049#true} is VALID [2022-02-21 03:10:26,532 INFO L290 TraceCheckUtils]: 4: Hoare triple {14049#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {14049#true} is VALID [2022-02-21 03:10:26,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {14049#true} #res := ~__retres4~0; {14049#true} is VALID [2022-02-21 03:10:26,532 INFO L290 TraceCheckUtils]: 6: Hoare triple {14049#true} assume true; {14049#true} is VALID [2022-02-21 03:10:26,532 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14049#true} {14049#true} #349#return; {14049#true} is VALID [2022-02-21 03:10:26,532 INFO L290 TraceCheckUtils]: 8: Hoare triple {14049#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {14049#true} is VALID [2022-02-21 03:10:26,533 INFO L272 TraceCheckUtils]: 9: Hoare triple {14049#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {14077#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:26,533 INFO L290 TraceCheckUtils]: 10: Hoare triple {14077#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14049#true} is VALID [2022-02-21 03:10:26,533 INFO L290 TraceCheckUtils]: 11: Hoare triple {14049#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {14078#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:26,533 INFO L290 TraceCheckUtils]: 12: Hoare triple {14078#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {14079#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:26,534 INFO L290 TraceCheckUtils]: 13: Hoare triple {14079#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {14079#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:26,534 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {14079#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {14049#true} #351#return; {14061#(= |ULTIMATE.start_main_#t~ret23#1| 0)} is VALID [2022-02-21 03:10:26,535 INFO L290 TraceCheckUtils]: 15: Hoare triple {14061#(= |ULTIMATE.start_main_#t~ret23#1| 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {14062#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:26,535 INFO L272 TraceCheckUtils]: 16: Hoare triple {14062#(= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {14077#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:26,535 INFO L290 TraceCheckUtils]: 17: Hoare triple {14077#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14049#true} is VALID [2022-02-21 03:10:26,535 INFO L290 TraceCheckUtils]: 18: Hoare triple {14049#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {14049#true} is VALID [2022-02-21 03:10:26,536 INFO L290 TraceCheckUtils]: 19: Hoare triple {14049#true} #res := ~__retres4~0; {14049#true} is VALID [2022-02-21 03:10:26,536 INFO L290 TraceCheckUtils]: 20: Hoare triple {14049#true} assume true; {14049#true} is VALID [2022-02-21 03:10:26,536 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14049#true} {14062#(= |ULTIMATE.start_main_~a~0#1| 0)} #353#return; {14062#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:26,536 INFO L290 TraceCheckUtils]: 22: Hoare triple {14062#(= |ULTIMATE.start_main_~a~0#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {14062#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:26,537 INFO L272 TraceCheckUtils]: 23: Hoare triple {14062#(= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {14080#(and (= abs_110 |old(abs_110)|) (= abs_140 |old(abs_140)|) (= abs_113 |old(abs_113)|) (= abs_111 |old(abs_111)|) (= abs_108 |old(abs_108)|) (= abs_141 |old(abs_141)|))} is VALID [2022-02-21 03:10:26,537 INFO L290 TraceCheckUtils]: 24: Hoare triple {14080#(and (= abs_110 |old(abs_110)|) (= abs_140 |old(abs_140)|) (= abs_113 |old(abs_113)|) (= abs_111 |old(abs_111)|) (= abs_108 |old(abs_108)|) (= abs_141 |old(abs_141)|))} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {14049#true} is VALID [2022-02-21 03:10:26,537 INFO L290 TraceCheckUtils]: 25: Hoare triple {14049#true} assume !(~a % 4294967296 < ~b % 4294967296); {14049#true} is VALID [2022-02-21 03:10:26,537 INFO L290 TraceCheckUtils]: 26: Hoare triple {14049#true} assume 0 == ~b % 4294967296;~__retres10~0 := ~a; {14049#true} is VALID [2022-02-21 03:10:26,538 INFO L290 TraceCheckUtils]: 27: Hoare triple {14049#true} #res := ~__retres10~0; {14049#true} is VALID [2022-02-21 03:10:26,538 INFO L290 TraceCheckUtils]: 28: Hoare triple {14049#true} assume true; {14049#true} is VALID [2022-02-21 03:10:26,538 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {14049#true} {14062#(= |ULTIMATE.start_main_~a~0#1| 0)} #355#return; {14062#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:26,538 INFO L290 TraceCheckUtils]: 30: Hoare triple {14062#(= |ULTIMATE.start_main_~a~0#1| 0)} main_~r_add1~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {14062#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:26,539 INFO L272 TraceCheckUtils]: 31: Hoare triple {14062#(= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret26#1 := addflt(main_~b~0#1, main_~a~0#1); {14074#(= |addflt_#in~b| 0)} is VALID [2022-02-21 03:10:26,539 INFO L290 TraceCheckUtils]: 32: Hoare triple {14074#(= |addflt_#in~b| 0)} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {14075#(= addflt_~b 0)} is VALID [2022-02-21 03:10:26,540 INFO L290 TraceCheckUtils]: 33: Hoare triple {14075#(= addflt_~b 0)} assume ~a % 4294967296 < ~b % 4294967296;~tmp~0 := ~a;~a := ~b;~b := ~tmp~0; {14076#(= addflt_~a 0)} is VALID [2022-02-21 03:10:26,540 INFO L290 TraceCheckUtils]: 34: Hoare triple {14076#(= addflt_~a 0)} assume !(0 == ~b % 4294967296); {14076#(= addflt_~a 0)} is VALID [2022-02-21 03:10:26,540 INFO L290 TraceCheckUtils]: 35: Hoare triple {14076#(= addflt_~a 0)} assume !(0 == ~a); {14050#false} is VALID [2022-02-21 03:10:26,540 INFO L290 TraceCheckUtils]: 36: Hoare triple {14050#false} assume !false; {14050#false} is VALID [2022-02-21 03:10:26,540 INFO L290 TraceCheckUtils]: 37: Hoare triple {14050#false} assume !false; {14050#false} is VALID [2022-02-21 03:10:26,540 INFO L290 TraceCheckUtils]: 38: Hoare triple {14050#false} assume ~a >= 0;abs_108 := (if ~a < 16777215 then ~a else 16777215);assume ~a >= 0;assume ~ma~0 < abs_108; {14050#false} is VALID [2022-02-21 03:10:26,540 INFO L290 TraceCheckUtils]: 39: Hoare triple {14050#false} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {14050#false} is VALID [2022-02-21 03:10:26,541 INFO L290 TraceCheckUtils]: 40: Hoare triple {14050#false} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {14050#false} is VALID [2022-02-21 03:10:26,541 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-21 03:10:26,541 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:26,541 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698049912] [2022-02-21 03:10:26,541 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698049912] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:26,541 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538968382] [2022-02-21 03:10:26,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:26,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:26,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:26,560 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:26,561 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:26,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:26,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-21 03:10:26,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:26,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:26,902 INFO L290 TraceCheckUtils]: 0: Hoare triple {14049#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); {14049#true} is VALID [2022-02-21 03:10:26,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {14049#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {14049#true} is VALID [2022-02-21 03:10:26,903 INFO L272 TraceCheckUtils]: 2: Hoare triple {14049#true} call main_#t~ret22#1 := base2flt(0, 0); {14049#true} is VALID [2022-02-21 03:10:26,903 INFO L290 TraceCheckUtils]: 3: Hoare triple {14049#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14049#true} is VALID [2022-02-21 03:10:26,903 INFO L290 TraceCheckUtils]: 4: Hoare triple {14049#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {14049#true} is VALID [2022-02-21 03:10:26,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {14049#true} #res := ~__retres4~0; {14049#true} is VALID [2022-02-21 03:10:26,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {14049#true} assume true; {14049#true} is VALID [2022-02-21 03:10:26,903 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14049#true} {14049#true} #349#return; {14049#true} is VALID [2022-02-21 03:10:26,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {14049#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {14049#true} is VALID [2022-02-21 03:10:26,903 INFO L272 TraceCheckUtils]: 9: Hoare triple {14049#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {14049#true} is VALID [2022-02-21 03:10:26,904 INFO L290 TraceCheckUtils]: 10: Hoare triple {14049#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14049#true} is VALID [2022-02-21 03:10:26,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {14049#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {14117#(<= base2flt_~__retres4~0 0)} is VALID [2022-02-21 03:10:26,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {14117#(<= base2flt_~__retres4~0 0)} #res := ~__retres4~0; {14121#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:10:26,905 INFO L290 TraceCheckUtils]: 13: Hoare triple {14121#(<= |base2flt_#res| 0)} assume true; {14121#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:10:26,905 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {14121#(<= |base2flt_#res| 0)} {14049#true} #351#return; {14128#(<= |ULTIMATE.start_main_#t~ret23#1| 0)} is VALID [2022-02-21 03:10:26,906 INFO L290 TraceCheckUtils]: 15: Hoare triple {14128#(<= |ULTIMATE.start_main_#t~ret23#1| 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {14132#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:26,906 INFO L272 TraceCheckUtils]: 16: Hoare triple {14132#(<= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {14049#true} is VALID [2022-02-21 03:10:26,906 INFO L290 TraceCheckUtils]: 17: Hoare triple {14049#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14049#true} is VALID [2022-02-21 03:10:26,906 INFO L290 TraceCheckUtils]: 18: Hoare triple {14049#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {14049#true} is VALID [2022-02-21 03:10:26,906 INFO L290 TraceCheckUtils]: 19: Hoare triple {14049#true} #res := ~__retres4~0; {14049#true} is VALID [2022-02-21 03:10:26,906 INFO L290 TraceCheckUtils]: 20: Hoare triple {14049#true} assume true; {14049#true} is VALID [2022-02-21 03:10:26,907 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14049#true} {14132#(<= |ULTIMATE.start_main_~a~0#1| 0)} #353#return; {14132#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:26,907 INFO L290 TraceCheckUtils]: 22: Hoare triple {14132#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {14132#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:26,907 INFO L272 TraceCheckUtils]: 23: Hoare triple {14132#(<= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {14049#true} is VALID [2022-02-21 03:10:26,907 INFO L290 TraceCheckUtils]: 24: Hoare triple {14049#true} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {14049#true} is VALID [2022-02-21 03:10:26,907 INFO L290 TraceCheckUtils]: 25: Hoare triple {14049#true} assume !(~a % 4294967296 < ~b % 4294967296); {14049#true} is VALID [2022-02-21 03:10:26,907 INFO L290 TraceCheckUtils]: 26: Hoare triple {14049#true} assume 0 == ~b % 4294967296;~__retres10~0 := ~a; {14049#true} is VALID [2022-02-21 03:10:26,907 INFO L290 TraceCheckUtils]: 27: Hoare triple {14049#true} #res := ~__retres10~0; {14049#true} is VALID [2022-02-21 03:10:26,908 INFO L290 TraceCheckUtils]: 28: Hoare triple {14049#true} assume true; {14049#true} is VALID [2022-02-21 03:10:26,908 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {14049#true} {14132#(<= |ULTIMATE.start_main_~a~0#1| 0)} #355#return; {14132#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:26,908 INFO L290 TraceCheckUtils]: 30: Hoare triple {14132#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_~r_add1~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {14132#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:26,909 INFO L272 TraceCheckUtils]: 31: Hoare triple {14132#(<= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret26#1 := addflt(main_~b~0#1, main_~a~0#1); {14181#(<= |addflt_#in~b| 0)} is VALID [2022-02-21 03:10:26,909 INFO L290 TraceCheckUtils]: 32: Hoare triple {14181#(<= |addflt_#in~b| 0)} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {14185#(<= addflt_~b 0)} is VALID [2022-02-21 03:10:26,909 INFO L290 TraceCheckUtils]: 33: Hoare triple {14185#(<= addflt_~b 0)} assume ~a % 4294967296 < ~b % 4294967296;~tmp~0 := ~a;~a := ~b;~b := ~tmp~0; {14189#(<= addflt_~a 0)} is VALID [2022-02-21 03:10:26,910 INFO L290 TraceCheckUtils]: 34: Hoare triple {14189#(<= addflt_~a 0)} assume !(0 == ~b % 4294967296); {14189#(<= addflt_~a 0)} is VALID [2022-02-21 03:10:26,910 INFO L290 TraceCheckUtils]: 35: Hoare triple {14189#(<= addflt_~a 0)} assume !(0 == ~a); {14196#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} is VALID [2022-02-21 03:10:26,910 INFO L290 TraceCheckUtils]: 36: Hoare triple {14196#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} assume !false; {14196#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} is VALID [2022-02-21 03:10:26,911 INFO L290 TraceCheckUtils]: 37: Hoare triple {14196#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} assume !false; {14196#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} is VALID [2022-02-21 03:10:26,911 INFO L290 TraceCheckUtils]: 38: Hoare triple {14196#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} assume ~a >= 0;abs_108 := (if ~a < 16777215 then ~a else 16777215);assume ~a >= 0;assume ~ma~0 < abs_108; {14050#false} is VALID [2022-02-21 03:10:26,911 INFO L290 TraceCheckUtils]: 39: Hoare triple {14050#false} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {14050#false} is VALID [2022-02-21 03:10:26,911 INFO L290 TraceCheckUtils]: 40: Hoare triple {14050#false} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {14050#false} is VALID [2022-02-21 03:10:26,912 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-21 03:10:26,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:10:27,153 INFO L290 TraceCheckUtils]: 40: Hoare triple {14050#false} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {14050#false} is VALID [2022-02-21 03:10:27,153 INFO L290 TraceCheckUtils]: 39: Hoare triple {14050#false} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {14050#false} is VALID [2022-02-21 03:10:27,154 INFO L290 TraceCheckUtils]: 38: Hoare triple {14196#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} assume ~a >= 0;abs_108 := (if ~a < 16777215 then ~a else 16777215);assume ~a >= 0;assume ~ma~0 < abs_108; {14050#false} is VALID [2022-02-21 03:10:27,154 INFO L290 TraceCheckUtils]: 37: Hoare triple {14196#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} assume !false; {14196#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} is VALID [2022-02-21 03:10:27,154 INFO L290 TraceCheckUtils]: 36: Hoare triple {14196#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} assume !false; {14196#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} is VALID [2022-02-21 03:10:27,155 INFO L290 TraceCheckUtils]: 35: Hoare triple {14189#(<= addflt_~a 0)} assume !(0 == ~a); {14196#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} is VALID [2022-02-21 03:10:27,155 INFO L290 TraceCheckUtils]: 34: Hoare triple {14189#(<= addflt_~a 0)} assume !(0 == ~b % 4294967296); {14189#(<= addflt_~a 0)} is VALID [2022-02-21 03:10:27,155 INFO L290 TraceCheckUtils]: 33: Hoare triple {14185#(<= addflt_~b 0)} assume ~a % 4294967296 < ~b % 4294967296;~tmp~0 := ~a;~a := ~b;~b := ~tmp~0; {14189#(<= addflt_~a 0)} is VALID [2022-02-21 03:10:27,156 INFO L290 TraceCheckUtils]: 32: Hoare triple {14181#(<= |addflt_#in~b| 0)} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {14185#(<= addflt_~b 0)} is VALID [2022-02-21 03:10:27,156 INFO L272 TraceCheckUtils]: 31: Hoare triple {14132#(<= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret26#1 := addflt(main_~b~0#1, main_~a~0#1); {14181#(<= |addflt_#in~b| 0)} is VALID [2022-02-21 03:10:27,157 INFO L290 TraceCheckUtils]: 30: Hoare triple {14132#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_~r_add1~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {14132#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:27,157 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {14049#true} {14132#(<= |ULTIMATE.start_main_~a~0#1| 0)} #355#return; {14132#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:27,157 INFO L290 TraceCheckUtils]: 28: Hoare triple {14049#true} assume true; {14049#true} is VALID [2022-02-21 03:10:27,158 INFO L290 TraceCheckUtils]: 27: Hoare triple {14049#true} #res := ~__retres10~0; {14049#true} is VALID [2022-02-21 03:10:27,158 INFO L290 TraceCheckUtils]: 26: Hoare triple {14049#true} assume 0 == ~b % 4294967296;~__retres10~0 := ~a; {14049#true} is VALID [2022-02-21 03:10:27,158 INFO L290 TraceCheckUtils]: 25: Hoare triple {14049#true} assume !(~a % 4294967296 < ~b % 4294967296); {14049#true} is VALID [2022-02-21 03:10:27,158 INFO L290 TraceCheckUtils]: 24: Hoare triple {14049#true} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {14049#true} is VALID [2022-02-21 03:10:27,158 INFO L272 TraceCheckUtils]: 23: Hoare triple {14132#(<= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {14049#true} is VALID [2022-02-21 03:10:27,158 INFO L290 TraceCheckUtils]: 22: Hoare triple {14132#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {14132#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:27,159 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14049#true} {14132#(<= |ULTIMATE.start_main_~a~0#1| 0)} #353#return; {14132#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:27,159 INFO L290 TraceCheckUtils]: 20: Hoare triple {14049#true} assume true; {14049#true} is VALID [2022-02-21 03:10:27,159 INFO L290 TraceCheckUtils]: 19: Hoare triple {14049#true} #res := ~__retres4~0; {14049#true} is VALID [2022-02-21 03:10:27,159 INFO L290 TraceCheckUtils]: 18: Hoare triple {14049#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {14049#true} is VALID [2022-02-21 03:10:27,159 INFO L290 TraceCheckUtils]: 17: Hoare triple {14049#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14049#true} is VALID [2022-02-21 03:10:27,159 INFO L272 TraceCheckUtils]: 16: Hoare triple {14132#(<= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {14049#true} is VALID [2022-02-21 03:10:27,160 INFO L290 TraceCheckUtils]: 15: Hoare triple {14128#(<= |ULTIMATE.start_main_#t~ret23#1| 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {14132#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:27,160 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {14121#(<= |base2flt_#res| 0)} {14049#true} #351#return; {14128#(<= |ULTIMATE.start_main_#t~ret23#1| 0)} is VALID [2022-02-21 03:10:27,161 INFO L290 TraceCheckUtils]: 13: Hoare triple {14121#(<= |base2flt_#res| 0)} assume true; {14121#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:10:27,161 INFO L290 TraceCheckUtils]: 12: Hoare triple {14117#(<= base2flt_~__retres4~0 0)} #res := ~__retres4~0; {14121#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:10:27,161 INFO L290 TraceCheckUtils]: 11: Hoare triple {14049#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {14117#(<= base2flt_~__retres4~0 0)} is VALID [2022-02-21 03:10:27,162 INFO L290 TraceCheckUtils]: 10: Hoare triple {14049#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14049#true} is VALID [2022-02-21 03:10:27,162 INFO L272 TraceCheckUtils]: 9: Hoare triple {14049#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {14049#true} is VALID [2022-02-21 03:10:27,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {14049#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {14049#true} is VALID [2022-02-21 03:10:27,162 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14049#true} {14049#true} #349#return; {14049#true} is VALID [2022-02-21 03:10:27,162 INFO L290 TraceCheckUtils]: 6: Hoare triple {14049#true} assume true; {14049#true} is VALID [2022-02-21 03:10:27,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {14049#true} #res := ~__retres4~0; {14049#true} is VALID [2022-02-21 03:10:27,162 INFO L290 TraceCheckUtils]: 4: Hoare triple {14049#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {14049#true} is VALID [2022-02-21 03:10:27,162 INFO L290 TraceCheckUtils]: 3: Hoare triple {14049#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14049#true} is VALID [2022-02-21 03:10:27,162 INFO L272 TraceCheckUtils]: 2: Hoare triple {14049#true} call main_#t~ret22#1 := base2flt(0, 0); {14049#true} is VALID [2022-02-21 03:10:27,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {14049#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {14049#true} is VALID [2022-02-21 03:10:27,163 INFO L290 TraceCheckUtils]: 0: Hoare triple {14049#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); {14049#true} is VALID [2022-02-21 03:10:27,163 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-21 03:10:27,163 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538968382] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:10:27,163 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:10:27,163 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 19 [2022-02-21 03:10:27,163 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213687065] [2022-02-21 03:10:27,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:10:27,164 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 41 [2022-02-21 03:10:27,164 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:27,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-21 03:10:27,205 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:27,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-21 03:10:27,205 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:27,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-21 03:10:27,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2022-02-21 03:10:27,206 INFO L87 Difference]: Start difference. First operand 166 states and 215 transitions. Second operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-21 03:10:34,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:34,068 INFO L93 Difference]: Finished difference Result 793 states and 1023 transitions. [2022-02-21 03:10:34,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-21 03:10:34,068 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 41 [2022-02-21 03:10:34,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:34,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-21 03:10:34,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 939 transitions. [2022-02-21 03:10:34,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-21 03:10:34,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 939 transitions. [2022-02-21 03:10:34,081 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 939 transitions. [2022-02-21 03:10:34,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 939 edges. 939 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:34,851 INFO L225 Difference]: With dead ends: 793 [2022-02-21 03:10:34,852 INFO L226 Difference]: Without dead ends: 704 [2022-02-21 03:10:34,852 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=213, Invalid=1193, Unknown=0, NotChecked=0, Total=1406 [2022-02-21 03:10:34,853 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 1262 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 3719 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1265 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 3892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 3719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:34,853 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1265 Valid, 387 Invalid, 3892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 3719 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-02-21 03:10:34,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2022-02-21 03:10:34,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 153. [2022-02-21 03:10:34,904 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:34,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 704 states. Second operand has 153 states, 127 states have (on average 1.4094488188976377) internal successors, (179), 138 states have internal predecessors, (179), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-02-21 03:10:34,904 INFO L74 IsIncluded]: Start isIncluded. First operand 704 states. Second operand has 153 states, 127 states have (on average 1.4094488188976377) internal successors, (179), 138 states have internal predecessors, (179), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-02-21 03:10:34,904 INFO L87 Difference]: Start difference. First operand 704 states. Second operand has 153 states, 127 states have (on average 1.4094488188976377) internal successors, (179), 138 states have internal predecessors, (179), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-02-21 03:10:34,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:34,921 INFO L93 Difference]: Finished difference Result 704 states and 910 transitions. [2022-02-21 03:10:34,921 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 910 transitions. [2022-02-21 03:10:34,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:34,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:34,925 INFO L74 IsIncluded]: Start isIncluded. First operand has 153 states, 127 states have (on average 1.4094488188976377) internal successors, (179), 138 states have internal predecessors, (179), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Second operand 704 states. [2022-02-21 03:10:34,925 INFO L87 Difference]: Start difference. First operand has 153 states, 127 states have (on average 1.4094488188976377) internal successors, (179), 138 states have internal predecessors, (179), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Second operand 704 states. [2022-02-21 03:10:34,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:34,942 INFO L93 Difference]: Finished difference Result 704 states and 910 transitions. [2022-02-21 03:10:34,942 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 910 transitions. [2022-02-21 03:10:34,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:34,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:34,945 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:34,945 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:34,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 127 states have (on average 1.4094488188976377) internal successors, (179), 138 states have internal predecessors, (179), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-02-21 03:10:34,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 197 transitions. [2022-02-21 03:10:34,948 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 197 transitions. Word has length 41 [2022-02-21 03:10:34,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:34,948 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 197 transitions. [2022-02-21 03:10:34,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-21 03:10:34,948 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 197 transitions. [2022-02-21 03:10:34,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-21 03:10:34,948 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:34,949 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:34,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-02-21 03:10:35,163 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:35,163 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:35,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:35,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1966221434, now seen corresponding path program 2 times [2022-02-21 03:10:35,164 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:35,164 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495987578] [2022-02-21 03:10:35,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:35,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:35,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:35,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:35,305 INFO L290 TraceCheckUtils]: 0: Hoare triple {16887#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {16856#true} is VALID [2022-02-21 03:10:35,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {16856#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {16856#true} is VALID [2022-02-21 03:10:35,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {16856#true} #res := ~__retres4~0; {16856#true} is VALID [2022-02-21 03:10:35,306 INFO L290 TraceCheckUtils]: 3: Hoare triple {16856#true} assume true; {16856#true} is VALID [2022-02-21 03:10:35,306 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {16856#true} {16856#true} #349#return; {16856#true} is VALID [2022-02-21 03:10:35,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:35,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:35,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {16887#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {16856#true} is VALID [2022-02-21 03:10:35,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {16856#true} assume !(0 == ~m % 4294967296); {16856#true} is VALID [2022-02-21 03:10:35,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {16856#true} assume !(~m % 4294967296 < 16777216); {16856#true} is VALID [2022-02-21 03:10:35,311 INFO L290 TraceCheckUtils]: 3: Hoare triple {16856#true} assume !false; {16856#true} is VALID [2022-02-21 03:10:35,311 INFO L290 TraceCheckUtils]: 4: Hoare triple {16856#true} assume ~m % 4294967296 >= 33554432; {16856#true} is VALID [2022-02-21 03:10:35,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {16856#true} assume ~e >= 127;~__retres4~0 := 4294967295; {16856#true} is VALID [2022-02-21 03:10:35,311 INFO L290 TraceCheckUtils]: 6: Hoare triple {16856#true} #res := ~__retres4~0; {16856#true} is VALID [2022-02-21 03:10:35,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {16856#true} assume true; {16856#true} is VALID [2022-02-21 03:10:35,311 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {16856#true} {16856#true} #351#return; {16856#true} is VALID [2022-02-21 03:10:35,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-21 03:10:35,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:35,348 INFO L290 TraceCheckUtils]: 0: Hoare triple {16887#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {16856#true} is VALID [2022-02-21 03:10:35,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {16856#true} assume !(0 == ~m % 4294967296); {16856#true} is VALID [2022-02-21 03:10:35,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {16856#true} assume !(~m % 4294967296 < 16777216); {16856#true} is VALID [2022-02-21 03:10:35,349 INFO L290 TraceCheckUtils]: 3: Hoare triple {16856#true} assume !false; {16856#true} is VALID [2022-02-21 03:10:35,349 INFO L290 TraceCheckUtils]: 4: Hoare triple {16856#true} assume ~m % 4294967296 >= 33554432; {16856#true} is VALID [2022-02-21 03:10:35,349 INFO L290 TraceCheckUtils]: 5: Hoare triple {16856#true} assume ~e >= 127;~__retres4~0 := 4294967295; {16888#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:35,350 INFO L290 TraceCheckUtils]: 6: Hoare triple {16888#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} #res := ~__retres4~0; {16889#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:35,350 INFO L290 TraceCheckUtils]: 7: Hoare triple {16889#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} assume true; {16889#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:35,351 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {16889#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} {16856#true} #353#return; {16881#(and (<= 4294967295 |ULTIMATE.start_main_#t~ret24#1|) (<= |ULTIMATE.start_main_#t~ret24#1| 4294967295))} is VALID [2022-02-21 03:10:35,351 INFO L290 TraceCheckUtils]: 0: Hoare triple {16856#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); {16856#true} is VALID [2022-02-21 03:10:35,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {16856#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {16856#true} is VALID [2022-02-21 03:10:35,352 INFO L272 TraceCheckUtils]: 2: Hoare triple {16856#true} call main_#t~ret22#1 := base2flt(0, 0); {16887#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:35,352 INFO L290 TraceCheckUtils]: 3: Hoare triple {16887#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {16856#true} is VALID [2022-02-21 03:10:35,352 INFO L290 TraceCheckUtils]: 4: Hoare triple {16856#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {16856#true} is VALID [2022-02-21 03:10:35,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {16856#true} #res := ~__retres4~0; {16856#true} is VALID [2022-02-21 03:10:35,352 INFO L290 TraceCheckUtils]: 6: Hoare triple {16856#true} assume true; {16856#true} is VALID [2022-02-21 03:10:35,352 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {16856#true} {16856#true} #349#return; {16856#true} is VALID [2022-02-21 03:10:35,353 INFO L290 TraceCheckUtils]: 8: Hoare triple {16856#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {16856#true} is VALID [2022-02-21 03:10:35,353 INFO L272 TraceCheckUtils]: 9: Hoare triple {16856#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {16887#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:35,353 INFO L290 TraceCheckUtils]: 10: Hoare triple {16887#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {16856#true} is VALID [2022-02-21 03:10:35,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {16856#true} assume !(0 == ~m % 4294967296); {16856#true} is VALID [2022-02-21 03:10:35,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {16856#true} assume !(~m % 4294967296 < 16777216); {16856#true} is VALID [2022-02-21 03:10:35,354 INFO L290 TraceCheckUtils]: 13: Hoare triple {16856#true} assume !false; {16856#true} is VALID [2022-02-21 03:10:35,354 INFO L290 TraceCheckUtils]: 14: Hoare triple {16856#true} assume ~m % 4294967296 >= 33554432; {16856#true} is VALID [2022-02-21 03:10:35,354 INFO L290 TraceCheckUtils]: 15: Hoare triple {16856#true} assume ~e >= 127;~__retres4~0 := 4294967295; {16856#true} is VALID [2022-02-21 03:10:35,354 INFO L290 TraceCheckUtils]: 16: Hoare triple {16856#true} #res := ~__retres4~0; {16856#true} is VALID [2022-02-21 03:10:35,354 INFO L290 TraceCheckUtils]: 17: Hoare triple {16856#true} assume true; {16856#true} is VALID [2022-02-21 03:10:35,354 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {16856#true} {16856#true} #351#return; {16856#true} is VALID [2022-02-21 03:10:35,354 INFO L290 TraceCheckUtils]: 19: Hoare triple {16856#true} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {16856#true} is VALID [2022-02-21 03:10:35,355 INFO L272 TraceCheckUtils]: 20: Hoare triple {16856#true} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {16887#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:35,355 INFO L290 TraceCheckUtils]: 21: Hoare triple {16887#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {16856#true} is VALID [2022-02-21 03:10:35,355 INFO L290 TraceCheckUtils]: 22: Hoare triple {16856#true} assume !(0 == ~m % 4294967296); {16856#true} is VALID [2022-02-21 03:10:35,355 INFO L290 TraceCheckUtils]: 23: Hoare triple {16856#true} assume !(~m % 4294967296 < 16777216); {16856#true} is VALID [2022-02-21 03:10:35,355 INFO L290 TraceCheckUtils]: 24: Hoare triple {16856#true} assume !false; {16856#true} is VALID [2022-02-21 03:10:35,355 INFO L290 TraceCheckUtils]: 25: Hoare triple {16856#true} assume ~m % 4294967296 >= 33554432; {16856#true} is VALID [2022-02-21 03:10:35,356 INFO L290 TraceCheckUtils]: 26: Hoare triple {16856#true} assume ~e >= 127;~__retres4~0 := 4294967295; {16888#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:35,356 INFO L290 TraceCheckUtils]: 27: Hoare triple {16888#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} #res := ~__retres4~0; {16889#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:35,357 INFO L290 TraceCheckUtils]: 28: Hoare triple {16889#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} assume true; {16889#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:35,357 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {16889#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} {16856#true} #353#return; {16881#(and (<= 4294967295 |ULTIMATE.start_main_#t~ret24#1|) (<= |ULTIMATE.start_main_#t~ret24#1| 4294967295))} is VALID [2022-02-21 03:10:35,358 INFO L290 TraceCheckUtils]: 30: Hoare triple {16881#(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; {16882#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} is VALID [2022-02-21 03:10:35,358 INFO L272 TraceCheckUtils]: 31: Hoare triple {16882#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {16883#(and (<= 4294967295 |addflt_#in~b|) (<= |addflt_#in~b| 4294967295))} is VALID [2022-02-21 03:10:35,359 INFO L290 TraceCheckUtils]: 32: Hoare triple {16883#(and (<= 4294967295 |addflt_#in~b|) (<= |addflt_#in~b| 4294967295))} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {16884#(and (<= addflt_~b 4294967295) (<= 4294967295 addflt_~b))} is VALID [2022-02-21 03:10:35,359 INFO L290 TraceCheckUtils]: 33: Hoare triple {16884#(and (<= addflt_~b 4294967295) (<= 4294967295 addflt_~b))} assume ~a % 4294967296 < ~b % 4294967296;~tmp~0 := ~a;~a := ~b;~b := ~tmp~0; {16885#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} is VALID [2022-02-21 03:10:35,360 INFO L290 TraceCheckUtils]: 34: Hoare triple {16885#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} assume !(0 == ~b % 4294967296); {16885#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} is VALID [2022-02-21 03:10:35,360 INFO L290 TraceCheckUtils]: 35: Hoare triple {16885#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} assume !(0 == ~a); {16885#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} is VALID [2022-02-21 03:10:35,361 INFO L290 TraceCheckUtils]: 36: Hoare triple {16885#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} assume !false; {16885#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} is VALID [2022-02-21 03:10:35,361 INFO L290 TraceCheckUtils]: 37: Hoare triple {16885#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} assume !false; {16885#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} is VALID [2022-02-21 03:10:35,361 INFO L290 TraceCheckUtils]: 38: Hoare triple {16885#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} assume ~a >= 0;abs_108 := (if ~a < 16777215 then ~a else 16777215);assume ~a >= 0;assume ~ma~0 < abs_108; {16885#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} is VALID [2022-02-21 03:10:35,362 INFO L290 TraceCheckUtils]: 39: Hoare triple {16885#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {16886#(and (< 0 (+ (div (div addflt_~a 16777216) 4294967296) 1)) (<= (div addflt_~a 16777216) (+ 2147483647 (* (div (div addflt_~a 16777216) 4294967296) 4294967296))))} is VALID [2022-02-21 03:10:35,363 INFO L290 TraceCheckUtils]: 40: Hoare triple {16886#(and (< 0 (+ (div (div addflt_~a 16777216) 4294967296) 1)) (<= (div addflt_~a 16777216) (+ 2147483647 (* (div (div addflt_~a 16777216) 4294967296) 4294967296))))} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {16857#false} is VALID [2022-02-21 03:10:35,363 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:35,363 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:35,363 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495987578] [2022-02-21 03:10:35,363 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495987578] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:35,363 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:10:35,363 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-21 03:10:35,364 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143202252] [2022-02-21 03:10:35,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:35,365 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2022-02-21 03:10:35,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:35,365 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:35,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:35,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-21 03:10:35,393 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:35,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-21 03:10:35,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-02-21 03:10:35,393 INFO L87 Difference]: Start difference. First operand 153 states and 197 transitions. Second operand has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:38,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:38,369 INFO L93 Difference]: Finished difference Result 480 states and 620 transitions. [2022-02-21 03:10:38,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 03:10:38,370 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2022-02-21 03:10:38,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:38,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:38,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 536 transitions. [2022-02-21 03:10:38,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:38,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 536 transitions. [2022-02-21 03:10:38,383 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 536 transitions. [2022-02-21 03:10:38,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 536 edges. 536 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:38,825 INFO L225 Difference]: With dead ends: 480 [2022-02-21 03:10:38,826 INFO L226 Difference]: Without dead ends: 410 [2022-02-21 03:10:38,827 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-02-21 03:10:38,829 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 742 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:38,831 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [747 Valid, 664 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-21 03:10:38,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-02-21 03:10:38,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 227. [2022-02-21 03:10:38,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:38,958 INFO L82 GeneralOperation]: Start isEquivalent. First operand 410 states. Second operand has 227 states, 195 states have (on average 1.4102564102564104) internal successors, (275), 207 states have internal predecessors, (275), 13 states have call successors, (13), 7 states have call predecessors, (13), 9 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-02-21 03:10:38,958 INFO L74 IsIncluded]: Start isIncluded. First operand 410 states. Second operand has 227 states, 195 states have (on average 1.4102564102564104) internal successors, (275), 207 states have internal predecessors, (275), 13 states have call successors, (13), 7 states have call predecessors, (13), 9 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-02-21 03:10:38,958 INFO L87 Difference]: Start difference. First operand 410 states. Second operand has 227 states, 195 states have (on average 1.4102564102564104) internal successors, (275), 207 states have internal predecessors, (275), 13 states have call successors, (13), 7 states have call predecessors, (13), 9 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-02-21 03:10:38,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:38,965 INFO L93 Difference]: Finished difference Result 410 states and 523 transitions. [2022-02-21 03:10:38,965 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 523 transitions. [2022-02-21 03:10:38,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:38,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:38,967 INFO L74 IsIncluded]: Start isIncluded. First operand has 227 states, 195 states have (on average 1.4102564102564104) internal successors, (275), 207 states have internal predecessors, (275), 13 states have call successors, (13), 7 states have call predecessors, (13), 9 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) Second operand 410 states. [2022-02-21 03:10:38,967 INFO L87 Difference]: Start difference. First operand has 227 states, 195 states have (on average 1.4102564102564104) internal successors, (275), 207 states have internal predecessors, (275), 13 states have call successors, (13), 7 states have call predecessors, (13), 9 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) Second operand 410 states. [2022-02-21 03:10:38,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:38,974 INFO L93 Difference]: Finished difference Result 410 states and 523 transitions. [2022-02-21 03:10:38,974 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 523 transitions. [2022-02-21 03:10:38,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:38,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:38,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:38,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:38,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 195 states have (on average 1.4102564102564104) internal successors, (275), 207 states have internal predecessors, (275), 13 states have call successors, (13), 7 states have call predecessors, (13), 9 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-02-21 03:10:38,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 302 transitions. [2022-02-21 03:10:38,978 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 302 transitions. Word has length 41 [2022-02-21 03:10:38,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:38,978 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 302 transitions. [2022-02-21 03:10:38,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:38,979 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 302 transitions. [2022-02-21 03:10:38,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-21 03:10:38,979 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:38,980 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:38,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-21 03:10:38,980 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:38,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:38,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1519399236, now seen corresponding path program 1 times [2022-02-21 03:10:38,982 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:38,982 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113796520] [2022-02-21 03:10:38,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:38,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:39,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:39,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:39,090 INFO L290 TraceCheckUtils]: 0: Hoare triple {18554#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18524#true} is VALID [2022-02-21 03:10:39,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {18524#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {18524#true} is VALID [2022-02-21 03:10:39,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {18524#true} #res := ~__retres4~0; {18524#true} is VALID [2022-02-21 03:10:39,090 INFO L290 TraceCheckUtils]: 3: Hoare triple {18524#true} assume true; {18524#true} is VALID [2022-02-21 03:10:39,090 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {18524#true} {18524#true} #349#return; {18524#true} is VALID [2022-02-21 03:10:39,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:39,123 INFO L290 TraceCheckUtils]: 0: Hoare triple {18554#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18524#true} is VALID [2022-02-21 03:10:39,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {18524#true} assume !(0 == ~m % 4294967296); {18524#true} is VALID [2022-02-21 03:10:39,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {18524#true} assume !(~m % 4294967296 < 16777216); {18524#true} is VALID [2022-02-21 03:10:39,124 INFO L290 TraceCheckUtils]: 3: Hoare triple {18524#true} assume !false; {18524#true} is VALID [2022-02-21 03:10:39,124 INFO L290 TraceCheckUtils]: 4: Hoare triple {18524#true} assume ~m % 4294967296 >= 33554432; {18524#true} is VALID [2022-02-21 03:10:39,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {18524#true} assume ~e >= 127;~__retres4~0 := 4294967295; {18555#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:39,125 INFO L290 TraceCheckUtils]: 6: Hoare triple {18555#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} #res := ~__retres4~0; {18556#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:39,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {18556#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} assume true; {18556#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:39,126 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {18556#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} {18524#true} #351#return; {18540#(and (<= 4294967295 |ULTIMATE.start_main_#t~ret23#1|) (<= |ULTIMATE.start_main_#t~ret23#1| 4294967295))} is VALID [2022-02-21 03:10:39,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-21 03:10:39,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:39,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {18554#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18524#true} is VALID [2022-02-21 03:10:39,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {18524#true} assume !(0 == ~m % 4294967296); {18524#true} is VALID [2022-02-21 03:10:39,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {18524#true} assume !(~m % 4294967296 < 16777216); {18524#true} is VALID [2022-02-21 03:10:39,132 INFO L290 TraceCheckUtils]: 3: Hoare triple {18524#true} assume !false; {18524#true} is VALID [2022-02-21 03:10:39,132 INFO L290 TraceCheckUtils]: 4: Hoare triple {18524#true} assume ~m % 4294967296 >= 33554432; {18524#true} is VALID [2022-02-21 03:10:39,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {18524#true} assume ~e >= 127;~__retres4~0 := 4294967295; {18524#true} is VALID [2022-02-21 03:10:39,133 INFO L290 TraceCheckUtils]: 6: Hoare triple {18524#true} #res := ~__retres4~0; {18524#true} is VALID [2022-02-21 03:10:39,133 INFO L290 TraceCheckUtils]: 7: Hoare triple {18524#true} assume true; {18524#true} is VALID [2022-02-21 03:10:39,133 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {18524#true} {18541#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} #353#return; {18541#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:39,134 INFO L290 TraceCheckUtils]: 0: Hoare triple {18524#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); {18524#true} is VALID [2022-02-21 03:10:39,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {18524#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {18524#true} is VALID [2022-02-21 03:10:39,134 INFO L272 TraceCheckUtils]: 2: Hoare triple {18524#true} call main_#t~ret22#1 := base2flt(0, 0); {18554#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:39,134 INFO L290 TraceCheckUtils]: 3: Hoare triple {18554#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18524#true} is VALID [2022-02-21 03:10:39,134 INFO L290 TraceCheckUtils]: 4: Hoare triple {18524#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {18524#true} is VALID [2022-02-21 03:10:39,135 INFO L290 TraceCheckUtils]: 5: Hoare triple {18524#true} #res := ~__retres4~0; {18524#true} is VALID [2022-02-21 03:10:39,135 INFO L290 TraceCheckUtils]: 6: Hoare triple {18524#true} assume true; {18524#true} is VALID [2022-02-21 03:10:39,135 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {18524#true} {18524#true} #349#return; {18524#true} is VALID [2022-02-21 03:10:39,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {18524#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {18524#true} is VALID [2022-02-21 03:10:39,136 INFO L272 TraceCheckUtils]: 9: Hoare triple {18524#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {18554#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:39,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {18554#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18524#true} is VALID [2022-02-21 03:10:39,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {18524#true} assume !(0 == ~m % 4294967296); {18524#true} is VALID [2022-02-21 03:10:39,136 INFO L290 TraceCheckUtils]: 12: Hoare triple {18524#true} assume !(~m % 4294967296 < 16777216); {18524#true} is VALID [2022-02-21 03:10:39,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {18524#true} assume !false; {18524#true} is VALID [2022-02-21 03:10:39,136 INFO L290 TraceCheckUtils]: 14: Hoare triple {18524#true} assume ~m % 4294967296 >= 33554432; {18524#true} is VALID [2022-02-21 03:10:39,136 INFO L290 TraceCheckUtils]: 15: Hoare triple {18524#true} assume ~e >= 127;~__retres4~0 := 4294967295; {18555#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:39,137 INFO L290 TraceCheckUtils]: 16: Hoare triple {18555#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} #res := ~__retres4~0; {18556#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:39,137 INFO L290 TraceCheckUtils]: 17: Hoare triple {18556#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} assume true; {18556#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:39,138 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {18556#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} {18524#true} #351#return; {18540#(and (<= 4294967295 |ULTIMATE.start_main_#t~ret23#1|) (<= |ULTIMATE.start_main_#t~ret23#1| 4294967295))} is VALID [2022-02-21 03:10:39,138 INFO L290 TraceCheckUtils]: 19: Hoare triple {18540#(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; {18541#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:39,139 INFO L272 TraceCheckUtils]: 20: Hoare triple {18541#(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); {18554#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:39,139 INFO L290 TraceCheckUtils]: 21: Hoare triple {18554#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18524#true} is VALID [2022-02-21 03:10:39,139 INFO L290 TraceCheckUtils]: 22: Hoare triple {18524#true} assume !(0 == ~m % 4294967296); {18524#true} is VALID [2022-02-21 03:10:39,139 INFO L290 TraceCheckUtils]: 23: Hoare triple {18524#true} assume !(~m % 4294967296 < 16777216); {18524#true} is VALID [2022-02-21 03:10:39,139 INFO L290 TraceCheckUtils]: 24: Hoare triple {18524#true} assume !false; {18524#true} is VALID [2022-02-21 03:10:39,139 INFO L290 TraceCheckUtils]: 25: Hoare triple {18524#true} assume ~m % 4294967296 >= 33554432; {18524#true} is VALID [2022-02-21 03:10:39,140 INFO L290 TraceCheckUtils]: 26: Hoare triple {18524#true} assume ~e >= 127;~__retres4~0 := 4294967295; {18524#true} is VALID [2022-02-21 03:10:39,140 INFO L290 TraceCheckUtils]: 27: Hoare triple {18524#true} #res := ~__retres4~0; {18524#true} is VALID [2022-02-21 03:10:39,140 INFO L290 TraceCheckUtils]: 28: Hoare triple {18524#true} assume true; {18524#true} is VALID [2022-02-21 03:10:39,140 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {18524#true} {18541#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} #353#return; {18541#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:39,141 INFO L290 TraceCheckUtils]: 30: Hoare triple {18541#(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; {18541#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:39,141 INFO L272 TraceCheckUtils]: 31: Hoare triple {18541#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {18551#(and (<= 4294967295 |addflt_#in~a|) (<= |addflt_#in~a| 4294967295))} is VALID [2022-02-21 03:10:39,142 INFO L290 TraceCheckUtils]: 32: Hoare triple {18551#(and (<= 4294967295 |addflt_#in~a|) (<= |addflt_#in~a| 4294967295))} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {18552#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} is VALID [2022-02-21 03:10:39,142 INFO L290 TraceCheckUtils]: 33: Hoare triple {18552#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} assume !(~a % 4294967296 < ~b % 4294967296); {18552#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} is VALID [2022-02-21 03:10:39,142 INFO L290 TraceCheckUtils]: 34: Hoare triple {18552#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} assume !(0 == ~b % 4294967296); {18552#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} is VALID [2022-02-21 03:10:39,143 INFO L290 TraceCheckUtils]: 35: Hoare triple {18552#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} assume !(0 == ~a); {18552#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} is VALID [2022-02-21 03:10:39,143 INFO L290 TraceCheckUtils]: 36: Hoare triple {18552#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} assume !false; {18552#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} is VALID [2022-02-21 03:10:39,144 INFO L290 TraceCheckUtils]: 37: Hoare triple {18552#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} assume !false; {18552#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} is VALID [2022-02-21 03:10:39,144 INFO L290 TraceCheckUtils]: 38: Hoare triple {18552#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} assume ~a >= 0;abs_108 := (if ~a < 16777215 then ~a else 16777215);assume ~a >= 0;assume ~ma~0 < abs_108; {18552#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} is VALID [2022-02-21 03:10:39,144 INFO L290 TraceCheckUtils]: 39: Hoare triple {18552#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {18553#(<= (div addflt_~a 16777216) (+ 2147483647 (* (div (div addflt_~a 16777216) 4294967296) 4294967296)))} is VALID [2022-02-21 03:10:39,145 INFO L290 TraceCheckUtils]: 40: Hoare triple {18553#(<= (div addflt_~a 16777216) (+ 2147483647 (* (div (div addflt_~a 16777216) 4294967296) 4294967296)))} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {18525#false} is VALID [2022-02-21 03:10:39,145 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:39,145 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:39,145 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113796520] [2022-02-21 03:10:39,146 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113796520] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:39,146 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735331174] [2022-02-21 03:10:39,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:39,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:39,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:39,148 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:39,149 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:39,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:39,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-21 03:10:39,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:39,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:39,413 INFO L290 TraceCheckUtils]: 0: Hoare triple {18524#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); {18524#true} is VALID [2022-02-21 03:10:39,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {18524#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {18524#true} is VALID [2022-02-21 03:10:39,413 INFO L272 TraceCheckUtils]: 2: Hoare triple {18524#true} call main_#t~ret22#1 := base2flt(0, 0); {18524#true} is VALID [2022-02-21 03:10:39,413 INFO L290 TraceCheckUtils]: 3: Hoare triple {18524#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18524#true} is VALID [2022-02-21 03:10:39,414 INFO L290 TraceCheckUtils]: 4: Hoare triple {18524#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {18524#true} is VALID [2022-02-21 03:10:39,414 INFO L290 TraceCheckUtils]: 5: Hoare triple {18524#true} #res := ~__retres4~0; {18524#true} is VALID [2022-02-21 03:10:39,414 INFO L290 TraceCheckUtils]: 6: Hoare triple {18524#true} assume true; {18524#true} is VALID [2022-02-21 03:10:39,414 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {18524#true} {18524#true} #349#return; {18524#true} is VALID [2022-02-21 03:10:39,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {18524#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {18524#true} is VALID [2022-02-21 03:10:39,414 INFO L272 TraceCheckUtils]: 9: Hoare triple {18524#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {18524#true} is VALID [2022-02-21 03:10:39,414 INFO L290 TraceCheckUtils]: 10: Hoare triple {18524#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18524#true} is VALID [2022-02-21 03:10:39,414 INFO L290 TraceCheckUtils]: 11: Hoare triple {18524#true} assume !(0 == ~m % 4294967296); {18524#true} is VALID [2022-02-21 03:10:39,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {18524#true} assume !(~m % 4294967296 < 16777216); {18524#true} is VALID [2022-02-21 03:10:39,415 INFO L290 TraceCheckUtils]: 13: Hoare triple {18524#true} assume !false; {18524#true} is VALID [2022-02-21 03:10:39,415 INFO L290 TraceCheckUtils]: 14: Hoare triple {18524#true} assume ~m % 4294967296 >= 33554432; {18524#true} is VALID [2022-02-21 03:10:39,415 INFO L290 TraceCheckUtils]: 15: Hoare triple {18524#true} assume ~e >= 127;~__retres4~0 := 4294967295; {18555#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:39,415 INFO L290 TraceCheckUtils]: 16: Hoare triple {18555#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} #res := ~__retres4~0; {18556#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:39,416 INFO L290 TraceCheckUtils]: 17: Hoare triple {18556#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} assume true; {18556#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:39,416 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {18556#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} {18524#true} #351#return; {18540#(and (<= 4294967295 |ULTIMATE.start_main_#t~ret23#1|) (<= |ULTIMATE.start_main_#t~ret23#1| 4294967295))} is VALID [2022-02-21 03:10:39,417 INFO L290 TraceCheckUtils]: 19: Hoare triple {18540#(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; {18541#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:39,417 INFO L272 TraceCheckUtils]: 20: Hoare triple {18541#(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); {18524#true} is VALID [2022-02-21 03:10:39,417 INFO L290 TraceCheckUtils]: 21: Hoare triple {18524#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18524#true} is VALID [2022-02-21 03:10:39,417 INFO L290 TraceCheckUtils]: 22: Hoare triple {18524#true} assume !(0 == ~m % 4294967296); {18524#true} is VALID [2022-02-21 03:10:39,417 INFO L290 TraceCheckUtils]: 23: Hoare triple {18524#true} assume !(~m % 4294967296 < 16777216); {18524#true} is VALID [2022-02-21 03:10:39,417 INFO L290 TraceCheckUtils]: 24: Hoare triple {18524#true} assume !false; {18524#true} is VALID [2022-02-21 03:10:39,417 INFO L290 TraceCheckUtils]: 25: Hoare triple {18524#true} assume ~m % 4294967296 >= 33554432; {18524#true} is VALID [2022-02-21 03:10:39,418 INFO L290 TraceCheckUtils]: 26: Hoare triple {18524#true} assume ~e >= 127;~__retres4~0 := 4294967295; {18524#true} is VALID [2022-02-21 03:10:39,418 INFO L290 TraceCheckUtils]: 27: Hoare triple {18524#true} #res := ~__retres4~0; {18524#true} is VALID [2022-02-21 03:10:39,418 INFO L290 TraceCheckUtils]: 28: Hoare triple {18524#true} assume true; {18524#true} is VALID [2022-02-21 03:10:39,418 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {18524#true} {18541#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} #353#return; {18541#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:39,419 INFO L290 TraceCheckUtils]: 30: Hoare triple {18541#(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; {18541#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:39,419 INFO L272 TraceCheckUtils]: 31: Hoare triple {18541#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {18551#(and (<= 4294967295 |addflt_#in~a|) (<= |addflt_#in~a| 4294967295))} is VALID [2022-02-21 03:10:39,420 INFO L290 TraceCheckUtils]: 32: Hoare triple {18551#(and (<= 4294967295 |addflt_#in~a|) (<= |addflt_#in~a| 4294967295))} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {18656#(and (<= addflt_~a 4294967295) (<= 4294967295 addflt_~a))} is VALID [2022-02-21 03:10:39,420 INFO L290 TraceCheckUtils]: 33: Hoare triple {18656#(and (<= addflt_~a 4294967295) (<= 4294967295 addflt_~a))} assume !(~a % 4294967296 < ~b % 4294967296); {18656#(and (<= addflt_~a 4294967295) (<= 4294967295 addflt_~a))} is VALID [2022-02-21 03:10:39,420 INFO L290 TraceCheckUtils]: 34: Hoare triple {18656#(and (<= addflt_~a 4294967295) (<= 4294967295 addflt_~a))} assume !(0 == ~b % 4294967296); {18656#(and (<= addflt_~a 4294967295) (<= 4294967295 addflt_~a))} is VALID [2022-02-21 03:10:39,421 INFO L290 TraceCheckUtils]: 35: Hoare triple {18656#(and (<= addflt_~a 4294967295) (<= 4294967295 addflt_~a))} assume !(0 == ~a); {18656#(and (<= addflt_~a 4294967295) (<= 4294967295 addflt_~a))} is VALID [2022-02-21 03:10:39,421 INFO L290 TraceCheckUtils]: 36: Hoare triple {18656#(and (<= addflt_~a 4294967295) (<= 4294967295 addflt_~a))} assume !false; {18656#(and (<= addflt_~a 4294967295) (<= 4294967295 addflt_~a))} is VALID [2022-02-21 03:10:39,422 INFO L290 TraceCheckUtils]: 37: Hoare triple {18656#(and (<= addflt_~a 4294967295) (<= 4294967295 addflt_~a))} assume !false; {18656#(and (<= addflt_~a 4294967295) (<= 4294967295 addflt_~a))} is VALID [2022-02-21 03:10:39,422 INFO L290 TraceCheckUtils]: 38: Hoare triple {18656#(and (<= addflt_~a 4294967295) (<= 4294967295 addflt_~a))} assume ~a >= 0;abs_108 := (if ~a < 16777215 then ~a else 16777215);assume ~a >= 0;assume ~ma~0 < abs_108; {18656#(and (<= addflt_~a 4294967295) (<= 4294967295 addflt_~a))} is VALID [2022-02-21 03:10:39,422 INFO L290 TraceCheckUtils]: 39: Hoare triple {18656#(and (<= addflt_~a 4294967295) (<= 4294967295 addflt_~a))} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {18656#(and (<= addflt_~a 4294967295) (<= 4294967295 addflt_~a))} is VALID [2022-02-21 03:10:39,423 INFO L290 TraceCheckUtils]: 40: Hoare triple {18656#(and (<= addflt_~a 4294967295) (<= 4294967295 addflt_~a))} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {18525#false} is VALID [2022-02-21 03:10:39,423 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:39,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:10:39,716 INFO L290 TraceCheckUtils]: 40: Hoare triple {18681#(or (<= (mod (div addflt_~a 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div addflt_~a 16777216) 4294967296)))} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {18525#false} is VALID [2022-02-21 03:10:39,717 INFO L290 TraceCheckUtils]: 39: Hoare triple {18681#(or (<= (mod (div addflt_~a 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div addflt_~a 16777216) 4294967296)))} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {18681#(or (<= (mod (div addflt_~a 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div addflt_~a 16777216) 4294967296)))} is VALID [2022-02-21 03:10:39,717 INFO L290 TraceCheckUtils]: 38: Hoare triple {18681#(or (<= (mod (div addflt_~a 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div addflt_~a 16777216) 4294967296)))} assume ~a >= 0;abs_108 := (if ~a < 16777215 then ~a else 16777215);assume ~a >= 0;assume ~ma~0 < abs_108; {18681#(or (<= (mod (div addflt_~a 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div addflt_~a 16777216) 4294967296)))} is VALID [2022-02-21 03:10:39,717 INFO L290 TraceCheckUtils]: 37: Hoare triple {18681#(or (<= (mod (div addflt_~a 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div addflt_~a 16777216) 4294967296)))} assume !false; {18681#(or (<= (mod (div addflt_~a 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div addflt_~a 16777216) 4294967296)))} is VALID [2022-02-21 03:10:39,718 INFO L290 TraceCheckUtils]: 36: Hoare triple {18681#(or (<= (mod (div addflt_~a 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div addflt_~a 16777216) 4294967296)))} assume !false; {18681#(or (<= (mod (div addflt_~a 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div addflt_~a 16777216) 4294967296)))} is VALID [2022-02-21 03:10:39,718 INFO L290 TraceCheckUtils]: 35: Hoare triple {18681#(or (<= (mod (div addflt_~a 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div addflt_~a 16777216) 4294967296)))} assume !(0 == ~a); {18681#(or (<= (mod (div addflt_~a 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div addflt_~a 16777216) 4294967296)))} is VALID [2022-02-21 03:10:39,718 INFO L290 TraceCheckUtils]: 34: Hoare triple {18681#(or (<= (mod (div addflt_~a 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div addflt_~a 16777216) 4294967296)))} assume !(0 == ~b % 4294967296); {18681#(or (<= (mod (div addflt_~a 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div addflt_~a 16777216) 4294967296)))} is VALID [2022-02-21 03:10:39,719 INFO L290 TraceCheckUtils]: 33: Hoare triple {18681#(or (<= (mod (div addflt_~a 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div addflt_~a 16777216) 4294967296)))} assume !(~a % 4294967296 < ~b % 4294967296); {18681#(or (<= (mod (div addflt_~a 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div addflt_~a 16777216) 4294967296)))} is VALID [2022-02-21 03:10:39,719 INFO L290 TraceCheckUtils]: 32: Hoare triple {18706#(or (<= 2147483776 (mod (div |addflt_#in~a| 16777216) 4294967296)) (<= (mod (div |addflt_#in~a| 16777216) 4294967296) 2147483647))} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {18681#(or (<= (mod (div addflt_~a 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div addflt_~a 16777216) 4294967296)))} is VALID [2022-02-21 03:10:39,720 INFO L272 TraceCheckUtils]: 31: Hoare triple {18710#(or (<= (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296)))} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {18706#(or (<= 2147483776 (mod (div |addflt_#in~a| 16777216) 4294967296)) (<= (mod (div |addflt_#in~a| 16777216) 4294967296) 2147483647))} is VALID [2022-02-21 03:10:39,720 INFO L290 TraceCheckUtils]: 30: Hoare triple {18710#(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; {18710#(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:39,721 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {18524#true} {18710#(or (<= (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296)))} #353#return; {18710#(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:39,721 INFO L290 TraceCheckUtils]: 28: Hoare triple {18524#true} assume true; {18524#true} is VALID [2022-02-21 03:10:39,721 INFO L290 TraceCheckUtils]: 27: Hoare triple {18524#true} #res := ~__retres4~0; {18524#true} is VALID [2022-02-21 03:10:39,721 INFO L290 TraceCheckUtils]: 26: Hoare triple {18524#true} assume ~e >= 127;~__retres4~0 := 4294967295; {18524#true} is VALID [2022-02-21 03:10:39,721 INFO L290 TraceCheckUtils]: 25: Hoare triple {18524#true} assume ~m % 4294967296 >= 33554432; {18524#true} is VALID [2022-02-21 03:10:39,721 INFO L290 TraceCheckUtils]: 24: Hoare triple {18524#true} assume !false; {18524#true} is VALID [2022-02-21 03:10:39,721 INFO L290 TraceCheckUtils]: 23: Hoare triple {18524#true} assume !(~m % 4294967296 < 16777216); {18524#true} is VALID [2022-02-21 03:10:39,721 INFO L290 TraceCheckUtils]: 22: Hoare triple {18524#true} assume !(0 == ~m % 4294967296); {18524#true} is VALID [2022-02-21 03:10:39,721 INFO L290 TraceCheckUtils]: 21: Hoare triple {18524#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18524#true} is VALID [2022-02-21 03:10:39,721 INFO L272 TraceCheckUtils]: 20: Hoare triple {18710#(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); {18524#true} is VALID [2022-02-21 03:10:39,722 INFO L290 TraceCheckUtils]: 19: Hoare triple {18747#(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; {18710#(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:39,722 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {18754#(or (<= (mod (div |base2flt_#res| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |base2flt_#res| 16777216) 4294967296)))} {18524#true} #351#return; {18747#(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:39,723 INFO L290 TraceCheckUtils]: 17: Hoare triple {18754#(or (<= (mod (div |base2flt_#res| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |base2flt_#res| 16777216) 4294967296)))} assume true; {18754#(or (<= (mod (div |base2flt_#res| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |base2flt_#res| 16777216) 4294967296)))} is VALID [2022-02-21 03:10:39,723 INFO L290 TraceCheckUtils]: 16: Hoare triple {18761#(or (<= 2147483776 (mod (div base2flt_~__retres4~0 16777216) 4294967296)) (<= (mod (div base2flt_~__retres4~0 16777216) 4294967296) 2147483647))} #res := ~__retres4~0; {18754#(or (<= (mod (div |base2flt_#res| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |base2flt_#res| 16777216) 4294967296)))} is VALID [2022-02-21 03:10:39,724 INFO L290 TraceCheckUtils]: 15: Hoare triple {18524#true} assume ~e >= 127;~__retres4~0 := 4294967295; {18761#(or (<= 2147483776 (mod (div base2flt_~__retres4~0 16777216) 4294967296)) (<= (mod (div base2flt_~__retres4~0 16777216) 4294967296) 2147483647))} is VALID [2022-02-21 03:10:39,724 INFO L290 TraceCheckUtils]: 14: Hoare triple {18524#true} assume ~m % 4294967296 >= 33554432; {18524#true} is VALID [2022-02-21 03:10:39,724 INFO L290 TraceCheckUtils]: 13: Hoare triple {18524#true} assume !false; {18524#true} is VALID [2022-02-21 03:10:39,724 INFO L290 TraceCheckUtils]: 12: Hoare triple {18524#true} assume !(~m % 4294967296 < 16777216); {18524#true} is VALID [2022-02-21 03:10:39,724 INFO L290 TraceCheckUtils]: 11: Hoare triple {18524#true} assume !(0 == ~m % 4294967296); {18524#true} is VALID [2022-02-21 03:10:39,724 INFO L290 TraceCheckUtils]: 10: Hoare triple {18524#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18524#true} is VALID [2022-02-21 03:10:39,734 INFO L272 TraceCheckUtils]: 9: Hoare triple {18524#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {18524#true} is VALID [2022-02-21 03:10:39,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {18524#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {18524#true} is VALID [2022-02-21 03:10:39,734 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {18524#true} {18524#true} #349#return; {18524#true} is VALID [2022-02-21 03:10:39,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {18524#true} assume true; {18524#true} is VALID [2022-02-21 03:10:39,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {18524#true} #res := ~__retres4~0; {18524#true} is VALID [2022-02-21 03:10:39,735 INFO L290 TraceCheckUtils]: 4: Hoare triple {18524#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {18524#true} is VALID [2022-02-21 03:10:39,735 INFO L290 TraceCheckUtils]: 3: Hoare triple {18524#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18524#true} is VALID [2022-02-21 03:10:39,735 INFO L272 TraceCheckUtils]: 2: Hoare triple {18524#true} call main_#t~ret22#1 := base2flt(0, 0); {18524#true} is VALID [2022-02-21 03:10:39,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {18524#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {18524#true} is VALID [2022-02-21 03:10:39,735 INFO L290 TraceCheckUtils]: 0: Hoare triple {18524#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); {18524#true} is VALID [2022-02-21 03:10:39,735 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:39,735 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735331174] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:10:39,735 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:10:39,735 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 16 [2022-02-21 03:10:39,735 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212489771] [2022-02-21 03:10:39,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:10:39,736 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.125) internal successors, (50), 12 states have internal predecessors, (50), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-02-21 03:10:39,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:39,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 3.125) internal successors, (50), 12 states have internal predecessors, (50), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:10:39,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:39,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-21 03:10:39,801 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:39,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-21 03:10:39,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2022-02-21 03:10:39,802 INFO L87 Difference]: Start difference. First operand 227 states and 302 transitions. Second operand has 17 states, 16 states have (on average 3.125) internal successors, (50), 12 states have internal predecessors, (50), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:10:42,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:42,574 INFO L93 Difference]: Finished difference Result 624 states and 842 transitions. [2022-02-21 03:10:42,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-21 03:10:42,575 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.125) internal successors, (50), 12 states have internal predecessors, (50), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-02-21 03:10:42,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:42,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 3.125) internal successors, (50), 12 states have internal predecessors, (50), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:10:42,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 405 transitions. [2022-02-21 03:10:42,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 3.125) internal successors, (50), 12 states have internal predecessors, (50), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:10:42,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 405 transitions. [2022-02-21 03:10:42,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 405 transitions. [2022-02-21 03:10:42,860 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:42,878 INFO L225 Difference]: With dead ends: 624 [2022-02-21 03:10:42,879 INFO L226 Difference]: Without dead ends: 492 [2022-02-21 03:10:42,879 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2022-02-21 03:10:42,880 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 608 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:42,880 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [609 Valid, 650 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1042 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-21 03:10:42,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-02-21 03:10:43,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 338. [2022-02-21 03:10:43,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:43,004 INFO L82 GeneralOperation]: Start isEquivalent. First operand 492 states. Second operand has 338 states, 294 states have (on average 1.4081632653061225) internal successors, (414), 307 states have internal predecessors, (414), 22 states have call successors, (22), 9 states have call predecessors, (22), 12 states have return successors, (26), 21 states have call predecessors, (26), 21 states have call successors, (26) [2022-02-21 03:10:43,004 INFO L74 IsIncluded]: Start isIncluded. First operand 492 states. Second operand has 338 states, 294 states have (on average 1.4081632653061225) internal successors, (414), 307 states have internal predecessors, (414), 22 states have call successors, (22), 9 states have call predecessors, (22), 12 states have return successors, (26), 21 states have call predecessors, (26), 21 states have call successors, (26) [2022-02-21 03:10:43,005 INFO L87 Difference]: Start difference. First operand 492 states. Second operand has 338 states, 294 states have (on average 1.4081632653061225) internal successors, (414), 307 states have internal predecessors, (414), 22 states have call successors, (22), 9 states have call predecessors, (22), 12 states have return successors, (26), 21 states have call predecessors, (26), 21 states have call successors, (26) [2022-02-21 03:10:43,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:43,015 INFO L93 Difference]: Finished difference Result 492 states and 656 transitions. [2022-02-21 03:10:43,015 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 656 transitions. [2022-02-21 03:10:43,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:43,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:43,016 INFO L74 IsIncluded]: Start isIncluded. First operand has 338 states, 294 states have (on average 1.4081632653061225) internal successors, (414), 307 states have internal predecessors, (414), 22 states have call successors, (22), 9 states have call predecessors, (22), 12 states have return successors, (26), 21 states have call predecessors, (26), 21 states have call successors, (26) Second operand 492 states. [2022-02-21 03:10:43,017 INFO L87 Difference]: Start difference. First operand has 338 states, 294 states have (on average 1.4081632653061225) internal successors, (414), 307 states have internal predecessors, (414), 22 states have call successors, (22), 9 states have call predecessors, (22), 12 states have return successors, (26), 21 states have call predecessors, (26), 21 states have call successors, (26) Second operand 492 states. [2022-02-21 03:10:43,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:43,029 INFO L93 Difference]: Finished difference Result 492 states and 656 transitions. [2022-02-21 03:10:43,029 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 656 transitions. [2022-02-21 03:10:43,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:43,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:43,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:43,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:43,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 294 states have (on average 1.4081632653061225) internal successors, (414), 307 states have internal predecessors, (414), 22 states have call successors, (22), 9 states have call predecessors, (22), 12 states have return successors, (26), 21 states have call predecessors, (26), 21 states have call successors, (26) [2022-02-21 03:10:43,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 462 transitions. [2022-02-21 03:10:43,037 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 462 transitions. Word has length 41 [2022-02-21 03:10:43,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:43,037 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 462 transitions. [2022-02-21 03:10:43,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.125) internal successors, (50), 12 states have internal predecessors, (50), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:10:43,039 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 462 transitions. [2022-02-21 03:10:43,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-21 03:10:43,041 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:43,041 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:43,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-02-21 03:10:43,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-02-21 03:10:43,251 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:43,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:43,251 INFO L85 PathProgramCache]: Analyzing trace with hash -440801234, now seen corresponding path program 1 times [2022-02-21 03:10:43,251 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:43,251 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762229809] [2022-02-21 03:10:43,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:43,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:43,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:43,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:43,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {20924#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20892#true} is VALID [2022-02-21 03:10:43,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {20892#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {20892#true} is VALID [2022-02-21 03:10:43,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {20892#true} #res := ~__retres4~0; {20892#true} is VALID [2022-02-21 03:10:43,311 INFO L290 TraceCheckUtils]: 3: Hoare triple {20892#true} assume true; {20892#true} is VALID [2022-02-21 03:10:43,311 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {20892#true} {20892#true} #349#return; {20892#true} is VALID [2022-02-21 03:10:43,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:43,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:43,315 INFO L290 TraceCheckUtils]: 0: Hoare triple {20924#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20892#true} is VALID [2022-02-21 03:10:43,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {20892#true} assume !(0 == ~m % 4294967296); {20892#true} is VALID [2022-02-21 03:10:43,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {20892#true} assume !(~m % 4294967296 < 16777216); {20892#true} is VALID [2022-02-21 03:10:43,316 INFO L290 TraceCheckUtils]: 3: Hoare triple {20892#true} assume !false; {20892#true} is VALID [2022-02-21 03:10:43,316 INFO L290 TraceCheckUtils]: 4: Hoare triple {20892#true} assume ~m % 4294967296 >= 33554432; {20892#true} is VALID [2022-02-21 03:10:43,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {20892#true} assume ~e >= 127;~__retres4~0 := 4294967295; {20892#true} is VALID [2022-02-21 03:10:43,316 INFO L290 TraceCheckUtils]: 6: Hoare triple {20892#true} #res := ~__retres4~0; {20892#true} is VALID [2022-02-21 03:10:43,316 INFO L290 TraceCheckUtils]: 7: Hoare triple {20892#true} assume true; {20892#true} is VALID [2022-02-21 03:10:43,316 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {20892#true} {20892#true} #351#return; {20892#true} is VALID [2022-02-21 03:10:43,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-21 03:10:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:43,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {20924#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20892#true} is VALID [2022-02-21 03:10:43,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {20892#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {20925#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:43,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {20925#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {20926#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:43,343 INFO L290 TraceCheckUtils]: 3: Hoare triple {20926#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {20926#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:43,344 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {20926#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {20892#true} #353#return; {20913#(= |ULTIMATE.start_main_#t~ret24#1| 0)} is VALID [2022-02-21 03:10:43,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-21 03:10:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:43,361 INFO L290 TraceCheckUtils]: 0: Hoare triple {20927#(and (= abs_110 |old(abs_110)|) (= abs_140 |old(abs_140)|) (= abs_113 |old(abs_113)|) (= abs_111 |old(abs_111)|) (= abs_108 |old(abs_108)|) (= abs_141 |old(abs_141)|))} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {20892#true} is VALID [2022-02-21 03:10:43,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {20892#true} assume !(~a % 4294967296 < ~b % 4294967296); {20892#true} is VALID [2022-02-21 03:10:43,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {20892#true} assume 0 == ~b % 4294967296;~__retres10~0 := ~a; {20892#true} is VALID [2022-02-21 03:10:43,362 INFO L290 TraceCheckUtils]: 3: Hoare triple {20892#true} #res := ~__retres10~0; {20892#true} is VALID [2022-02-21 03:10:43,362 INFO L290 TraceCheckUtils]: 4: Hoare triple {20892#true} assume true; {20892#true} is VALID [2022-02-21 03:10:43,363 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {20892#true} {20914#(= |ULTIMATE.start_main_~b~0#1| 0)} #355#return; {20914#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-21 03:10:43,363 INFO L290 TraceCheckUtils]: 0: Hoare triple {20892#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); {20892#true} is VALID [2022-02-21 03:10:43,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {20892#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {20892#true} is VALID [2022-02-21 03:10:43,363 INFO L272 TraceCheckUtils]: 2: Hoare triple {20892#true} call main_#t~ret22#1 := base2flt(0, 0); {20924#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:43,364 INFO L290 TraceCheckUtils]: 3: Hoare triple {20924#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20892#true} is VALID [2022-02-21 03:10:43,364 INFO L290 TraceCheckUtils]: 4: Hoare triple {20892#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {20892#true} is VALID [2022-02-21 03:10:43,364 INFO L290 TraceCheckUtils]: 5: Hoare triple {20892#true} #res := ~__retres4~0; {20892#true} is VALID [2022-02-21 03:10:43,364 INFO L290 TraceCheckUtils]: 6: Hoare triple {20892#true} assume true; {20892#true} is VALID [2022-02-21 03:10:43,364 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {20892#true} {20892#true} #349#return; {20892#true} is VALID [2022-02-21 03:10:43,364 INFO L290 TraceCheckUtils]: 8: Hoare triple {20892#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {20892#true} is VALID [2022-02-21 03:10:43,365 INFO L272 TraceCheckUtils]: 9: Hoare triple {20892#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {20924#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:43,365 INFO L290 TraceCheckUtils]: 10: Hoare triple {20924#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20892#true} is VALID [2022-02-21 03:10:43,365 INFO L290 TraceCheckUtils]: 11: Hoare triple {20892#true} assume !(0 == ~m % 4294967296); {20892#true} is VALID [2022-02-21 03:10:43,365 INFO L290 TraceCheckUtils]: 12: Hoare triple {20892#true} assume !(~m % 4294967296 < 16777216); {20892#true} is VALID [2022-02-21 03:10:43,365 INFO L290 TraceCheckUtils]: 13: Hoare triple {20892#true} assume !false; {20892#true} is VALID [2022-02-21 03:10:43,365 INFO L290 TraceCheckUtils]: 14: Hoare triple {20892#true} assume ~m % 4294967296 >= 33554432; {20892#true} is VALID [2022-02-21 03:10:43,365 INFO L290 TraceCheckUtils]: 15: Hoare triple {20892#true} assume ~e >= 127;~__retres4~0 := 4294967295; {20892#true} is VALID [2022-02-21 03:10:43,365 INFO L290 TraceCheckUtils]: 16: Hoare triple {20892#true} #res := ~__retres4~0; {20892#true} is VALID [2022-02-21 03:10:43,366 INFO L290 TraceCheckUtils]: 17: Hoare triple {20892#true} assume true; {20892#true} is VALID [2022-02-21 03:10:43,366 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {20892#true} {20892#true} #351#return; {20892#true} is VALID [2022-02-21 03:10:43,366 INFO L290 TraceCheckUtils]: 19: Hoare triple {20892#true} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {20892#true} is VALID [2022-02-21 03:10:43,366 INFO L272 TraceCheckUtils]: 20: Hoare triple {20892#true} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {20924#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:43,367 INFO L290 TraceCheckUtils]: 21: Hoare triple {20924#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20892#true} is VALID [2022-02-21 03:10:43,367 INFO L290 TraceCheckUtils]: 22: Hoare triple {20892#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {20925#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:43,367 INFO L290 TraceCheckUtils]: 23: Hoare triple {20925#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {20926#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:43,368 INFO L290 TraceCheckUtils]: 24: Hoare triple {20926#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {20926#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:43,368 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {20926#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {20892#true} #353#return; {20913#(= |ULTIMATE.start_main_#t~ret24#1| 0)} is VALID [2022-02-21 03:10:43,369 INFO L290 TraceCheckUtils]: 26: Hoare triple {20913#(= |ULTIMATE.start_main_#t~ret24#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {20914#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-21 03:10:43,369 INFO L272 TraceCheckUtils]: 27: Hoare triple {20914#(= |ULTIMATE.start_main_~b~0#1| 0)} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {20927#(and (= abs_110 |old(abs_110)|) (= abs_140 |old(abs_140)|) (= abs_113 |old(abs_113)|) (= abs_111 |old(abs_111)|) (= abs_108 |old(abs_108)|) (= abs_141 |old(abs_141)|))} is VALID [2022-02-21 03:10:43,369 INFO L290 TraceCheckUtils]: 28: Hoare triple {20927#(and (= abs_110 |old(abs_110)|) (= abs_140 |old(abs_140)|) (= abs_113 |old(abs_113)|) (= abs_111 |old(abs_111)|) (= abs_108 |old(abs_108)|) (= abs_141 |old(abs_141)|))} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {20892#true} is VALID [2022-02-21 03:10:43,370 INFO L290 TraceCheckUtils]: 29: Hoare triple {20892#true} assume !(~a % 4294967296 < ~b % 4294967296); {20892#true} is VALID [2022-02-21 03:10:43,370 INFO L290 TraceCheckUtils]: 30: Hoare triple {20892#true} assume 0 == ~b % 4294967296;~__retres10~0 := ~a; {20892#true} is VALID [2022-02-21 03:10:43,370 INFO L290 TraceCheckUtils]: 31: Hoare triple {20892#true} #res := ~__retres10~0; {20892#true} is VALID [2022-02-21 03:10:43,370 INFO L290 TraceCheckUtils]: 32: Hoare triple {20892#true} assume true; {20892#true} is VALID [2022-02-21 03:10:43,370 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {20892#true} {20914#(= |ULTIMATE.start_main_~b~0#1| 0)} #355#return; {20914#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-21 03:10:43,371 INFO L290 TraceCheckUtils]: 34: Hoare triple {20914#(= |ULTIMATE.start_main_~b~0#1| 0)} main_~r_add1~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {20914#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-21 03:10:43,371 INFO L272 TraceCheckUtils]: 35: Hoare triple {20914#(= |ULTIMATE.start_main_~b~0#1| 0)} call main_#t~ret26#1 := addflt(main_~b~0#1, main_~a~0#1); {20921#(= |addflt_#in~a| 0)} is VALID [2022-02-21 03:10:43,371 INFO L290 TraceCheckUtils]: 36: Hoare triple {20921#(= |addflt_#in~a| 0)} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {20922#(= addflt_~a 0)} is VALID [2022-02-21 03:10:43,372 INFO L290 TraceCheckUtils]: 37: Hoare triple {20922#(= addflt_~a 0)} assume ~a % 4294967296 < ~b % 4294967296;~tmp~0 := ~a;~a := ~b;~b := ~tmp~0; {20923#(= addflt_~b 0)} is VALID [2022-02-21 03:10:43,372 INFO L290 TraceCheckUtils]: 38: Hoare triple {20923#(= addflt_~b 0)} assume !(0 == ~b % 4294967296); {20893#false} is VALID [2022-02-21 03:10:43,372 INFO L290 TraceCheckUtils]: 39: Hoare triple {20893#false} assume !(0 == ~a); {20893#false} is VALID [2022-02-21 03:10:43,372 INFO L290 TraceCheckUtils]: 40: Hoare triple {20893#false} assume !false; {20893#false} is VALID [2022-02-21 03:10:43,372 INFO L290 TraceCheckUtils]: 41: Hoare triple {20893#false} assume !false; {20893#false} is VALID [2022-02-21 03:10:43,372 INFO L290 TraceCheckUtils]: 42: Hoare triple {20893#false} assume ~a >= 0;abs_108 := (if ~a < 16777215 then ~a else 16777215);assume ~a >= 0;assume ~ma~0 < abs_108; {20893#false} is VALID [2022-02-21 03:10:43,373 INFO L290 TraceCheckUtils]: 43: Hoare triple {20893#false} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {20893#false} is VALID [2022-02-21 03:10:43,373 INFO L290 TraceCheckUtils]: 44: Hoare triple {20893#false} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {20893#false} is VALID [2022-02-21 03:10:43,373 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-21 03:10:43,373 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:43,373 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762229809] [2022-02-21 03:10:43,373 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762229809] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:43,373 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231831637] [2022-02-21 03:10:43,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:43,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:43,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:43,397 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:43,408 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:43,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:43,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-21 03:10:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:43,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:43,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {20892#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); {20892#true} is VALID [2022-02-21 03:10:43,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {20892#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {20892#true} is VALID [2022-02-21 03:10:43,614 INFO L272 TraceCheckUtils]: 2: Hoare triple {20892#true} call main_#t~ret22#1 := base2flt(0, 0); {20892#true} is VALID [2022-02-21 03:10:43,614 INFO L290 TraceCheckUtils]: 3: Hoare triple {20892#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20940#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:43,614 INFO L290 TraceCheckUtils]: 4: Hoare triple {20940#(= base2flt_~m |base2flt_#in~m|)} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {20944#(<= (mod |base2flt_#in~m| 4294967296) 0)} is VALID [2022-02-21 03:10:43,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {20944#(<= (mod |base2flt_#in~m| 4294967296) 0)} #res := ~__retres4~0; {20944#(<= (mod |base2flt_#in~m| 4294967296) 0)} is VALID [2022-02-21 03:10:43,615 INFO L290 TraceCheckUtils]: 6: Hoare triple {20944#(<= (mod |base2flt_#in~m| 4294967296) 0)} assume true; {20944#(<= (mod |base2flt_#in~m| 4294967296) 0)} is VALID [2022-02-21 03:10:43,615 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {20944#(<= (mod |base2flt_#in~m| 4294967296) 0)} {20892#true} #349#return; {20892#true} is VALID [2022-02-21 03:10:43,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {20892#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {20892#true} is VALID [2022-02-21 03:10:43,615 INFO L272 TraceCheckUtils]: 9: Hoare triple {20892#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {20892#true} is VALID [2022-02-21 03:10:43,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {20892#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20892#true} is VALID [2022-02-21 03:10:43,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {20892#true} assume !(0 == ~m % 4294967296); {20892#true} is VALID [2022-02-21 03:10:43,616 INFO L290 TraceCheckUtils]: 12: Hoare triple {20892#true} assume !(~m % 4294967296 < 16777216); {20892#true} is VALID [2022-02-21 03:10:43,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {20892#true} assume !false; {20892#true} is VALID [2022-02-21 03:10:43,616 INFO L290 TraceCheckUtils]: 14: Hoare triple {20892#true} assume ~m % 4294967296 >= 33554432; {20892#true} is VALID [2022-02-21 03:10:43,616 INFO L290 TraceCheckUtils]: 15: Hoare triple {20892#true} assume ~e >= 127;~__retres4~0 := 4294967295; {20892#true} is VALID [2022-02-21 03:10:43,616 INFO L290 TraceCheckUtils]: 16: Hoare triple {20892#true} #res := ~__retres4~0; {20892#true} is VALID [2022-02-21 03:10:43,616 INFO L290 TraceCheckUtils]: 17: Hoare triple {20892#true} assume true; {20892#true} is VALID [2022-02-21 03:10:43,616 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {20892#true} {20892#true} #351#return; {20892#true} is VALID [2022-02-21 03:10:43,616 INFO L290 TraceCheckUtils]: 19: Hoare triple {20892#true} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {20892#true} is VALID [2022-02-21 03:10:43,616 INFO L272 TraceCheckUtils]: 20: Hoare triple {20892#true} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {20892#true} is VALID [2022-02-21 03:10:43,617 INFO L290 TraceCheckUtils]: 21: Hoare triple {20892#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20892#true} is VALID [2022-02-21 03:10:43,617 INFO L290 TraceCheckUtils]: 22: Hoare triple {20892#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {20925#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:43,617 INFO L290 TraceCheckUtils]: 23: Hoare triple {20925#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {20926#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:43,618 INFO L290 TraceCheckUtils]: 24: Hoare triple {20926#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {20926#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:43,618 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {20926#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {20892#true} #353#return; {20913#(= |ULTIMATE.start_main_#t~ret24#1| 0)} is VALID [2022-02-21 03:10:43,619 INFO L290 TraceCheckUtils]: 26: Hoare triple {20913#(= |ULTIMATE.start_main_#t~ret24#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {20914#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-21 03:10:43,619 INFO L272 TraceCheckUtils]: 27: Hoare triple {20914#(= |ULTIMATE.start_main_~b~0#1| 0)} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {20892#true} is VALID [2022-02-21 03:10:43,619 INFO L290 TraceCheckUtils]: 28: Hoare triple {20892#true} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {20892#true} is VALID [2022-02-21 03:10:43,619 INFO L290 TraceCheckUtils]: 29: Hoare triple {20892#true} assume !(~a % 4294967296 < ~b % 4294967296); {20892#true} is VALID [2022-02-21 03:10:43,619 INFO L290 TraceCheckUtils]: 30: Hoare triple {20892#true} assume 0 == ~b % 4294967296;~__retres10~0 := ~a; {20892#true} is VALID [2022-02-21 03:10:43,619 INFO L290 TraceCheckUtils]: 31: Hoare triple {20892#true} #res := ~__retres10~0; {20892#true} is VALID [2022-02-21 03:10:43,620 INFO L290 TraceCheckUtils]: 32: Hoare triple {20892#true} assume true; {20892#true} is VALID [2022-02-21 03:10:43,620 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {20892#true} {20914#(= |ULTIMATE.start_main_~b~0#1| 0)} #355#return; {20914#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-21 03:10:43,620 INFO L290 TraceCheckUtils]: 34: Hoare triple {20914#(= |ULTIMATE.start_main_~b~0#1| 0)} main_~r_add1~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {20914#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-21 03:10:43,621 INFO L272 TraceCheckUtils]: 35: Hoare triple {20914#(= |ULTIMATE.start_main_~b~0#1| 0)} call main_#t~ret26#1 := addflt(main_~b~0#1, main_~a~0#1); {20921#(= |addflt_#in~a| 0)} is VALID [2022-02-21 03:10:43,621 INFO L290 TraceCheckUtils]: 36: Hoare triple {20921#(= |addflt_#in~a| 0)} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {20922#(= addflt_~a 0)} is VALID [2022-02-21 03:10:43,622 INFO L290 TraceCheckUtils]: 37: Hoare triple {20922#(= addflt_~a 0)} assume ~a % 4294967296 < ~b % 4294967296;~tmp~0 := ~a;~a := ~b;~b := ~tmp~0; {20923#(= addflt_~b 0)} is VALID [2022-02-21 03:10:43,622 INFO L290 TraceCheckUtils]: 38: Hoare triple {20923#(= addflt_~b 0)} assume !(0 == ~b % 4294967296); {20893#false} is VALID [2022-02-21 03:10:43,622 INFO L290 TraceCheckUtils]: 39: Hoare triple {20893#false} assume !(0 == ~a); {20893#false} is VALID [2022-02-21 03:10:43,622 INFO L290 TraceCheckUtils]: 40: Hoare triple {20893#false} assume !false; {20893#false} is VALID [2022-02-21 03:10:43,622 INFO L290 TraceCheckUtils]: 41: Hoare triple {20893#false} assume !false; {20893#false} is VALID [2022-02-21 03:10:43,623 INFO L290 TraceCheckUtils]: 42: Hoare triple {20893#false} assume ~a >= 0;abs_108 := (if ~a < 16777215 then ~a else 16777215);assume ~a >= 0;assume ~ma~0 < abs_108; {20893#false} is VALID [2022-02-21 03:10:43,623 INFO L290 TraceCheckUtils]: 43: Hoare triple {20893#false} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {20893#false} is VALID [2022-02-21 03:10:43,623 INFO L290 TraceCheckUtils]: 44: Hoare triple {20893#false} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {20893#false} is VALID [2022-02-21 03:10:43,623 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-21 03:10:43,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:10:43,844 INFO L290 TraceCheckUtils]: 44: Hoare triple {20893#false} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {20893#false} is VALID [2022-02-21 03:10:43,845 INFO L290 TraceCheckUtils]: 43: Hoare triple {20893#false} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {20893#false} is VALID [2022-02-21 03:10:43,845 INFO L290 TraceCheckUtils]: 42: Hoare triple {20893#false} assume ~a >= 0;abs_108 := (if ~a < 16777215 then ~a else 16777215);assume ~a >= 0;assume ~ma~0 < abs_108; {20893#false} is VALID [2022-02-21 03:10:43,845 INFO L290 TraceCheckUtils]: 41: Hoare triple {20893#false} assume !false; {20893#false} is VALID [2022-02-21 03:10:43,845 INFO L290 TraceCheckUtils]: 40: Hoare triple {20893#false} assume !false; {20893#false} is VALID [2022-02-21 03:10:43,845 INFO L290 TraceCheckUtils]: 39: Hoare triple {20893#false} assume !(0 == ~a); {20893#false} is VALID [2022-02-21 03:10:43,845 INFO L290 TraceCheckUtils]: 38: Hoare triple {21083#(= (mod addflt_~b 4294967296) 0)} assume !(0 == ~b % 4294967296); {20893#false} is VALID [2022-02-21 03:10:43,846 INFO L290 TraceCheckUtils]: 37: Hoare triple {21087#(= (mod addflt_~a 4294967296) 0)} assume ~a % 4294967296 < ~b % 4294967296;~tmp~0 := ~a;~a := ~b;~b := ~tmp~0; {21083#(= (mod addflt_~b 4294967296) 0)} is VALID [2022-02-21 03:10:43,846 INFO L290 TraceCheckUtils]: 36: Hoare triple {21091#(= (mod |addflt_#in~a| 4294967296) 0)} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {21087#(= (mod addflt_~a 4294967296) 0)} is VALID [2022-02-21 03:10:43,847 INFO L272 TraceCheckUtils]: 35: Hoare triple {21095#(= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} call main_#t~ret26#1 := addflt(main_~b~0#1, main_~a~0#1); {21091#(= (mod |addflt_#in~a| 4294967296) 0)} is VALID [2022-02-21 03:10:43,847 INFO L290 TraceCheckUtils]: 34: Hoare triple {21095#(= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} main_~r_add1~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {21095#(= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:43,848 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {20892#true} {21095#(= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} #355#return; {21095#(= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:43,848 INFO L290 TraceCheckUtils]: 32: Hoare triple {20892#true} assume true; {20892#true} is VALID [2022-02-21 03:10:43,848 INFO L290 TraceCheckUtils]: 31: Hoare triple {20892#true} #res := ~__retres10~0; {20892#true} is VALID [2022-02-21 03:10:43,848 INFO L290 TraceCheckUtils]: 30: Hoare triple {20892#true} assume 0 == ~b % 4294967296;~__retres10~0 := ~a; {20892#true} is VALID [2022-02-21 03:10:43,848 INFO L290 TraceCheckUtils]: 29: Hoare triple {20892#true} assume !(~a % 4294967296 < ~b % 4294967296); {20892#true} is VALID [2022-02-21 03:10:43,848 INFO L290 TraceCheckUtils]: 28: Hoare triple {20892#true} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {20892#true} is VALID [2022-02-21 03:10:43,848 INFO L272 TraceCheckUtils]: 27: Hoare triple {21095#(= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {20892#true} is VALID [2022-02-21 03:10:43,848 INFO L290 TraceCheckUtils]: 26: Hoare triple {21123#(= (mod |ULTIMATE.start_main_#t~ret24#1| 4294967296) 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {21095#(= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:43,849 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {21130#(= (mod |base2flt_#res| 4294967296) 0)} {20892#true} #353#return; {21123#(= (mod |ULTIMATE.start_main_#t~ret24#1| 4294967296) 0)} is VALID [2022-02-21 03:10:43,849 INFO L290 TraceCheckUtils]: 24: Hoare triple {21130#(= (mod |base2flt_#res| 4294967296) 0)} assume true; {21130#(= (mod |base2flt_#res| 4294967296) 0)} is VALID [2022-02-21 03:10:43,850 INFO L290 TraceCheckUtils]: 23: Hoare triple {21137#(= (mod base2flt_~__retres4~0 4294967296) 0)} #res := ~__retres4~0; {21130#(= (mod |base2flt_#res| 4294967296) 0)} is VALID [2022-02-21 03:10:43,850 INFO L290 TraceCheckUtils]: 22: Hoare triple {20892#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {21137#(= (mod base2flt_~__retres4~0 4294967296) 0)} is VALID [2022-02-21 03:10:43,850 INFO L290 TraceCheckUtils]: 21: Hoare triple {20892#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20892#true} is VALID [2022-02-21 03:10:43,850 INFO L272 TraceCheckUtils]: 20: Hoare triple {20892#true} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {20892#true} is VALID [2022-02-21 03:10:43,850 INFO L290 TraceCheckUtils]: 19: Hoare triple {20892#true} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {20892#true} is VALID [2022-02-21 03:10:43,850 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {20892#true} {20892#true} #351#return; {20892#true} is VALID [2022-02-21 03:10:43,850 INFO L290 TraceCheckUtils]: 17: Hoare triple {20892#true} assume true; {20892#true} is VALID [2022-02-21 03:10:43,850 INFO L290 TraceCheckUtils]: 16: Hoare triple {20892#true} #res := ~__retres4~0; {20892#true} is VALID [2022-02-21 03:10:43,850 INFO L290 TraceCheckUtils]: 15: Hoare triple {20892#true} assume ~e >= 127;~__retres4~0 := 4294967295; {20892#true} is VALID [2022-02-21 03:10:43,850 INFO L290 TraceCheckUtils]: 14: Hoare triple {20892#true} assume ~m % 4294967296 >= 33554432; {20892#true} is VALID [2022-02-21 03:10:43,850 INFO L290 TraceCheckUtils]: 13: Hoare triple {20892#true} assume !false; {20892#true} is VALID [2022-02-21 03:10:43,850 INFO L290 TraceCheckUtils]: 12: Hoare triple {20892#true} assume !(~m % 4294967296 < 16777216); {20892#true} is VALID [2022-02-21 03:10:43,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {20892#true} assume !(0 == ~m % 4294967296); {20892#true} is VALID [2022-02-21 03:10:43,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {20892#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20892#true} is VALID [2022-02-21 03:10:43,850 INFO L272 TraceCheckUtils]: 9: Hoare triple {20892#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {20892#true} is VALID [2022-02-21 03:10:43,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {20892#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {20892#true} is VALID [2022-02-21 03:10:43,851 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {20892#true} {20892#true} #349#return; {20892#true} is VALID [2022-02-21 03:10:43,851 INFO L290 TraceCheckUtils]: 6: Hoare triple {20892#true} assume true; {20892#true} is VALID [2022-02-21 03:10:43,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {20892#true} #res := ~__retres4~0; {20892#true} is VALID [2022-02-21 03:10:43,851 INFO L290 TraceCheckUtils]: 4: Hoare triple {20892#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {20892#true} is VALID [2022-02-21 03:10:43,851 INFO L290 TraceCheckUtils]: 3: Hoare triple {20892#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20892#true} is VALID [2022-02-21 03:10:43,851 INFO L272 TraceCheckUtils]: 2: Hoare triple {20892#true} call main_#t~ret22#1 := base2flt(0, 0); {20892#true} is VALID [2022-02-21 03:10:43,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {20892#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {20892#true} is VALID [2022-02-21 03:10:43,851 INFO L290 TraceCheckUtils]: 0: Hoare triple {20892#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); {20892#true} is VALID [2022-02-21 03:10:43,851 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-21 03:10:43,851 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231831637] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:43,852 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-02-21 03:10:43,852 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 11] total 20 [2022-02-21 03:10:43,852 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063697526] [2022-02-21 03:10:43,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:43,852 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2022-02-21 03:10:43,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:43,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:10:43,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:43,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-21 03:10:43,878 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:43,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-21 03:10:43,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2022-02-21 03:10:43,879 INFO L87 Difference]: Start difference. First operand 338 states and 462 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:10:45,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:45,284 INFO L93 Difference]: Finished difference Result 695 states and 959 transitions. [2022-02-21 03:10:45,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-21 03:10:45,284 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2022-02-21 03:10:45,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:45,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:10:45,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 406 transitions. [2022-02-21 03:10:45,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:10:45,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 406 transitions. [2022-02-21 03:10:45,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 406 transitions. [2022-02-21 03:10:45,533 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:45,559 INFO L225 Difference]: With dead ends: 695 [2022-02-21 03:10:45,559 INFO L226 Difference]: Without dead ends: 607 [2022-02-21 03:10:45,560 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2022-02-21 03:10:45,560 INFO L933 BasicCegarLoop]: 267 mSDtfsCounter, 146 mSDsluCounter, 1692 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1959 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:45,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 1959 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:10:45,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2022-02-21 03:10:45,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 327. [2022-02-21 03:10:45,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:45,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 607 states. Second operand has 327 states, 286 states have (on average 1.4125874125874125) internal successors, (404), 298 states have internal predecessors, (404), 21 states have call successors, (21), 8 states have call predecessors, (21), 10 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2022-02-21 03:10:45,669 INFO L74 IsIncluded]: Start isIncluded. First operand 607 states. Second operand has 327 states, 286 states have (on average 1.4125874125874125) internal successors, (404), 298 states have internal predecessors, (404), 21 states have call successors, (21), 8 states have call predecessors, (21), 10 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2022-02-21 03:10:45,669 INFO L87 Difference]: Start difference. First operand 607 states. Second operand has 327 states, 286 states have (on average 1.4125874125874125) internal successors, (404), 298 states have internal predecessors, (404), 21 states have call successors, (21), 8 states have call predecessors, (21), 10 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2022-02-21 03:10:45,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:45,691 INFO L93 Difference]: Finished difference Result 607 states and 852 transitions. [2022-02-21 03:10:45,691 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 852 transitions. [2022-02-21 03:10:45,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:45,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:45,694 INFO L74 IsIncluded]: Start isIncluded. First operand has 327 states, 286 states have (on average 1.4125874125874125) internal successors, (404), 298 states have internal predecessors, (404), 21 states have call successors, (21), 8 states have call predecessors, (21), 10 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) Second operand 607 states. [2022-02-21 03:10:45,694 INFO L87 Difference]: Start difference. First operand has 327 states, 286 states have (on average 1.4125874125874125) internal successors, (404), 298 states have internal predecessors, (404), 21 states have call successors, (21), 8 states have call predecessors, (21), 10 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) Second operand 607 states. [2022-02-21 03:10:45,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:45,715 INFO L93 Difference]: Finished difference Result 607 states and 852 transitions. [2022-02-21 03:10:45,715 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 852 transitions. [2022-02-21 03:10:45,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:45,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:45,717 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:45,717 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:45,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 286 states have (on average 1.4125874125874125) internal successors, (404), 298 states have internal predecessors, (404), 21 states have call successors, (21), 8 states have call predecessors, (21), 10 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2022-02-21 03:10:45,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 448 transitions. [2022-02-21 03:10:45,725 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 448 transitions. Word has length 45 [2022-02-21 03:10:45,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:45,726 INFO L470 AbstractCegarLoop]: Abstraction has 327 states and 448 transitions. [2022-02-21 03:10:45,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:10:45,726 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 448 transitions. [2022-02-21 03:10:45,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-21 03:10:45,727 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:45,727 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:45,770 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:45,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-02-21 03:10:45,943 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:45,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:45,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1658343875, now seen corresponding path program 1 times [2022-02-21 03:10:45,944 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:45,944 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057762560] [2022-02-21 03:10:45,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:45,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:45,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:45,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:45,988 INFO L290 TraceCheckUtils]: 0: Hoare triple {23611#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {23580#true} is VALID [2022-02-21 03:10:45,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {23580#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {23580#true} is VALID [2022-02-21 03:10:45,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {23580#true} #res := ~__retres4~0; {23580#true} is VALID [2022-02-21 03:10:45,988 INFO L290 TraceCheckUtils]: 3: Hoare triple {23580#true} assume true; {23580#true} is VALID [2022-02-21 03:10:45,988 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {23580#true} {23580#true} #349#return; {23580#true} is VALID [2022-02-21 03:10:45,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:46,017 INFO L290 TraceCheckUtils]: 0: Hoare triple {23611#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {23580#true} is VALID [2022-02-21 03:10:46,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {23580#true} assume !(0 == ~m % 4294967296); {23580#true} is VALID [2022-02-21 03:10:46,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {23580#true} assume !(~m % 4294967296 < 16777216); {23580#true} is VALID [2022-02-21 03:10:46,017 INFO L290 TraceCheckUtils]: 3: Hoare triple {23580#true} assume !false; {23580#true} is VALID [2022-02-21 03:10:46,017 INFO L290 TraceCheckUtils]: 4: Hoare triple {23580#true} assume !(~m % 4294967296 >= 33554432); {23580#true} is VALID [2022-02-21 03:10:46,018 INFO L290 TraceCheckUtils]: 5: Hoare triple {23580#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {23612#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:46,018 INFO L290 TraceCheckUtils]: 6: Hoare triple {23612#(<= base2flt_~m 0)} assume 128 + ~e <= 2147483647; {23612#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:46,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {23612#(<= base2flt_~m 0)} assume 128 + ~e >= -2147483648; {23612#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:46,019 INFO L290 TraceCheckUtils]: 8: Hoare triple {23612#(<= base2flt_~m 0)} assume 128 + ~e <= 2147483647; {23612#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:46,019 INFO L290 TraceCheckUtils]: 9: Hoare triple {23612#(<= base2flt_~m 0)} assume 128 + ~e >= -2147483648; {23612#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:46,019 INFO L290 TraceCheckUtils]: 10: Hoare triple {23612#(<= 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; {23581#false} is VALID [2022-02-21 03:10:46,020 INFO L290 TraceCheckUtils]: 11: Hoare triple {23581#false} ~__retres4~0 := ~res~0; {23581#false} is VALID [2022-02-21 03:10:46,020 INFO L290 TraceCheckUtils]: 12: Hoare triple {23581#false} #res := ~__retres4~0; {23581#false} is VALID [2022-02-21 03:10:46,020 INFO L290 TraceCheckUtils]: 13: Hoare triple {23581#false} assume true; {23581#false} is VALID [2022-02-21 03:10:46,020 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {23581#false} {23580#true} #351#return; {23581#false} is VALID [2022-02-21 03:10:46,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-21 03:10:46,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:46,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {23611#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {23580#true} is VALID [2022-02-21 03:10:46,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {23580#true} assume !(0 == ~m % 4294967296); {23580#true} is VALID [2022-02-21 03:10:46,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {23580#true} assume !(~m % 4294967296 < 16777216); {23580#true} is VALID [2022-02-21 03:10:46,025 INFO L290 TraceCheckUtils]: 3: Hoare triple {23580#true} assume !false; {23580#true} is VALID [2022-02-21 03:10:46,025 INFO L290 TraceCheckUtils]: 4: Hoare triple {23580#true} assume ~m % 4294967296 >= 33554432; {23580#true} is VALID [2022-02-21 03:10:46,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {23580#true} assume ~e >= 127;~__retres4~0 := 4294967295; {23580#true} is VALID [2022-02-21 03:10:46,025 INFO L290 TraceCheckUtils]: 6: Hoare triple {23580#true} #res := ~__retres4~0; {23580#true} is VALID [2022-02-21 03:10:46,025 INFO L290 TraceCheckUtils]: 7: Hoare triple {23580#true} assume true; {23580#true} is VALID [2022-02-21 03:10:46,025 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {23580#true} {23581#false} #353#return; {23581#false} is VALID [2022-02-21 03:10:46,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {23580#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); {23580#true} is VALID [2022-02-21 03:10:46,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {23580#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {23580#true} is VALID [2022-02-21 03:10:46,026 INFO L272 TraceCheckUtils]: 2: Hoare triple {23580#true} call main_#t~ret22#1 := base2flt(0, 0); {23611#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:46,026 INFO L290 TraceCheckUtils]: 3: Hoare triple {23611#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {23580#true} is VALID [2022-02-21 03:10:46,026 INFO L290 TraceCheckUtils]: 4: Hoare triple {23580#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {23580#true} is VALID [2022-02-21 03:10:46,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {23580#true} #res := ~__retres4~0; {23580#true} is VALID [2022-02-21 03:10:46,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {23580#true} assume true; {23580#true} is VALID [2022-02-21 03:10:46,027 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {23580#true} {23580#true} #349#return; {23580#true} is VALID [2022-02-21 03:10:46,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {23580#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {23580#true} is VALID [2022-02-21 03:10:46,030 INFO L272 TraceCheckUtils]: 9: Hoare triple {23580#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {23611#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:46,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {23611#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {23580#true} is VALID [2022-02-21 03:10:46,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {23580#true} assume !(0 == ~m % 4294967296); {23580#true} is VALID [2022-02-21 03:10:46,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {23580#true} assume !(~m % 4294967296 < 16777216); {23580#true} is VALID [2022-02-21 03:10:46,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {23580#true} assume !false; {23580#true} is VALID [2022-02-21 03:10:46,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {23580#true} assume !(~m % 4294967296 >= 33554432); {23580#true} is VALID [2022-02-21 03:10:46,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {23580#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {23612#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:46,031 INFO L290 TraceCheckUtils]: 16: Hoare triple {23612#(<= base2flt_~m 0)} assume 128 + ~e <= 2147483647; {23612#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:46,031 INFO L290 TraceCheckUtils]: 17: Hoare triple {23612#(<= base2flt_~m 0)} assume 128 + ~e >= -2147483648; {23612#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:46,031 INFO L290 TraceCheckUtils]: 18: Hoare triple {23612#(<= base2flt_~m 0)} assume 128 + ~e <= 2147483647; {23612#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:46,032 INFO L290 TraceCheckUtils]: 19: Hoare triple {23612#(<= base2flt_~m 0)} assume 128 + ~e >= -2147483648; {23612#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:46,032 INFO L290 TraceCheckUtils]: 20: Hoare triple {23612#(<= 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; {23581#false} is VALID [2022-02-21 03:10:46,032 INFO L290 TraceCheckUtils]: 21: Hoare triple {23581#false} ~__retres4~0 := ~res~0; {23581#false} is VALID [2022-02-21 03:10:46,032 INFO L290 TraceCheckUtils]: 22: Hoare triple {23581#false} #res := ~__retres4~0; {23581#false} is VALID [2022-02-21 03:10:46,032 INFO L290 TraceCheckUtils]: 23: Hoare triple {23581#false} assume true; {23581#false} is VALID [2022-02-21 03:10:46,033 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {23581#false} {23580#true} #351#return; {23581#false} is VALID [2022-02-21 03:10:46,033 INFO L290 TraceCheckUtils]: 25: Hoare triple {23581#false} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {23581#false} is VALID [2022-02-21 03:10:46,033 INFO L272 TraceCheckUtils]: 26: Hoare triple {23581#false} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {23611#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:46,033 INFO L290 TraceCheckUtils]: 27: Hoare triple {23611#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {23580#true} is VALID [2022-02-21 03:10:46,033 INFO L290 TraceCheckUtils]: 28: Hoare triple {23580#true} assume !(0 == ~m % 4294967296); {23580#true} is VALID [2022-02-21 03:10:46,033 INFO L290 TraceCheckUtils]: 29: Hoare triple {23580#true} assume !(~m % 4294967296 < 16777216); {23580#true} is VALID [2022-02-21 03:10:46,033 INFO L290 TraceCheckUtils]: 30: Hoare triple {23580#true} assume !false; {23580#true} is VALID [2022-02-21 03:10:46,033 INFO L290 TraceCheckUtils]: 31: Hoare triple {23580#true} assume ~m % 4294967296 >= 33554432; {23580#true} is VALID [2022-02-21 03:10:46,033 INFO L290 TraceCheckUtils]: 32: Hoare triple {23580#true} assume ~e >= 127;~__retres4~0 := 4294967295; {23580#true} is VALID [2022-02-21 03:10:46,034 INFO L290 TraceCheckUtils]: 33: Hoare triple {23580#true} #res := ~__retres4~0; {23580#true} is VALID [2022-02-21 03:10:46,034 INFO L290 TraceCheckUtils]: 34: Hoare triple {23580#true} assume true; {23580#true} is VALID [2022-02-21 03:10:46,034 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {23580#true} {23581#false} #353#return; {23581#false} is VALID [2022-02-21 03:10:46,034 INFO L290 TraceCheckUtils]: 36: Hoare triple {23581#false} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {23581#false} is VALID [2022-02-21 03:10:46,034 INFO L272 TraceCheckUtils]: 37: Hoare triple {23581#false} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {23581#false} is VALID [2022-02-21 03:10:46,034 INFO L290 TraceCheckUtils]: 38: Hoare triple {23581#false} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {23581#false} is VALID [2022-02-21 03:10:46,034 INFO L290 TraceCheckUtils]: 39: Hoare triple {23581#false} assume !(~a % 4294967296 < ~b % 4294967296); {23581#false} is VALID [2022-02-21 03:10:46,034 INFO L290 TraceCheckUtils]: 40: Hoare triple {23581#false} assume !(0 == ~b % 4294967296); {23581#false} is VALID [2022-02-21 03:10:46,034 INFO L290 TraceCheckUtils]: 41: Hoare triple {23581#false} assume !(0 == ~a); {23581#false} is VALID [2022-02-21 03:10:46,035 INFO L290 TraceCheckUtils]: 42: Hoare triple {23581#false} assume !false; {23581#false} is VALID [2022-02-21 03:10:46,035 INFO L290 TraceCheckUtils]: 43: Hoare triple {23581#false} assume !false; {23581#false} is VALID [2022-02-21 03:10:46,035 INFO L290 TraceCheckUtils]: 44: Hoare triple {23581#false} assume ~a >= 0;abs_108 := (if ~a < 16777215 then ~a else 16777215);assume ~a >= 0;assume ~ma~0 < abs_108; {23581#false} is VALID [2022-02-21 03:10:46,035 INFO L290 TraceCheckUtils]: 45: Hoare triple {23581#false} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {23581#false} is VALID [2022-02-21 03:10:46,035 INFO L290 TraceCheckUtils]: 46: Hoare triple {23581#false} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {23581#false} is VALID [2022-02-21 03:10:46,035 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-21 03:10:46,035 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:46,035 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057762560] [2022-02-21 03:10:46,036 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057762560] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:46,036 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381309961] [2022-02-21 03:10:46,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:46,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:46,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:46,041 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:10:46,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-21 03:10:46,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:46,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:10:46,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:46,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:46,185 INFO L290 TraceCheckUtils]: 0: Hoare triple {23580#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); {23580#true} is VALID [2022-02-21 03:10:46,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {23580#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {23580#true} is VALID [2022-02-21 03:10:46,186 INFO L272 TraceCheckUtils]: 2: Hoare triple {23580#true} call main_#t~ret22#1 := base2flt(0, 0); {23580#true} is VALID [2022-02-21 03:10:46,186 INFO L290 TraceCheckUtils]: 3: Hoare triple {23580#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {23580#true} is VALID [2022-02-21 03:10:46,186 INFO L290 TraceCheckUtils]: 4: Hoare triple {23580#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {23580#true} is VALID [2022-02-21 03:10:46,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {23580#true} #res := ~__retres4~0; {23580#true} is VALID [2022-02-21 03:10:46,187 INFO L290 TraceCheckUtils]: 6: Hoare triple {23580#true} assume true; {23580#true} is VALID [2022-02-21 03:10:46,187 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {23580#true} {23580#true} #349#return; {23580#true} is VALID [2022-02-21 03:10:46,187 INFO L290 TraceCheckUtils]: 8: Hoare triple {23580#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {23580#true} is VALID [2022-02-21 03:10:46,187 INFO L272 TraceCheckUtils]: 9: Hoare triple {23580#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {23580#true} is VALID [2022-02-21 03:10:46,187 INFO L290 TraceCheckUtils]: 10: Hoare triple {23580#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {23580#true} is VALID [2022-02-21 03:10:46,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {23580#true} assume !(0 == ~m % 4294967296); {23580#true} is VALID [2022-02-21 03:10:46,188 INFO L290 TraceCheckUtils]: 12: Hoare triple {23580#true} assume !(~m % 4294967296 < 16777216); {23580#true} is VALID [2022-02-21 03:10:46,188 INFO L290 TraceCheckUtils]: 13: Hoare triple {23580#true} assume !false; {23580#true} is VALID [2022-02-21 03:10:46,188 INFO L290 TraceCheckUtils]: 14: Hoare triple {23580#true} assume !(~m % 4294967296 >= 33554432); {23580#true} is VALID [2022-02-21 03:10:46,188 INFO L290 TraceCheckUtils]: 15: Hoare triple {23580#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {23612#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:46,189 INFO L290 TraceCheckUtils]: 16: Hoare triple {23612#(<= base2flt_~m 0)} assume 128 + ~e <= 2147483647; {23612#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:46,190 INFO L290 TraceCheckUtils]: 17: Hoare triple {23612#(<= base2flt_~m 0)} assume 128 + ~e >= -2147483648; {23612#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:46,190 INFO L290 TraceCheckUtils]: 18: Hoare triple {23612#(<= base2flt_~m 0)} assume 128 + ~e <= 2147483647; {23612#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:46,190 INFO L290 TraceCheckUtils]: 19: Hoare triple {23612#(<= base2flt_~m 0)} assume 128 + ~e >= -2147483648; {23612#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:46,191 INFO L290 TraceCheckUtils]: 20: Hoare triple {23612#(<= 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; {23581#false} is VALID [2022-02-21 03:10:46,191 INFO L290 TraceCheckUtils]: 21: Hoare triple {23581#false} ~__retres4~0 := ~res~0; {23581#false} is VALID [2022-02-21 03:10:46,191 INFO L290 TraceCheckUtils]: 22: Hoare triple {23581#false} #res := ~__retres4~0; {23581#false} is VALID [2022-02-21 03:10:46,191 INFO L290 TraceCheckUtils]: 23: Hoare triple {23581#false} assume true; {23581#false} is VALID [2022-02-21 03:10:46,191 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {23581#false} {23580#true} #351#return; {23581#false} is VALID [2022-02-21 03:10:46,192 INFO L290 TraceCheckUtils]: 25: Hoare triple {23581#false} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {23581#false} is VALID [2022-02-21 03:10:46,192 INFO L272 TraceCheckUtils]: 26: Hoare triple {23581#false} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {23581#false} is VALID [2022-02-21 03:10:46,192 INFO L290 TraceCheckUtils]: 27: Hoare triple {23581#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {23581#false} is VALID [2022-02-21 03:10:46,192 INFO L290 TraceCheckUtils]: 28: Hoare triple {23581#false} assume !(0 == ~m % 4294967296); {23581#false} is VALID [2022-02-21 03:10:46,192 INFO L290 TraceCheckUtils]: 29: Hoare triple {23581#false} assume !(~m % 4294967296 < 16777216); {23581#false} is VALID [2022-02-21 03:10:46,192 INFO L290 TraceCheckUtils]: 30: Hoare triple {23581#false} assume !false; {23581#false} is VALID [2022-02-21 03:10:46,192 INFO L290 TraceCheckUtils]: 31: Hoare triple {23581#false} assume ~m % 4294967296 >= 33554432; {23581#false} is VALID [2022-02-21 03:10:46,193 INFO L290 TraceCheckUtils]: 32: Hoare triple {23581#false} assume ~e >= 127;~__retres4~0 := 4294967295; {23581#false} is VALID [2022-02-21 03:10:46,193 INFO L290 TraceCheckUtils]: 33: Hoare triple {23581#false} #res := ~__retres4~0; {23581#false} is VALID [2022-02-21 03:10:46,193 INFO L290 TraceCheckUtils]: 34: Hoare triple {23581#false} assume true; {23581#false} is VALID [2022-02-21 03:10:46,193 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {23581#false} {23581#false} #353#return; {23581#false} is VALID [2022-02-21 03:10:46,193 INFO L290 TraceCheckUtils]: 36: Hoare triple {23581#false} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {23581#false} is VALID [2022-02-21 03:10:46,193 INFO L272 TraceCheckUtils]: 37: Hoare triple {23581#false} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {23581#false} is VALID [2022-02-21 03:10:46,193 INFO L290 TraceCheckUtils]: 38: Hoare triple {23581#false} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {23581#false} is VALID [2022-02-21 03:10:46,193 INFO L290 TraceCheckUtils]: 39: Hoare triple {23581#false} assume !(~a % 4294967296 < ~b % 4294967296); {23581#false} is VALID [2022-02-21 03:10:46,194 INFO L290 TraceCheckUtils]: 40: Hoare triple {23581#false} assume !(0 == ~b % 4294967296); {23581#false} is VALID [2022-02-21 03:10:46,194 INFO L290 TraceCheckUtils]: 41: Hoare triple {23581#false} assume !(0 == ~a); {23581#false} is VALID [2022-02-21 03:10:46,194 INFO L290 TraceCheckUtils]: 42: Hoare triple {23581#false} assume !false; {23581#false} is VALID [2022-02-21 03:10:46,194 INFO L290 TraceCheckUtils]: 43: Hoare triple {23581#false} assume !false; {23581#false} is VALID [2022-02-21 03:10:46,194 INFO L290 TraceCheckUtils]: 44: Hoare triple {23581#false} assume ~a >= 0;abs_108 := (if ~a < 16777215 then ~a else 16777215);assume ~a >= 0;assume ~ma~0 < abs_108; {23581#false} is VALID [2022-02-21 03:10:46,194 INFO L290 TraceCheckUtils]: 45: Hoare triple {23581#false} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {23581#false} is VALID [2022-02-21 03:10:46,194 INFO L290 TraceCheckUtils]: 46: Hoare triple {23581#false} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {23581#false} is VALID [2022-02-21 03:10:46,195 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:46,195 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:10:46,195 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381309961] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:46,195 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:10:46,195 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2022-02-21 03:10:46,197 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56051716] [2022-02-21 03:10:46,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:46,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 47 [2022-02-21 03:10:46,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:46,198 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:46,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:46,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:10:46,222 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:46,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:10:46,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:10:46,223 INFO L87 Difference]: Start difference. First operand 327 states and 448 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:46,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:46,481 INFO L93 Difference]: Finished difference Result 586 states and 804 transitions. [2022-02-21 03:10:46,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:10:46,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 47 [2022-02-21 03:10:46,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:46,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:46,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 285 transitions. [2022-02-21 03:10:46,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:46,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 285 transitions. [2022-02-21 03:10:46,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 285 transitions. [2022-02-21 03:10:46,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 285 edges. 285 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:46,638 INFO L225 Difference]: With dead ends: 586 [2022-02-21 03:10:46,638 INFO L226 Difference]: Without dead ends: 351 [2022-02-21 03:10:46,639 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:10:46,640 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 10 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 246 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:46,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 246 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:46,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-02-21 03:10:46,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 337. [2022-02-21 03:10:46,783 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:46,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 351 states. Second operand has 337 states, 296 states have (on average 1.3986486486486487) internal successors, (414), 308 states have internal predecessors, (414), 21 states have call successors, (21), 8 states have call predecessors, (21), 10 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2022-02-21 03:10:46,785 INFO L74 IsIncluded]: Start isIncluded. First operand 351 states. Second operand has 337 states, 296 states have (on average 1.3986486486486487) internal successors, (414), 308 states have internal predecessors, (414), 21 states have call successors, (21), 8 states have call predecessors, (21), 10 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2022-02-21 03:10:46,785 INFO L87 Difference]: Start difference. First operand 351 states. Second operand has 337 states, 296 states have (on average 1.3986486486486487) internal successors, (414), 308 states have internal predecessors, (414), 21 states have call successors, (21), 8 states have call predecessors, (21), 10 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2022-02-21 03:10:46,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:46,793 INFO L93 Difference]: Finished difference Result 351 states and 479 transitions. [2022-02-21 03:10:46,793 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 479 transitions. [2022-02-21 03:10:46,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:46,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:46,795 INFO L74 IsIncluded]: Start isIncluded. First operand has 337 states, 296 states have (on average 1.3986486486486487) internal successors, (414), 308 states have internal predecessors, (414), 21 states have call successors, (21), 8 states have call predecessors, (21), 10 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) Second operand 351 states. [2022-02-21 03:10:46,796 INFO L87 Difference]: Start difference. First operand has 337 states, 296 states have (on average 1.3986486486486487) internal successors, (414), 308 states have internal predecessors, (414), 21 states have call successors, (21), 8 states have call predecessors, (21), 10 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) Second operand 351 states. [2022-02-21 03:10:46,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:46,803 INFO L93 Difference]: Finished difference Result 351 states and 479 transitions. [2022-02-21 03:10:46,804 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 479 transitions. [2022-02-21 03:10:46,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:46,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:46,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:46,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:46,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 296 states have (on average 1.3986486486486487) internal successors, (414), 308 states have internal predecessors, (414), 21 states have call successors, (21), 8 states have call predecessors, (21), 10 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2022-02-21 03:10:46,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 458 transitions. [2022-02-21 03:10:46,813 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 458 transitions. Word has length 47 [2022-02-21 03:10:46,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:46,813 INFO L470 AbstractCegarLoop]: Abstraction has 337 states and 458 transitions. [2022-02-21 03:10:46,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:46,814 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 458 transitions. [2022-02-21 03:10:46,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-21 03:10:46,815 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:46,815 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:46,839 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:47,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-02-21 03:10:47,031 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:47,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:47,032 INFO L85 PathProgramCache]: Analyzing trace with hash -836152950, now seen corresponding path program 1 times [2022-02-21 03:10:47,032 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:47,032 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877785066] [2022-02-21 03:10:47,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:47,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:47,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:47,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:47,112 INFO L290 TraceCheckUtils]: 0: Hoare triple {25533#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {25496#true} is VALID [2022-02-21 03:10:47,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {25496#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {25496#true} is VALID [2022-02-21 03:10:47,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {25496#true} #res := ~__retres4~0; {25496#true} is VALID [2022-02-21 03:10:47,112 INFO L290 TraceCheckUtils]: 3: Hoare triple {25496#true} assume true; {25496#true} is VALID [2022-02-21 03:10:47,112 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {25496#true} {25496#true} #349#return; {25496#true} is VALID [2022-02-21 03:10:47,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:47,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:47,139 INFO L290 TraceCheckUtils]: 0: Hoare triple {25533#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {25496#true} is VALID [2022-02-21 03:10:47,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {25496#true} assume !(0 == ~m % 4294967296); {25496#true} is VALID [2022-02-21 03:10:47,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {25496#true} assume !(~m % 4294967296 < 16777216); {25496#true} is VALID [2022-02-21 03:10:47,140 INFO L290 TraceCheckUtils]: 3: Hoare triple {25496#true} assume !false; {25496#true} is VALID [2022-02-21 03:10:47,140 INFO L290 TraceCheckUtils]: 4: Hoare triple {25496#true} assume !(~m % 4294967296 >= 33554432); {25496#true} is VALID [2022-02-21 03:10:47,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {25496#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {25496#true} is VALID [2022-02-21 03:10:47,140 INFO L290 TraceCheckUtils]: 6: Hoare triple {25496#true} assume 128 + ~e <= 2147483647; {25496#true} is VALID [2022-02-21 03:10:47,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {25496#true} assume 128 + ~e >= -2147483648; {25496#true} is VALID [2022-02-21 03:10:47,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {25496#true} assume 128 + ~e <= 2147483647; {25496#true} is VALID [2022-02-21 03:10:47,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {25496#true} assume 128 + ~e >= -2147483648; {25496#true} is VALID [2022-02-21 03:10:47,141 INFO L290 TraceCheckUtils]: 10: Hoare triple {25496#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {25496#true} is VALID [2022-02-21 03:10:47,141 INFO L290 TraceCheckUtils]: 11: Hoare triple {25496#true} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {25534#(<= base2flt_~res~0 0)} is VALID [2022-02-21 03:10:47,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {25534#(<= base2flt_~res~0 0)} ~__retres4~0 := ~res~0; {25535#(<= base2flt_~__retres4~0 0)} is VALID [2022-02-21 03:10:47,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {25535#(<= base2flt_~__retres4~0 0)} #res := ~__retres4~0; {25536#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:10:47,142 INFO L290 TraceCheckUtils]: 14: Hoare triple {25536#(<= |base2flt_#res| 0)} assume true; {25536#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:10:47,143 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {25536#(<= |base2flt_#res| 0)} {25496#true} #351#return; {25519#(<= |ULTIMATE.start_main_#t~ret23#1| 0)} is VALID [2022-02-21 03:10:47,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-21 03:10:47,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:47,147 INFO L290 TraceCheckUtils]: 0: Hoare triple {25533#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {25496#true} is VALID [2022-02-21 03:10:47,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {25496#true} assume !(0 == ~m % 4294967296); {25496#true} is VALID [2022-02-21 03:10:47,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {25496#true} assume !(~m % 4294967296 < 16777216); {25496#true} is VALID [2022-02-21 03:10:47,147 INFO L290 TraceCheckUtils]: 3: Hoare triple {25496#true} assume !false; {25496#true} is VALID [2022-02-21 03:10:47,147 INFO L290 TraceCheckUtils]: 4: Hoare triple {25496#true} assume ~m % 4294967296 >= 33554432; {25496#true} is VALID [2022-02-21 03:10:47,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {25496#true} assume ~e >= 127;~__retres4~0 := 4294967295; {25496#true} is VALID [2022-02-21 03:10:47,148 INFO L290 TraceCheckUtils]: 6: Hoare triple {25496#true} #res := ~__retres4~0; {25496#true} is VALID [2022-02-21 03:10:47,148 INFO L290 TraceCheckUtils]: 7: Hoare triple {25496#true} assume true; {25496#true} is VALID [2022-02-21 03:10:47,148 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {25496#true} {25520#(<= |ULTIMATE.start_main_~a~0#1| 0)} #353#return; {25520#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:47,148 INFO L290 TraceCheckUtils]: 0: Hoare triple {25496#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); {25496#true} is VALID [2022-02-21 03:10:47,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {25496#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {25496#true} is VALID [2022-02-21 03:10:47,149 INFO L272 TraceCheckUtils]: 2: Hoare triple {25496#true} call main_#t~ret22#1 := base2flt(0, 0); {25533#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:47,149 INFO L290 TraceCheckUtils]: 3: Hoare triple {25533#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {25496#true} is VALID [2022-02-21 03:10:47,149 INFO L290 TraceCheckUtils]: 4: Hoare triple {25496#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {25496#true} is VALID [2022-02-21 03:10:47,149 INFO L290 TraceCheckUtils]: 5: Hoare triple {25496#true} #res := ~__retres4~0; {25496#true} is VALID [2022-02-21 03:10:47,149 INFO L290 TraceCheckUtils]: 6: Hoare triple {25496#true} assume true; {25496#true} is VALID [2022-02-21 03:10:47,150 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {25496#true} {25496#true} #349#return; {25496#true} is VALID [2022-02-21 03:10:47,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {25496#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {25496#true} is VALID [2022-02-21 03:10:47,150 INFO L272 TraceCheckUtils]: 9: Hoare triple {25496#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {25533#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:47,150 INFO L290 TraceCheckUtils]: 10: Hoare triple {25533#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {25496#true} is VALID [2022-02-21 03:10:47,150 INFO L290 TraceCheckUtils]: 11: Hoare triple {25496#true} assume !(0 == ~m % 4294967296); {25496#true} is VALID [2022-02-21 03:10:47,150 INFO L290 TraceCheckUtils]: 12: Hoare triple {25496#true} assume !(~m % 4294967296 < 16777216); {25496#true} is VALID [2022-02-21 03:10:47,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {25496#true} assume !false; {25496#true} is VALID [2022-02-21 03:10:47,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {25496#true} assume !(~m % 4294967296 >= 33554432); {25496#true} is VALID [2022-02-21 03:10:47,151 INFO L290 TraceCheckUtils]: 15: Hoare triple {25496#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {25496#true} is VALID [2022-02-21 03:10:47,151 INFO L290 TraceCheckUtils]: 16: Hoare triple {25496#true} assume 128 + ~e <= 2147483647; {25496#true} is VALID [2022-02-21 03:10:47,151 INFO L290 TraceCheckUtils]: 17: Hoare triple {25496#true} assume 128 + ~e >= -2147483648; {25496#true} is VALID [2022-02-21 03:10:47,151 INFO L290 TraceCheckUtils]: 18: Hoare triple {25496#true} assume 128 + ~e <= 2147483647; {25496#true} is VALID [2022-02-21 03:10:47,151 INFO L290 TraceCheckUtils]: 19: Hoare triple {25496#true} assume 128 + ~e >= -2147483648; {25496#true} is VALID [2022-02-21 03:10:47,151 INFO L290 TraceCheckUtils]: 20: Hoare triple {25496#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {25496#true} is VALID [2022-02-21 03:10:47,152 INFO L290 TraceCheckUtils]: 21: Hoare triple {25496#true} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {25534#(<= base2flt_~res~0 0)} is VALID [2022-02-21 03:10:47,152 INFO L290 TraceCheckUtils]: 22: Hoare triple {25534#(<= base2flt_~res~0 0)} ~__retres4~0 := ~res~0; {25535#(<= base2flt_~__retres4~0 0)} is VALID [2022-02-21 03:10:47,152 INFO L290 TraceCheckUtils]: 23: Hoare triple {25535#(<= base2flt_~__retres4~0 0)} #res := ~__retres4~0; {25536#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:10:47,152 INFO L290 TraceCheckUtils]: 24: Hoare triple {25536#(<= |base2flt_#res| 0)} assume true; {25536#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:10:47,153 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {25536#(<= |base2flt_#res| 0)} {25496#true} #351#return; {25519#(<= |ULTIMATE.start_main_#t~ret23#1| 0)} is VALID [2022-02-21 03:10:47,153 INFO L290 TraceCheckUtils]: 26: Hoare triple {25519#(<= |ULTIMATE.start_main_#t~ret23#1| 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {25520#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:47,154 INFO L272 TraceCheckUtils]: 27: Hoare triple {25520#(<= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {25533#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:47,154 INFO L290 TraceCheckUtils]: 28: Hoare triple {25533#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {25496#true} is VALID [2022-02-21 03:10:47,154 INFO L290 TraceCheckUtils]: 29: Hoare triple {25496#true} assume !(0 == ~m % 4294967296); {25496#true} is VALID [2022-02-21 03:10:47,154 INFO L290 TraceCheckUtils]: 30: Hoare triple {25496#true} assume !(~m % 4294967296 < 16777216); {25496#true} is VALID [2022-02-21 03:10:47,154 INFO L290 TraceCheckUtils]: 31: Hoare triple {25496#true} assume !false; {25496#true} is VALID [2022-02-21 03:10:47,154 INFO L290 TraceCheckUtils]: 32: Hoare triple {25496#true} assume ~m % 4294967296 >= 33554432; {25496#true} is VALID [2022-02-21 03:10:47,154 INFO L290 TraceCheckUtils]: 33: Hoare triple {25496#true} assume ~e >= 127;~__retres4~0 := 4294967295; {25496#true} is VALID [2022-02-21 03:10:47,155 INFO L290 TraceCheckUtils]: 34: Hoare triple {25496#true} #res := ~__retres4~0; {25496#true} is VALID [2022-02-21 03:10:47,155 INFO L290 TraceCheckUtils]: 35: Hoare triple {25496#true} assume true; {25496#true} is VALID [2022-02-21 03:10:47,155 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {25496#true} {25520#(<= |ULTIMATE.start_main_~a~0#1| 0)} #353#return; {25520#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:47,155 INFO L290 TraceCheckUtils]: 37: Hoare triple {25520#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {25520#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:47,156 INFO L272 TraceCheckUtils]: 38: Hoare triple {25520#(<= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {25530#(<= |addflt_#in~a| 0)} is VALID [2022-02-21 03:10:47,156 INFO L290 TraceCheckUtils]: 39: Hoare triple {25530#(<= |addflt_#in~a| 0)} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {25531#(<= addflt_~a 0)} is VALID [2022-02-21 03:10:47,156 INFO L290 TraceCheckUtils]: 40: Hoare triple {25531#(<= addflt_~a 0)} assume !(~a % 4294967296 < ~b % 4294967296); {25531#(<= addflt_~a 0)} is VALID [2022-02-21 03:10:47,157 INFO L290 TraceCheckUtils]: 41: Hoare triple {25531#(<= addflt_~a 0)} assume !(0 == ~b % 4294967296); {25531#(<= addflt_~a 0)} is VALID [2022-02-21 03:10:47,157 INFO L290 TraceCheckUtils]: 42: Hoare triple {25531#(<= addflt_~a 0)} assume !(0 == ~a); {25532#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} is VALID [2022-02-21 03:10:47,157 INFO L290 TraceCheckUtils]: 43: Hoare triple {25532#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} assume !false; {25532#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} is VALID [2022-02-21 03:10:47,158 INFO L290 TraceCheckUtils]: 44: Hoare triple {25532#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} assume !false; {25532#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} is VALID [2022-02-21 03:10:47,158 INFO L290 TraceCheckUtils]: 45: Hoare triple {25532#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} assume ~a >= 0;abs_108 := (if ~a < 16777215 then ~a else 16777215);assume ~a >= 0;assume ~ma~0 < abs_108; {25497#false} is VALID [2022-02-21 03:10:47,158 INFO L290 TraceCheckUtils]: 46: Hoare triple {25497#false} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {25497#false} is VALID [2022-02-21 03:10:47,158 INFO L290 TraceCheckUtils]: 47: Hoare triple {25497#false} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {25497#false} is VALID [2022-02-21 03:10:47,159 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:47,159 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:47,159 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877785066] [2022-02-21 03:10:47,159 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877785066] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:47,159 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985210633] [2022-02-21 03:10:47,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:47,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:47,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:47,160 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:47,161 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:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:47,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:10:47,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:47,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:47,460 INFO L290 TraceCheckUtils]: 0: Hoare triple {25496#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); {25496#true} is VALID [2022-02-21 03:10:47,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {25496#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {25496#true} is VALID [2022-02-21 03:10:47,460 INFO L272 TraceCheckUtils]: 2: Hoare triple {25496#true} call main_#t~ret22#1 := base2flt(0, 0); {25496#true} is VALID [2022-02-21 03:10:47,460 INFO L290 TraceCheckUtils]: 3: Hoare triple {25496#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {25496#true} is VALID [2022-02-21 03:10:47,461 INFO L290 TraceCheckUtils]: 4: Hoare triple {25496#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {25496#true} is VALID [2022-02-21 03:10:47,461 INFO L290 TraceCheckUtils]: 5: Hoare triple {25496#true} #res := ~__retres4~0; {25496#true} is VALID [2022-02-21 03:10:47,461 INFO L290 TraceCheckUtils]: 6: Hoare triple {25496#true} assume true; {25496#true} is VALID [2022-02-21 03:10:47,461 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {25496#true} {25496#true} #349#return; {25496#true} is VALID [2022-02-21 03:10:47,461 INFO L290 TraceCheckUtils]: 8: Hoare triple {25496#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {25496#true} is VALID [2022-02-21 03:10:47,461 INFO L272 TraceCheckUtils]: 9: Hoare triple {25496#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {25496#true} is VALID [2022-02-21 03:10:47,461 INFO L290 TraceCheckUtils]: 10: Hoare triple {25496#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {25496#true} is VALID [2022-02-21 03:10:47,461 INFO L290 TraceCheckUtils]: 11: Hoare triple {25496#true} assume !(0 == ~m % 4294967296); {25496#true} is VALID [2022-02-21 03:10:47,461 INFO L290 TraceCheckUtils]: 12: Hoare triple {25496#true} assume !(~m % 4294967296 < 16777216); {25496#true} is VALID [2022-02-21 03:10:47,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {25496#true} assume !false; {25496#true} is VALID [2022-02-21 03:10:47,462 INFO L290 TraceCheckUtils]: 14: Hoare triple {25496#true} assume !(~m % 4294967296 >= 33554432); {25496#true} is VALID [2022-02-21 03:10:47,462 INFO L290 TraceCheckUtils]: 15: Hoare triple {25496#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {25496#true} is VALID [2022-02-21 03:10:47,462 INFO L290 TraceCheckUtils]: 16: Hoare triple {25496#true} assume 128 + ~e <= 2147483647; {25496#true} is VALID [2022-02-21 03:10:47,462 INFO L290 TraceCheckUtils]: 17: Hoare triple {25496#true} assume 128 + ~e >= -2147483648; {25496#true} is VALID [2022-02-21 03:10:47,462 INFO L290 TraceCheckUtils]: 18: Hoare triple {25496#true} assume 128 + ~e <= 2147483647; {25496#true} is VALID [2022-02-21 03:10:47,462 INFO L290 TraceCheckUtils]: 19: Hoare triple {25496#true} assume 128 + ~e >= -2147483648; {25496#true} is VALID [2022-02-21 03:10:47,462 INFO L290 TraceCheckUtils]: 20: Hoare triple {25496#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {25496#true} is VALID [2022-02-21 03:10:47,463 INFO L290 TraceCheckUtils]: 21: Hoare triple {25496#true} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {25534#(<= base2flt_~res~0 0)} is VALID [2022-02-21 03:10:47,463 INFO L290 TraceCheckUtils]: 22: Hoare triple {25534#(<= base2flt_~res~0 0)} ~__retres4~0 := ~res~0; {25535#(<= base2flt_~__retres4~0 0)} is VALID [2022-02-21 03:10:47,463 INFO L290 TraceCheckUtils]: 23: Hoare triple {25535#(<= base2flt_~__retres4~0 0)} #res := ~__retres4~0; {25536#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:10:47,464 INFO L290 TraceCheckUtils]: 24: Hoare triple {25536#(<= |base2flt_#res| 0)} assume true; {25536#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:10:47,464 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {25536#(<= |base2flt_#res| 0)} {25496#true} #351#return; {25519#(<= |ULTIMATE.start_main_#t~ret23#1| 0)} is VALID [2022-02-21 03:10:47,465 INFO L290 TraceCheckUtils]: 26: Hoare triple {25519#(<= |ULTIMATE.start_main_#t~ret23#1| 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {25520#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:47,465 INFO L272 TraceCheckUtils]: 27: Hoare triple {25520#(<= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {25496#true} is VALID [2022-02-21 03:10:47,465 INFO L290 TraceCheckUtils]: 28: Hoare triple {25496#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {25496#true} is VALID [2022-02-21 03:10:47,465 INFO L290 TraceCheckUtils]: 29: Hoare triple {25496#true} assume !(0 == ~m % 4294967296); {25496#true} is VALID [2022-02-21 03:10:47,465 INFO L290 TraceCheckUtils]: 30: Hoare triple {25496#true} assume !(~m % 4294967296 < 16777216); {25496#true} is VALID [2022-02-21 03:10:47,465 INFO L290 TraceCheckUtils]: 31: Hoare triple {25496#true} assume !false; {25496#true} is VALID [2022-02-21 03:10:47,465 INFO L290 TraceCheckUtils]: 32: Hoare triple {25496#true} assume ~m % 4294967296 >= 33554432; {25496#true} is VALID [2022-02-21 03:10:47,465 INFO L290 TraceCheckUtils]: 33: Hoare triple {25496#true} assume ~e >= 127;~__retres4~0 := 4294967295; {25496#true} is VALID [2022-02-21 03:10:47,465 INFO L290 TraceCheckUtils]: 34: Hoare triple {25496#true} #res := ~__retres4~0; {25496#true} is VALID [2022-02-21 03:10:47,466 INFO L290 TraceCheckUtils]: 35: Hoare triple {25496#true} assume true; {25496#true} is VALID [2022-02-21 03:10:47,466 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {25496#true} {25520#(<= |ULTIMATE.start_main_~a~0#1| 0)} #353#return; {25520#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:47,466 INFO L290 TraceCheckUtils]: 37: Hoare triple {25520#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {25520#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:47,467 INFO L272 TraceCheckUtils]: 38: Hoare triple {25520#(<= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {25530#(<= |addflt_#in~a| 0)} is VALID [2022-02-21 03:10:47,467 INFO L290 TraceCheckUtils]: 39: Hoare triple {25530#(<= |addflt_#in~a| 0)} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {25531#(<= addflt_~a 0)} is VALID [2022-02-21 03:10:47,468 INFO L290 TraceCheckUtils]: 40: Hoare triple {25531#(<= addflt_~a 0)} assume !(~a % 4294967296 < ~b % 4294967296); {25531#(<= addflt_~a 0)} is VALID [2022-02-21 03:10:47,468 INFO L290 TraceCheckUtils]: 41: Hoare triple {25531#(<= addflt_~a 0)} assume !(0 == ~b % 4294967296); {25531#(<= addflt_~a 0)} is VALID [2022-02-21 03:10:47,468 INFO L290 TraceCheckUtils]: 42: Hoare triple {25531#(<= addflt_~a 0)} assume !(0 == ~a); {25532#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} is VALID [2022-02-21 03:10:47,469 INFO L290 TraceCheckUtils]: 43: Hoare triple {25532#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} assume !false; {25532#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} is VALID [2022-02-21 03:10:47,469 INFO L290 TraceCheckUtils]: 44: Hoare triple {25532#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} assume !false; {25532#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} is VALID [2022-02-21 03:10:47,469 INFO L290 TraceCheckUtils]: 45: Hoare triple {25532#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} assume ~a >= 0;abs_108 := (if ~a < 16777215 then ~a else 16777215);assume ~a >= 0;assume ~ma~0 < abs_108; {25497#false} is VALID [2022-02-21 03:10:47,470 INFO L290 TraceCheckUtils]: 46: Hoare triple {25497#false} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {25497#false} is VALID [2022-02-21 03:10:47,470 INFO L290 TraceCheckUtils]: 47: Hoare triple {25497#false} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {25497#false} is VALID [2022-02-21 03:10:47,470 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:47,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:10:47,823 INFO L290 TraceCheckUtils]: 47: Hoare triple {25497#false} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {25497#false} is VALID [2022-02-21 03:10:47,823 INFO L290 TraceCheckUtils]: 46: Hoare triple {25497#false} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {25497#false} is VALID [2022-02-21 03:10:47,823 INFO L290 TraceCheckUtils]: 45: Hoare triple {25532#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} assume ~a >= 0;abs_108 := (if ~a < 16777215 then ~a else 16777215);assume ~a >= 0;assume ~ma~0 < abs_108; {25497#false} is VALID [2022-02-21 03:10:47,824 INFO L290 TraceCheckUtils]: 44: Hoare triple {25532#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} assume !false; {25532#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} is VALID [2022-02-21 03:10:47,824 INFO L290 TraceCheckUtils]: 43: Hoare triple {25532#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} assume !false; {25532#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} is VALID [2022-02-21 03:10:47,825 INFO L290 TraceCheckUtils]: 42: Hoare triple {25531#(<= addflt_~a 0)} assume !(0 == ~a); {25532#(and (not (= addflt_~a 0)) (<= addflt_~a 0))} is VALID [2022-02-21 03:10:47,825 INFO L290 TraceCheckUtils]: 41: Hoare triple {25531#(<= addflt_~a 0)} assume !(0 == ~b % 4294967296); {25531#(<= addflt_~a 0)} is VALID [2022-02-21 03:10:47,825 INFO L290 TraceCheckUtils]: 40: Hoare triple {25531#(<= addflt_~a 0)} assume !(~a % 4294967296 < ~b % 4294967296); {25531#(<= addflt_~a 0)} is VALID [2022-02-21 03:10:47,826 INFO L290 TraceCheckUtils]: 39: Hoare triple {25530#(<= |addflt_#in~a| 0)} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {25531#(<= addflt_~a 0)} is VALID [2022-02-21 03:10:47,826 INFO L272 TraceCheckUtils]: 38: Hoare triple {25520#(<= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {25530#(<= |addflt_#in~a| 0)} is VALID [2022-02-21 03:10:47,827 INFO L290 TraceCheckUtils]: 37: Hoare triple {25520#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {25520#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:47,827 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {25496#true} {25520#(<= |ULTIMATE.start_main_~a~0#1| 0)} #353#return; {25520#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:47,827 INFO L290 TraceCheckUtils]: 35: Hoare triple {25496#true} assume true; {25496#true} is VALID [2022-02-21 03:10:47,828 INFO L290 TraceCheckUtils]: 34: Hoare triple {25496#true} #res := ~__retres4~0; {25496#true} is VALID [2022-02-21 03:10:47,828 INFO L290 TraceCheckUtils]: 33: Hoare triple {25496#true} assume ~e >= 127;~__retres4~0 := 4294967295; {25496#true} is VALID [2022-02-21 03:10:47,828 INFO L290 TraceCheckUtils]: 32: Hoare triple {25496#true} assume ~m % 4294967296 >= 33554432; {25496#true} is VALID [2022-02-21 03:10:47,828 INFO L290 TraceCheckUtils]: 31: Hoare triple {25496#true} assume !false; {25496#true} is VALID [2022-02-21 03:10:47,828 INFO L290 TraceCheckUtils]: 30: Hoare triple {25496#true} assume !(~m % 4294967296 < 16777216); {25496#true} is VALID [2022-02-21 03:10:47,828 INFO L290 TraceCheckUtils]: 29: Hoare triple {25496#true} assume !(0 == ~m % 4294967296); {25496#true} is VALID [2022-02-21 03:10:47,828 INFO L290 TraceCheckUtils]: 28: Hoare triple {25496#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {25496#true} is VALID [2022-02-21 03:10:47,828 INFO L272 TraceCheckUtils]: 27: Hoare triple {25520#(<= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {25496#true} is VALID [2022-02-21 03:10:47,829 INFO L290 TraceCheckUtils]: 26: Hoare triple {25519#(<= |ULTIMATE.start_main_#t~ret23#1| 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {25520#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:47,830 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {25536#(<= |base2flt_#res| 0)} {25496#true} #351#return; {25519#(<= |ULTIMATE.start_main_#t~ret23#1| 0)} is VALID [2022-02-21 03:10:47,830 INFO L290 TraceCheckUtils]: 24: Hoare triple {25536#(<= |base2flt_#res| 0)} assume true; {25536#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:10:47,830 INFO L290 TraceCheckUtils]: 23: Hoare triple {25535#(<= base2flt_~__retres4~0 0)} #res := ~__retres4~0; {25536#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:10:47,831 INFO L290 TraceCheckUtils]: 22: Hoare triple {25534#(<= base2flt_~res~0 0)} ~__retres4~0 := ~res~0; {25535#(<= base2flt_~__retres4~0 0)} is VALID [2022-02-21 03:10:47,831 INFO L290 TraceCheckUtils]: 21: Hoare triple {25496#true} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {25534#(<= base2flt_~res~0 0)} is VALID [2022-02-21 03:10:47,832 INFO L290 TraceCheckUtils]: 20: Hoare triple {25496#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {25496#true} is VALID [2022-02-21 03:10:47,832 INFO L290 TraceCheckUtils]: 19: Hoare triple {25496#true} assume 128 + ~e >= -2147483648; {25496#true} is VALID [2022-02-21 03:10:47,832 INFO L290 TraceCheckUtils]: 18: Hoare triple {25496#true} assume 128 + ~e <= 2147483647; {25496#true} is VALID [2022-02-21 03:10:47,832 INFO L290 TraceCheckUtils]: 17: Hoare triple {25496#true} assume 128 + ~e >= -2147483648; {25496#true} is VALID [2022-02-21 03:10:47,832 INFO L290 TraceCheckUtils]: 16: Hoare triple {25496#true} assume 128 + ~e <= 2147483647; {25496#true} is VALID [2022-02-21 03:10:47,832 INFO L290 TraceCheckUtils]: 15: Hoare triple {25496#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {25496#true} is VALID [2022-02-21 03:10:47,832 INFO L290 TraceCheckUtils]: 14: Hoare triple {25496#true} assume !(~m % 4294967296 >= 33554432); {25496#true} is VALID [2022-02-21 03:10:47,832 INFO L290 TraceCheckUtils]: 13: Hoare triple {25496#true} assume !false; {25496#true} is VALID [2022-02-21 03:10:47,832 INFO L290 TraceCheckUtils]: 12: Hoare triple {25496#true} assume !(~m % 4294967296 < 16777216); {25496#true} is VALID [2022-02-21 03:10:47,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {25496#true} assume !(0 == ~m % 4294967296); {25496#true} is VALID [2022-02-21 03:10:47,833 INFO L290 TraceCheckUtils]: 10: Hoare triple {25496#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {25496#true} is VALID [2022-02-21 03:10:47,833 INFO L272 TraceCheckUtils]: 9: Hoare triple {25496#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {25496#true} is VALID [2022-02-21 03:10:47,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {25496#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {25496#true} is VALID [2022-02-21 03:10:47,833 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {25496#true} {25496#true} #349#return; {25496#true} is VALID [2022-02-21 03:10:47,833 INFO L290 TraceCheckUtils]: 6: Hoare triple {25496#true} assume true; {25496#true} is VALID [2022-02-21 03:10:47,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {25496#true} #res := ~__retres4~0; {25496#true} is VALID [2022-02-21 03:10:47,833 INFO L290 TraceCheckUtils]: 4: Hoare triple {25496#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {25496#true} is VALID [2022-02-21 03:10:47,833 INFO L290 TraceCheckUtils]: 3: Hoare triple {25496#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {25496#true} is VALID [2022-02-21 03:10:47,833 INFO L272 TraceCheckUtils]: 2: Hoare triple {25496#true} call main_#t~ret22#1 := base2flt(0, 0); {25496#true} is VALID [2022-02-21 03:10:47,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {25496#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {25496#true} is VALID [2022-02-21 03:10:47,834 INFO L290 TraceCheckUtils]: 0: Hoare triple {25496#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); {25496#true} is VALID [2022-02-21 03:10:47,834 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:47,834 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985210633] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:10:47,834 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:10:47,834 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 11 [2022-02-21 03:10:47,834 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763547692] [2022-02-21 03:10:47,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:10:47,835 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2022-02-21 03:10:47,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:47,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:47,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:47,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-21 03:10:47,865 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:47,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-21 03:10:47,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-02-21 03:10:47,868 INFO L87 Difference]: Start difference. First operand 337 states and 458 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:51,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:51,207 INFO L93 Difference]: Finished difference Result 1032 states and 1414 transitions. [2022-02-21 03:10:51,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-21 03:10:51,207 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2022-02-21 03:10:51,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:51,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:51,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 617 transitions. [2022-02-21 03:10:51,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:51,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 617 transitions. [2022-02-21 03:10:51,214 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 617 transitions. [2022-02-21 03:10:51,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 617 edges. 617 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:51,581 INFO L225 Difference]: With dead ends: 1032 [2022-02-21 03:10:51,581 INFO L226 Difference]: Without dead ends: 919 [2022-02-21 03:10:51,582 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2022-02-21 03:10:51,583 INFO L933 BasicCegarLoop]: 358 mSDtfsCounter, 407 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 2279 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 2332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:51,583 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [411 Valid, 797 Invalid, 2332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2279 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-02-21 03:10:51,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2022-02-21 03:10:51,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 475. [2022-02-21 03:10:51,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:51,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 919 states. Second operand has 475 states, 422 states have (on average 1.4099526066350712) internal successors, (595), 435 states have internal predecessors, (595), 30 states have call successors, (30), 10 states have call predecessors, (30), 13 states have return successors, (34), 29 states have call predecessors, (34), 29 states have call successors, (34) [2022-02-21 03:10:51,857 INFO L74 IsIncluded]: Start isIncluded. First operand 919 states. Second operand has 475 states, 422 states have (on average 1.4099526066350712) internal successors, (595), 435 states have internal predecessors, (595), 30 states have call successors, (30), 10 states have call predecessors, (30), 13 states have return successors, (34), 29 states have call predecessors, (34), 29 states have call successors, (34) [2022-02-21 03:10:51,857 INFO L87 Difference]: Start difference. First operand 919 states. Second operand has 475 states, 422 states have (on average 1.4099526066350712) internal successors, (595), 435 states have internal predecessors, (595), 30 states have call successors, (30), 10 states have call predecessors, (30), 13 states have return successors, (34), 29 states have call predecessors, (34), 29 states have call successors, (34) [2022-02-21 03:10:51,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:51,894 INFO L93 Difference]: Finished difference Result 919 states and 1259 transitions. [2022-02-21 03:10:51,895 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1259 transitions. [2022-02-21 03:10:51,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:51,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:51,898 INFO L74 IsIncluded]: Start isIncluded. First operand has 475 states, 422 states have (on average 1.4099526066350712) internal successors, (595), 435 states have internal predecessors, (595), 30 states have call successors, (30), 10 states have call predecessors, (30), 13 states have return successors, (34), 29 states have call predecessors, (34), 29 states have call successors, (34) Second operand 919 states. [2022-02-21 03:10:51,898 INFO L87 Difference]: Start difference. First operand has 475 states, 422 states have (on average 1.4099526066350712) internal successors, (595), 435 states have internal predecessors, (595), 30 states have call successors, (30), 10 states have call predecessors, (30), 13 states have return successors, (34), 29 states have call predecessors, (34), 29 states have call successors, (34) Second operand 919 states. [2022-02-21 03:10:51,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:51,939 INFO L93 Difference]: Finished difference Result 919 states and 1259 transitions. [2022-02-21 03:10:51,939 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1259 transitions. [2022-02-21 03:10:51,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:51,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:51,941 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:51,941 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:51,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 422 states have (on average 1.4099526066350712) internal successors, (595), 435 states have internal predecessors, (595), 30 states have call successors, (30), 10 states have call predecessors, (30), 13 states have return successors, (34), 29 states have call predecessors, (34), 29 states have call successors, (34) [2022-02-21 03:10:51,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 659 transitions. [2022-02-21 03:10:51,955 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 659 transitions. Word has length 48 [2022-02-21 03:10:51,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:51,955 INFO L470 AbstractCegarLoop]: Abstraction has 475 states and 659 transitions. [2022-02-21 03:10:51,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:51,956 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 659 transitions. [2022-02-21 03:10:51,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-21 03:10:51,957 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:51,957 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:52,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-02-21 03:10:52,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:52,171 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:52,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:52,172 INFO L85 PathProgramCache]: Analyzing trace with hash -836151028, now seen corresponding path program 1 times [2022-02-21 03:10:52,172 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:52,172 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511240521] [2022-02-21 03:10:52,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:52,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:52,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:52,237 INFO L290 TraceCheckUtils]: 0: Hoare triple {29391#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {29355#true} is VALID [2022-02-21 03:10:52,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {29355#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {29355#true} is VALID [2022-02-21 03:10:52,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {29355#true} #res := ~__retres4~0; {29355#true} is VALID [2022-02-21 03:10:52,238 INFO L290 TraceCheckUtils]: 3: Hoare triple {29355#true} assume true; {29355#true} is VALID [2022-02-21 03:10:52,238 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {29355#true} {29355#true} #349#return; {29355#true} is VALID [2022-02-21 03:10:52,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:52,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:52,275 INFO L290 TraceCheckUtils]: 0: Hoare triple {29391#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {29355#true} is VALID [2022-02-21 03:10:52,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {29355#true} assume !(0 == ~m % 4294967296); {29355#true} is VALID [2022-02-21 03:10:52,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {29355#true} assume !(~m % 4294967296 < 16777216); {29355#true} is VALID [2022-02-21 03:10:52,276 INFO L290 TraceCheckUtils]: 3: Hoare triple {29355#true} assume !false; {29355#true} is VALID [2022-02-21 03:10:52,276 INFO L290 TraceCheckUtils]: 4: Hoare triple {29355#true} assume !(~m % 4294967296 >= 33554432); {29355#true} is VALID [2022-02-21 03:10:52,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {29355#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {29355#true} is VALID [2022-02-21 03:10:52,276 INFO L290 TraceCheckUtils]: 6: Hoare triple {29355#true} assume 128 + ~e <= 2147483647; {29355#true} is VALID [2022-02-21 03:10:52,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {29355#true} assume 128 + ~e >= -2147483648; {29355#true} is VALID [2022-02-21 03:10:52,276 INFO L290 TraceCheckUtils]: 8: Hoare triple {29355#true} assume 128 + ~e <= 2147483647; {29355#true} is VALID [2022-02-21 03:10:52,276 INFO L290 TraceCheckUtils]: 9: Hoare triple {29355#true} assume 128 + ~e >= -2147483648; {29355#true} is VALID [2022-02-21 03:10:52,276 INFO L290 TraceCheckUtils]: 10: Hoare triple {29355#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {29355#true} is VALID [2022-02-21 03:10:52,277 INFO L290 TraceCheckUtils]: 11: Hoare triple {29355#true} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {29392#(<= 0 base2flt_~res~0)} is VALID [2022-02-21 03:10:52,278 INFO L290 TraceCheckUtils]: 12: Hoare triple {29392#(<= 0 base2flt_~res~0)} ~__retres4~0 := ~res~0; {29393#(<= 0 base2flt_~__retres4~0)} is VALID [2022-02-21 03:10:52,278 INFO L290 TraceCheckUtils]: 13: Hoare triple {29393#(<= 0 base2flt_~__retres4~0)} #res := ~__retres4~0; {29394#(<= 0 |base2flt_#res|)} is VALID [2022-02-21 03:10:52,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {29394#(<= 0 |base2flt_#res|)} assume true; {29394#(<= 0 |base2flt_#res|)} is VALID [2022-02-21 03:10:52,279 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {29394#(<= 0 |base2flt_#res|)} {29355#true} #351#return; {29378#(<= 0 |ULTIMATE.start_main_#t~ret23#1|)} is VALID [2022-02-21 03:10:52,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-21 03:10:52,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:52,290 INFO L290 TraceCheckUtils]: 0: Hoare triple {29391#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {29355#true} is VALID [2022-02-21 03:10:52,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {29355#true} assume !(0 == ~m % 4294967296); {29355#true} is VALID [2022-02-21 03:10:52,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {29355#true} assume !(~m % 4294967296 < 16777216); {29355#true} is VALID [2022-02-21 03:10:52,290 INFO L290 TraceCheckUtils]: 3: Hoare triple {29355#true} assume !false; {29355#true} is VALID [2022-02-21 03:10:52,290 INFO L290 TraceCheckUtils]: 4: Hoare triple {29355#true} assume ~m % 4294967296 >= 33554432; {29355#true} is VALID [2022-02-21 03:10:52,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {29355#true} assume ~e >= 127;~__retres4~0 := 4294967295; {29355#true} is VALID [2022-02-21 03:10:52,291 INFO L290 TraceCheckUtils]: 6: Hoare triple {29355#true} #res := ~__retres4~0; {29355#true} is VALID [2022-02-21 03:10:52,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {29355#true} assume true; {29355#true} is VALID [2022-02-21 03:10:52,292 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {29355#true} {29379#(<= 0 |ULTIMATE.start_main_~a~0#1|)} #353#return; {29379#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:52,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {29355#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); {29355#true} is VALID [2022-02-21 03:10:52,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {29355#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {29355#true} is VALID [2022-02-21 03:10:52,293 INFO L272 TraceCheckUtils]: 2: Hoare triple {29355#true} call main_#t~ret22#1 := base2flt(0, 0); {29391#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:52,293 INFO L290 TraceCheckUtils]: 3: Hoare triple {29391#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {29355#true} is VALID [2022-02-21 03:10:52,293 INFO L290 TraceCheckUtils]: 4: Hoare triple {29355#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {29355#true} is VALID [2022-02-21 03:10:52,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {29355#true} #res := ~__retres4~0; {29355#true} is VALID [2022-02-21 03:10:52,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {29355#true} assume true; {29355#true} is VALID [2022-02-21 03:10:52,293 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {29355#true} {29355#true} #349#return; {29355#true} is VALID [2022-02-21 03:10:52,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {29355#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {29355#true} is VALID [2022-02-21 03:10:52,294 INFO L272 TraceCheckUtils]: 9: Hoare triple {29355#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {29391#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:52,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {29391#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {29355#true} is VALID [2022-02-21 03:10:52,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {29355#true} assume !(0 == ~m % 4294967296); {29355#true} is VALID [2022-02-21 03:10:52,294 INFO L290 TraceCheckUtils]: 12: Hoare triple {29355#true} assume !(~m % 4294967296 < 16777216); {29355#true} is VALID [2022-02-21 03:10:52,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {29355#true} assume !false; {29355#true} is VALID [2022-02-21 03:10:52,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {29355#true} assume !(~m % 4294967296 >= 33554432); {29355#true} is VALID [2022-02-21 03:10:52,295 INFO L290 TraceCheckUtils]: 15: Hoare triple {29355#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {29355#true} is VALID [2022-02-21 03:10:52,295 INFO L290 TraceCheckUtils]: 16: Hoare triple {29355#true} assume 128 + ~e <= 2147483647; {29355#true} is VALID [2022-02-21 03:10:52,295 INFO L290 TraceCheckUtils]: 17: Hoare triple {29355#true} assume 128 + ~e >= -2147483648; {29355#true} is VALID [2022-02-21 03:10:52,295 INFO L290 TraceCheckUtils]: 18: Hoare triple {29355#true} assume 128 + ~e <= 2147483647; {29355#true} is VALID [2022-02-21 03:10:52,295 INFO L290 TraceCheckUtils]: 19: Hoare triple {29355#true} assume 128 + ~e >= -2147483648; {29355#true} is VALID [2022-02-21 03:10:52,295 INFO L290 TraceCheckUtils]: 20: Hoare triple {29355#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {29355#true} is VALID [2022-02-21 03:10:52,296 INFO L290 TraceCheckUtils]: 21: Hoare triple {29355#true} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {29392#(<= 0 base2flt_~res~0)} is VALID [2022-02-21 03:10:52,296 INFO L290 TraceCheckUtils]: 22: Hoare triple {29392#(<= 0 base2flt_~res~0)} ~__retres4~0 := ~res~0; {29393#(<= 0 base2flt_~__retres4~0)} is VALID [2022-02-21 03:10:52,297 INFO L290 TraceCheckUtils]: 23: Hoare triple {29393#(<= 0 base2flt_~__retres4~0)} #res := ~__retres4~0; {29394#(<= 0 |base2flt_#res|)} is VALID [2022-02-21 03:10:52,297 INFO L290 TraceCheckUtils]: 24: Hoare triple {29394#(<= 0 |base2flt_#res|)} assume true; {29394#(<= 0 |base2flt_#res|)} is VALID [2022-02-21 03:10:52,298 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {29394#(<= 0 |base2flt_#res|)} {29355#true} #351#return; {29378#(<= 0 |ULTIMATE.start_main_#t~ret23#1|)} is VALID [2022-02-21 03:10:52,298 INFO L290 TraceCheckUtils]: 26: Hoare triple {29378#(<= 0 |ULTIMATE.start_main_#t~ret23#1|)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {29379#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:52,299 INFO L272 TraceCheckUtils]: 27: Hoare triple {29379#(<= 0 |ULTIMATE.start_main_~a~0#1|)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {29391#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:52,299 INFO L290 TraceCheckUtils]: 28: Hoare triple {29391#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {29355#true} is VALID [2022-02-21 03:10:52,299 INFO L290 TraceCheckUtils]: 29: Hoare triple {29355#true} assume !(0 == ~m % 4294967296); {29355#true} is VALID [2022-02-21 03:10:52,299 INFO L290 TraceCheckUtils]: 30: Hoare triple {29355#true} assume !(~m % 4294967296 < 16777216); {29355#true} is VALID [2022-02-21 03:10:52,299 INFO L290 TraceCheckUtils]: 31: Hoare triple {29355#true} assume !false; {29355#true} is VALID [2022-02-21 03:10:52,299 INFO L290 TraceCheckUtils]: 32: Hoare triple {29355#true} assume ~m % 4294967296 >= 33554432; {29355#true} is VALID [2022-02-21 03:10:52,299 INFO L290 TraceCheckUtils]: 33: Hoare triple {29355#true} assume ~e >= 127;~__retres4~0 := 4294967295; {29355#true} is VALID [2022-02-21 03:10:52,300 INFO L290 TraceCheckUtils]: 34: Hoare triple {29355#true} #res := ~__retres4~0; {29355#true} is VALID [2022-02-21 03:10:52,300 INFO L290 TraceCheckUtils]: 35: Hoare triple {29355#true} assume true; {29355#true} is VALID [2022-02-21 03:10:52,300 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {29355#true} {29379#(<= 0 |ULTIMATE.start_main_~a~0#1|)} #353#return; {29379#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:52,301 INFO L290 TraceCheckUtils]: 37: Hoare triple {29379#(<= 0 |ULTIMATE.start_main_~a~0#1|)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {29379#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:52,301 INFO L272 TraceCheckUtils]: 38: Hoare triple {29379#(<= 0 |ULTIMATE.start_main_~a~0#1|)} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {29389#(<= 0 |addflt_#in~a|)} is VALID [2022-02-21 03:10:52,302 INFO L290 TraceCheckUtils]: 39: Hoare triple {29389#(<= 0 |addflt_#in~a|)} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {29390#(<= 0 addflt_~a)} is VALID [2022-02-21 03:10:52,302 INFO L290 TraceCheckUtils]: 40: Hoare triple {29390#(<= 0 addflt_~a)} assume !(~a % 4294967296 < ~b % 4294967296); {29390#(<= 0 addflt_~a)} is VALID [2022-02-21 03:10:52,302 INFO L290 TraceCheckUtils]: 41: Hoare triple {29390#(<= 0 addflt_~a)} assume !(0 == ~b % 4294967296); {29390#(<= 0 addflt_~a)} is VALID [2022-02-21 03:10:52,303 INFO L290 TraceCheckUtils]: 42: Hoare triple {29390#(<= 0 addflt_~a)} assume !(0 == ~a); {29390#(<= 0 addflt_~a)} is VALID [2022-02-21 03:10:52,303 INFO L290 TraceCheckUtils]: 43: Hoare triple {29390#(<= 0 addflt_~a)} assume !false; {29390#(<= 0 addflt_~a)} is VALID [2022-02-21 03:10:52,303 INFO L290 TraceCheckUtils]: 44: Hoare triple {29390#(<= 0 addflt_~a)} assume !false; {29390#(<= 0 addflt_~a)} is VALID [2022-02-21 03:10:52,304 INFO L290 TraceCheckUtils]: 45: Hoare triple {29390#(<= 0 addflt_~a)} assume !(~a >= 0);~ma~0 := #t~nondet6;havoc #t~nondet6; {29356#false} is VALID [2022-02-21 03:10:52,304 INFO L290 TraceCheckUtils]: 46: Hoare triple {29356#false} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {29356#false} is VALID [2022-02-21 03:10:52,304 INFO L290 TraceCheckUtils]: 47: Hoare triple {29356#false} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {29356#false} is VALID [2022-02-21 03:10:52,304 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:52,304 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:52,304 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511240521] [2022-02-21 03:10:52,305 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511240521] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:52,305 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809710003] [2022-02-21 03:10:52,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:52,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:52,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:52,306 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:52,348 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:52,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:52,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 03:10:52,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:52,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:56,003 INFO L290 TraceCheckUtils]: 0: Hoare triple {29355#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); {29355#true} is VALID [2022-02-21 03:10:56,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {29355#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {29401#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:56,004 INFO L272 TraceCheckUtils]: 2: Hoare triple {29401#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret22#1 := base2flt(0, 0); {29355#true} is VALID [2022-02-21 03:10:56,004 INFO L290 TraceCheckUtils]: 3: Hoare triple {29355#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {29355#true} is VALID [2022-02-21 03:10:56,004 INFO L290 TraceCheckUtils]: 4: Hoare triple {29355#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {29355#true} is VALID [2022-02-21 03:10:56,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {29355#true} #res := ~__retres4~0; {29355#true} is VALID [2022-02-21 03:10:56,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {29355#true} assume true; {29355#true} is VALID [2022-02-21 03:10:56,005 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {29355#true} {29401#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} #349#return; {29401#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:56,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {29401#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {29401#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:56,006 INFO L272 TraceCheckUtils]: 9: Hoare triple {29401#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {29355#true} is VALID [2022-02-21 03:10:56,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {29355#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {29429#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:56,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {29429#(<= |base2flt_#in~e| base2flt_~e)} assume !(0 == ~m % 4294967296); {29429#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:56,007 INFO L290 TraceCheckUtils]: 12: Hoare triple {29429#(<= |base2flt_#in~e| base2flt_~e)} assume !(~m % 4294967296 < 16777216); {29429#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:56,007 INFO L290 TraceCheckUtils]: 13: Hoare triple {29429#(<= |base2flt_#in~e| base2flt_~e)} assume !false; {29429#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:56,007 INFO L290 TraceCheckUtils]: 14: Hoare triple {29429#(<= |base2flt_#in~e| base2flt_~e)} assume !(~m % 4294967296 >= 33554432); {29429#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:56,008 INFO L290 TraceCheckUtils]: 15: Hoare triple {29429#(<= |base2flt_#in~e| base2flt_~e)} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {29429#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:56,008 INFO L290 TraceCheckUtils]: 16: Hoare triple {29429#(<= |base2flt_#in~e| base2flt_~e)} assume 128 + ~e <= 2147483647; {29429#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:56,009 INFO L290 TraceCheckUtils]: 17: Hoare triple {29429#(<= |base2flt_#in~e| base2flt_~e)} assume 128 + ~e >= -2147483648; {29429#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:56,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {29429#(<= |base2flt_#in~e| base2flt_~e)} assume 128 + ~e <= 2147483647; {29429#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:56,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {29429#(<= |base2flt_#in~e| base2flt_~e)} assume 128 + ~e >= -2147483648; {29429#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:56,010 INFO L290 TraceCheckUtils]: 20: Hoare triple {29429#(<= |base2flt_#in~e| base2flt_~e)} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {29429#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:56,010 INFO L290 TraceCheckUtils]: 21: Hoare triple {29429#(<= |base2flt_#in~e| base2flt_~e)} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {29463#(<= |base2flt_#in~e| (div (+ (- 2147483648) base2flt_~res~0) 16777216))} is VALID [2022-02-21 03:10:56,011 INFO L290 TraceCheckUtils]: 22: Hoare triple {29463#(<= |base2flt_#in~e| (div (+ (- 2147483648) base2flt_~res~0) 16777216))} ~__retres4~0 := ~res~0; {29467#(<= |base2flt_#in~e| (div (+ (- 2147483648) base2flt_~__retres4~0) 16777216))} is VALID [2022-02-21 03:10:56,011 INFO L290 TraceCheckUtils]: 23: Hoare triple {29467#(<= |base2flt_#in~e| (div (+ (- 2147483648) base2flt_~__retres4~0) 16777216))} #res := ~__retres4~0; {29471#(<= |base2flt_#in~e| (div (+ (- 2147483648) |base2flt_#res|) 16777216))} is VALID [2022-02-21 03:10:56,012 INFO L290 TraceCheckUtils]: 24: Hoare triple {29471#(<= |base2flt_#in~e| (div (+ (- 2147483648) |base2flt_#res|) 16777216))} assume true; {29471#(<= |base2flt_#in~e| (div (+ (- 2147483648) |base2flt_#res|) 16777216))} is VALID [2022-02-21 03:10:56,013 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {29471#(<= |base2flt_#in~e| (div (+ (- 2147483648) |base2flt_#res|) 16777216))} {29401#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} #351#return; {29378#(<= 0 |ULTIMATE.start_main_#t~ret23#1|)} is VALID [2022-02-21 03:10:56,013 INFO L290 TraceCheckUtils]: 26: Hoare triple {29378#(<= 0 |ULTIMATE.start_main_#t~ret23#1|)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {29379#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:56,013 INFO L272 TraceCheckUtils]: 27: Hoare triple {29379#(<= 0 |ULTIMATE.start_main_~a~0#1|)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {29355#true} is VALID [2022-02-21 03:10:56,013 INFO L290 TraceCheckUtils]: 28: Hoare triple {29355#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {29355#true} is VALID [2022-02-21 03:10:56,013 INFO L290 TraceCheckUtils]: 29: Hoare triple {29355#true} assume !(0 == ~m % 4294967296); {29355#true} is VALID [2022-02-21 03:10:56,014 INFO L290 TraceCheckUtils]: 30: Hoare triple {29355#true} assume !(~m % 4294967296 < 16777216); {29355#true} is VALID [2022-02-21 03:10:56,014 INFO L290 TraceCheckUtils]: 31: Hoare triple {29355#true} assume !false; {29355#true} is VALID [2022-02-21 03:10:56,033 INFO L290 TraceCheckUtils]: 32: Hoare triple {29355#true} assume ~m % 4294967296 >= 33554432; {29355#true} is VALID [2022-02-21 03:10:56,033 INFO L290 TraceCheckUtils]: 33: Hoare triple {29355#true} assume ~e >= 127;~__retres4~0 := 4294967295; {29355#true} is VALID [2022-02-21 03:10:56,033 INFO L290 TraceCheckUtils]: 34: Hoare triple {29355#true} #res := ~__retres4~0; {29355#true} is VALID [2022-02-21 03:10:56,033 INFO L290 TraceCheckUtils]: 35: Hoare triple {29355#true} assume true; {29355#true} is VALID [2022-02-21 03:10:56,035 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {29355#true} {29379#(<= 0 |ULTIMATE.start_main_~a~0#1|)} #353#return; {29379#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:56,035 INFO L290 TraceCheckUtils]: 37: Hoare triple {29379#(<= 0 |ULTIMATE.start_main_~a~0#1|)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {29379#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:56,036 INFO L272 TraceCheckUtils]: 38: Hoare triple {29379#(<= 0 |ULTIMATE.start_main_~a~0#1|)} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {29389#(<= 0 |addflt_#in~a|)} is VALID [2022-02-21 03:10:56,036 INFO L290 TraceCheckUtils]: 39: Hoare triple {29389#(<= 0 |addflt_#in~a|)} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {29390#(<= 0 addflt_~a)} is VALID [2022-02-21 03:10:56,037 INFO L290 TraceCheckUtils]: 40: Hoare triple {29390#(<= 0 addflt_~a)} assume !(~a % 4294967296 < ~b % 4294967296); {29390#(<= 0 addflt_~a)} is VALID [2022-02-21 03:10:56,037 INFO L290 TraceCheckUtils]: 41: Hoare triple {29390#(<= 0 addflt_~a)} assume !(0 == ~b % 4294967296); {29390#(<= 0 addflt_~a)} is VALID [2022-02-21 03:10:56,037 INFO L290 TraceCheckUtils]: 42: Hoare triple {29390#(<= 0 addflt_~a)} assume !(0 == ~a); {29390#(<= 0 addflt_~a)} is VALID [2022-02-21 03:10:56,038 INFO L290 TraceCheckUtils]: 43: Hoare triple {29390#(<= 0 addflt_~a)} assume !false; {29390#(<= 0 addflt_~a)} is VALID [2022-02-21 03:10:56,038 INFO L290 TraceCheckUtils]: 44: Hoare triple {29390#(<= 0 addflt_~a)} assume !false; {29390#(<= 0 addflt_~a)} is VALID [2022-02-21 03:10:56,038 INFO L290 TraceCheckUtils]: 45: Hoare triple {29390#(<= 0 addflt_~a)} assume !(~a >= 0);~ma~0 := #t~nondet6;havoc #t~nondet6; {29356#false} is VALID [2022-02-21 03:10:56,039 INFO L290 TraceCheckUtils]: 46: Hoare triple {29356#false} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {29356#false} is VALID [2022-02-21 03:10:56,039 INFO L290 TraceCheckUtils]: 47: Hoare triple {29356#false} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {29356#false} is VALID [2022-02-21 03:10:56,039 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:56,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:10:56,593 INFO L290 TraceCheckUtils]: 47: Hoare triple {29356#false} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {29356#false} is VALID [2022-02-21 03:10:56,593 INFO L290 TraceCheckUtils]: 46: Hoare triple {29356#false} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {29356#false} is VALID [2022-02-21 03:10:56,594 INFO L290 TraceCheckUtils]: 45: Hoare triple {29390#(<= 0 addflt_~a)} assume !(~a >= 0);~ma~0 := #t~nondet6;havoc #t~nondet6; {29356#false} is VALID [2022-02-21 03:10:56,594 INFO L290 TraceCheckUtils]: 44: Hoare triple {29390#(<= 0 addflt_~a)} assume !false; {29390#(<= 0 addflt_~a)} is VALID [2022-02-21 03:10:56,594 INFO L290 TraceCheckUtils]: 43: Hoare triple {29390#(<= 0 addflt_~a)} assume !false; {29390#(<= 0 addflt_~a)} is VALID [2022-02-21 03:10:56,595 INFO L290 TraceCheckUtils]: 42: Hoare triple {29390#(<= 0 addflt_~a)} assume !(0 == ~a); {29390#(<= 0 addflt_~a)} is VALID [2022-02-21 03:10:56,595 INFO L290 TraceCheckUtils]: 41: Hoare triple {29390#(<= 0 addflt_~a)} assume !(0 == ~b % 4294967296); {29390#(<= 0 addflt_~a)} is VALID [2022-02-21 03:10:56,595 INFO L290 TraceCheckUtils]: 40: Hoare triple {29390#(<= 0 addflt_~a)} assume !(~a % 4294967296 < ~b % 4294967296); {29390#(<= 0 addflt_~a)} is VALID [2022-02-21 03:10:56,596 INFO L290 TraceCheckUtils]: 39: Hoare triple {29389#(<= 0 |addflt_#in~a|)} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {29390#(<= 0 addflt_~a)} is VALID [2022-02-21 03:10:56,596 INFO L272 TraceCheckUtils]: 38: Hoare triple {29379#(<= 0 |ULTIMATE.start_main_~a~0#1|)} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {29389#(<= 0 |addflt_#in~a|)} is VALID [2022-02-21 03:10:56,597 INFO L290 TraceCheckUtils]: 37: Hoare triple {29379#(<= 0 |ULTIMATE.start_main_~a~0#1|)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {29379#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:56,597 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {29355#true} {29379#(<= 0 |ULTIMATE.start_main_~a~0#1|)} #353#return; {29379#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:56,597 INFO L290 TraceCheckUtils]: 35: Hoare triple {29355#true} assume true; {29355#true} is VALID [2022-02-21 03:10:56,597 INFO L290 TraceCheckUtils]: 34: Hoare triple {29355#true} #res := ~__retres4~0; {29355#true} is VALID [2022-02-21 03:10:56,597 INFO L290 TraceCheckUtils]: 33: Hoare triple {29355#true} assume ~e >= 127;~__retres4~0 := 4294967295; {29355#true} is VALID [2022-02-21 03:10:56,598 INFO L290 TraceCheckUtils]: 32: Hoare triple {29355#true} assume ~m % 4294967296 >= 33554432; {29355#true} is VALID [2022-02-21 03:10:56,598 INFO L290 TraceCheckUtils]: 31: Hoare triple {29355#true} assume !false; {29355#true} is VALID [2022-02-21 03:10:56,598 INFO L290 TraceCheckUtils]: 30: Hoare triple {29355#true} assume !(~m % 4294967296 < 16777216); {29355#true} is VALID [2022-02-21 03:10:56,598 INFO L290 TraceCheckUtils]: 29: Hoare triple {29355#true} assume !(0 == ~m % 4294967296); {29355#true} is VALID [2022-02-21 03:10:56,598 INFO L290 TraceCheckUtils]: 28: Hoare triple {29355#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {29355#true} is VALID [2022-02-21 03:10:56,598 INFO L272 TraceCheckUtils]: 27: Hoare triple {29379#(<= 0 |ULTIMATE.start_main_~a~0#1|)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {29355#true} is VALID [2022-02-21 03:10:56,599 INFO L290 TraceCheckUtils]: 26: Hoare triple {29378#(<= 0 |ULTIMATE.start_main_#t~ret23#1|)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {29379#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:56,599 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {29613#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 |base2flt_#res|))} {29401#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} #351#return; {29378#(<= 0 |ULTIMATE.start_main_#t~ret23#1|)} is VALID [2022-02-21 03:10:56,600 INFO L290 TraceCheckUtils]: 24: Hoare triple {29613#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 |base2flt_#res|))} assume true; {29613#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:56,600 INFO L290 TraceCheckUtils]: 23: Hoare triple {29620#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {29613#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:56,600 INFO L290 TraceCheckUtils]: 22: Hoare triple {29624#(or (<= 0 base2flt_~res~0) (< (+ 128 |base2flt_#in~e|) 0))} ~__retres4~0 := ~res~0; {29620#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:56,601 INFO L290 TraceCheckUtils]: 21: Hoare triple {29628#(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); {29624#(or (<= 0 base2flt_~res~0) (< (+ 128 |base2flt_#in~e|) 0))} is VALID [2022-02-21 03:10:56,601 INFO L290 TraceCheckUtils]: 20: Hoare triple {29628#(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))); {29628#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} is VALID [2022-02-21 03:10:56,602 INFO L290 TraceCheckUtils]: 19: Hoare triple {29628#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} assume 128 + ~e >= -2147483648; {29628#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} is VALID [2022-02-21 03:10:56,602 INFO L290 TraceCheckUtils]: 18: Hoare triple {29628#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} assume 128 + ~e <= 2147483647; {29628#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} is VALID [2022-02-21 03:10:56,602 INFO L290 TraceCheckUtils]: 17: Hoare triple {29628#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} assume 128 + ~e >= -2147483648; {29628#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} is VALID [2022-02-21 03:10:56,603 INFO L290 TraceCheckUtils]: 16: Hoare triple {29628#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} assume 128 + ~e <= 2147483647; {29628#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} is VALID [2022-02-21 03:10:56,603 INFO L290 TraceCheckUtils]: 15: Hoare triple {29628#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {29628#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} is VALID [2022-02-21 03:10:56,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {29628#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} assume !(~m % 4294967296 >= 33554432); {29628#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} is VALID [2022-02-21 03:10:56,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {29628#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} assume !false; {29628#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} is VALID [2022-02-21 03:10:56,608 INFO L290 TraceCheckUtils]: 12: Hoare triple {29628#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} assume !(~m % 4294967296 < 16777216); {29628#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} is VALID [2022-02-21 03:10:56,608 INFO L290 TraceCheckUtils]: 11: Hoare triple {29628#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} assume !(0 == ~m % 4294967296); {29628#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} is VALID [2022-02-21 03:10:56,609 INFO L290 TraceCheckUtils]: 10: Hoare triple {29355#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {29628#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} is VALID [2022-02-21 03:10:56,609 INFO L272 TraceCheckUtils]: 9: Hoare triple {29401#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {29355#true} is VALID [2022-02-21 03:10:56,609 INFO L290 TraceCheckUtils]: 8: Hoare triple {29401#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {29401#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:56,610 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {29355#true} {29401#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} #349#return; {29401#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:56,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {29355#true} assume true; {29355#true} is VALID [2022-02-21 03:10:56,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {29355#true} #res := ~__retres4~0; {29355#true} is VALID [2022-02-21 03:10:56,610 INFO L290 TraceCheckUtils]: 4: Hoare triple {29355#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {29355#true} is VALID [2022-02-21 03:10:56,610 INFO L290 TraceCheckUtils]: 3: Hoare triple {29355#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {29355#true} is VALID [2022-02-21 03:10:56,610 INFO L272 TraceCheckUtils]: 2: Hoare triple {29401#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret22#1 := base2flt(0, 0); {29355#true} is VALID [2022-02-21 03:10:56,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {29355#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {29401#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:56,611 INFO L290 TraceCheckUtils]: 0: Hoare triple {29355#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); {29355#true} is VALID [2022-02-21 03:10:56,611 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:56,611 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809710003] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:10:56,611 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:10:56,611 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 19 [2022-02-21 03:10:56,612 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28215546] [2022-02-21 03:10:56,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:10:56,612 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 16 states have internal predecessors, (67), 3 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 48 [2022-02-21 03:10:56,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:56,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 16 states have internal predecessors, (67), 3 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:56,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:56,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-21 03:10:56,658 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:56,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-21 03:10:56,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2022-02-21 03:10:56,659 INFO L87 Difference]: Start difference. First operand 475 states and 659 transitions. Second operand has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 16 states have internal predecessors, (67), 3 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:59,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:59,470 INFO L93 Difference]: Finished difference Result 1166 states and 1621 transitions. [2022-02-21 03:10:59,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-21 03:10:59,470 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 16 states have internal predecessors, (67), 3 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 48 [2022-02-21 03:10:59,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:59,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 16 states have internal predecessors, (67), 3 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:59,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 546 transitions. [2022-02-21 03:10:59,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 16 states have internal predecessors, (67), 3 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:59,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 546 transitions. [2022-02-21 03:10:59,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 546 transitions. [2022-02-21 03:10:59,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 546 edges. 546 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:59,772 INFO L225 Difference]: With dead ends: 1166 [2022-02-21 03:10:59,772 INFO L226 Difference]: Without dead ends: 959 [2022-02-21 03:10:59,774 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=258, Invalid=1302, Unknown=0, NotChecked=0, Total=1560 [2022-02-21 03:10:59,774 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 641 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 1692 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 1792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:59,774 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [661 Valid, 443 Invalid, 1792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1692 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-21 03:10:59,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2022-02-21 03:11:00,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 605. [2022-02-21 03:11:00,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:11:00,013 INFO L82 GeneralOperation]: Start isEquivalent. First operand 959 states. Second operand has 605 states, 540 states have (on average 1.4166666666666667) internal successors, (765), 554 states have internal predecessors, (765), 39 states have call successors, (39), 12 states have call predecessors, (39), 16 states have return successors, (45), 38 states have call predecessors, (45), 38 states have call successors, (45) [2022-02-21 03:11:00,014 INFO L74 IsIncluded]: Start isIncluded. First operand 959 states. Second operand has 605 states, 540 states have (on average 1.4166666666666667) internal successors, (765), 554 states have internal predecessors, (765), 39 states have call successors, (39), 12 states have call predecessors, (39), 16 states have return successors, (45), 38 states have call predecessors, (45), 38 states have call successors, (45) [2022-02-21 03:11:00,015 INFO L87 Difference]: Start difference. First operand 959 states. Second operand has 605 states, 540 states have (on average 1.4166666666666667) internal successors, (765), 554 states have internal predecessors, (765), 39 states have call successors, (39), 12 states have call predecessors, (39), 16 states have return successors, (45), 38 states have call predecessors, (45), 38 states have call successors, (45) [2022-02-21 03:11:00,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:11:00,042 INFO L93 Difference]: Finished difference Result 959 states and 1323 transitions. [2022-02-21 03:11:00,042 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1323 transitions. [2022-02-21 03:11:00,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:11:00,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:11:00,045 INFO L74 IsIncluded]: Start isIncluded. First operand has 605 states, 540 states have (on average 1.4166666666666667) internal successors, (765), 554 states have internal predecessors, (765), 39 states have call successors, (39), 12 states have call predecessors, (39), 16 states have return successors, (45), 38 states have call predecessors, (45), 38 states have call successors, (45) Second operand 959 states. [2022-02-21 03:11:00,045 INFO L87 Difference]: Start difference. First operand has 605 states, 540 states have (on average 1.4166666666666667) internal successors, (765), 554 states have internal predecessors, (765), 39 states have call successors, (39), 12 states have call predecessors, (39), 16 states have return successors, (45), 38 states have call predecessors, (45), 38 states have call successors, (45) Second operand 959 states. [2022-02-21 03:11:00,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:11:00,073 INFO L93 Difference]: Finished difference Result 959 states and 1323 transitions. [2022-02-21 03:11:00,073 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1323 transitions. [2022-02-21 03:11:00,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:11:00,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:11:00,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:11:00,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:11:00,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 540 states have (on average 1.4166666666666667) internal successors, (765), 554 states have internal predecessors, (765), 39 states have call successors, (39), 12 states have call predecessors, (39), 16 states have return successors, (45), 38 states have call predecessors, (45), 38 states have call successors, (45) [2022-02-21 03:11:00,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 849 transitions. [2022-02-21 03:11:00,090 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 849 transitions. Word has length 48 [2022-02-21 03:11:00,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:11:00,090 INFO L470 AbstractCegarLoop]: Abstraction has 605 states and 849 transitions. [2022-02-21 03:11:00,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 16 states have internal predecessors, (67), 3 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:11:00,090 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 849 transitions. [2022-02-21 03:11:00,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-21 03:11:00,091 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:11:00,091 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:11:00,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:11:00,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2022-02-21 03:11:00,309 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:11:00,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:11:00,309 INFO L85 PathProgramCache]: Analyzing trace with hash 2123358745, now seen corresponding path program 1 times [2022-02-21 03:11:00,309 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:11:00,309 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581561621] [2022-02-21 03:11:00,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:11:00,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:11:00,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:11:00,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:11:00,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:11:00,349 INFO L290 TraceCheckUtils]: 0: Hoare triple {33654#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {33622#true} is VALID [2022-02-21 03:11:00,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {33622#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {33622#true} is VALID [2022-02-21 03:11:00,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {33622#true} #res := ~__retres4~0; {33622#true} is VALID [2022-02-21 03:11:00,349 INFO L290 TraceCheckUtils]: 3: Hoare triple {33622#true} assume true; {33622#true} is VALID [2022-02-21 03:11:00,349 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {33622#true} {33622#true} #349#return; {33622#true} is VALID [2022-02-21 03:11:00,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:11:00,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:11:00,402 INFO L290 TraceCheckUtils]: 0: Hoare triple {33654#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {33622#true} is VALID [2022-02-21 03:11:00,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {33622#true} assume !(0 == ~m % 4294967296); {33622#true} is VALID [2022-02-21 03:11:00,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {33622#true} assume !(~m % 4294967296 < 16777216); {33655#(or (<= (+ (div base2flt_~m 4294967296) 1) 0) (<= (+ 16777216 (* (div base2flt_~m 4294967296) 4294967296)) base2flt_~m))} is VALID [2022-02-21 03:11:00,403 INFO L290 TraceCheckUtils]: 3: Hoare triple {33655#(or (<= (+ (div base2flt_~m 4294967296) 1) 0) (<= (+ 16777216 (* (div base2flt_~m 4294967296) 4294967296)) base2flt_~m))} assume !false; {33655#(or (<= (+ (div base2flt_~m 4294967296) 1) 0) (<= (+ 16777216 (* (div base2flt_~m 4294967296) 4294967296)) base2flt_~m))} is VALID [2022-02-21 03:11:00,404 INFO L290 TraceCheckUtils]: 4: Hoare triple {33655#(or (<= (+ (div base2flt_~m 4294967296) 1) 0) (<= (+ 16777216 (* (div base2flt_~m 4294967296) 4294967296)) base2flt_~m))} assume !(~m % 4294967296 >= 33554432); {33656#(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:11:00,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {33656#(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)); {33656#(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:11:00,405 INFO L290 TraceCheckUtils]: 6: Hoare triple {33656#(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); {33623#false} is VALID [2022-02-21 03:11:00,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {33623#false} assume 128 + ~e <= 2147483647; {33623#false} is VALID [2022-02-21 03:11:00,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {33623#false} assume 128 + ~e >= -2147483648; {33623#false} is VALID [2022-02-21 03:11:00,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {33623#false} assume 128 + ~e <= 2147483647; {33623#false} is VALID [2022-02-21 03:11:00,405 INFO L290 TraceCheckUtils]: 10: Hoare triple {33623#false} assume 128 + ~e >= -2147483648; {33623#false} is VALID [2022-02-21 03:11:00,405 INFO L290 TraceCheckUtils]: 11: Hoare triple {33623#false} assume (1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e));~res~0 := 1; {33623#false} is VALID [2022-02-21 03:11:00,405 INFO L290 TraceCheckUtils]: 12: Hoare triple {33623#false} ~__retres4~0 := ~res~0; {33623#false} is VALID [2022-02-21 03:11:00,405 INFO L290 TraceCheckUtils]: 13: Hoare triple {33623#false} #res := ~__retres4~0; {33623#false} is VALID [2022-02-21 03:11:00,405 INFO L290 TraceCheckUtils]: 14: Hoare triple {33623#false} assume true; {33623#false} is VALID [2022-02-21 03:11:00,405 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {33623#false} {33622#true} #351#return; {33623#false} is VALID [2022-02-21 03:11:00,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-21 03:11:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:11:00,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {33654#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {33622#true} is VALID [2022-02-21 03:11:00,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {33622#true} assume !(0 == ~m % 4294967296); {33622#true} is VALID [2022-02-21 03:11:00,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {33622#true} assume !(~m % 4294967296 < 16777216); {33622#true} is VALID [2022-02-21 03:11:00,411 INFO L290 TraceCheckUtils]: 3: Hoare triple {33622#true} assume !false; {33622#true} is VALID [2022-02-21 03:11:00,411 INFO L290 TraceCheckUtils]: 4: Hoare triple {33622#true} assume ~m % 4294967296 >= 33554432; {33622#true} is VALID [2022-02-21 03:11:00,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {33622#true} assume ~e >= 127;~__retres4~0 := 4294967295; {33622#true} is VALID [2022-02-21 03:11:00,411 INFO L290 TraceCheckUtils]: 6: Hoare triple {33622#true} #res := ~__retres4~0; {33622#true} is VALID [2022-02-21 03:11:00,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {33622#true} assume true; {33622#true} is VALID [2022-02-21 03:11:00,411 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {33622#true} {33623#false} #353#return; {33623#false} is VALID [2022-02-21 03:11:00,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {33622#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); {33622#true} is VALID [2022-02-21 03:11:00,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {33622#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {33622#true} is VALID [2022-02-21 03:11:00,412 INFO L272 TraceCheckUtils]: 2: Hoare triple {33622#true} call main_#t~ret22#1 := base2flt(0, 0); {33654#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:11:00,412 INFO L290 TraceCheckUtils]: 3: Hoare triple {33654#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {33622#true} is VALID [2022-02-21 03:11:00,412 INFO L290 TraceCheckUtils]: 4: Hoare triple {33622#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {33622#true} is VALID [2022-02-21 03:11:00,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {33622#true} #res := ~__retres4~0; {33622#true} is VALID [2022-02-21 03:11:00,413 INFO L290 TraceCheckUtils]: 6: Hoare triple {33622#true} assume true; {33622#true} is VALID [2022-02-21 03:11:00,413 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {33622#true} {33622#true} #349#return; {33622#true} is VALID [2022-02-21 03:11:00,413 INFO L290 TraceCheckUtils]: 8: Hoare triple {33622#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {33622#true} is VALID [2022-02-21 03:11:00,413 INFO L272 TraceCheckUtils]: 9: Hoare triple {33622#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {33654#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:11:00,413 INFO L290 TraceCheckUtils]: 10: Hoare triple {33654#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {33622#true} is VALID [2022-02-21 03:11:00,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {33622#true} assume !(0 == ~m % 4294967296); {33622#true} is VALID [2022-02-21 03:11:00,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {33622#true} assume !(~m % 4294967296 < 16777216); {33655#(or (<= (+ (div base2flt_~m 4294967296) 1) 0) (<= (+ 16777216 (* (div base2flt_~m 4294967296) 4294967296)) base2flt_~m))} is VALID [2022-02-21 03:11:00,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {33655#(or (<= (+ (div base2flt_~m 4294967296) 1) 0) (<= (+ 16777216 (* (div base2flt_~m 4294967296) 4294967296)) base2flt_~m))} assume !false; {33655#(or (<= (+ (div base2flt_~m 4294967296) 1) 0) (<= (+ 16777216 (* (div base2flt_~m 4294967296) 4294967296)) base2flt_~m))} is VALID [2022-02-21 03:11:00,415 INFO L290 TraceCheckUtils]: 14: Hoare triple {33655#(or (<= (+ (div base2flt_~m 4294967296) 1) 0) (<= (+ 16777216 (* (div base2flt_~m 4294967296) 4294967296)) base2flt_~m))} assume !(~m % 4294967296 >= 33554432); {33656#(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:11:00,415 INFO L290 TraceCheckUtils]: 15: Hoare triple {33656#(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)); {33656#(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:11:00,416 INFO L290 TraceCheckUtils]: 16: Hoare triple {33656#(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); {33623#false} is VALID [2022-02-21 03:11:00,416 INFO L290 TraceCheckUtils]: 17: Hoare triple {33623#false} assume 128 + ~e <= 2147483647; {33623#false} is VALID [2022-02-21 03:11:00,416 INFO L290 TraceCheckUtils]: 18: Hoare triple {33623#false} assume 128 + ~e >= -2147483648; {33623#false} is VALID [2022-02-21 03:11:00,416 INFO L290 TraceCheckUtils]: 19: Hoare triple {33623#false} assume 128 + ~e <= 2147483647; {33623#false} is VALID [2022-02-21 03:11:00,416 INFO L290 TraceCheckUtils]: 20: Hoare triple {33623#false} assume 128 + ~e >= -2147483648; {33623#false} is VALID [2022-02-21 03:11:00,416 INFO L290 TraceCheckUtils]: 21: Hoare triple {33623#false} assume (1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e));~res~0 := 1; {33623#false} is VALID [2022-02-21 03:11:00,416 INFO L290 TraceCheckUtils]: 22: Hoare triple {33623#false} ~__retres4~0 := ~res~0; {33623#false} is VALID [2022-02-21 03:11:00,416 INFO L290 TraceCheckUtils]: 23: Hoare triple {33623#false} #res := ~__retres4~0; {33623#false} is VALID [2022-02-21 03:11:00,417 INFO L290 TraceCheckUtils]: 24: Hoare triple {33623#false} assume true; {33623#false} is VALID [2022-02-21 03:11:00,417 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {33623#false} {33622#true} #351#return; {33623#false} is VALID [2022-02-21 03:11:00,417 INFO L290 TraceCheckUtils]: 26: Hoare triple {33623#false} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {33623#false} is VALID [2022-02-21 03:11:00,417 INFO L272 TraceCheckUtils]: 27: Hoare triple {33623#false} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {33654#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:11:00,417 INFO L290 TraceCheckUtils]: 28: Hoare triple {33654#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {33622#true} is VALID [2022-02-21 03:11:00,417 INFO L290 TraceCheckUtils]: 29: Hoare triple {33622#true} assume !(0 == ~m % 4294967296); {33622#true} is VALID [2022-02-21 03:11:00,417 INFO L290 TraceCheckUtils]: 30: Hoare triple {33622#true} assume !(~m % 4294967296 < 16777216); {33622#true} is VALID [2022-02-21 03:11:00,417 INFO L290 TraceCheckUtils]: 31: Hoare triple {33622#true} assume !false; {33622#true} is VALID [2022-02-21 03:11:00,417 INFO L290 TraceCheckUtils]: 32: Hoare triple {33622#true} assume ~m % 4294967296 >= 33554432; {33622#true} is VALID [2022-02-21 03:11:00,417 INFO L290 TraceCheckUtils]: 33: Hoare triple {33622#true} assume ~e >= 127;~__retres4~0 := 4294967295; {33622#true} is VALID [2022-02-21 03:11:00,417 INFO L290 TraceCheckUtils]: 34: Hoare triple {33622#true} #res := ~__retres4~0; {33622#true} is VALID [2022-02-21 03:11:00,418 INFO L290 TraceCheckUtils]: 35: Hoare triple {33622#true} assume true; {33622#true} is VALID [2022-02-21 03:11:00,418 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {33622#true} {33623#false} #353#return; {33623#false} is VALID [2022-02-21 03:11:00,418 INFO L290 TraceCheckUtils]: 37: Hoare triple {33623#false} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {33623#false} is VALID [2022-02-21 03:11:00,418 INFO L272 TraceCheckUtils]: 38: Hoare triple {33623#false} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {33623#false} is VALID [2022-02-21 03:11:00,418 INFO L290 TraceCheckUtils]: 39: Hoare triple {33623#false} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {33623#false} is VALID [2022-02-21 03:11:00,418 INFO L290 TraceCheckUtils]: 40: Hoare triple {33623#false} assume !(~a % 4294967296 < ~b % 4294967296); {33623#false} is VALID [2022-02-21 03:11:00,418 INFO L290 TraceCheckUtils]: 41: Hoare triple {33623#false} assume !(0 == ~b % 4294967296); {33623#false} is VALID [2022-02-21 03:11:00,418 INFO L290 TraceCheckUtils]: 42: Hoare triple {33623#false} assume !(0 == ~a); {33623#false} is VALID [2022-02-21 03:11:00,418 INFO L290 TraceCheckUtils]: 43: Hoare triple {33623#false} assume !false; {33623#false} is VALID [2022-02-21 03:11:00,418 INFO L290 TraceCheckUtils]: 44: Hoare triple {33623#false} assume !false; {33623#false} is VALID [2022-02-21 03:11:00,419 INFO L290 TraceCheckUtils]: 45: Hoare triple {33623#false} assume ~a >= 0;abs_108 := (if ~a < 16777215 then ~a else 16777215);assume ~a >= 0;assume ~ma~0 < abs_108; {33623#false} is VALID [2022-02-21 03:11:00,419 INFO L290 TraceCheckUtils]: 46: Hoare triple {33623#false} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {33623#false} is VALID [2022-02-21 03:11:00,419 INFO L290 TraceCheckUtils]: 47: Hoare triple {33623#false} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {33623#false} is VALID [2022-02-21 03:11:00,419 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:11:00,419 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:11:00,419 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581561621] [2022-02-21 03:11:00,419 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581561621] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:11:00,419 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190718895] [2022-02-21 03:11:00,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:11:00,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:11:00,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:11:00,422 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:11:00,423 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:11:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:11:00,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:11:00,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:11:00,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:11:00,650 INFO L290 TraceCheckUtils]: 0: Hoare triple {33622#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); {33622#true} is VALID [2022-02-21 03:11:00,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {33622#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {33622#true} is VALID [2022-02-21 03:11:00,650 INFO L272 TraceCheckUtils]: 2: Hoare triple {33622#true} call main_#t~ret22#1 := base2flt(0, 0); {33622#true} is VALID [2022-02-21 03:11:00,650 INFO L290 TraceCheckUtils]: 3: Hoare triple {33622#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {33622#true} is VALID [2022-02-21 03:11:00,650 INFO L290 TraceCheckUtils]: 4: Hoare triple {33622#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {33622#true} is VALID [2022-02-21 03:11:00,650 INFO L290 TraceCheckUtils]: 5: Hoare triple {33622#true} #res := ~__retres4~0; {33622#true} is VALID [2022-02-21 03:11:00,650 INFO L290 TraceCheckUtils]: 6: Hoare triple {33622#true} assume true; {33622#true} is VALID [2022-02-21 03:11:00,650 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {33622#true} {33622#true} #349#return; {33622#true} is VALID [2022-02-21 03:11:00,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {33622#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {33622#true} is VALID [2022-02-21 03:11:00,650 INFO L272 TraceCheckUtils]: 9: Hoare triple {33622#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {33622#true} is VALID [2022-02-21 03:11:00,650 INFO L290 TraceCheckUtils]: 10: Hoare triple {33622#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {33622#true} is VALID [2022-02-21 03:11:00,650 INFO L290 TraceCheckUtils]: 11: Hoare triple {33622#true} assume !(0 == ~m % 4294967296); {33622#true} is VALID [2022-02-21 03:11:00,651 INFO L290 TraceCheckUtils]: 12: Hoare triple {33622#true} assume !(~m % 4294967296 < 16777216); {33696#(not (< (mod base2flt_~m 4294967296) 16777216))} is VALID [2022-02-21 03:11:00,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {33696#(not (< (mod base2flt_~m 4294967296) 16777216))} assume !false; {33696#(not (< (mod base2flt_~m 4294967296) 16777216))} is VALID [2022-02-21 03:11:00,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {33696#(not (< (mod base2flt_~m 4294967296) 16777216))} assume !(~m % 4294967296 >= 33554432); {33703#(and (not (< (mod base2flt_~m 4294967296) 16777216)) (not (<= 33554432 (mod base2flt_~m 4294967296))))} is VALID [2022-02-21 03:11:00,652 INFO L290 TraceCheckUtils]: 15: Hoare triple {33703#(and (not (< (mod base2flt_~m 4294967296) 16777216)) (not (<= 33554432 (mod base2flt_~m 4294967296))))} assume !(0 == ~m || 0 == ~bitwiseComplement(16777216)); {33703#(and (not (< (mod base2flt_~m 4294967296) 16777216)) (not (<= 33554432 (mod base2flt_~m 4294967296))))} is VALID [2022-02-21 03:11:00,652 INFO L290 TraceCheckUtils]: 16: Hoare triple {33703#(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); {33623#false} is VALID [2022-02-21 03:11:00,652 INFO L290 TraceCheckUtils]: 17: Hoare triple {33623#false} assume 128 + ~e <= 2147483647; {33623#false} is VALID [2022-02-21 03:11:00,652 INFO L290 TraceCheckUtils]: 18: Hoare triple {33623#false} assume 128 + ~e >= -2147483648; {33623#false} is VALID [2022-02-21 03:11:00,652 INFO L290 TraceCheckUtils]: 19: Hoare triple {33623#false} assume 128 + ~e <= 2147483647; {33623#false} is VALID [2022-02-21 03:11:00,652 INFO L290 TraceCheckUtils]: 20: Hoare triple {33623#false} assume 128 + ~e >= -2147483648; {33623#false} is VALID [2022-02-21 03:11:00,652 INFO L290 TraceCheckUtils]: 21: Hoare triple {33623#false} assume (1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e));~res~0 := 1; {33623#false} is VALID [2022-02-21 03:11:00,652 INFO L290 TraceCheckUtils]: 22: Hoare triple {33623#false} ~__retres4~0 := ~res~0; {33623#false} is VALID [2022-02-21 03:11:00,652 INFO L290 TraceCheckUtils]: 23: Hoare triple {33623#false} #res := ~__retres4~0; {33623#false} is VALID [2022-02-21 03:11:00,652 INFO L290 TraceCheckUtils]: 24: Hoare triple {33623#false} assume true; {33623#false} is VALID [2022-02-21 03:11:00,652 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {33623#false} {33622#true} #351#return; {33623#false} is VALID [2022-02-21 03:11:00,653 INFO L290 TraceCheckUtils]: 26: Hoare triple {33623#false} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {33623#false} is VALID [2022-02-21 03:11:00,653 INFO L272 TraceCheckUtils]: 27: Hoare triple {33623#false} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {33623#false} is VALID [2022-02-21 03:11:00,653 INFO L290 TraceCheckUtils]: 28: Hoare triple {33623#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {33623#false} is VALID [2022-02-21 03:11:00,653 INFO L290 TraceCheckUtils]: 29: Hoare triple {33623#false} assume !(0 == ~m % 4294967296); {33623#false} is VALID [2022-02-21 03:11:00,653 INFO L290 TraceCheckUtils]: 30: Hoare triple {33623#false} assume !(~m % 4294967296 < 16777216); {33623#false} is VALID [2022-02-21 03:11:00,653 INFO L290 TraceCheckUtils]: 31: Hoare triple {33623#false} assume !false; {33623#false} is VALID [2022-02-21 03:11:00,653 INFO L290 TraceCheckUtils]: 32: Hoare triple {33623#false} assume ~m % 4294967296 >= 33554432; {33623#false} is VALID [2022-02-21 03:11:00,653 INFO L290 TraceCheckUtils]: 33: Hoare triple {33623#false} assume ~e >= 127;~__retres4~0 := 4294967295; {33623#false} is VALID [2022-02-21 03:11:00,653 INFO L290 TraceCheckUtils]: 34: Hoare triple {33623#false} #res := ~__retres4~0; {33623#false} is VALID [2022-02-21 03:11:00,653 INFO L290 TraceCheckUtils]: 35: Hoare triple {33623#false} assume true; {33623#false} is VALID [2022-02-21 03:11:00,653 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {33623#false} {33623#false} #353#return; {33623#false} is VALID [2022-02-21 03:11:00,653 INFO L290 TraceCheckUtils]: 37: Hoare triple {33623#false} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {33623#false} is VALID [2022-02-21 03:11:00,653 INFO L272 TraceCheckUtils]: 38: Hoare triple {33623#false} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {33623#false} is VALID [2022-02-21 03:11:00,653 INFO L290 TraceCheckUtils]: 39: Hoare triple {33623#false} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {33623#false} is VALID [2022-02-21 03:11:00,653 INFO L290 TraceCheckUtils]: 40: Hoare triple {33623#false} assume !(~a % 4294967296 < ~b % 4294967296); {33623#false} is VALID [2022-02-21 03:11:00,653 INFO L290 TraceCheckUtils]: 41: Hoare triple {33623#false} assume !(0 == ~b % 4294967296); {33623#false} is VALID [2022-02-21 03:11:00,653 INFO L290 TraceCheckUtils]: 42: Hoare triple {33623#false} assume !(0 == ~a); {33623#false} is VALID [2022-02-21 03:11:00,653 INFO L290 TraceCheckUtils]: 43: Hoare triple {33623#false} assume !false; {33623#false} is VALID [2022-02-21 03:11:00,653 INFO L290 TraceCheckUtils]: 44: Hoare triple {33623#false} assume !false; {33623#false} is VALID [2022-02-21 03:11:00,653 INFO L290 TraceCheckUtils]: 45: Hoare triple {33623#false} assume ~a >= 0;abs_108 := (if ~a < 16777215 then ~a else 16777215);assume ~a >= 0;assume ~ma~0 < abs_108; {33623#false} is VALID [2022-02-21 03:11:00,653 INFO L290 TraceCheckUtils]: 46: Hoare triple {33623#false} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {33623#false} is VALID [2022-02-21 03:11:00,654 INFO L290 TraceCheckUtils]: 47: Hoare triple {33623#false} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {33623#false} is VALID [2022-02-21 03:11:00,654 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:11:00,654 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:11:00,654 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190718895] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:11:00,654 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:11:00,654 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-02-21 03:11:00,654 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536344855] [2022-02-21 03:11:00,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:11:00,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2022-02-21 03:11:00,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:11:00,654 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:11:00,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:11:00,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:11:00,686 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:11:00,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:11:00,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:11:00,686 INFO L87 Difference]: Start difference. First operand 605 states and 849 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:11:01,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:11:01,434 INFO L93 Difference]: Finished difference Result 1197 states and 1698 transitions. [2022-02-21 03:11:01,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:11:01,434 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2022-02-21 03:11:01,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:11:01,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:11:01,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 321 transitions. [2022-02-21 03:11:01,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:11:01,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 321 transitions. [2022-02-21 03:11:01,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 321 transitions. [2022-02-21 03:11:01,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 321 edges. 321 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:11:01,653 INFO L225 Difference]: With dead ends: 1197 [2022-02-21 03:11:01,653 INFO L226 Difference]: Without dead ends: 681 [2022-02-21 03:11:01,654 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 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:11:01,655 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 50 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 259 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.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:11:01,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 259 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:11:01,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2022-02-21 03:11:01,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 631. [2022-02-21 03:11:01,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:11:01,979 INFO L82 GeneralOperation]: Start isEquivalent. First operand 681 states. Second operand has 631 states, 566 states have (on average 1.4081272084805654) internal successors, (797), 580 states have internal predecessors, (797), 39 states have call successors, (39), 12 states have call predecessors, (39), 16 states have return successors, (45), 38 states have call predecessors, (45), 38 states have call successors, (45) [2022-02-21 03:11:01,980 INFO L74 IsIncluded]: Start isIncluded. First operand 681 states. Second operand has 631 states, 566 states have (on average 1.4081272084805654) internal successors, (797), 580 states have internal predecessors, (797), 39 states have call successors, (39), 12 states have call predecessors, (39), 16 states have return successors, (45), 38 states have call predecessors, (45), 38 states have call successors, (45) [2022-02-21 03:11:01,980 INFO L87 Difference]: Start difference. First operand 681 states. Second operand has 631 states, 566 states have (on average 1.4081272084805654) internal successors, (797), 580 states have internal predecessors, (797), 39 states have call successors, (39), 12 states have call predecessors, (39), 16 states have return successors, (45), 38 states have call predecessors, (45), 38 states have call successors, (45) [2022-02-21 03:11:01,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:11:01,995 INFO L93 Difference]: Finished difference Result 681 states and 945 transitions. [2022-02-21 03:11:01,996 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 945 transitions. [2022-02-21 03:11:01,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:11:01,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:11:01,998 INFO L74 IsIncluded]: Start isIncluded. First operand has 631 states, 566 states have (on average 1.4081272084805654) internal successors, (797), 580 states have internal predecessors, (797), 39 states have call successors, (39), 12 states have call predecessors, (39), 16 states have return successors, (45), 38 states have call predecessors, (45), 38 states have call successors, (45) Second operand 681 states. [2022-02-21 03:11:01,999 INFO L87 Difference]: Start difference. First operand has 631 states, 566 states have (on average 1.4081272084805654) internal successors, (797), 580 states have internal predecessors, (797), 39 states have call successors, (39), 12 states have call predecessors, (39), 16 states have return successors, (45), 38 states have call predecessors, (45), 38 states have call successors, (45) Second operand 681 states. [2022-02-21 03:11:02,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:11:02,015 INFO L93 Difference]: Finished difference Result 681 states and 945 transitions. [2022-02-21 03:11:02,015 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 945 transitions. [2022-02-21 03:11:02,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:11:02,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:11:02,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:11:02,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:11:02,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 566 states have (on average 1.4081272084805654) internal successors, (797), 580 states have internal predecessors, (797), 39 states have call successors, (39), 12 states have call predecessors, (39), 16 states have return successors, (45), 38 states have call predecessors, (45), 38 states have call successors, (45) [2022-02-21 03:11:02,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 881 transitions. [2022-02-21 03:11:02,031 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 881 transitions. Word has length 48 [2022-02-21 03:11:02,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:11:02,031 INFO L470 AbstractCegarLoop]: Abstraction has 631 states and 881 transitions. [2022-02-21 03:11:02,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:11:02,032 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 881 transitions. [2022-02-21 03:11:02,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-21 03:11:02,032 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:11:02,033 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] [2022-02-21 03:11:02,062 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:11:02,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:11:02,247 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:11:02,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:11:02,248 INFO L85 PathProgramCache]: Analyzing trace with hash -343040408, now seen corresponding path program 1 times [2022-02-21 03:11:02,248 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:11:02,248 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519407951] [2022-02-21 03:11:02,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:11:02,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:11:02,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:11:02,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:11:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:11:02,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {37241#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {37208#true} is VALID [2022-02-21 03:11:02,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {37208#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {37208#true} is VALID [2022-02-21 03:11:02,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {37208#true} #res := ~__retres4~0; {37208#true} is VALID [2022-02-21 03:11:02,285 INFO L290 TraceCheckUtils]: 3: Hoare triple {37208#true} assume true; {37208#true} is VALID [2022-02-21 03:11:02,285 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {37208#true} {37208#true} #349#return; {37208#true} is VALID [2022-02-21 03:11:02,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:11:02,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:11:02,317 INFO L290 TraceCheckUtils]: 0: Hoare triple {37241#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {37208#true} is VALID [2022-02-21 03:11:02,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {37208#true} assume !(0 == ~m % 4294967296); {37208#true} is VALID [2022-02-21 03:11:02,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {37208#true} assume !(~m % 4294967296 < 16777216); {37208#true} is VALID [2022-02-21 03:11:02,318 INFO L290 TraceCheckUtils]: 3: Hoare triple {37208#true} assume !false; {37208#true} is VALID [2022-02-21 03:11:02,318 INFO L290 TraceCheckUtils]: 4: Hoare triple {37208#true} assume !(~m % 4294967296 >= 33554432); {37208#true} is VALID [2022-02-21 03:11:02,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {37208#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {37242#(= base2flt_~m 0)} is VALID [2022-02-21 03:11:02,319 INFO L290 TraceCheckUtils]: 6: Hoare triple {37242#(= base2flt_~m 0)} assume 128 + ~e <= 2147483647; {37242#(= base2flt_~m 0)} is VALID [2022-02-21 03:11:02,319 INFO L290 TraceCheckUtils]: 7: Hoare triple {37242#(= base2flt_~m 0)} assume 128 + ~e >= -2147483648; {37242#(= base2flt_~m 0)} is VALID [2022-02-21 03:11:02,319 INFO L290 TraceCheckUtils]: 8: Hoare triple {37242#(= base2flt_~m 0)} assume 128 + ~e <= 2147483647; {37242#(= base2flt_~m 0)} is VALID [2022-02-21 03:11:02,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {37242#(= base2flt_~m 0)} assume 128 + ~e >= -2147483648; {37242#(= base2flt_~m 0)} is VALID [2022-02-21 03:11:02,320 INFO L290 TraceCheckUtils]: 10: Hoare triple {37242#(= base2flt_~m 0)} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {37243#(or (= base2flt_~m 0) (not (= (+ (* 16777216 base2flt_~e) 2147483648) 0)))} is VALID [2022-02-21 03:11:02,320 INFO L290 TraceCheckUtils]: 11: Hoare triple {37243#(or (= base2flt_~m 0) (not (= (+ (* 16777216 base2flt_~e) 2147483648) 0)))} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {37244#(not (= (+ 128 base2flt_~e) 0))} is VALID [2022-02-21 03:11:02,320 INFO L290 TraceCheckUtils]: 12: Hoare triple {37244#(not (= (+ 128 base2flt_~e) 0))} assume (0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e);~res~0 := ~m; {37209#false} is VALID [2022-02-21 03:11:02,321 INFO L290 TraceCheckUtils]: 13: Hoare triple {37209#false} ~__retres4~0 := ~res~0; {37209#false} is VALID [2022-02-21 03:11:02,321 INFO L290 TraceCheckUtils]: 14: Hoare triple {37209#false} #res := ~__retres4~0; {37209#false} is VALID [2022-02-21 03:11:02,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {37209#false} assume true; {37209#false} is VALID [2022-02-21 03:11:02,321 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {37209#false} {37208#true} #351#return; {37209#false} is VALID [2022-02-21 03:11:02,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-02-21 03:11:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:11:02,325 INFO L290 TraceCheckUtils]: 0: Hoare triple {37241#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {37208#true} is VALID [2022-02-21 03:11:02,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {37208#true} assume !(0 == ~m % 4294967296); {37208#true} is VALID [2022-02-21 03:11:02,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {37208#true} assume !(~m % 4294967296 < 16777216); {37208#true} is VALID [2022-02-21 03:11:02,326 INFO L290 TraceCheckUtils]: 3: Hoare triple {37208#true} assume !false; {37208#true} is VALID [2022-02-21 03:11:02,326 INFO L290 TraceCheckUtils]: 4: Hoare triple {37208#true} assume ~m % 4294967296 >= 33554432; {37208#true} is VALID [2022-02-21 03:11:02,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {37208#true} assume ~e >= 127;~__retres4~0 := 4294967295; {37208#true} is VALID [2022-02-21 03:11:02,326 INFO L290 TraceCheckUtils]: 6: Hoare triple {37208#true} #res := ~__retres4~0; {37208#true} is VALID [2022-02-21 03:11:02,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {37208#true} assume true; {37208#true} is VALID [2022-02-21 03:11:02,326 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {37208#true} {37209#false} #353#return; {37209#false} is VALID [2022-02-21 03:11:02,326 INFO L290 TraceCheckUtils]: 0: Hoare triple {37208#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); {37208#true} is VALID [2022-02-21 03:11:02,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {37208#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {37208#true} is VALID [2022-02-21 03:11:02,327 INFO L272 TraceCheckUtils]: 2: Hoare triple {37208#true} call main_#t~ret22#1 := base2flt(0, 0); {37241#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:11:02,327 INFO L290 TraceCheckUtils]: 3: Hoare triple {37241#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {37208#true} is VALID [2022-02-21 03:11:02,327 INFO L290 TraceCheckUtils]: 4: Hoare triple {37208#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {37208#true} is VALID [2022-02-21 03:11:02,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {37208#true} #res := ~__retres4~0; {37208#true} is VALID [2022-02-21 03:11:02,327 INFO L290 TraceCheckUtils]: 6: Hoare triple {37208#true} assume true; {37208#true} is VALID [2022-02-21 03:11:02,327 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {37208#true} {37208#true} #349#return; {37208#true} is VALID [2022-02-21 03:11:02,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {37208#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {37208#true} is VALID [2022-02-21 03:11:02,328 INFO L272 TraceCheckUtils]: 9: Hoare triple {37208#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {37241#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:11:02,328 INFO L290 TraceCheckUtils]: 10: Hoare triple {37241#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {37208#true} is VALID [2022-02-21 03:11:02,328 INFO L290 TraceCheckUtils]: 11: Hoare triple {37208#true} assume !(0 == ~m % 4294967296); {37208#true} is VALID [2022-02-21 03:11:02,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {37208#true} assume !(~m % 4294967296 < 16777216); {37208#true} is VALID [2022-02-21 03:11:02,328 INFO L290 TraceCheckUtils]: 13: Hoare triple {37208#true} assume !false; {37208#true} is VALID [2022-02-21 03:11:02,328 INFO L290 TraceCheckUtils]: 14: Hoare triple {37208#true} assume !(~m % 4294967296 >= 33554432); {37208#true} is VALID [2022-02-21 03:11:02,329 INFO L290 TraceCheckUtils]: 15: Hoare triple {37208#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {37242#(= base2flt_~m 0)} is VALID [2022-02-21 03:11:02,329 INFO L290 TraceCheckUtils]: 16: Hoare triple {37242#(= base2flt_~m 0)} assume 128 + ~e <= 2147483647; {37242#(= base2flt_~m 0)} is VALID [2022-02-21 03:11:02,329 INFO L290 TraceCheckUtils]: 17: Hoare triple {37242#(= base2flt_~m 0)} assume 128 + ~e >= -2147483648; {37242#(= base2flt_~m 0)} is VALID [2022-02-21 03:11:02,329 INFO L290 TraceCheckUtils]: 18: Hoare triple {37242#(= base2flt_~m 0)} assume 128 + ~e <= 2147483647; {37242#(= base2flt_~m 0)} is VALID [2022-02-21 03:11:02,330 INFO L290 TraceCheckUtils]: 19: Hoare triple {37242#(= base2flt_~m 0)} assume 128 + ~e >= -2147483648; {37242#(= base2flt_~m 0)} is VALID [2022-02-21 03:11:02,330 INFO L290 TraceCheckUtils]: 20: Hoare triple {37242#(= base2flt_~m 0)} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {37243#(or (= base2flt_~m 0) (not (= (+ (* 16777216 base2flt_~e) 2147483648) 0)))} is VALID [2022-02-21 03:11:02,330 INFO L290 TraceCheckUtils]: 21: Hoare triple {37243#(or (= base2flt_~m 0) (not (= (+ (* 16777216 base2flt_~e) 2147483648) 0)))} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {37244#(not (= (+ 128 base2flt_~e) 0))} is VALID [2022-02-21 03:11:02,331 INFO L290 TraceCheckUtils]: 22: Hoare triple {37244#(not (= (+ 128 base2flt_~e) 0))} assume (0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e);~res~0 := ~m; {37209#false} is VALID [2022-02-21 03:11:02,331 INFO L290 TraceCheckUtils]: 23: Hoare triple {37209#false} ~__retres4~0 := ~res~0; {37209#false} is VALID [2022-02-21 03:11:02,331 INFO L290 TraceCheckUtils]: 24: Hoare triple {37209#false} #res := ~__retres4~0; {37209#false} is VALID [2022-02-21 03:11:02,331 INFO L290 TraceCheckUtils]: 25: Hoare triple {37209#false} assume true; {37209#false} is VALID [2022-02-21 03:11:02,331 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {37209#false} {37208#true} #351#return; {37209#false} is VALID [2022-02-21 03:11:02,331 INFO L290 TraceCheckUtils]: 27: Hoare triple {37209#false} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {37209#false} is VALID [2022-02-21 03:11:02,331 INFO L272 TraceCheckUtils]: 28: Hoare triple {37209#false} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {37241#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:11:02,331 INFO L290 TraceCheckUtils]: 29: Hoare triple {37241#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {37208#true} is VALID [2022-02-21 03:11:02,332 INFO L290 TraceCheckUtils]: 30: Hoare triple {37208#true} assume !(0 == ~m % 4294967296); {37208#true} is VALID [2022-02-21 03:11:02,332 INFO L290 TraceCheckUtils]: 31: Hoare triple {37208#true} assume !(~m % 4294967296 < 16777216); {37208#true} is VALID [2022-02-21 03:11:02,332 INFO L290 TraceCheckUtils]: 32: Hoare triple {37208#true} assume !false; {37208#true} is VALID [2022-02-21 03:11:02,332 INFO L290 TraceCheckUtils]: 33: Hoare triple {37208#true} assume ~m % 4294967296 >= 33554432; {37208#true} is VALID [2022-02-21 03:11:02,332 INFO L290 TraceCheckUtils]: 34: Hoare triple {37208#true} assume ~e >= 127;~__retres4~0 := 4294967295; {37208#true} is VALID [2022-02-21 03:11:02,332 INFO L290 TraceCheckUtils]: 35: Hoare triple {37208#true} #res := ~__retres4~0; {37208#true} is VALID [2022-02-21 03:11:02,332 INFO L290 TraceCheckUtils]: 36: Hoare triple {37208#true} assume true; {37208#true} is VALID [2022-02-21 03:11:02,332 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {37208#true} {37209#false} #353#return; {37209#false} is VALID [2022-02-21 03:11:02,332 INFO L290 TraceCheckUtils]: 38: Hoare triple {37209#false} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {37209#false} is VALID [2022-02-21 03:11:02,332 INFO L272 TraceCheckUtils]: 39: Hoare triple {37209#false} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {37209#false} is VALID [2022-02-21 03:11:02,333 INFO L290 TraceCheckUtils]: 40: Hoare triple {37209#false} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {37209#false} is VALID [2022-02-21 03:11:02,333 INFO L290 TraceCheckUtils]: 41: Hoare triple {37209#false} assume !(~a % 4294967296 < ~b % 4294967296); {37209#false} is VALID [2022-02-21 03:11:02,333 INFO L290 TraceCheckUtils]: 42: Hoare triple {37209#false} assume !(0 == ~b % 4294967296); {37209#false} is VALID [2022-02-21 03:11:02,333 INFO L290 TraceCheckUtils]: 43: Hoare triple {37209#false} assume !(0 == ~a); {37209#false} is VALID [2022-02-21 03:11:02,333 INFO L290 TraceCheckUtils]: 44: Hoare triple {37209#false} assume !false; {37209#false} is VALID [2022-02-21 03:11:02,333 INFO L290 TraceCheckUtils]: 45: Hoare triple {37209#false} assume !false; {37209#false} is VALID [2022-02-21 03:11:02,333 INFO L290 TraceCheckUtils]: 46: Hoare triple {37209#false} assume ~a >= 0;abs_108 := (if ~a < 16777215 then ~a else 16777215);assume ~a >= 0;assume ~ma~0 < abs_108; {37209#false} is VALID [2022-02-21 03:11:02,333 INFO L290 TraceCheckUtils]: 47: Hoare triple {37209#false} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {37209#false} is VALID [2022-02-21 03:11:02,333 INFO L290 TraceCheckUtils]: 48: Hoare triple {37209#false} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {37209#false} is VALID [2022-02-21 03:11:02,334 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:11:02,334 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:11:02,334 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519407951] [2022-02-21 03:11:02,334 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519407951] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:11:02,334 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897756268] [2022-02-21 03:11:02,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:11:02,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:11:02,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:11:02,336 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:11:02,336 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:11:02,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:11:02,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:11:02,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:11:02,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:11:02,472 INFO L290 TraceCheckUtils]: 0: Hoare triple {37208#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); {37208#true} is VALID [2022-02-21 03:11:02,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {37208#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {37208#true} is VALID [2022-02-21 03:11:02,473 INFO L272 TraceCheckUtils]: 2: Hoare triple {37208#true} call main_#t~ret22#1 := base2flt(0, 0); {37208#true} is VALID [2022-02-21 03:11:02,473 INFO L290 TraceCheckUtils]: 3: Hoare triple {37208#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {37208#true} is VALID [2022-02-21 03:11:02,473 INFO L290 TraceCheckUtils]: 4: Hoare triple {37208#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {37208#true} is VALID [2022-02-21 03:11:02,473 INFO L290 TraceCheckUtils]: 5: Hoare triple {37208#true} #res := ~__retres4~0; {37208#true} is VALID [2022-02-21 03:11:02,473 INFO L290 TraceCheckUtils]: 6: Hoare triple {37208#true} assume true; {37208#true} is VALID [2022-02-21 03:11:02,473 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {37208#true} {37208#true} #349#return; {37208#true} is VALID [2022-02-21 03:11:02,473 INFO L290 TraceCheckUtils]: 8: Hoare triple {37208#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {37208#true} is VALID [2022-02-21 03:11:02,474 INFO L272 TraceCheckUtils]: 9: Hoare triple {37208#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {37208#true} is VALID [2022-02-21 03:11:02,474 INFO L290 TraceCheckUtils]: 10: Hoare triple {37208#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {37208#true} is VALID [2022-02-21 03:11:02,474 INFO L290 TraceCheckUtils]: 11: Hoare triple {37208#true} assume !(0 == ~m % 4294967296); {37208#true} is VALID [2022-02-21 03:11:02,474 INFO L290 TraceCheckUtils]: 12: Hoare triple {37208#true} assume !(~m % 4294967296 < 16777216); {37208#true} is VALID [2022-02-21 03:11:02,474 INFO L290 TraceCheckUtils]: 13: Hoare triple {37208#true} assume !false; {37208#true} is VALID [2022-02-21 03:11:02,474 INFO L290 TraceCheckUtils]: 14: Hoare triple {37208#true} assume !(~m % 4294967296 >= 33554432); {37208#true} is VALID [2022-02-21 03:11:02,474 INFO L290 TraceCheckUtils]: 15: Hoare triple {37208#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {37242#(= base2flt_~m 0)} is VALID [2022-02-21 03:11:02,475 INFO L290 TraceCheckUtils]: 16: Hoare triple {37242#(= base2flt_~m 0)} assume 128 + ~e <= 2147483647; {37242#(= base2flt_~m 0)} is VALID [2022-02-21 03:11:02,475 INFO L290 TraceCheckUtils]: 17: Hoare triple {37242#(= base2flt_~m 0)} assume 128 + ~e >= -2147483648; {37242#(= base2flt_~m 0)} is VALID [2022-02-21 03:11:02,475 INFO L290 TraceCheckUtils]: 18: Hoare triple {37242#(= base2flt_~m 0)} assume 128 + ~e <= 2147483647; {37242#(= base2flt_~m 0)} is VALID [2022-02-21 03:11:02,476 INFO L290 TraceCheckUtils]: 19: Hoare triple {37242#(= base2flt_~m 0)} assume 128 + ~e >= -2147483648; {37242#(= base2flt_~m 0)} is VALID [2022-02-21 03:11:02,476 INFO L290 TraceCheckUtils]: 20: Hoare triple {37242#(= base2flt_~m 0)} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {37242#(= base2flt_~m 0)} is VALID [2022-02-21 03:11:02,476 INFO L290 TraceCheckUtils]: 21: Hoare triple {37242#(= base2flt_~m 0)} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {37244#(not (= (+ 128 base2flt_~e) 0))} is VALID [2022-02-21 03:11:02,477 INFO L290 TraceCheckUtils]: 22: Hoare triple {37244#(not (= (+ 128 base2flt_~e) 0))} assume (0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e);~res~0 := ~m; {37209#false} is VALID [2022-02-21 03:11:02,477 INFO L290 TraceCheckUtils]: 23: Hoare triple {37209#false} ~__retres4~0 := ~res~0; {37209#false} is VALID [2022-02-21 03:11:02,477 INFO L290 TraceCheckUtils]: 24: Hoare triple {37209#false} #res := ~__retres4~0; {37209#false} is VALID [2022-02-21 03:11:02,477 INFO L290 TraceCheckUtils]: 25: Hoare triple {37209#false} assume true; {37209#false} is VALID [2022-02-21 03:11:02,477 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {37209#false} {37208#true} #351#return; {37209#false} is VALID [2022-02-21 03:11:02,477 INFO L290 TraceCheckUtils]: 27: Hoare triple {37209#false} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {37209#false} is VALID [2022-02-21 03:11:02,477 INFO L272 TraceCheckUtils]: 28: Hoare triple {37209#false} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {37209#false} is VALID [2022-02-21 03:11:02,477 INFO L290 TraceCheckUtils]: 29: Hoare triple {37209#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {37209#false} is VALID [2022-02-21 03:11:02,478 INFO L290 TraceCheckUtils]: 30: Hoare triple {37209#false} assume !(0 == ~m % 4294967296); {37209#false} is VALID [2022-02-21 03:11:02,478 INFO L290 TraceCheckUtils]: 31: Hoare triple {37209#false} assume !(~m % 4294967296 < 16777216); {37209#false} is VALID [2022-02-21 03:11:02,478 INFO L290 TraceCheckUtils]: 32: Hoare triple {37209#false} assume !false; {37209#false} is VALID [2022-02-21 03:11:02,478 INFO L290 TraceCheckUtils]: 33: Hoare triple {37209#false} assume ~m % 4294967296 >= 33554432; {37209#false} is VALID [2022-02-21 03:11:02,478 INFO L290 TraceCheckUtils]: 34: Hoare triple {37209#false} assume ~e >= 127;~__retres4~0 := 4294967295; {37209#false} is VALID [2022-02-21 03:11:02,478 INFO L290 TraceCheckUtils]: 35: Hoare triple {37209#false} #res := ~__retres4~0; {37209#false} is VALID [2022-02-21 03:11:02,478 INFO L290 TraceCheckUtils]: 36: Hoare triple {37209#false} assume true; {37209#false} is VALID [2022-02-21 03:11:02,478 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {37209#false} {37209#false} #353#return; {37209#false} is VALID [2022-02-21 03:11:02,478 INFO L290 TraceCheckUtils]: 38: Hoare triple {37209#false} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {37209#false} is VALID [2022-02-21 03:11:02,478 INFO L272 TraceCheckUtils]: 39: Hoare triple {37209#false} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {37209#false} is VALID [2022-02-21 03:11:02,479 INFO L290 TraceCheckUtils]: 40: Hoare triple {37209#false} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {37209#false} is VALID [2022-02-21 03:11:02,479 INFO L290 TraceCheckUtils]: 41: Hoare triple {37209#false} assume !(~a % 4294967296 < ~b % 4294967296); {37209#false} is VALID [2022-02-21 03:11:02,479 INFO L290 TraceCheckUtils]: 42: Hoare triple {37209#false} assume !(0 == ~b % 4294967296); {37209#false} is VALID [2022-02-21 03:11:02,479 INFO L290 TraceCheckUtils]: 43: Hoare triple {37209#false} assume !(0 == ~a); {37209#false} is VALID [2022-02-21 03:11:02,479 INFO L290 TraceCheckUtils]: 44: Hoare triple {37209#false} assume !false; {37209#false} is VALID [2022-02-21 03:11:02,479 INFO L290 TraceCheckUtils]: 45: Hoare triple {37209#false} assume !false; {37209#false} is VALID [2022-02-21 03:11:02,479 INFO L290 TraceCheckUtils]: 46: Hoare triple {37209#false} assume ~a >= 0;abs_108 := (if ~a < 16777215 then ~a else 16777215);assume ~a >= 0;assume ~ma~0 < abs_108; {37209#false} is VALID [2022-02-21 03:11:02,479 INFO L290 TraceCheckUtils]: 47: Hoare triple {37209#false} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {37209#false} is VALID [2022-02-21 03:11:02,480 INFO L290 TraceCheckUtils]: 48: Hoare triple {37209#false} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {37209#false} is VALID [2022-02-21 03:11:02,480 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:11:02,480 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:11:02,480 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897756268] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:11:02,480 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:11:02,480 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-02-21 03:11:02,480 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400427827] [2022-02-21 03:11:02,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:11:02,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2022-02-21 03:11:02,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:11:02,481 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:11:02,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:11:02,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:11:02,510 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:11:02,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:11:02,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:11:02,511 INFO L87 Difference]: Start difference. First operand 631 states and 881 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:11:03,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:11:03,058 INFO L93 Difference]: Finished difference Result 1025 states and 1440 transitions. [2022-02-21 03:11:03,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:11:03,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2022-02-21 03:11:03,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:11:03,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:11:03,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 293 transitions. [2022-02-21 03:11:03,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:11:03,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 293 transitions. [2022-02-21 03:11:03,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 293 transitions. [2022-02-21 03:11:03,250 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 293 edges. 293 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:11:03,270 INFO L225 Difference]: With dead ends: 1025 [2022-02-21 03:11:03,271 INFO L226 Difference]: Without dead ends: 653 [2022-02-21 03:11:03,272 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 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:11:03,273 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 15 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 378 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:11:03,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 378 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:11:03,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2022-02-21 03:11:03,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 633. [2022-02-21 03:11:03,599 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:11:03,600 INFO L82 GeneralOperation]: Start isEquivalent. First operand 653 states. Second operand has 633 states, 568 states have (on average 1.4102112676056338) internal successors, (801), 582 states have internal predecessors, (801), 39 states have call successors, (39), 12 states have call predecessors, (39), 16 states have return successors, (45), 38 states have call predecessors, (45), 38 states have call successors, (45) [2022-02-21 03:11:03,601 INFO L74 IsIncluded]: Start isIncluded. First operand 653 states. Second operand has 633 states, 568 states have (on average 1.4102112676056338) internal successors, (801), 582 states have internal predecessors, (801), 39 states have call successors, (39), 12 states have call predecessors, (39), 16 states have return successors, (45), 38 states have call predecessors, (45), 38 states have call successors, (45) [2022-02-21 03:11:03,601 INFO L87 Difference]: Start difference. First operand 653 states. Second operand has 633 states, 568 states have (on average 1.4102112676056338) internal successors, (801), 582 states have internal predecessors, (801), 39 states have call successors, (39), 12 states have call predecessors, (39), 16 states have return successors, (45), 38 states have call predecessors, (45), 38 states have call successors, (45) [2022-02-21 03:11:03,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:11:03,616 INFO L93 Difference]: Finished difference Result 653 states and 913 transitions. [2022-02-21 03:11:03,616 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 913 transitions. [2022-02-21 03:11:03,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:11:03,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:11:03,619 INFO L74 IsIncluded]: Start isIncluded. First operand has 633 states, 568 states have (on average 1.4102112676056338) internal successors, (801), 582 states have internal predecessors, (801), 39 states have call successors, (39), 12 states have call predecessors, (39), 16 states have return successors, (45), 38 states have call predecessors, (45), 38 states have call successors, (45) Second operand 653 states. [2022-02-21 03:11:03,620 INFO L87 Difference]: Start difference. First operand has 633 states, 568 states have (on average 1.4102112676056338) internal successors, (801), 582 states have internal predecessors, (801), 39 states have call successors, (39), 12 states have call predecessors, (39), 16 states have return successors, (45), 38 states have call predecessors, (45), 38 states have call successors, (45) Second operand 653 states. [2022-02-21 03:11:03,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:11:03,635 INFO L93 Difference]: Finished difference Result 653 states and 913 transitions. [2022-02-21 03:11:03,635 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 913 transitions. [2022-02-21 03:11:03,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:11:03,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:11:03,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:11:03,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:11:03,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 568 states have (on average 1.4102112676056338) internal successors, (801), 582 states have internal predecessors, (801), 39 states have call successors, (39), 12 states have call predecessors, (39), 16 states have return successors, (45), 38 states have call predecessors, (45), 38 states have call successors, (45) [2022-02-21 03:11:03,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 885 transitions. [2022-02-21 03:11:03,655 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 885 transitions. Word has length 49 [2022-02-21 03:11:03,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:11:03,655 INFO L470 AbstractCegarLoop]: Abstraction has 633 states and 885 transitions. [2022-02-21 03:11:03,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:11:03,655 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 885 transitions. [2022-02-21 03:11:03,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-21 03:11:03,656 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:11:03,656 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] [2022-02-21 03:11:03,677 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:11:03,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:11:03,875 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:11:03,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:11:03,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1723318001, now seen corresponding path program 1 times [2022-02-21 03:11:03,875 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:11:03,875 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973676982] [2022-02-21 03:11:03,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:11:03,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:11:03,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:11:04,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:11:04,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:11:04,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {40597#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {40556#true} is VALID [2022-02-21 03:11:04,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {40556#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {40556#true} is VALID [2022-02-21 03:11:04,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {40556#true} #res := ~__retres4~0; {40556#true} is VALID [2022-02-21 03:11:04,080 INFO L290 TraceCheckUtils]: 3: Hoare triple {40556#true} assume true; {40556#true} is VALID [2022-02-21 03:11:04,080 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {40556#true} {40556#true} #349#return; {40556#true} is VALID [2022-02-21 03:11:04,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:11:04,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:11:04,087 INFO L290 TraceCheckUtils]: 0: Hoare triple {40597#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {40556#true} is VALID [2022-02-21 03:11:04,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {40556#true} assume !(0 == ~m % 4294967296); {40556#true} is VALID [2022-02-21 03:11:04,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {40556#true} assume !(~m % 4294967296 < 16777216); {40556#true} is VALID [2022-02-21 03:11:04,087 INFO L290 TraceCheckUtils]: 3: Hoare triple {40556#true} assume !false; {40556#true} is VALID [2022-02-21 03:11:04,087 INFO L290 TraceCheckUtils]: 4: Hoare triple {40556#true} assume !(~m % 4294967296 >= 33554432); {40556#true} is VALID [2022-02-21 03:11:04,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {40556#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {40556#true} is VALID [2022-02-21 03:11:04,087 INFO L290 TraceCheckUtils]: 6: Hoare triple {40556#true} assume 128 + ~e <= 2147483647; {40556#true} is VALID [2022-02-21 03:11:04,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {40556#true} assume 128 + ~e >= -2147483648; {40556#true} is VALID [2022-02-21 03:11:04,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {40556#true} assume 128 + ~e <= 2147483647; {40556#true} is VALID [2022-02-21 03:11:04,088 INFO L290 TraceCheckUtils]: 9: Hoare triple {40556#true} assume 128 + ~e >= -2147483648; {40556#true} is VALID [2022-02-21 03:11:04,088 INFO L290 TraceCheckUtils]: 10: Hoare triple {40556#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {40556#true} is VALID [2022-02-21 03:11:04,088 INFO L290 TraceCheckUtils]: 11: Hoare triple {40556#true} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {40556#true} is VALID [2022-02-21 03:11:04,088 INFO L290 TraceCheckUtils]: 12: Hoare triple {40556#true} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {40556#true} is VALID [2022-02-21 03:11:04,088 INFO L290 TraceCheckUtils]: 13: Hoare triple {40556#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; {40556#true} is VALID [2022-02-21 03:11:04,088 INFO L290 TraceCheckUtils]: 14: Hoare triple {40556#true} ~__retres4~0 := ~res~0; {40556#true} is VALID [2022-02-21 03:11:04,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {40556#true} #res := ~__retres4~0; {40556#true} is VALID [2022-02-21 03:11:04,088 INFO L290 TraceCheckUtils]: 16: Hoare triple {40556#true} assume true; {40556#true} is VALID [2022-02-21 03:11:04,088 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {40556#true} {40556#true} #351#return; {40556#true} is VALID [2022-02-21 03:11:04,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-02-21 03:11:04,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:11:04,124 INFO L290 TraceCheckUtils]: 0: Hoare triple {40597#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {40556#true} is VALID [2022-02-21 03:11:04,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {40556#true} assume !(0 == ~m % 4294967296); {40556#true} is VALID [2022-02-21 03:11:04,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {40556#true} assume !(~m % 4294967296 < 16777216); {40556#true} is VALID [2022-02-21 03:11:04,125 INFO L290 TraceCheckUtils]: 3: Hoare triple {40556#true} assume !false; {40556#true} is VALID [2022-02-21 03:11:04,125 INFO L290 TraceCheckUtils]: 4: Hoare triple {40556#true} assume ~m % 4294967296 >= 33554432; {40556#true} is VALID [2022-02-21 03:11:04,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {40556#true} assume ~e >= 127;~__retres4~0 := 4294967295; {40598#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} is VALID [2022-02-21 03:11:04,126 INFO L290 TraceCheckUtils]: 6: Hoare triple {40598#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} #res := ~__retres4~0; {40599#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:11:04,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {40599#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} assume true; {40599#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:11:04,127 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {40599#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} {40556#true} #353#return; {40590#(and (<= 4294967295 |ULTIMATE.start_main_#t~ret24#1|) (<= |ULTIMATE.start_main_#t~ret24#1| 4294967295))} is VALID [2022-02-21 03:11:04,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {40556#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); {40556#true} is VALID [2022-02-21 03:11:04,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {40556#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {40556#true} is VALID [2022-02-21 03:11:04,127 INFO L272 TraceCheckUtils]: 2: Hoare triple {40556#true} call main_#t~ret22#1 := base2flt(0, 0); {40597#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:11:04,128 INFO L290 TraceCheckUtils]: 3: Hoare triple {40597#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {40556#true} is VALID [2022-02-21 03:11:04,128 INFO L290 TraceCheckUtils]: 4: Hoare triple {40556#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {40556#true} is VALID [2022-02-21 03:11:04,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {40556#true} #res := ~__retres4~0; {40556#true} is VALID [2022-02-21 03:11:04,128 INFO L290 TraceCheckUtils]: 6: Hoare triple {40556#true} assume true; {40556#true} is VALID [2022-02-21 03:11:04,128 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {40556#true} {40556#true} #349#return; {40556#true} is VALID [2022-02-21 03:11:04,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {40556#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {40556#true} is VALID [2022-02-21 03:11:04,129 INFO L272 TraceCheckUtils]: 9: Hoare triple {40556#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {40597#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:11:04,129 INFO L290 TraceCheckUtils]: 10: Hoare triple {40597#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {40556#true} is VALID [2022-02-21 03:11:04,129 INFO L290 TraceCheckUtils]: 11: Hoare triple {40556#true} assume !(0 == ~m % 4294967296); {40556#true} is VALID [2022-02-21 03:11:04,129 INFO L290 TraceCheckUtils]: 12: Hoare triple {40556#true} assume !(~m % 4294967296 < 16777216); {40556#true} is VALID [2022-02-21 03:11:04,129 INFO L290 TraceCheckUtils]: 13: Hoare triple {40556#true} assume !false; {40556#true} is VALID [2022-02-21 03:11:04,129 INFO L290 TraceCheckUtils]: 14: Hoare triple {40556#true} assume !(~m % 4294967296 >= 33554432); {40556#true} is VALID [2022-02-21 03:11:04,129 INFO L290 TraceCheckUtils]: 15: Hoare triple {40556#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {40556#true} is VALID [2022-02-21 03:11:04,129 INFO L290 TraceCheckUtils]: 16: Hoare triple {40556#true} assume 128 + ~e <= 2147483647; {40556#true} is VALID [2022-02-21 03:11:04,129 INFO L290 TraceCheckUtils]: 17: Hoare triple {40556#true} assume 128 + ~e >= -2147483648; {40556#true} is VALID [2022-02-21 03:11:04,130 INFO L290 TraceCheckUtils]: 18: Hoare triple {40556#true} assume 128 + ~e <= 2147483647; {40556#true} is VALID [2022-02-21 03:11:04,130 INFO L290 TraceCheckUtils]: 19: Hoare triple {40556#true} assume 128 + ~e >= -2147483648; {40556#true} is VALID [2022-02-21 03:11:04,130 INFO L290 TraceCheckUtils]: 20: Hoare triple {40556#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {40556#true} is VALID [2022-02-21 03:11:04,130 INFO L290 TraceCheckUtils]: 21: Hoare triple {40556#true} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {40556#true} is VALID [2022-02-21 03:11:04,130 INFO L290 TraceCheckUtils]: 22: Hoare triple {40556#true} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {40556#true} is VALID [2022-02-21 03:11:04,130 INFO L290 TraceCheckUtils]: 23: Hoare triple {40556#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; {40556#true} is VALID [2022-02-21 03:11:04,130 INFO L290 TraceCheckUtils]: 24: Hoare triple {40556#true} ~__retres4~0 := ~res~0; {40556#true} is VALID [2022-02-21 03:11:04,130 INFO L290 TraceCheckUtils]: 25: Hoare triple {40556#true} #res := ~__retres4~0; {40556#true} is VALID [2022-02-21 03:11:04,130 INFO L290 TraceCheckUtils]: 26: Hoare triple {40556#true} assume true; {40556#true} is VALID [2022-02-21 03:11:04,130 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {40556#true} {40556#true} #351#return; {40556#true} is VALID [2022-02-21 03:11:04,131 INFO L290 TraceCheckUtils]: 28: Hoare triple {40556#true} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {40556#true} is VALID [2022-02-21 03:11:04,140 INFO L272 TraceCheckUtils]: 29: Hoare triple {40556#true} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {40597#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:11:04,140 INFO L290 TraceCheckUtils]: 30: Hoare triple {40597#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {40556#true} is VALID [2022-02-21 03:11:04,140 INFO L290 TraceCheckUtils]: 31: Hoare triple {40556#true} assume !(0 == ~m % 4294967296); {40556#true} is VALID [2022-02-21 03:11:04,140 INFO L290 TraceCheckUtils]: 32: Hoare triple {40556#true} assume !(~m % 4294967296 < 16777216); {40556#true} is VALID [2022-02-21 03:11:04,140 INFO L290 TraceCheckUtils]: 33: Hoare triple {40556#true} assume !false; {40556#true} is VALID [2022-02-21 03:11:04,140 INFO L290 TraceCheckUtils]: 34: Hoare triple {40556#true} assume ~m % 4294967296 >= 33554432; {40556#true} is VALID [2022-02-21 03:11:04,141 INFO L290 TraceCheckUtils]: 35: Hoare triple {40556#true} assume ~e >= 127;~__retres4~0 := 4294967295; {40598#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} is VALID [2022-02-21 03:11:04,141 INFO L290 TraceCheckUtils]: 36: Hoare triple {40598#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} #res := ~__retres4~0; {40599#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:11:04,141 INFO L290 TraceCheckUtils]: 37: Hoare triple {40599#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} assume true; {40599#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:11:04,142 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {40599#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} {40556#true} #353#return; {40590#(and (<= 4294967295 |ULTIMATE.start_main_#t~ret24#1|) (<= |ULTIMATE.start_main_#t~ret24#1| 4294967295))} is VALID [2022-02-21 03:11:04,142 INFO L290 TraceCheckUtils]: 39: Hoare triple {40590#(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; {40591#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} is VALID [2022-02-21 03:11:04,143 INFO L272 TraceCheckUtils]: 40: Hoare triple {40591#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {40592#(and (<= 4294967295 |addflt_#in~b|) (<= |addflt_#in~b| 4294967295))} is VALID [2022-02-21 03:11:04,144 INFO L290 TraceCheckUtils]: 41: Hoare triple {40592#(and (<= 4294967295 |addflt_#in~b|) (<= |addflt_#in~b| 4294967295))} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {40593#(and (or (<= (div addflt_~a 4294967296) (+ 8388607 (* (div (div addflt_~a 16777216) 4294967296) 16777216))) (<= (+ 8388608 (div addflt_~b 4294967296) (* (div (div addflt_~a 16777216) 4294967296) 16777216)) (div addflt_~a 4294967296))) (or (not (<= (+ 8388608 (div addflt_~b 4294967296) (* (div (div addflt_~a 16777216) 4294967296) 16777216)) (div addflt_~a 4294967296))) (<= 4294967295 addflt_~b)))} is VALID [2022-02-21 03:11:04,144 INFO L290 TraceCheckUtils]: 42: Hoare triple {40593#(and (or (<= (div addflt_~a 4294967296) (+ 8388607 (* (div (div addflt_~a 16777216) 4294967296) 16777216))) (<= (+ 8388608 (div addflt_~b 4294967296) (* (div (div addflt_~a 16777216) 4294967296) 16777216)) (div addflt_~a 4294967296))) (or (not (<= (+ 8388608 (div addflt_~b 4294967296) (* (div (div addflt_~a 16777216) 4294967296) 16777216)) (div addflt_~a 4294967296))) (<= 4294967295 addflt_~b)))} assume !(~a % 4294967296 < ~b % 4294967296); {40594#(and (or (not (<= (+ 8388608 (div addflt_~b 4294967296) (* (div (div addflt_~a 16777216) 4294967296) 16777216)) (div addflt_~a 4294967296))) (<= (+ (* (div addflt_~a 4294967296) 4294967296) 4294967295) (+ (* (div addflt_~b 4294967296) 4294967296) addflt_~a))) (or (<= (div addflt_~a 4294967296) (+ 8388607 (* (div (div addflt_~a 16777216) 4294967296) 16777216))) (<= (+ 8388608 (div addflt_~b 4294967296) (* (div (div addflt_~a 16777216) 4294967296) 16777216)) (div addflt_~a 4294967296))))} is VALID [2022-02-21 03:11:04,145 INFO L290 TraceCheckUtils]: 43: Hoare triple {40594#(and (or (not (<= (+ 8388608 (div addflt_~b 4294967296) (* (div (div addflt_~a 16777216) 4294967296) 16777216)) (div addflt_~a 4294967296))) (<= (+ (* (div addflt_~a 4294967296) 4294967296) 4294967295) (+ (* (div addflt_~b 4294967296) 4294967296) addflt_~a))) (or (<= (div addflt_~a 4294967296) (+ 8388607 (* (div (div addflt_~a 16777216) 4294967296) 16777216))) (<= (+ 8388608 (div addflt_~b 4294967296) (* (div (div addflt_~a 16777216) 4294967296) 16777216)) (div addflt_~a 4294967296))))} assume !(0 == ~b % 4294967296); {40595#(or (<= (+ (* (div (div addflt_~a 16777216) 4294967296) 72057594037927936) 36028801313931263) addflt_~a) (<= (div addflt_~a 4294967296) (+ 8388607 (* (div (div addflt_~a 16777216) 4294967296) 16777216))))} is VALID [2022-02-21 03:11:04,146 INFO L290 TraceCheckUtils]: 44: Hoare triple {40595#(or (<= (+ (* (div (div addflt_~a 16777216) 4294967296) 72057594037927936) 36028801313931263) addflt_~a) (<= (div addflt_~a 4294967296) (+ 8388607 (* (div (div addflt_~a 16777216) 4294967296) 16777216))))} assume !(0 == ~a); {40595#(or (<= (+ (* (div (div addflt_~a 16777216) 4294967296) 72057594037927936) 36028801313931263) addflt_~a) (<= (div addflt_~a 4294967296) (+ 8388607 (* (div (div addflt_~a 16777216) 4294967296) 16777216))))} is VALID [2022-02-21 03:11:04,146 INFO L290 TraceCheckUtils]: 45: Hoare triple {40595#(or (<= (+ (* (div (div addflt_~a 16777216) 4294967296) 72057594037927936) 36028801313931263) addflt_~a) (<= (div addflt_~a 4294967296) (+ 8388607 (* (div (div addflt_~a 16777216) 4294967296) 16777216))))} assume !false; {40595#(or (<= (+ (* (div (div addflt_~a 16777216) 4294967296) 72057594037927936) 36028801313931263) addflt_~a) (<= (div addflt_~a 4294967296) (+ 8388607 (* (div (div addflt_~a 16777216) 4294967296) 16777216))))} is VALID [2022-02-21 03:11:04,147 INFO L290 TraceCheckUtils]: 46: Hoare triple {40595#(or (<= (+ (* (div (div addflt_~a 16777216) 4294967296) 72057594037927936) 36028801313931263) addflt_~a) (<= (div addflt_~a 4294967296) (+ 8388607 (* (div (div addflt_~a 16777216) 4294967296) 16777216))))} assume !false; {40595#(or (<= (+ (* (div (div addflt_~a 16777216) 4294967296) 72057594037927936) 36028801313931263) addflt_~a) (<= (div addflt_~a 4294967296) (+ 8388607 (* (div (div addflt_~a 16777216) 4294967296) 16777216))))} is VALID [2022-02-21 03:11:04,147 INFO L290 TraceCheckUtils]: 47: Hoare triple {40595#(or (<= (+ (* (div (div addflt_~a 16777216) 4294967296) 72057594037927936) 36028801313931263) addflt_~a) (<= (div addflt_~a 4294967296) (+ 8388607 (* (div (div addflt_~a 16777216) 4294967296) 16777216))))} assume ~a >= 0;abs_108 := (if ~a < 16777215 then ~a else 16777215);assume ~a >= 0;assume ~ma~0 < abs_108; {40595#(or (<= (+ (* (div (div addflt_~a 16777216) 4294967296) 72057594037927936) 36028801313931263) addflt_~a) (<= (div addflt_~a 4294967296) (+ 8388607 (* (div (div addflt_~a 16777216) 4294967296) 16777216))))} is VALID [2022-02-21 03:11:04,148 INFO L290 TraceCheckUtils]: 48: Hoare triple {40595#(or (<= (+ (* (div (div addflt_~a 16777216) 4294967296) 72057594037927936) 36028801313931263) addflt_~a) (<= (div addflt_~a 4294967296) (+ 8388607 (* (div (div addflt_~a 16777216) 4294967296) 16777216))))} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {40596#(or (<= (div addflt_~a 16777216) (+ 2147483647 (* (div (div addflt_~a 16777216) 4294967296) 4294967296))) (<= (+ 2147483903 (* (div (div addflt_~a 16777216) 4294967296) 4294967296)) (div addflt_~a 16777216)))} is VALID [2022-02-21 03:11:04,148 INFO L290 TraceCheckUtils]: 49: Hoare triple {40596#(or (<= (div addflt_~a 16777216) (+ 2147483647 (* (div (div addflt_~a 16777216) 4294967296) 4294967296))) (<= (+ 2147483903 (* (div (div addflt_~a 16777216) 4294967296) 4294967296)) (div addflt_~a 16777216)))} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {40557#false} is VALID [2022-02-21 03:11:04,149 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:11:04,149 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:11:04,149 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973676982] [2022-02-21 03:11:04,149 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973676982] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:11:04,149 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:11:04,149 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-21 03:11:04,149 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862386167] [2022-02-21 03:11:04,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:11:04,150 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2022-02-21 03:11:04,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:11:04,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:11:04,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:11:04,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-21 03:11:04,179 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:11:04,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-21 03:11:04,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-02-21 03:11:04,180 INFO L87 Difference]: Start difference. First operand 633 states and 885 transitions. Second operand has 12 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:11:08,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:11:08,058 INFO L93 Difference]: Finished difference Result 1068 states and 1499 transitions. [2022-02-21 03:11:08,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 03:11:08,058 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2022-02-21 03:11:08,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:11:08,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:11:08,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 445 transitions. [2022-02-21 03:11:08,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:11:08,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 445 transitions. [2022-02-21 03:11:08,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 445 transitions. [2022-02-21 03:11:08,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 445 edges. 445 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:11:08,389 INFO L225 Difference]: With dead ends: 1068 [2022-02-21 03:11:08,389 INFO L226 Difference]: Without dead ends: 1067 [2022-02-21 03:11:08,390 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2022-02-21 03:11:08,390 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 613 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 1298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-02-21 03:11:08,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [618 Valid, 597 Invalid, 1298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-02-21 03:11:08,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2022-02-21 03:11:08,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 629. [2022-02-21 03:11:08,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:11:08,774 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1067 states. Second operand has 629 states, 564 states have (on average 1.4095744680851063) internal successors, (795), 578 states have internal predecessors, (795), 39 states have call successors, (39), 12 states have call predecessors, (39), 16 states have return successors, (45), 38 states have call predecessors, (45), 38 states have call successors, (45) [2022-02-21 03:11:08,774 INFO L74 IsIncluded]: Start isIncluded. First operand 1067 states. Second operand has 629 states, 564 states have (on average 1.4095744680851063) internal successors, (795), 578 states have internal predecessors, (795), 39 states have call successors, (39), 12 states have call predecessors, (39), 16 states have return successors, (45), 38 states have call predecessors, (45), 38 states have call successors, (45) [2022-02-21 03:11:08,775 INFO L87 Difference]: Start difference. First operand 1067 states. Second operand has 629 states, 564 states have (on average 1.4095744680851063) internal successors, (795), 578 states have internal predecessors, (795), 39 states have call successors, (39), 12 states have call predecessors, (39), 16 states have return successors, (45), 38 states have call predecessors, (45), 38 states have call successors, (45) [2022-02-21 03:11:08,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:11:08,823 INFO L93 Difference]: Finished difference Result 1067 states and 1497 transitions. [2022-02-21 03:11:08,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1497 transitions. [2022-02-21 03:11:08,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:11:08,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:11:08,826 INFO L74 IsIncluded]: Start isIncluded. First operand has 629 states, 564 states have (on average 1.4095744680851063) internal successors, (795), 578 states have internal predecessors, (795), 39 states have call successors, (39), 12 states have call predecessors, (39), 16 states have return successors, (45), 38 states have call predecessors, (45), 38 states have call successors, (45) Second operand 1067 states. [2022-02-21 03:11:08,826 INFO L87 Difference]: Start difference. First operand has 629 states, 564 states have (on average 1.4095744680851063) internal successors, (795), 578 states have internal predecessors, (795), 39 states have call successors, (39), 12 states have call predecessors, (39), 16 states have return successors, (45), 38 states have call predecessors, (45), 38 states have call successors, (45) Second operand 1067 states. [2022-02-21 03:11:08,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:11:08,865 INFO L93 Difference]: Finished difference Result 1067 states and 1497 transitions. [2022-02-21 03:11:08,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1497 transitions. [2022-02-21 03:11:08,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:11:08,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:11:08,867 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:11:08,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:11:08,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 564 states have (on average 1.4095744680851063) internal successors, (795), 578 states have internal predecessors, (795), 39 states have call successors, (39), 12 states have call predecessors, (39), 16 states have return successors, (45), 38 states have call predecessors, (45), 38 states have call successors, (45) [2022-02-21 03:11:08,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 879 transitions. [2022-02-21 03:11:08,881 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 879 transitions. Word has length 50 [2022-02-21 03:11:08,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:11:08,881 INFO L470 AbstractCegarLoop]: Abstraction has 629 states and 879 transitions. [2022-02-21 03:11:08,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:11:08,882 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 879 transitions. [2022-02-21 03:11:08,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-21 03:11:08,882 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:11:08,882 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:11:08,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-21 03:11:08,883 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:11:08,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:11:08,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1460160345, now seen corresponding path program 1 times [2022-02-21 03:11:08,884 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:11:08,884 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133580323] [2022-02-21 03:11:08,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:11:08,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:11:08,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:11:09,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:11:09,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:11:09,008 INFO L290 TraceCheckUtils]: 0: Hoare triple {44684#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {44640#true} is VALID [2022-02-21 03:11:09,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {44640#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {44640#true} is VALID [2022-02-21 03:11:09,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {44640#true} #res := ~__retres4~0; {44640#true} is VALID [2022-02-21 03:11:09,008 INFO L290 TraceCheckUtils]: 3: Hoare triple {44640#true} assume true; {44640#true} is VALID [2022-02-21 03:11:09,009 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {44640#true} {44640#true} #349#return; {44640#true} is VALID [2022-02-21 03:11:09,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:11:09,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:11:09,044 INFO L290 TraceCheckUtils]: 0: Hoare triple {44684#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {44640#true} is VALID [2022-02-21 03:11:09,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {44640#true} assume !(0 == ~m % 4294967296); {44640#true} is VALID [2022-02-21 03:11:09,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {44640#true} assume !(~m % 4294967296 < 16777216); {44640#true} is VALID [2022-02-21 03:11:09,045 INFO L290 TraceCheckUtils]: 3: Hoare triple {44640#true} assume !false; {44640#true} is VALID [2022-02-21 03:11:09,045 INFO L290 TraceCheckUtils]: 4: Hoare triple {44640#true} assume ~m % 4294967296 >= 33554432; {44640#true} is VALID [2022-02-21 03:11:09,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {44640#true} assume ~e >= 127;~__retres4~0 := 4294967295; {44685#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} is VALID [2022-02-21 03:11:09,046 INFO L290 TraceCheckUtils]: 6: Hoare triple {44685#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} #res := ~__retres4~0; {44686#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:11:09,046 INFO L290 TraceCheckUtils]: 7: Hoare triple {44686#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} assume true; {44686#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:11:09,047 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {44686#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} {44640#true} #351#return; {44656#(and (<= 4294967295 |ULTIMATE.start_main_#t~ret23#1|) (<= |ULTIMATE.start_main_#t~ret23#1| 4294967295))} is VALID [2022-02-21 03:11:09,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-21 03:11:09,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:11:09,054 INFO L290 TraceCheckUtils]: 0: Hoare triple {44684#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {44640#true} is VALID [2022-02-21 03:11:09,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {44640#true} assume !(0 == ~m % 4294967296); {44640#true} is VALID [2022-02-21 03:11:09,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {44640#true} assume !(~m % 4294967296 < 16777216); {44640#true} is VALID [2022-02-21 03:11:09,055 INFO L290 TraceCheckUtils]: 3: Hoare triple {44640#true} assume !false; {44640#true} is VALID [2022-02-21 03:11:09,055 INFO L290 TraceCheckUtils]: 4: Hoare triple {44640#true} assume !(~m % 4294967296 >= 33554432); {44640#true} is VALID [2022-02-21 03:11:09,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {44640#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {44640#true} is VALID [2022-02-21 03:11:09,055 INFO L290 TraceCheckUtils]: 6: Hoare triple {44640#true} assume 128 + ~e <= 2147483647; {44640#true} is VALID [2022-02-21 03:11:09,055 INFO L290 TraceCheckUtils]: 7: Hoare triple {44640#true} assume 128 + ~e >= -2147483648; {44640#true} is VALID [2022-02-21 03:11:09,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {44640#true} assume 128 + ~e <= 2147483647; {44640#true} is VALID [2022-02-21 03:11:09,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {44640#true} assume 128 + ~e >= -2147483648; {44640#true} is VALID [2022-02-21 03:11:09,056 INFO L290 TraceCheckUtils]: 10: Hoare triple {44640#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {44640#true} is VALID [2022-02-21 03:11:09,056 INFO L290 TraceCheckUtils]: 11: Hoare triple {44640#true} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {44640#true} is VALID [2022-02-21 03:11:09,056 INFO L290 TraceCheckUtils]: 12: Hoare triple {44640#true} ~__retres4~0 := ~res~0; {44640#true} is VALID [2022-02-21 03:11:09,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {44640#true} #res := ~__retres4~0; {44640#true} is VALID [2022-02-21 03:11:09,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {44640#true} assume true; {44640#true} is VALID [2022-02-21 03:11:09,057 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {44640#true} {44657#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} #353#return; {44657#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:11:09,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-21 03:11:09,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:11:09,077 INFO L290 TraceCheckUtils]: 0: Hoare triple {44687#(and (= abs_110 |old(abs_110)|) (= abs_140 |old(abs_140)|) (= abs_113 |old(abs_113)|) (= abs_111 |old(abs_111)|) (= abs_108 |old(abs_108)|) (= abs_141 |old(abs_141)|))} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {44640#true} is VALID [2022-02-21 03:11:09,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {44640#true} assume !(~a % 4294967296 < ~b % 4294967296); {44640#true} is VALID [2022-02-21 03:11:09,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {44640#true} assume 0 == ~b % 4294967296;~__retres10~0 := ~a; {44640#true} is VALID [2022-02-21 03:11:09,077 INFO L290 TraceCheckUtils]: 3: Hoare triple {44640#true} #res := ~__retres10~0; {44640#true} is VALID [2022-02-21 03:11:09,077 INFO L290 TraceCheckUtils]: 4: Hoare triple {44640#true} assume true; {44640#true} is VALID [2022-02-21 03:11:09,078 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {44640#true} {44657#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} #355#return; {44657#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:11:09,078 INFO L290 TraceCheckUtils]: 0: Hoare triple {44640#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); {44640#true} is VALID [2022-02-21 03:11:09,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {44640#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {44640#true} is VALID [2022-02-21 03:11:09,079 INFO L272 TraceCheckUtils]: 2: Hoare triple {44640#true} call main_#t~ret22#1 := base2flt(0, 0); {44684#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:11:09,079 INFO L290 TraceCheckUtils]: 3: Hoare triple {44684#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {44640#true} is VALID [2022-02-21 03:11:09,079 INFO L290 TraceCheckUtils]: 4: Hoare triple {44640#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {44640#true} is VALID [2022-02-21 03:11:09,079 INFO L290 TraceCheckUtils]: 5: Hoare triple {44640#true} #res := ~__retres4~0; {44640#true} is VALID [2022-02-21 03:11:09,079 INFO L290 TraceCheckUtils]: 6: Hoare triple {44640#true} assume true; {44640#true} is VALID [2022-02-21 03:11:09,079 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {44640#true} {44640#true} #349#return; {44640#true} is VALID [2022-02-21 03:11:09,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {44640#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {44640#true} is VALID [2022-02-21 03:11:09,080 INFO L272 TraceCheckUtils]: 9: Hoare triple {44640#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {44684#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:11:09,080 INFO L290 TraceCheckUtils]: 10: Hoare triple {44684#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {44640#true} is VALID [2022-02-21 03:11:09,080 INFO L290 TraceCheckUtils]: 11: Hoare triple {44640#true} assume !(0 == ~m % 4294967296); {44640#true} is VALID [2022-02-21 03:11:09,080 INFO L290 TraceCheckUtils]: 12: Hoare triple {44640#true} assume !(~m % 4294967296 < 16777216); {44640#true} is VALID [2022-02-21 03:11:09,080 INFO L290 TraceCheckUtils]: 13: Hoare triple {44640#true} assume !false; {44640#true} is VALID [2022-02-21 03:11:09,080 INFO L290 TraceCheckUtils]: 14: Hoare triple {44640#true} assume ~m % 4294967296 >= 33554432; {44640#true} is VALID [2022-02-21 03:11:09,081 INFO L290 TraceCheckUtils]: 15: Hoare triple {44640#true} assume ~e >= 127;~__retres4~0 := 4294967295; {44685#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} is VALID [2022-02-21 03:11:09,081 INFO L290 TraceCheckUtils]: 16: Hoare triple {44685#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} #res := ~__retres4~0; {44686#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:11:09,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {44686#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} assume true; {44686#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:11:09,082 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {44686#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} {44640#true} #351#return; {44656#(and (<= 4294967295 |ULTIMATE.start_main_#t~ret23#1|) (<= |ULTIMATE.start_main_#t~ret23#1| 4294967295))} is VALID [2022-02-21 03:11:09,082 INFO L290 TraceCheckUtils]: 19: Hoare triple {44656#(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; {44657#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:11:09,083 INFO L272 TraceCheckUtils]: 20: Hoare triple {44657#(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); {44684#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:11:09,083 INFO L290 TraceCheckUtils]: 21: Hoare triple {44684#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {44640#true} is VALID [2022-02-21 03:11:09,083 INFO L290 TraceCheckUtils]: 22: Hoare triple {44640#true} assume !(0 == ~m % 4294967296); {44640#true} is VALID [2022-02-21 03:11:09,083 INFO L290 TraceCheckUtils]: 23: Hoare triple {44640#true} assume !(~m % 4294967296 < 16777216); {44640#true} is VALID [2022-02-21 03:11:09,083 INFO L290 TraceCheckUtils]: 24: Hoare triple {44640#true} assume !false; {44640#true} is VALID [2022-02-21 03:11:09,083 INFO L290 TraceCheckUtils]: 25: Hoare triple {44640#true} assume !(~m % 4294967296 >= 33554432); {44640#true} is VALID [2022-02-21 03:11:09,084 INFO L290 TraceCheckUtils]: 26: Hoare triple {44640#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {44640#true} is VALID [2022-02-21 03:11:09,084 INFO L290 TraceCheckUtils]: 27: Hoare triple {44640#true} assume 128 + ~e <= 2147483647; {44640#true} is VALID [2022-02-21 03:11:09,084 INFO L290 TraceCheckUtils]: 28: Hoare triple {44640#true} assume 128 + ~e >= -2147483648; {44640#true} is VALID [2022-02-21 03:11:09,084 INFO L290 TraceCheckUtils]: 29: Hoare triple {44640#true} assume 128 + ~e <= 2147483647; {44640#true} is VALID [2022-02-21 03:11:09,084 INFO L290 TraceCheckUtils]: 30: Hoare triple {44640#true} assume 128 + ~e >= -2147483648; {44640#true} is VALID [2022-02-21 03:11:09,084 INFO L290 TraceCheckUtils]: 31: Hoare triple {44640#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {44640#true} is VALID [2022-02-21 03:11:09,084 INFO L290 TraceCheckUtils]: 32: Hoare triple {44640#true} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {44640#true} is VALID [2022-02-21 03:11:09,084 INFO L290 TraceCheckUtils]: 33: Hoare triple {44640#true} ~__retres4~0 := ~res~0; {44640#true} is VALID [2022-02-21 03:11:09,084 INFO L290 TraceCheckUtils]: 34: Hoare triple {44640#true} #res := ~__retres4~0; {44640#true} is VALID [2022-02-21 03:11:09,084 INFO L290 TraceCheckUtils]: 35: Hoare triple {44640#true} assume true; {44640#true} is VALID [2022-02-21 03:11:09,085 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {44640#true} {44657#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} #353#return; {44657#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:11:09,085 INFO L290 TraceCheckUtils]: 37: Hoare triple {44657#(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; {44657#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:11:09,086 INFO L272 TraceCheckUtils]: 38: Hoare triple {44657#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {44687#(and (= abs_110 |old(abs_110)|) (= abs_140 |old(abs_140)|) (= abs_113 |old(abs_113)|) (= abs_111 |old(abs_111)|) (= abs_108 |old(abs_108)|) (= abs_141 |old(abs_141)|))} is VALID [2022-02-21 03:11:09,086 INFO L290 TraceCheckUtils]: 39: Hoare triple {44687#(and (= abs_110 |old(abs_110)|) (= abs_140 |old(abs_140)|) (= abs_113 |old(abs_113)|) (= abs_111 |old(abs_111)|) (= abs_108 |old(abs_108)|) (= abs_141 |old(abs_141)|))} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {44640#true} is VALID [2022-02-21 03:11:09,086 INFO L290 TraceCheckUtils]: 40: Hoare triple {44640#true} assume !(~a % 4294967296 < ~b % 4294967296); {44640#true} is VALID [2022-02-21 03:11:09,086 INFO L290 TraceCheckUtils]: 41: Hoare triple {44640#true} assume 0 == ~b % 4294967296;~__retres10~0 := ~a; {44640#true} is VALID [2022-02-21 03:11:09,087 INFO L290 TraceCheckUtils]: 42: Hoare triple {44640#true} #res := ~__retres10~0; {44640#true} is VALID [2022-02-21 03:11:09,087 INFO L290 TraceCheckUtils]: 43: Hoare triple {44640#true} assume true; {44640#true} is VALID [2022-02-21 03:11:09,087 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {44640#true} {44657#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} #355#return; {44657#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:11:09,087 INFO L290 TraceCheckUtils]: 45: Hoare triple {44657#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} main_~r_add1~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {44657#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:11:09,088 INFO L272 TraceCheckUtils]: 46: Hoare triple {44657#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} call main_#t~ret26#1 := addflt(main_~b~0#1, main_~a~0#1); {44680#(and (<= 4294967295 |addflt_#in~b|) (<= |addflt_#in~b| 4294967295))} is VALID [2022-02-21 03:11:09,088 INFO L290 TraceCheckUtils]: 47: Hoare triple {44680#(and (<= 4294967295 |addflt_#in~b|) (<= |addflt_#in~b| 4294967295))} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {44681#(and (<= addflt_~b 4294967295) (<= 4294967295 addflt_~b))} is VALID [2022-02-21 03:11:09,089 INFO L290 TraceCheckUtils]: 48: Hoare triple {44681#(and (<= addflt_~b 4294967295) (<= 4294967295 addflt_~b))} assume ~a % 4294967296 < ~b % 4294967296;~tmp~0 := ~a;~a := ~b;~b := ~tmp~0; {44682#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} is VALID [2022-02-21 03:11:09,089 INFO L290 TraceCheckUtils]: 49: Hoare triple {44682#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} assume !(0 == ~b % 4294967296); {44682#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} is VALID [2022-02-21 03:11:09,090 INFO L290 TraceCheckUtils]: 50: Hoare triple {44682#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} assume !(0 == ~a); {44682#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} is VALID [2022-02-21 03:11:09,090 INFO L290 TraceCheckUtils]: 51: Hoare triple {44682#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} assume !false; {44682#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} is VALID [2022-02-21 03:11:09,090 INFO L290 TraceCheckUtils]: 52: Hoare triple {44682#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} assume !false; {44682#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} is VALID [2022-02-21 03:11:09,091 INFO L290 TraceCheckUtils]: 53: Hoare triple {44682#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} assume ~a >= 0;abs_108 := (if ~a < 16777215 then ~a else 16777215);assume ~a >= 0;assume ~ma~0 < abs_108; {44682#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} is VALID [2022-02-21 03:11:09,091 INFO L290 TraceCheckUtils]: 54: Hoare triple {44682#(and (not (<= (+ (div (div addflt_~a 16777216) 4294967296) 1) 0)) (<= addflt_~a 4294967295))} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {44683#(<= (div addflt_~a 16777216) (+ 2147483647 (* (div (div addflt_~a 16777216) 4294967296) 4294967296)))} is VALID [2022-02-21 03:11:09,092 INFO L290 TraceCheckUtils]: 55: Hoare triple {44683#(<= (div addflt_~a 16777216) (+ 2147483647 (* (div (div addflt_~a 16777216) 4294967296) 4294967296)))} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {44641#false} is VALID [2022-02-21 03:11:09,092 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-21 03:11:09,092 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:11:09,092 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133580323] [2022-02-21 03:11:09,092 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133580323] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:11:09,093 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744607189] [2022-02-21 03:11:09,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:11:09,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:11:09,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:11:09,094 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:11:09,095 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:11:09,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:11:09,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-21 03:11:09,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:11:09,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:11:09,665 INFO L290 TraceCheckUtils]: 0: Hoare triple {44640#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); {44640#true} is VALID [2022-02-21 03:11:09,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {44640#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {44640#true} is VALID [2022-02-21 03:11:09,665 INFO L272 TraceCheckUtils]: 2: Hoare triple {44640#true} call main_#t~ret22#1 := base2flt(0, 0); {44640#true} is VALID [2022-02-21 03:11:09,665 INFO L290 TraceCheckUtils]: 3: Hoare triple {44640#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {44640#true} is VALID [2022-02-21 03:11:09,666 INFO L290 TraceCheckUtils]: 4: Hoare triple {44640#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {44640#true} is VALID [2022-02-21 03:11:09,666 INFO L290 TraceCheckUtils]: 5: Hoare triple {44640#true} #res := ~__retres4~0; {44640#true} is VALID [2022-02-21 03:11:09,666 INFO L290 TraceCheckUtils]: 6: Hoare triple {44640#true} assume true; {44640#true} is VALID [2022-02-21 03:11:09,666 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {44640#true} {44640#true} #349#return; {44640#true} is VALID [2022-02-21 03:11:09,666 INFO L290 TraceCheckUtils]: 8: Hoare triple {44640#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {44640#true} is VALID [2022-02-21 03:11:09,666 INFO L272 TraceCheckUtils]: 9: Hoare triple {44640#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {44640#true} is VALID [2022-02-21 03:11:09,666 INFO L290 TraceCheckUtils]: 10: Hoare triple {44640#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {44640#true} is VALID [2022-02-21 03:11:09,666 INFO L290 TraceCheckUtils]: 11: Hoare triple {44640#true} assume !(0 == ~m % 4294967296); {44640#true} is VALID [2022-02-21 03:11:09,666 INFO L290 TraceCheckUtils]: 12: Hoare triple {44640#true} assume !(~m % 4294967296 < 16777216); {44640#true} is VALID [2022-02-21 03:11:09,666 INFO L290 TraceCheckUtils]: 13: Hoare triple {44640#true} assume !false; {44640#true} is VALID [2022-02-21 03:11:09,667 INFO L290 TraceCheckUtils]: 14: Hoare triple {44640#true} assume ~m % 4294967296 >= 33554432; {44640#true} is VALID [2022-02-21 03:11:09,667 INFO L290 TraceCheckUtils]: 15: Hoare triple {44640#true} assume ~e >= 127;~__retres4~0 := 4294967295; {44640#true} is VALID [2022-02-21 03:11:09,667 INFO L290 TraceCheckUtils]: 16: Hoare triple {44640#true} #res := ~__retres4~0; {44640#true} is VALID [2022-02-21 03:11:09,667 INFO L290 TraceCheckUtils]: 17: Hoare triple {44640#true} assume true; {44640#true} is VALID [2022-02-21 03:11:09,667 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {44640#true} {44640#true} #351#return; {44640#true} is VALID [2022-02-21 03:11:09,667 INFO L290 TraceCheckUtils]: 19: Hoare triple {44640#true} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {44640#true} is VALID [2022-02-21 03:11:09,667 INFO L272 TraceCheckUtils]: 20: Hoare triple {44640#true} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {44640#true} is VALID [2022-02-21 03:11:09,667 INFO L290 TraceCheckUtils]: 21: Hoare triple {44640#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {44640#true} is VALID [2022-02-21 03:11:09,667 INFO L290 TraceCheckUtils]: 22: Hoare triple {44640#true} assume !(0 == ~m % 4294967296); {44640#true} is VALID [2022-02-21 03:11:09,668 INFO L290 TraceCheckUtils]: 23: Hoare triple {44640#true} assume !(~m % 4294967296 < 16777216); {44640#true} is VALID [2022-02-21 03:11:09,668 INFO L290 TraceCheckUtils]: 24: Hoare triple {44640#true} assume !false; {44640#true} is VALID [2022-02-21 03:11:09,668 INFO L290 TraceCheckUtils]: 25: Hoare triple {44640#true} assume !(~m % 4294967296 >= 33554432); {44640#true} is VALID [2022-02-21 03:11:09,668 INFO L290 TraceCheckUtils]: 26: Hoare triple {44640#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {44640#true} is VALID [2022-02-21 03:11:09,669 INFO L290 TraceCheckUtils]: 27: Hoare triple {44640#true} assume 128 + ~e <= 2147483647; {44640#true} is VALID [2022-02-21 03:11:09,671 INFO L290 TraceCheckUtils]: 28: Hoare triple {44640#true} assume 128 + ~e >= -2147483648; {44640#true} is VALID [2022-02-21 03:11:09,671 INFO L290 TraceCheckUtils]: 29: Hoare triple {44640#true} assume 128 + ~e <= 2147483647; {44640#true} is VALID [2022-02-21 03:11:09,671 INFO L290 TraceCheckUtils]: 30: Hoare triple {44640#true} assume 128 + ~e >= -2147483648; {44640#true} is VALID [2022-02-21 03:11:09,671 INFO L290 TraceCheckUtils]: 31: Hoare triple {44640#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {44640#true} is VALID [2022-02-21 03:11:09,672 INFO L290 TraceCheckUtils]: 32: Hoare triple {44640#true} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {44640#true} is VALID [2022-02-21 03:11:09,672 INFO L290 TraceCheckUtils]: 33: Hoare triple {44640#true} ~__retres4~0 := ~res~0; {44640#true} is VALID [2022-02-21 03:11:09,672 INFO L290 TraceCheckUtils]: 34: Hoare triple {44640#true} #res := ~__retres4~0; {44640#true} is VALID [2022-02-21 03:11:09,672 INFO L290 TraceCheckUtils]: 35: Hoare triple {44640#true} assume true; {44640#true} is VALID [2022-02-21 03:11:09,672 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {44640#true} {44640#true} #353#return; {44640#true} is VALID [2022-02-21 03:11:09,672 INFO L290 TraceCheckUtils]: 37: Hoare triple {44640#true} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {44640#true} is VALID [2022-02-21 03:11:09,672 INFO L272 TraceCheckUtils]: 38: Hoare triple {44640#true} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {44640#true} is VALID [2022-02-21 03:11:09,673 INFO L290 TraceCheckUtils]: 39: Hoare triple {44640#true} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {44808#(= |addflt_#in~b| addflt_~b)} is VALID [2022-02-21 03:11:09,673 INFO L290 TraceCheckUtils]: 40: Hoare triple {44808#(= |addflt_#in~b| addflt_~b)} assume !(~a % 4294967296 < ~b % 4294967296); {44808#(= |addflt_#in~b| addflt_~b)} is VALID [2022-02-21 03:11:09,673 INFO L290 TraceCheckUtils]: 41: Hoare triple {44808#(= |addflt_#in~b| addflt_~b)} assume 0 == ~b % 4294967296;~__retres10~0 := ~a; {44815#(<= (mod |addflt_#in~b| 4294967296) 0)} is VALID [2022-02-21 03:11:09,674 INFO L290 TraceCheckUtils]: 42: Hoare triple {44815#(<= (mod |addflt_#in~b| 4294967296) 0)} #res := ~__retres10~0; {44815#(<= (mod |addflt_#in~b| 4294967296) 0)} is VALID [2022-02-21 03:11:09,674 INFO L290 TraceCheckUtils]: 43: Hoare triple {44815#(<= (mod |addflt_#in~b| 4294967296) 0)} assume true; {44815#(<= (mod |addflt_#in~b| 4294967296) 0)} is VALID [2022-02-21 03:11:09,675 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {44815#(<= (mod |addflt_#in~b| 4294967296) 0)} {44640#true} #355#return; {44825#(<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} is VALID [2022-02-21 03:11:09,675 INFO L290 TraceCheckUtils]: 45: Hoare triple {44825#(<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} main_~r_add1~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {44825#(<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} is VALID [2022-02-21 03:11:09,675 INFO L272 TraceCheckUtils]: 46: Hoare triple {44825#(<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} call main_#t~ret26#1 := addflt(main_~b~0#1, main_~a~0#1); {44832#(<= (mod |addflt_#in~a| 4294967296) 0)} is VALID [2022-02-21 03:11:09,676 INFO L290 TraceCheckUtils]: 47: Hoare triple {44832#(<= (mod |addflt_#in~a| 4294967296) 0)} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {44836#(<= (mod addflt_~a 4294967296) 0)} is VALID [2022-02-21 03:11:09,676 INFO L290 TraceCheckUtils]: 48: Hoare triple {44836#(<= (mod addflt_~a 4294967296) 0)} assume ~a % 4294967296 < ~b % 4294967296;~tmp~0 := ~a;~a := ~b;~b := ~tmp~0; {44840#(<= (mod addflt_~b 4294967296) 0)} is VALID [2022-02-21 03:11:09,677 INFO L290 TraceCheckUtils]: 49: Hoare triple {44840#(<= (mod addflt_~b 4294967296) 0)} assume !(0 == ~b % 4294967296); {44641#false} is VALID [2022-02-21 03:11:09,677 INFO L290 TraceCheckUtils]: 50: Hoare triple {44641#false} assume !(0 == ~a); {44641#false} is VALID [2022-02-21 03:11:09,677 INFO L290 TraceCheckUtils]: 51: Hoare triple {44641#false} assume !false; {44641#false} is VALID [2022-02-21 03:11:09,677 INFO L290 TraceCheckUtils]: 52: Hoare triple {44641#false} assume !false; {44641#false} is VALID [2022-02-21 03:11:09,677 INFO L290 TraceCheckUtils]: 53: Hoare triple {44641#false} assume ~a >= 0;abs_108 := (if ~a < 16777215 then ~a else 16777215);assume ~a >= 0;assume ~ma~0 < abs_108; {44641#false} is VALID [2022-02-21 03:11:09,677 INFO L290 TraceCheckUtils]: 54: Hoare triple {44641#false} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {44641#false} is VALID [2022-02-21 03:11:09,677 INFO L290 TraceCheckUtils]: 55: Hoare triple {44641#false} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {44641#false} is VALID [2022-02-21 03:11:09,678 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-02-21 03:11:09,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:11:09,943 INFO L290 TraceCheckUtils]: 55: Hoare triple {44641#false} assume !((if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {44641#false} is VALID [2022-02-21 03:11:09,943 INFO L290 TraceCheckUtils]: 54: Hoare triple {44641#false} assume (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {44641#false} is VALID [2022-02-21 03:11:09,943 INFO L290 TraceCheckUtils]: 53: Hoare triple {44641#false} assume ~a >= 0;abs_108 := (if ~a < 16777215 then ~a else 16777215);assume ~a >= 0;assume ~ma~0 < abs_108; {44641#false} is VALID [2022-02-21 03:11:09,943 INFO L290 TraceCheckUtils]: 52: Hoare triple {44641#false} assume !false; {44641#false} is VALID [2022-02-21 03:11:09,943 INFO L290 TraceCheckUtils]: 51: Hoare triple {44641#false} assume !false; {44641#false} is VALID [2022-02-21 03:11:09,943 INFO L290 TraceCheckUtils]: 50: Hoare triple {44641#false} assume !(0 == ~a); {44641#false} is VALID [2022-02-21 03:11:09,944 INFO L290 TraceCheckUtils]: 49: Hoare triple {44840#(<= (mod addflt_~b 4294967296) 0)} assume !(0 == ~b % 4294967296); {44641#false} is VALID [2022-02-21 03:11:09,944 INFO L290 TraceCheckUtils]: 48: Hoare triple {44836#(<= (mod addflt_~a 4294967296) 0)} assume ~a % 4294967296 < ~b % 4294967296;~tmp~0 := ~a;~a := ~b;~b := ~tmp~0; {44840#(<= (mod addflt_~b 4294967296) 0)} is VALID [2022-02-21 03:11:09,944 INFO L290 TraceCheckUtils]: 47: Hoare triple {44832#(<= (mod |addflt_#in~a| 4294967296) 0)} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {44836#(<= (mod addflt_~a 4294967296) 0)} is VALID [2022-02-21 03:11:09,945 INFO L272 TraceCheckUtils]: 46: Hoare triple {44825#(<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} call main_#t~ret26#1 := addflt(main_~b~0#1, main_~a~0#1); {44832#(<= (mod |addflt_#in~a| 4294967296) 0)} is VALID [2022-02-21 03:11:09,945 INFO L290 TraceCheckUtils]: 45: Hoare triple {44825#(<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} main_~r_add1~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {44825#(<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} is VALID [2022-02-21 03:11:09,946 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {44815#(<= (mod |addflt_#in~b| 4294967296) 0)} {44640#true} #355#return; {44825#(<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} is VALID [2022-02-21 03:11:09,946 INFO L290 TraceCheckUtils]: 43: Hoare triple {44815#(<= (mod |addflt_#in~b| 4294967296) 0)} assume true; {44815#(<= (mod |addflt_#in~b| 4294967296) 0)} is VALID [2022-02-21 03:11:09,946 INFO L290 TraceCheckUtils]: 42: Hoare triple {44815#(<= (mod |addflt_#in~b| 4294967296) 0)} #res := ~__retres10~0; {44815#(<= (mod |addflt_#in~b| 4294967296) 0)} is VALID [2022-02-21 03:11:09,947 INFO L290 TraceCheckUtils]: 41: Hoare triple {44907#(or (<= (mod |addflt_#in~b| 4294967296) 0) (not (<= (mod addflt_~b 4294967296) 0)))} assume 0 == ~b % 4294967296;~__retres10~0 := ~a; {44815#(<= (mod |addflt_#in~b| 4294967296) 0)} is VALID [2022-02-21 03:11:09,947 INFO L290 TraceCheckUtils]: 40: Hoare triple {44907#(or (<= (mod |addflt_#in~b| 4294967296) 0) (not (<= (mod addflt_~b 4294967296) 0)))} assume !(~a % 4294967296 < ~b % 4294967296); {44907#(or (<= (mod |addflt_#in~b| 4294967296) 0) (not (<= (mod addflt_~b 4294967296) 0)))} is VALID [2022-02-21 03:11:09,948 INFO L290 TraceCheckUtils]: 39: Hoare triple {44640#true} ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; {44907#(or (<= (mod |addflt_#in~b| 4294967296) 0) (not (<= (mod addflt_~b 4294967296) 0)))} is VALID [2022-02-21 03:11:09,948 INFO L272 TraceCheckUtils]: 38: Hoare triple {44640#true} call main_#t~ret25#1 := addflt(main_~a~0#1, main_~b~0#1); {44640#true} is VALID [2022-02-21 03:11:09,948 INFO L290 TraceCheckUtils]: 37: Hoare triple {44640#true} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {44640#true} is VALID [2022-02-21 03:11:09,948 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {44640#true} {44640#true} #353#return; {44640#true} is VALID [2022-02-21 03:11:09,948 INFO L290 TraceCheckUtils]: 35: Hoare triple {44640#true} assume true; {44640#true} is VALID [2022-02-21 03:11:09,948 INFO L290 TraceCheckUtils]: 34: Hoare triple {44640#true} #res := ~__retres4~0; {44640#true} is VALID [2022-02-21 03:11:09,948 INFO L290 TraceCheckUtils]: 33: Hoare triple {44640#true} ~__retres4~0 := ~res~0; {44640#true} is VALID [2022-02-21 03:11:09,948 INFO L290 TraceCheckUtils]: 32: Hoare triple {44640#true} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {44640#true} is VALID [2022-02-21 03:11:09,948 INFO L290 TraceCheckUtils]: 31: Hoare triple {44640#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {44640#true} is VALID [2022-02-21 03:11:09,948 INFO L290 TraceCheckUtils]: 30: Hoare triple {44640#true} assume 128 + ~e >= -2147483648; {44640#true} is VALID [2022-02-21 03:11:09,948 INFO L290 TraceCheckUtils]: 29: Hoare triple {44640#true} assume 128 + ~e <= 2147483647; {44640#true} is VALID [2022-02-21 03:11:09,948 INFO L290 TraceCheckUtils]: 28: Hoare triple {44640#true} assume 128 + ~e >= -2147483648; {44640#true} is VALID [2022-02-21 03:11:09,948 INFO L290 TraceCheckUtils]: 27: Hoare triple {44640#true} assume 128 + ~e <= 2147483647; {44640#true} is VALID [2022-02-21 03:11:09,948 INFO L290 TraceCheckUtils]: 26: Hoare triple {44640#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {44640#true} is VALID [2022-02-21 03:11:09,948 INFO L290 TraceCheckUtils]: 25: Hoare triple {44640#true} assume !(~m % 4294967296 >= 33554432); {44640#true} is VALID [2022-02-21 03:11:09,948 INFO L290 TraceCheckUtils]: 24: Hoare triple {44640#true} assume !false; {44640#true} is VALID [2022-02-21 03:11:09,948 INFO L290 TraceCheckUtils]: 23: Hoare triple {44640#true} assume !(~m % 4294967296 < 16777216); {44640#true} is VALID [2022-02-21 03:11:09,948 INFO L290 TraceCheckUtils]: 22: Hoare triple {44640#true} assume !(0 == ~m % 4294967296); {44640#true} is VALID [2022-02-21 03:11:09,948 INFO L290 TraceCheckUtils]: 21: Hoare triple {44640#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {44640#true} is VALID [2022-02-21 03:11:09,949 INFO L272 TraceCheckUtils]: 20: Hoare triple {44640#true} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {44640#true} is VALID [2022-02-21 03:11:09,949 INFO L290 TraceCheckUtils]: 19: Hoare triple {44640#true} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {44640#true} is VALID [2022-02-21 03:11:09,949 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {44640#true} {44640#true} #351#return; {44640#true} is VALID [2022-02-21 03:11:09,949 INFO L290 TraceCheckUtils]: 17: Hoare triple {44640#true} assume true; {44640#true} is VALID [2022-02-21 03:11:09,949 INFO L290 TraceCheckUtils]: 16: Hoare triple {44640#true} #res := ~__retres4~0; {44640#true} is VALID [2022-02-21 03:11:09,949 INFO L290 TraceCheckUtils]: 15: Hoare triple {44640#true} assume ~e >= 127;~__retres4~0 := 4294967295; {44640#true} is VALID [2022-02-21 03:11:09,949 INFO L290 TraceCheckUtils]: 14: Hoare triple {44640#true} assume ~m % 4294967296 >= 33554432; {44640#true} is VALID [2022-02-21 03:11:09,949 INFO L290 TraceCheckUtils]: 13: Hoare triple {44640#true} assume !false; {44640#true} is VALID [2022-02-21 03:11:09,949 INFO L290 TraceCheckUtils]: 12: Hoare triple {44640#true} assume !(~m % 4294967296 < 16777216); {44640#true} is VALID [2022-02-21 03:11:09,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {44640#true} assume !(0 == ~m % 4294967296); {44640#true} is VALID [2022-02-21 03:11:09,949 INFO L290 TraceCheckUtils]: 10: Hoare triple {44640#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {44640#true} is VALID [2022-02-21 03:11:09,949 INFO L272 TraceCheckUtils]: 9: Hoare triple {44640#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {44640#true} is VALID [2022-02-21 03:11:09,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {44640#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {44640#true} is VALID [2022-02-21 03:11:09,949 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {44640#true} {44640#true} #349#return; {44640#true} is VALID [2022-02-21 03:11:09,949 INFO L290 TraceCheckUtils]: 6: Hoare triple {44640#true} assume true; {44640#true} is VALID [2022-02-21 03:11:09,949 INFO L290 TraceCheckUtils]: 5: Hoare triple {44640#true} #res := ~__retres4~0; {44640#true} is VALID [2022-02-21 03:11:09,950 INFO L290 TraceCheckUtils]: 4: Hoare triple {44640#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {44640#true} is VALID [2022-02-21 03:11:09,950 INFO L290 TraceCheckUtils]: 3: Hoare triple {44640#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {44640#true} is VALID [2022-02-21 03:11:09,950 INFO L272 TraceCheckUtils]: 2: Hoare triple {44640#true} call main_#t~ret22#1 := base2flt(0, 0); {44640#true} is VALID [2022-02-21 03:11:09,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {44640#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1; {44640#true} is VALID [2022-02-21 03:11:09,950 INFO L290 TraceCheckUtils]: 0: Hoare triple {44640#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); {44640#true} is VALID [2022-02-21 03:11:09,950 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-02-21 03:11:09,950 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744607189] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:11:09,950 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:11:09,950 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 19 [2022-02-21 03:11:09,950 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448356328] [2022-02-21 03:11:09,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:11:09,952 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 14 states have internal predecessors, (62), 3 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 56 [2022-02-21 03:11:09,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:11:09,954 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 14 states have internal predecessors, (62), 3 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-21 03:11:10,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:11:10,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-21 03:11:10,023 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:11:10,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-21 03:11:10,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2022-02-21 03:11:10,023 INFO L87 Difference]: Start difference. First operand 629 states and 879 transitions. Second operand has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 14 states have internal predecessors, (62), 3 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7)