./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_5.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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_5.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 dd739e073fd22ceb2879e867de327b334b7eea402e53d4a8f9e32eed7e4110d8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 13:56:46,878 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 13:56:46,879 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 13:56:46,910 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 13:56:46,911 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 13:56:46,912 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 13:56:46,916 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 13:56:46,920 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 13:56:46,921 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 13:56:46,925 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 13:56:46,926 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 13:56:46,928 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 13:56:46,928 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 13:56:46,930 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 13:56:46,930 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 13:56:46,932 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 13:56:46,932 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 13:56:46,934 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 13:56:46,937 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 13:56:46,940 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 13:56:46,941 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 13:56:46,942 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 13:56:46,943 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 13:56:46,944 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 13:56:46,945 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 13:56:46,948 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 13:56:46,948 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 13:56:46,949 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 13:56:46,950 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 13:56:46,950 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 13:56:46,951 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 13:56:46,951 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 13:56:46,952 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 13:56:46,953 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 13:56:46,953 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 13:56:46,954 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 13:56:46,954 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 13:56:46,955 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 13:56:46,955 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 13:56:46,955 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 13:56:46,956 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 13:56:46,957 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 13:56:46,958 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-07-14 13:56:46,977 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 13:56:46,977 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 13:56:46,977 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 13:56:46,978 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 13:56:46,978 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 13:56:46,978 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 13:56:46,979 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 13:56:46,979 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 13:56:46,979 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 13:56:46,980 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 13:56:46,980 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 13:56:46,980 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 13:56:46,981 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 13:56:46,981 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 13:56:46,981 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 13:56:46,981 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 13:56:46,981 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 13:56:46,981 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 13:56:46,982 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-07-14 13:56:46,982 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 13:56:46,983 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 13:56:46,983 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 13:56:46,983 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 13:56:46,983 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 13:56:46,983 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 13:56:46,984 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 13:56:46,984 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 13:56:46,984 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 13:56:46,984 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 13:56:46,984 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 13:56:46,985 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 13:56:46,985 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 13:56:46,985 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 13:56:46,985 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 -> dd739e073fd22ceb2879e867de327b334b7eea402e53d4a8f9e32eed7e4110d8 [2022-07-14 13:56:47,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 13:56:47,178 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 13:56:47,180 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 13:56:47,181 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 13:56:47,181 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 13:56:47,182 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_5.c.cil.c [2022-07-14 13:56:47,228 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57018aae5/8251c112829b46eb913d7384197d4aa6/FLAG23eff9aac [2022-07-14 13:56:47,511 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 13:56:47,512 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_5.c.cil.c [2022-07-14 13:56:47,516 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57018aae5/8251c112829b46eb913d7384197d4aa6/FLAG23eff9aac [2022-07-14 13:56:47,962 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57018aae5/8251c112829b46eb913d7384197d4aa6 [2022-07-14 13:56:47,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 13:56:47,964 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 13:56:47,965 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 13:56:47,965 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 13:56:47,976 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 13:56:47,977 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 01:56:47" (1/1) ... [2022-07-14 13:56:47,978 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60f5dc78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:56:47, skipping insertion in model container [2022-07-14 13:56:47,978 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 01:56:47" (1/1) ... [2022-07-14 13:56:47,982 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 13:56:48,001 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 13:56:48,132 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_5.c.cil.c[727,740] [2022-07-14 13:56:48,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 13:56:48,190 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 13:56:48,210 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_5.c.cil.c[727,740] [2022-07-14 13:56:48,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 13:56:48,240 INFO L208 MainTranslator]: Completed translation [2022-07-14 13:56:48,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:56:48 WrapperNode [2022-07-14 13:56:48,241 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 13:56:48,242 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 13:56:48,242 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 13:56:48,242 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 13:56:48,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:56:48" (1/1) ... [2022-07-14 13:56:48,263 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:56:48" (1/1) ... [2022-07-14 13:56:48,288 INFO L137 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 196 [2022-07-14 13:56:48,288 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 13:56:48,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 13:56:48,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 13:56:48,289 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 13:56:48,294 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:56:48" (1/1) ... [2022-07-14 13:56:48,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:56:48" (1/1) ... [2022-07-14 13:56:48,296 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:56:48" (1/1) ... [2022-07-14 13:56:48,296 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:56:48" (1/1) ... [2022-07-14 13:56:48,301 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:56:48" (1/1) ... [2022-07-14 13:56:48,305 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:56:48" (1/1) ... [2022-07-14 13:56:48,306 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:56:48" (1/1) ... [2022-07-14 13:56:48,308 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 13:56:48,309 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 13:56:48,309 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 13:56:48,309 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 13:56:48,310 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:56:48" (1/1) ... [2022-07-14 13:56:48,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 13:56:48,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:56:48,339 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-07-14 13:56:48,340 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-07-14 13:56:48,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 13:56:48,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 13:56:48,364 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-07-14 13:56:48,364 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-07-14 13:56:48,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 13:56:48,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 13:56:48,365 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-14 13:56:48,365 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-14 13:56:48,415 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 13:56:48,416 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 13:56:48,696 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 13:56:48,702 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 13:56:48,702 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-14 13:56:48,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 01:56:48 BoogieIcfgContainer [2022-07-14 13:56:48,704 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 13:56:48,705 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 13:56:48,705 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 13:56:48,718 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 13:56:48,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 01:56:47" (1/3) ... [2022-07-14 13:56:48,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@711f9af9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 01:56:48, skipping insertion in model container [2022-07-14 13:56:48,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:56:48" (2/3) ... [2022-07-14 13:56:48,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@711f9af9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 01:56:48, skipping insertion in model container [2022-07-14 13:56:48,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 01:56:48" (3/3) ... [2022-07-14 13:56:48,721 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_5.c.cil.c [2022-07-14 13:56:48,730 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 13:56:48,731 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-07-14 13:56:48,763 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 13:56:48,768 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@554de534, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1b5ecf57 [2022-07-14 13:56:48,768 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2022-07-14 13:56:48,771 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 106 states have (on average 1.8018867924528301) internal successors, (191), 137 states have internal predecessors, (191), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-14 13:56:48,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-14 13:56:48,775 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:48,776 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:56:48,776 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-07-14 13:56:48,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:48,779 INFO L85 PathProgramCache]: Analyzing trace with hash 147391961, now seen corresponding path program 1 times [2022-07-14 13:56:48,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:48,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484483270] [2022-07-14 13:56:48,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:48,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:48,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:48,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:56:48,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:48,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484483270] [2022-07-14 13:56:48,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484483270] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:48,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:56:48,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 13:56:48,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399629467] [2022-07-14 13:56:48,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:48,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-14 13:56:48,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:48,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-14 13:56:48,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 13:56:48,902 INFO L87 Difference]: Start difference. First operand has 144 states, 106 states have (on average 1.8018867924528301) internal successors, (191), 137 states have internal predecessors, (191), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:48,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:48,927 INFO L93 Difference]: Finished difference Result 283 states and 403 transitions. [2022-07-14 13:56:48,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-14 13:56:48,929 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-07-14 13:56:48,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:48,934 INFO L225 Difference]: With dead ends: 283 [2022-07-14 13:56:48,935 INFO L226 Difference]: Without dead ends: 121 [2022-07-14 13:56:48,937 INFO L412 NwaCegarLoop]: 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-07-14 13:56:48,941 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:48,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:56:48,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-14 13:56:48,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-07-14 13:56:48,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 88 states have (on average 1.625) internal successors, (143), 115 states have internal predecessors, (143), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 13:56:48,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 151 transitions. [2022-07-14 13:56:48,992 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 151 transitions. Word has length 9 [2022-07-14 13:56:48,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:48,993 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 151 transitions. [2022-07-14 13:56:48,993 INFO L496 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-07-14 13:56:48,993 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 151 transitions. [2022-07-14 13:56:48,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-14 13:56:48,995 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:48,995 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:56:48,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 13:56:48,996 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-07-14 13:56:48,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:48,997 INFO L85 PathProgramCache]: Analyzing trace with hash 146450613, now seen corresponding path program 1 times [2022-07-14 13:56:48,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:48,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247865751] [2022-07-14 13:56:48,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:48,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:49,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:49,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:56:49,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:49,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247865751] [2022-07-14 13:56:49,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247865751] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:49,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:56:49,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:56:49,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076537508] [2022-07-14 13:56:49,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:49,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 13:56:49,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:49,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 13:56:49,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 13:56:49,065 INFO L87 Difference]: Start difference. First operand 121 states and 151 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:49,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:49,172 INFO L93 Difference]: Finished difference Result 304 states and 392 transitions. [2022-07-14 13:56:49,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 13:56:49,173 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-07-14 13:56:49,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:49,177 INFO L225 Difference]: With dead ends: 304 [2022-07-14 13:56:49,177 INFO L226 Difference]: Without dead ends: 186 [2022-07-14 13:56:49,183 INFO L412 NwaCegarLoop]: 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-07-14 13:56:49,184 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 100 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:49,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 395 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:56:49,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-14 13:56:49,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 170. [2022-07-14 13:56:49,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 136 states have (on average 1.6323529411764706) internal successors, (222), 163 states have internal predecessors, (222), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 13:56:49,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 230 transitions. [2022-07-14 13:56:49,207 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 230 transitions. Word has length 9 [2022-07-14 13:56:49,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:49,208 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 230 transitions. [2022-07-14 13:56:49,209 INFO L496 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-07-14 13:56:49,209 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 230 transitions. [2022-07-14 13:56:49,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-14 13:56:49,210 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:49,210 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:56:49,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 13:56:49,211 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-07-14 13:56:49,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:49,211 INFO L85 PathProgramCache]: Analyzing trace with hash 966754998, now seen corresponding path program 1 times [2022-07-14 13:56:49,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:49,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582473580] [2022-07-14 13:56:49,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:49,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:49,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:49,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:56:49,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:49,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582473580] [2022-07-14 13:56:49,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582473580] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:49,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:56:49,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 13:56:49,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414876] [2022-07-14 13:56:49,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:49,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 13:56:49,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:49,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 13:56:49,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 13:56:49,291 INFO L87 Difference]: Start difference. First operand 170 states and 230 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:49,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:49,355 INFO L93 Difference]: Finished difference Result 385 states and 525 transitions. [2022-07-14 13:56:49,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 13:56:49,355 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-14 13:56:49,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:49,357 INFO L225 Difference]: With dead ends: 385 [2022-07-14 13:56:49,357 INFO L226 Difference]: Without dead ends: 218 [2022-07-14 13:56:49,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 13:56:49,362 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 33 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:49,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 413 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:56:49,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-07-14 13:56:49,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 193. [2022-07-14 13:56:49,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 158 states have (on average 1.6455696202531647) internal successors, (260), 185 states have internal predecessors, (260), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 13:56:49,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 268 transitions. [2022-07-14 13:56:49,378 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 268 transitions. Word has length 12 [2022-07-14 13:56:49,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:49,378 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 268 transitions. [2022-07-14 13:56:49,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:49,378 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 268 transitions. [2022-07-14 13:56:49,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-14 13:56:49,379 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:49,379 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:56:49,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 13:56:49,379 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-07-14 13:56:49,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:49,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1503455626, now seen corresponding path program 1 times [2022-07-14 13:56:49,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:49,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999740090] [2022-07-14 13:56:49,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:49,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:49,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 13:56:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:49,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:56:49,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:49,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999740090] [2022-07-14 13:56:49,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999740090] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:56:49,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59546455] [2022-07-14 13:56:49,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:49,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:56:49,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:56:49,431 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-07-14 13:56:49,435 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-07-14 13:56:49,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:49,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 13:56:49,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:56:49,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:56:49,504 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:56:49,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59546455] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:49,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 13:56:49,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-14 13:56:49,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342348113] [2022-07-14 13:56:49,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:49,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 13:56:49,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:49,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 13:56:49,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 13:56:49,506 INFO L87 Difference]: Start difference. First operand 193 states and 268 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 13:56:49,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:49,547 INFO L93 Difference]: Finished difference Result 365 states and 491 transitions. [2022-07-14 13:56:49,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 13:56:49,547 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-07-14 13:56:49,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:49,548 INFO L225 Difference]: With dead ends: 365 [2022-07-14 13:56:49,548 INFO L226 Difference]: Without dead ends: 194 [2022-07-14 13:56:49,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 13:56:49,550 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 60 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:49,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 431 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:56:49,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-07-14 13:56:49,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 176. [2022-07-14 13:56:49,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 141 states have (on average 1.6453900709219857) internal successors, (232), 168 states have internal predecessors, (232), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 13:56:49,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 240 transitions. [2022-07-14 13:56:49,555 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 240 transitions. Word has length 19 [2022-07-14 13:56:49,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:49,555 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 240 transitions. [2022-07-14 13:56:49,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 13:56:49,556 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 240 transitions. [2022-07-14 13:56:49,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 13:56:49,556 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:49,556 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:56:49,577 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-07-14 13:56:49,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:56:49,773 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-07-14 13:56:49,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:49,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1863907122, now seen corresponding path program 1 times [2022-07-14 13:56:49,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:49,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844636842] [2022-07-14 13:56:49,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:49,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:49,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:49,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 13:56:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:49,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:56:49,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:49,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844636842] [2022-07-14 13:56:49,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844636842] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:56:49,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730545617] [2022-07-14 13:56:49,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:49,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:56:49,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:56:49,829 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-07-14 13:56:49,831 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-07-14 13:56:49,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:49,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 13:56:49,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:56:49,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:56:49,914 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:56:49,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730545617] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:49,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 13:56:49,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-07-14 13:56:49,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535375869] [2022-07-14 13:56:49,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:49,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 13:56:49,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:49,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 13:56:49,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-14 13:56:49,918 INFO L87 Difference]: Start difference. First operand 176 states and 240 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 13:56:49,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:49,989 INFO L93 Difference]: Finished difference Result 187 states and 244 transitions. [2022-07-14 13:56:49,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 13:56:49,989 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-07-14 13:56:49,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:49,990 INFO L225 Difference]: With dead ends: 187 [2022-07-14 13:56:49,990 INFO L226 Difference]: Without dead ends: 182 [2022-07-14 13:56:49,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-07-14 13:56:49,992 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 152 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:49,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 375 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:56:49,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-07-14 13:56:49,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 174. [2022-07-14 13:56:49,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 141 states have (on average 1.553191489361702) internal successors, (219), 166 states have internal predecessors, (219), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 13:56:49,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 227 transitions. [2022-07-14 13:56:49,998 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 227 transitions. Word has length 20 [2022-07-14 13:56:49,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:49,998 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 227 transitions. [2022-07-14 13:56:49,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 13:56:49,999 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 227 transitions. [2022-07-14 13:56:49,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-14 13:56:49,999 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:49,999 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:56:50,024 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-07-14 13:56:50,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:56:50,215 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-07-14 13:56:50,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:50,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1946545813, now seen corresponding path program 1 times [2022-07-14 13:56:50,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:50,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278594656] [2022-07-14 13:56:50,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:50,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:50,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:50,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 13:56:50,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:50,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:56:50,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:50,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278594656] [2022-07-14 13:56:50,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278594656] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:56:50,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947649147] [2022-07-14 13:56:50,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:50,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:56:50,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:56:50,272 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-07-14 13:56:50,274 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-07-14 13:56:50,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:50,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 13:56:50,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:56:50,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 13:56:50,334 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:56:50,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947649147] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:50,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 13:56:50,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-07-14 13:56:50,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166501435] [2022-07-14 13:56:50,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:50,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 13:56:50,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:50,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 13:56:50,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-14 13:56:50,337 INFO L87 Difference]: Start difference. First operand 174 states and 227 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 13:56:50,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:50,400 INFO L93 Difference]: Finished difference Result 212 states and 284 transitions. [2022-07-14 13:56:50,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 13:56:50,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-07-14 13:56:50,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:50,402 INFO L225 Difference]: With dead ends: 212 [2022-07-14 13:56:50,402 INFO L226 Difference]: Without dead ends: 207 [2022-07-14 13:56:50,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-14 13:56:50,403 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 33 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:50,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 263 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:56:50,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-07-14 13:56:50,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 191. [2022-07-14 13:56:50,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 159 states have (on average 1.4779874213836477) internal successors, (235), 183 states have internal predecessors, (235), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 13:56:50,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 243 transitions. [2022-07-14 13:56:50,408 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 243 transitions. Word has length 21 [2022-07-14 13:56:50,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:50,408 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 243 transitions. [2022-07-14 13:56:50,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 13:56:50,408 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 243 transitions. [2022-07-14 13:56:50,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-14 13:56:50,409 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:50,409 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:56:50,427 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-07-14 13:56:50,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:56:50,619 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-07-14 13:56:50,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:50,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1511766147, now seen corresponding path program 1 times [2022-07-14 13:56:50,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:50,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885259031] [2022-07-14 13:56:50,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:50,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:50,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 13:56:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:50,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 13:56:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:50,700 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 13:56:50,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:50,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885259031] [2022-07-14 13:56:50,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885259031] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:56:50,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054824465] [2022-07-14 13:56:50,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:50,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:56:50,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:56:50,702 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-07-14 13:56:50,703 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-07-14 13:56:50,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:50,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 13:56:50,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:56:50,778 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 13:56:50,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:56:50,872 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 13:56:50,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054824465] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:56:50,873 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:56:50,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2022-07-14 13:56:50,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290908210] [2022-07-14 13:56:50,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:56:50,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 13:56:50,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:50,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 13:56:50,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-07-14 13:56:50,874 INFO L87 Difference]: Start difference. First operand 191 states and 243 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-14 13:56:51,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:51,410 INFO L93 Difference]: Finished difference Result 829 states and 1079 transitions. [2022-07-14 13:56:51,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-14 13:56:51,410 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2022-07-14 13:56:51,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:51,414 INFO L225 Difference]: With dead ends: 829 [2022-07-14 13:56:51,414 INFO L226 Difference]: Without dead ends: 671 [2022-07-14 13:56:51,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=342, Invalid=714, Unknown=0, NotChecked=0, Total=1056 [2022-07-14 13:56:51,416 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 621 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:51,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 848 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 13:56:51,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2022-07-14 13:56:51,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 221. [2022-07-14 13:56:51,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 189 states have (on average 1.439153439153439) internal successors, (272), 213 states have internal predecessors, (272), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 13:56:51,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 280 transitions. [2022-07-14 13:56:51,436 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 280 transitions. Word has length 31 [2022-07-14 13:56:51,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:51,437 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 280 transitions. [2022-07-14 13:56:51,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-14 13:56:51,437 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 280 transitions. [2022-07-14 13:56:51,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-14 13:56:51,442 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:51,442 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:56:51,460 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-07-14 13:56:51,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:56:51,652 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-07-14 13:56:51,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:51,652 INFO L85 PathProgramCache]: Analyzing trace with hash 24022301, now seen corresponding path program 1 times [2022-07-14 13:56:51,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:51,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176554071] [2022-07-14 13:56:51,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:51,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:51,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:51,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 13:56:51,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:51,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 13:56:51,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:51,712 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-14 13:56:51,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:51,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176554071] [2022-07-14 13:56:51,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176554071] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:56:51,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657071019] [2022-07-14 13:56:51,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:51,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:56:51,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:56:51,714 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-07-14 13:56:51,715 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-07-14 13:56:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:51,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 13:56:51,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:56:51,775 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-14 13:56:51,775 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:56:51,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657071019] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:51,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 13:56:51,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-14 13:56:51,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313748922] [2022-07-14 13:56:51,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:51,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 13:56:51,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:51,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 13:56:51,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 13:56:51,777 INFO L87 Difference]: Start difference. First operand 221 states and 280 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 13:56:51,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:51,846 INFO L93 Difference]: Finished difference Result 312 states and 409 transitions. [2022-07-14 13:56:51,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 13:56:51,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2022-07-14 13:56:51,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:51,849 INFO L225 Difference]: With dead ends: 312 [2022-07-14 13:56:51,849 INFO L226 Difference]: Without dead ends: 309 [2022-07-14 13:56:51,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-14 13:56:51,850 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 218 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:51,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 376 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:56:51,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-07-14 13:56:51,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 290. [2022-07-14 13:56:51,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 258 states have (on average 1.4651162790697674) internal successors, (378), 281 states have internal predecessors, (378), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 13:56:51,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 386 transitions. [2022-07-14 13:56:51,859 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 386 transitions. Word has length 43 [2022-07-14 13:56:51,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:51,859 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 386 transitions. [2022-07-14 13:56:51,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 13:56:51,860 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 386 transitions. [2022-07-14 13:56:51,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-14 13:56:51,862 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:51,862 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:56:51,881 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-07-14 13:56:52,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:56:52,072 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-07-14 13:56:52,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:52,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1796922619, now seen corresponding path program 1 times [2022-07-14 13:56:52,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:52,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167774041] [2022-07-14 13:56:52,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:52,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:52,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:52,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 13:56:52,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:52,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 13:56:52,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:52,156 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-14 13:56:52,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:52,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167774041] [2022-07-14 13:56:52,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167774041] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:56:52,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415997178] [2022-07-14 13:56:52,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:52,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:56:52,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:56:52,161 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-07-14 13:56:52,162 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-07-14 13:56:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:52,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 13:56:52,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:56:52,217 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-14 13:56:52,217 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:56:52,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415997178] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:52,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 13:56:52,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-14 13:56:52,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628590467] [2022-07-14 13:56:52,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:52,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 13:56:52,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:52,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 13:56:52,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 13:56:52,218 INFO L87 Difference]: Start difference. First operand 290 states and 386 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 13:56:52,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:52,290 INFO L93 Difference]: Finished difference Result 316 states and 410 transitions. [2022-07-14 13:56:52,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 13:56:52,290 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2022-07-14 13:56:52,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:52,292 INFO L225 Difference]: With dead ends: 316 [2022-07-14 13:56:52,292 INFO L226 Difference]: Without dead ends: 311 [2022-07-14 13:56:52,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-14 13:56:52,297 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 171 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:52,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 447 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:56:52,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-07-14 13:56:52,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 270. [2022-07-14 13:56:52,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 238 states have (on average 1.4411764705882353) internal successors, (343), 261 states have internal predecessors, (343), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 13:56:52,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 351 transitions. [2022-07-14 13:56:52,311 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 351 transitions. Word has length 45 [2022-07-14 13:56:52,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:52,311 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 351 transitions. [2022-07-14 13:56:52,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 13:56:52,311 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 351 transitions. [2022-07-14 13:56:52,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-14 13:56:52,312 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:52,312 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:56:52,338 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-07-14 13:56:52,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:56:52,532 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-07-14 13:56:52,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:52,532 INFO L85 PathProgramCache]: Analyzing trace with hash 132146510, now seen corresponding path program 1 times [2022-07-14 13:56:52,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:52,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840107230] [2022-07-14 13:56:52,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:52,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:52,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:52,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 13:56:52,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:52,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 13:56:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:52,606 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 13:56:52,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:52,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840107230] [2022-07-14 13:56:52,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840107230] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:52,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:56:52,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 13:56:52,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437191051] [2022-07-14 13:56:52,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:52,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 13:56:52,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:52,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 13:56:52,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 13:56:52,610 INFO L87 Difference]: Start difference. First operand 270 states and 351 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 13:56:52,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:52,787 INFO L93 Difference]: Finished difference Result 875 states and 1119 transitions. [2022-07-14 13:56:52,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 13:56:52,787 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2022-07-14 13:56:52,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:52,791 INFO L225 Difference]: With dead ends: 875 [2022-07-14 13:56:52,791 INFO L226 Difference]: Without dead ends: 648 [2022-07-14 13:56:52,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-07-14 13:56:52,792 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 288 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:52,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 621 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:56:52,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2022-07-14 13:56:52,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 270. [2022-07-14 13:56:52,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 238 states have (on average 1.4369747899159664) internal successors, (342), 261 states have internal predecessors, (342), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 13:56:52,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 350 transitions. [2022-07-14 13:56:52,805 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 350 transitions. Word has length 46 [2022-07-14 13:56:52,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:52,805 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 350 transitions. [2022-07-14 13:56:52,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 13:56:52,806 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 350 transitions. [2022-07-14 13:56:52,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-14 13:56:52,807 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:52,807 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:56:52,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 13:56:52,808 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-07-14 13:56:52,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:52,808 INFO L85 PathProgramCache]: Analyzing trace with hash 594216172, now seen corresponding path program 1 times [2022-07-14 13:56:52,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:52,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498383927] [2022-07-14 13:56:52,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:52,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:52,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:52,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 13:56:52,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:52,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 13:56:52,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:52,893 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 13:56:52,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:52,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498383927] [2022-07-14 13:56:52,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498383927] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:56:52,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089730404] [2022-07-14 13:56:52,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:52,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:56:52,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:56:52,895 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-07-14 13:56:52,896 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-07-14 13:56:52,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:52,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 13:56:52,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:56:53,008 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 13:56:53,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:56:53,177 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 13:56:53,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089730404] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:56:53,177 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:56:53,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2022-07-14 13:56:53,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496088223] [2022-07-14 13:56:53,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:56:53,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-14 13:56:53,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:53,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-14 13:56:53,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2022-07-14 13:56:53,178 INFO L87 Difference]: Start difference. First operand 270 states and 350 transitions. Second operand has 21 states, 21 states have (on average 4.714285714285714) internal successors, (99), 20 states have internal predecessors, (99), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-14 13:56:54,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:54,086 INFO L93 Difference]: Finished difference Result 2122 states and 2748 transitions. [2022-07-14 13:56:54,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-07-14 13:56:54,087 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.714285714285714) internal successors, (99), 20 states have internal predecessors, (99), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 49 [2022-07-14 13:56:54,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:54,091 INFO L225 Difference]: With dead ends: 2122 [2022-07-14 13:56:54,091 INFO L226 Difference]: Without dead ends: 1915 [2022-07-14 13:56:54,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1061 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1137, Invalid=2403, Unknown=0, NotChecked=0, Total=3540 [2022-07-14 13:56:54,093 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 2219 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2219 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:54,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2219 Valid, 877 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 13:56:54,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1915 states. [2022-07-14 13:56:54,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1915 to 300. [2022-07-14 13:56:54,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 268 states have (on average 1.4104477611940298) internal successors, (378), 291 states have internal predecessors, (378), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 13:56:54,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 386 transitions. [2022-07-14 13:56:54,111 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 386 transitions. Word has length 49 [2022-07-14 13:56:54,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:54,111 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 386 transitions. [2022-07-14 13:56:54,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.714285714285714) internal successors, (99), 20 states have internal predecessors, (99), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-14 13:56:54,111 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 386 transitions. [2022-07-14 13:56:54,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-14 13:56:54,112 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:54,112 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:56:54,130 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-07-14 13:56:54,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:56:54,329 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-07-14 13:56:54,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:54,329 INFO L85 PathProgramCache]: Analyzing trace with hash 567559826, now seen corresponding path program 1 times [2022-07-14 13:56:54,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:54,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612630038] [2022-07-14 13:56:54,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:54,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:54,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:54,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 13:56:54,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:54,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 13:56:54,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:54,427 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 13:56:54,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:54,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612630038] [2022-07-14 13:56:54,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612630038] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:56:54,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128383939] [2022-07-14 13:56:54,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:54,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:56:54,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:56:54,429 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-07-14 13:56:54,430 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-07-14 13:56:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:54,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-14 13:56:54,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:56:54,529 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 13:56:54,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:56:54,630 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 13:56:54,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128383939] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:56:54,630 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:56:54,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-07-14 13:56:54,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668142630] [2022-07-14 13:56:54,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:56:54,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-14 13:56:54,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:54,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-14 13:56:54,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-14 13:56:54,631 INFO L87 Difference]: Start difference. First operand 300 states and 386 transitions. Second operand has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 13 states have internal predecessors, (89), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 13:56:55,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:55,311 INFO L93 Difference]: Finished difference Result 1225 states and 1545 transitions. [2022-07-14 13:56:55,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-14 13:56:55,312 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 13 states have internal predecessors, (89), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2022-07-14 13:56:55,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:55,314 INFO L225 Difference]: With dead ends: 1225 [2022-07-14 13:56:55,314 INFO L226 Difference]: Without dead ends: 942 [2022-07-14 13:56:55,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=345, Invalid=845, Unknown=0, NotChecked=0, Total=1190 [2022-07-14 13:56:55,316 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 647 mSDsluCounter, 1341 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 1528 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:55,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 1528 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 13:56:55,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2022-07-14 13:56:55,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 364. [2022-07-14 13:56:55,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 332 states have (on average 1.4006024096385543) internal successors, (465), 355 states have internal predecessors, (465), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 13:56:55,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 473 transitions. [2022-07-14 13:56:55,333 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 473 transitions. Word has length 51 [2022-07-14 13:56:55,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:55,333 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 473 transitions. [2022-07-14 13:56:55,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 13 states have internal predecessors, (89), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 13:56:55,333 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 473 transitions. [2022-07-14 13:56:55,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-14 13:56:55,334 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:55,334 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:56:55,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-14 13:56:55,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-14 13:56:55,548 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-07-14 13:56:55,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:55,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1383845486, now seen corresponding path program 2 times [2022-07-14 13:56:55,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:55,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181829110] [2022-07-14 13:56:55,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:55,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:55,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 13:56:55,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:55,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 13:56:55,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:55,702 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 13 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 13:56:55,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:55,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181829110] [2022-07-14 13:56:55,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181829110] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:56:55,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869520977] [2022-07-14 13:56:55,703 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 13:56:55,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:56:55,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:56:55,704 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-07-14 13:56:55,705 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-07-14 13:56:55,761 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 13:56:55,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 13:56:55,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-14 13:56:55,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:56:55,900 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 13 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 13:56:55,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:56:56,131 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 13 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 13:56:56,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869520977] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:56:56,132 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:56:56,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2022-07-14 13:56:56,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743420467] [2022-07-14 13:56:56,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:56:56,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-14 13:56:56,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:56,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-14 13:56:56,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-07-14 13:56:56,133 INFO L87 Difference]: Start difference. First operand 364 states and 473 transitions. Second operand has 26 states, 26 states have (on average 5.730769230769231) internal successors, (149), 25 states have internal predecessors, (149), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 13:57:13,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:57:13,764 INFO L93 Difference]: Finished difference Result 1644 states and 2085 transitions. [2022-07-14 13:57:13,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-14 13:57:13,765 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.730769230769231) internal successors, (149), 25 states have internal predecessors, (149), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 71 [2022-07-14 13:57:13,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:57:13,768 INFO L225 Difference]: With dead ends: 1644 [2022-07-14 13:57:13,768 INFO L226 Difference]: Without dead ends: 1254 [2022-07-14 13:57:13,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 981 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=994, Invalid=2909, Unknown=3, NotChecked=0, Total=3906 [2022-07-14 13:57:13,770 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 1507 mSDsluCounter, 2504 mSDsCounter, 0 mSdLazyCounter, 1449 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 2709 SdHoareTripleChecker+Invalid, 1729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 1449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-14 13:57:13,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 2709 Invalid, 1729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 1449 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-14 13:57:13,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2022-07-14 13:57:13,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 407. [2022-07-14 13:57:13,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 375 states have (on average 1.3946666666666667) internal successors, (523), 398 states have internal predecessors, (523), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 13:57:13,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 531 transitions. [2022-07-14 13:57:13,792 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 531 transitions. Word has length 71 [2022-07-14 13:57:13,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:57:13,793 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 531 transitions. [2022-07-14 13:57:13,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.730769230769231) internal successors, (149), 25 states have internal predecessors, (149), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 13:57:13,793 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 531 transitions. [2022-07-14 13:57:13,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-14 13:57:13,794 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:57:13,794 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:57:13,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-14 13:57:14,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-14 13:57:14,008 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-07-14 13:57:14,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:57:14,009 INFO L85 PathProgramCache]: Analyzing trace with hash -2075937428, now seen corresponding path program 2 times [2022-07-14 13:57:14,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:57:14,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236072713] [2022-07-14 13:57:14,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:57:14,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:57:14,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:14,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 13:57:14,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:14,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 13:57:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:14,179 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 9 proven. 245 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 13:57:14,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:57:14,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236072713] [2022-07-14 13:57:14,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236072713] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:57:14,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170383642] [2022-07-14 13:57:14,180 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 13:57:14,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:57:14,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:57:14,184 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-07-14 13:57:14,187 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-07-14 13:57:14,232 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 13:57:14,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 13:57:14,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-14 13:57:14,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:57:14,388 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 9 proven. 245 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 13:57:14,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:57:14,751 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 9 proven. 245 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 13:57:14,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170383642] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:57:14,752 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:57:14,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 39 [2022-07-14 13:57:14,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659569092] [2022-07-14 13:57:14,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:57:14,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-14 13:57:14,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:57:14,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-14 13:57:14,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=492, Invalid=990, Unknown=0, NotChecked=0, Total=1482 [2022-07-14 13:57:14,754 INFO L87 Difference]: Start difference. First operand 407 states and 531 transitions. Second operand has 39 states, 39 states have (on average 4.846153846153846) internal successors, (189), 38 states have internal predecessors, (189), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-14 13:57:17,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:57:17,151 INFO L93 Difference]: Finished difference Result 3609 states and 4686 transitions. [2022-07-14 13:57:17,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-07-14 13:57:17,151 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 4.846153846153846) internal successors, (189), 38 states have internal predecessors, (189), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 79 [2022-07-14 13:57:17,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:57:17,159 INFO L225 Difference]: With dead ends: 3609 [2022-07-14 13:57:17,159 INFO L226 Difference]: Without dead ends: 3303 [2022-07-14 13:57:17,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3860 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3962, Invalid=8470, Unknown=0, NotChecked=0, Total=12432 [2022-07-14 13:57:17,162 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 3687 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 925 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3687 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 1755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 925 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-14 13:57:17,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3687 Valid, 1280 Invalid, 1755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [925 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-14 13:57:17,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3303 states. [2022-07-14 13:57:17,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3303 to 464. [2022-07-14 13:57:17,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 432 states have (on average 1.3634259259259258) internal successors, (589), 455 states have internal predecessors, (589), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 13:57:17,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 597 transitions. [2022-07-14 13:57:17,212 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 597 transitions. Word has length 79 [2022-07-14 13:57:17,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:57:17,212 INFO L495 AbstractCegarLoop]: Abstraction has 464 states and 597 transitions. [2022-07-14 13:57:17,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 4.846153846153846) internal successors, (189), 38 states have internal predecessors, (189), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-14 13:57:17,213 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 597 transitions. [2022-07-14 13:57:17,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-14 13:57:17,213 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:57:17,214 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:57:17,233 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-07-14 13:57:17,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-14 13:57:17,427 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-07-14 13:57:17,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:57:17,428 INFO L85 PathProgramCache]: Analyzing trace with hash -314996846, now seen corresponding path program 3 times [2022-07-14 13:57:17,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:57:17,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47855978] [2022-07-14 13:57:17,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:57:17,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:57:17,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:17,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 13:57:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:17,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 13:57:17,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:17,729 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 13 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 13:57:17,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:57:17,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47855978] [2022-07-14 13:57:17,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47855978] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:57:17,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188460886] [2022-07-14 13:57:17,729 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 13:57:17,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:57:17,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:57:17,731 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-07-14 13:57:17,733 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-07-14 13:57:19,175 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2022-07-14 13:57:19,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 13:57:19,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-14 13:57:19,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:57:19,522 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 13 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 13:57:19,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:57:20,569 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 13 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 13:57:20,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188460886] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:57:20,570 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:57:20,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 50 [2022-07-14 13:57:20,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323291644] [2022-07-14 13:57:20,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:57:20,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-14 13:57:20,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:57:20,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-14 13:57:20,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=1831, Unknown=0, NotChecked=0, Total=2450 [2022-07-14 13:57:20,572 INFO L87 Difference]: Start difference. First operand 464 states and 597 transitions. Second operand has 50 states, 50 states have (on average 5.38) internal successors, (269), 49 states have internal predecessors, (269), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 13:57:33,804 WARN L233 SmtUtils]: Spent 11.76s on a formula simplification. DAG size of input: 57 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-14 13:57:45,947 WARN L233 SmtUtils]: Spent 8.66s on a formula simplification. DAG size of input: 52 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-14 13:58:16,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:58:16,425 INFO L93 Difference]: Finished difference Result 2234 states and 2849 transitions. [2022-07-14 13:58:16,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-07-14 13:58:16,427 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.38) internal successors, (269), 49 states have internal predecessors, (269), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 111 [2022-07-14 13:58:16,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:58:16,431 INFO L225 Difference]: With dead ends: 2234 [2022-07-14 13:58:16,431 INFO L226 Difference]: Without dead ends: 1804 [2022-07-14 13:58:16,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3180 ImplicationChecksByTransitivity, 54.2s TimeCoverageRelationStatistics Valid=2908, Invalid=9966, Unknown=8, NotChecked=0, Total=12882 [2022-07-14 13:58:16,434 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 3014 mSDsluCounter, 7078 mSDsCounter, 0 mSdLazyCounter, 4592 mSolverCounterSat, 942 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3014 SdHoareTripleChecker+Valid, 7323 SdHoareTripleChecker+Invalid, 5534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 942 IncrementalHoareTripleChecker+Valid, 4592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-14 13:58:16,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3014 Valid, 7323 Invalid, 5534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [942 Valid, 4592 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-14 13:58:16,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2022-07-14 13:58:16,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 537. [2022-07-14 13:58:16,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 505 states have (on average 1.3683168316831684) internal successors, (691), 528 states have internal predecessors, (691), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 13:58:16,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 699 transitions. [2022-07-14 13:58:16,474 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 699 transitions. Word has length 111 [2022-07-14 13:58:16,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:58:16,474 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 699 transitions. [2022-07-14 13:58:16,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.38) internal successors, (269), 49 states have internal predecessors, (269), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 13:58:16,475 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 699 transitions. [2022-07-14 13:58:16,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-14 13:58:16,476 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:58:16,476 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:58:16,482 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-07-14 13:58:16,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-14 13:58:16,683 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-07-14 13:58:16,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:58:16,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1059944044, now seen corresponding path program 3 times [2022-07-14 13:58:16,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:58:16,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491627537] [2022-07-14 13:58:16,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:58:16,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:58:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:58:16,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 13:58:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:58:16,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 13:58:16,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:58:17,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1209 backedges. 9 proven. 1199 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 13:58:17,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:58:17,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491627537] [2022-07-14 13:58:17,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491627537] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:58:17,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755925063] [2022-07-14 13:58:17,056 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 13:58:17,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:58:17,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:58:17,057 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-07-14 13:58:17,058 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-07-14 13:58:17,815 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2022-07-14 13:58:17,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 13:58:17,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 13:58:17,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:58:18,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1209 backedges. 9 proven. 1199 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 13:58:18,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:58:19,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1209 backedges. 9 proven. 1199 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 13:58:19,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755925063] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:58:19,382 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:58:19,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 75 [2022-07-14 13:58:19,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003308750] [2022-07-14 13:58:19,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:58:19,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-07-14 13:58:19,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:58:19,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-07-14 13:58:19,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1848, Invalid=3702, Unknown=0, NotChecked=0, Total=5550 [2022-07-14 13:58:19,386 INFO L87 Difference]: Start difference. First operand 537 states and 699 transitions. Second operand has 75 states, 75 states have (on average 4.92) internal successors, (369), 74 states have internal predecessors, (369), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-14 13:58:27,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:58:27,794 INFO L93 Difference]: Finished difference Result 7083 states and 9208 transitions. [2022-07-14 13:58:27,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2022-07-14 13:58:27,795 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 4.92) internal successors, (369), 74 states have internal predecessors, (369), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 139 [2022-07-14 13:58:27,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:58:27,810 INFO L225 Difference]: With dead ends: 7083 [2022-07-14 13:58:27,810 INFO L226 Difference]: Without dead ends: 6697 [2022-07-14 13:58:27,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15157 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=15016, Invalid=32726, Unknown=0, NotChecked=0, Total=47742 [2022-07-14 13:58:27,820 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 8568 mSDsluCounter, 1953 mSDsCounter, 0 mSdLazyCounter, 1483 mSolverCounterSat, 1591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8568 SdHoareTripleChecker+Valid, 2078 SdHoareTripleChecker+Invalid, 3074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1591 IncrementalHoareTripleChecker+Valid, 1483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-14 13:58:27,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8568 Valid, 2078 Invalid, 3074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1591 Valid, 1483 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-14 13:58:27,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6697 states. [2022-07-14 13:58:27,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6697 to 664. [2022-07-14 13:58:27,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 632 states have (on average 1.3338607594936709) internal successors, (843), 655 states have internal predecessors, (843), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 13:58:27,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 851 transitions. [2022-07-14 13:58:27,951 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 851 transitions. Word has length 139 [2022-07-14 13:58:27,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:58:27,951 INFO L495 AbstractCegarLoop]: Abstraction has 664 states and 851 transitions. [2022-07-14 13:58:27,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 4.92) internal successors, (369), 74 states have internal predecessors, (369), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-14 13:58:27,952 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 851 transitions. [2022-07-14 13:58:27,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-14 13:58:27,953 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:58:27,953 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:58:27,970 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-07-14 13:58:28,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-14 13:58:28,158 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-07-14 13:58:28,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:58:28,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1455914222, now seen corresponding path program 4 times [2022-07-14 13:58:28,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:58:28,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954405617] [2022-07-14 13:58:28,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:58:28,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:58:28,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 13:58:28,184 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 13:58:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 13:58:28,227 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 13:58:28,227 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-14 13:58:28,228 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 30 remaining) [2022-07-14 13:58:28,229 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 30 remaining) [2022-07-14 13:58:28,229 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 30 remaining) [2022-07-14 13:58:28,229 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 30 remaining) [2022-07-14 13:58:28,229 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 30 remaining) [2022-07-14 13:58:28,229 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 30 remaining) [2022-07-14 13:58:28,229 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 30 remaining) [2022-07-14 13:58:28,230 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 30 remaining) [2022-07-14 13:58:28,230 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 30 remaining) [2022-07-14 13:58:28,230 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 30 remaining) [2022-07-14 13:58:28,230 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 30 remaining) [2022-07-14 13:58:28,230 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 30 remaining) [2022-07-14 13:58:28,230 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 30 remaining) [2022-07-14 13:58:28,230 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 30 remaining) [2022-07-14 13:58:28,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 30 remaining) [2022-07-14 13:58:28,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 30 remaining) [2022-07-14 13:58:28,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 30 remaining) [2022-07-14 13:58:28,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 30 remaining) [2022-07-14 13:58:28,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 30 remaining) [2022-07-14 13:58:28,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 30 remaining) [2022-07-14 13:58:28,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 30 remaining) [2022-07-14 13:58:28,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 30 remaining) [2022-07-14 13:58:28,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 30 remaining) [2022-07-14 13:58:28,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 30 remaining) [2022-07-14 13:58:28,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 30 remaining) [2022-07-14 13:58:28,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 30 remaining) [2022-07-14 13:58:28,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 30 remaining) [2022-07-14 13:58:28,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 30 remaining) [2022-07-14 13:58:28,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 30 remaining) [2022-07-14 13:58:28,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 30 remaining) [2022-07-14 13:58:28,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-14 13:58:28,237 INFO L356 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:58:28,239 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-14 13:58:28,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.07 01:58:28 BoogieIcfgContainer [2022-07-14 13:58:28,328 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-14 13:58:28,328 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 13:58:28,328 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 13:58:28,328 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 13:58:28,329 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 01:56:48" (3/4) ... [2022-07-14 13:58:28,331 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-14 13:58:28,331 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 13:58:28,332 INFO L158 Benchmark]: Toolchain (without parser) took 100366.94ms. Allocated memory was 107.0MB in the beginning and 402.7MB in the end (delta: 295.7MB). Free memory was 79.7MB in the beginning and 250.9MB in the end (delta: -171.2MB). Peak memory consumption was 125.0MB. Max. memory is 16.1GB. [2022-07-14 13:58:28,332 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 107.0MB. Free memory was 65.9MB in the beginning and 65.8MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 13:58:28,332 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.22ms. Allocated memory is still 107.0MB. Free memory was 79.4MB in the beginning and 79.3MB in the end (delta: 41.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-14 13:58:28,333 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.34ms. Allocated memory is still 107.0MB. Free memory was 79.3MB in the beginning and 76.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 13:58:28,333 INFO L158 Benchmark]: Boogie Preprocessor took 19.71ms. Allocated memory is still 107.0MB. Free memory was 76.9MB in the beginning and 75.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 13:58:28,333 INFO L158 Benchmark]: RCFGBuilder took 395.35ms. Allocated memory is still 107.0MB. Free memory was 75.2MB in the beginning and 53.9MB in the end (delta: 21.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-07-14 13:58:28,333 INFO L158 Benchmark]: TraceAbstraction took 99622.59ms. Allocated memory was 107.0MB in the beginning and 402.7MB in the end (delta: 295.7MB). Free memory was 53.3MB in the beginning and 250.9MB in the end (delta: -197.5MB). Peak memory consumption was 101.3MB. Max. memory is 16.1GB. [2022-07-14 13:58:28,333 INFO L158 Benchmark]: Witness Printer took 2.64ms. Allocated memory is still 402.7MB. Free memory is still 250.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 13:58:28,336 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 107.0MB. Free memory was 65.9MB in the beginning and 65.8MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 276.22ms. Allocated memory is still 107.0MB. Free memory was 79.4MB in the beginning and 79.3MB in the end (delta: 41.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.34ms. Allocated memory is still 107.0MB. Free memory was 79.3MB in the beginning and 76.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.71ms. Allocated memory is still 107.0MB. Free memory was 76.9MB in the beginning and 75.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 395.35ms. Allocated memory is still 107.0MB. Free memory was 75.2MB in the beginning and 53.9MB in the end (delta: 21.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 99622.59ms. Allocated memory was 107.0MB in the beginning and 402.7MB in the end (delta: 295.7MB). Free memory was 53.3MB in the beginning and 250.9MB in the end (delta: -197.5MB). Peak memory consumption was 101.3MB. Max. memory is 16.1GB. * Witness Printer took 2.64ms. Allocated memory is still 402.7MB. Free memory is still 250.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseComplement at line 76. Possible FailurePath: [L221] unsigned int a ; [L222] unsigned int ma = __VERIFIER_nondet_uint(); [L223] signed char ea = __VERIFIER_nondet_char(); [L224] unsigned int b ; [L225] unsigned int mb = __VERIFIER_nondet_uint(); [L226] signed char eb = __VERIFIER_nondet_char(); [L227] unsigned int r_mul ; [L228] unsigned int zero ; [L229] unsigned int one ; [L230] int sb ; [L231] int tmp ; [L232] int tmp___0 ; [L233] int tmp___1 ; [L234] int __retres16 ; VAL [ea=0, eb=0] [L238] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=0, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=0, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=0, m=0, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=0, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L80] return (__retres4); VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=0, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, \result=0, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L238] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=0, eb=0, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L238] zero = base2flt(0, 0) [L239] CALL, EXPR base2flt(1, 0) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=0, m=1, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=0, m=1, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L35] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=0, m=1, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=0, m=1, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=0, m=1, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-1, m=2, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-1, m=2, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-1, m=2, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-1, m=2, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-2, m=4, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-2, m=4, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-2, m=4, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-2, m=4, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-3, m=8, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-3, m=8, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-3, m=8, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-3, m=8, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-4, m=16, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-4, m=16, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-4, m=16, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-4, m=16, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-5, m=32, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-5, m=32, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-5, m=32, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-5, m=32, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-6, m=64, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-6, m=64, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-6, m=64, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-6, m=64, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-7, m=128, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-7, m=128, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-7, m=128, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-7, m=128, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-8, m=256, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-8, m=256, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-8, m=256, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-8, m=256, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-9, m=512, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-9, m=512, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-9, m=512, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-9, m=512, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-10, m=1024, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-10, m=1024, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-10, m=1024, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-10, m=1024, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-11, m=2048, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-11, m=2048, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-11, m=2048, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-11, m=2048, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-12, m=4096, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-12, m=4096, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-12, m=4096, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-12, m=4096, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-13, m=8192, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-13, m=8192, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-13, m=8192, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-13, m=8192, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-14, m=16384, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-14, m=16384, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-14, m=16384, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-14, m=16384, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-15, m=32768, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-15, m=32768, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-15, m=32768, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-15, m=32768, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-16, m=65536, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-16, m=65536, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-16, m=65536, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-16, m=65536, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-17, m=131072, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-17, m=131072, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-17, m=131072, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-17, m=131072, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-18, m=262144, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-18, m=262144, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-18, m=262144, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-18, m=262144, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-19, m=524288, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-19, m=524288, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-19, m=524288, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-19, m=524288, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-20, m=1048576, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-20, m=1048576, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-20, m=1048576, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-20, m=1048576, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-21, m=2097152, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-21, m=2097152, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-21, m=2097152, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-21, m=2097152, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-22, m=4194304, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-22, m=4194304, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-22, m=4194304, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-22, m=4194304, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-23, m=8388608, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-23, m=8388608, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-23, m=8388608, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-23, m=8388608, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-24, m=16777216, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-24, m=16777216, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-24, m=0, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L77] EXPR e + 128 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-24, m=0, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L77] EXPR (e + 128) << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-24, m=0, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L77] EXPR e + 128 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-24, m=0, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L77] EXPR (e + 128) << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-24, m=0, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L77] res = m | (unsigned int )((e + 128) << 24U) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-24, m=0, m = m & ~ (1U << 24U)=1744830465, res=1744830464, res = m | (unsigned int )((e + 128) << 24U)=1744830464] [L78] __retres4 = res VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, __retres4=1744830464, e=-24, m=0, m = m & ~ (1U << 24U)=1744830465, res=1744830464, res = m | (unsigned int )((e + 128) << 24U)=1744830464] [L80] return (__retres4); VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, \result=1744830464, __retres4=1744830464, e=-24, m=0, m = m & ~ (1U << 24U)=1744830465, res=1744830464, res = m | (unsigned int )((e + 128) << 24U)=1744830464] [L239] RET, EXPR base2flt(1, 0) VAL [base2flt(1, 0)=1744830464, ea=0, eb=0, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830464, zero=0] [L239] one = base2flt(1, 0) [L240] CALL base2flt(ma, ea) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830464, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830464] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830464, e=0, m=16777216, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830464] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830464, e=0, m=16777216, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830464] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830464, e=0, m=16777216, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830464] [L57] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830464, e=0, m=16777216, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830464] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830464, e=0, m=16777216, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830464] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830464, e=0, m=0, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830464] [L77] EXPR e + 128 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830464, e=0, m=0, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830464] [L77] (e + 128) << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830464, e=0, m=0, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830464] - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 172]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 172]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 175]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 175]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 177]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 177]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 178]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 178]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 201]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 201]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 144 locations, 30 error locations. Started 1 CEGAR loops. OverallTime: 99.5s, OverallIterations: 17, TraceHistogramMax: 24, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 87.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21324 SdHoareTripleChecker+Valid, 7.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21318 mSDsluCounter, 20148 SdHoareTripleChecker+Invalid, 5.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17720 mSDsCounter, 4377 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10495 IncrementalHoareTripleChecker+Invalid, 14872 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4377 mSolverCounterUnsat, 2428 mSDtfsCounter, 10495 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2074 GetRequests, 1408 SyntacticMatches, 1 SemanticMatches, 665 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24800 ImplicationChecksByTransitivity, 78.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=664occurred in iteration=16, InterpolantAutomatonStates: 566, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 14150 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 1595 NumberOfCodeBlocks, 1595 NumberOfCodeBlocksAsserted, 68 NumberOfCheckSat, 1930 ConstructedInterpolants, 0 QuantifiedInterpolants, 10509 SizeOfPredicates, 11 NumberOfNonLiveVariables, 1882 ConjunctsInSsa, 129 ConjunctsInUnsatCore, 35 InterpolantComputations, 9 PerfectInterpolantSequences, 326/6390 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-14 13:58:28,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample